On the public citation graph

Lower bounds on the length of monotone paths in arrangements

https://doi.org/10.1007/bf02574679
0 signed · 17 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187696openalex-snapshot
Upper bounds for configurations and polytopes inR d
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/73393.73429openalex-snapshot
Algorithms for vertical and orthogonal L1 linear approximation of points
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/pl00009345openalex-snapshot
How to Cut Pseudoparabolas into Segments
inferred← citeshttps://doi.org/10.1007/s00454-004-1106-6openalex-snapshot
Monotone Paths in Line Arrangements with a Small Number of Directions
inferred← citeshttps://doi.org/10.1007/s00454-004-1119-1openalex-snapshot
Long Monotone Paths in Line Arrangements
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90076-topenalex-snapshot
On disjoint concave chains in arrangements of (pseudo) lines
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00057-3openalex-snapshot
On disjoint concave chains in arrangements of (pseudo) lines
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00201-9openalex-snapshot
A pseudo-algorithmic separation of lines from pseudo-lines
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.01.001openalex-snapshot
On some monotone path problems in line arrangements
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00136-0openalex-snapshot
Monotone paths in line arrangements
inferred← citeshttps://doi.org/10.1145/220279.220304openalex-snapshot
How to cut pseudo-parabolas into segments
inferred← citeshttps://doi.org/10.1145/378583.378711openalex-snapshot
Monotone paths in line arrangement
inferred← citeshttps://doi.org/10.1145/777792.777812openalex-snapshot
Long monotone paths in line arrangements
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.