On the public citation graph

Constrained Two-Line Center Problems

https://doi.org/10.2139/ssrn.5399790
0 signed · 31 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.1006/jagm.1996.0054openalex-snapshot
Off-Line Maintenance of Planar Configurations
inferredcites →https://doi.org/10.1006/jagm.2000.1107openalex-snapshot
Incremental and Decremental Maintenance of Planar Width
inferredcites →https://doi.org/10.1007/3-540-60220-8_47openalex-snapshot
The two-line center problem from a polar view: a new algorithm and data structure
inferredcites →https://doi.org/10.1007/3-540-60220-8_48openalex-snapshot
On some geometric selection and optimization problems via sorted matrices
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-031-55598-5_20openalex-snapshot
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/bf01182774openalex-snapshot
Planar geometric location problems
inferredcites →https://doi.org/10.1007/bf01840436openalex-snapshot
Visibility of disjoint polygons
inferredcites →https://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1007/bf02712871openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
inferredcites →https://doi.org/10.1007/bfb0054358openalex-snapshot
Constrained square-center problems
inferredcites →https://doi.org/10.1007/s00453-005-1166-xopenalex-snapshot
Approximation Algorithms for a k-Line Center
inferredcites →https://doi.org/10.1007/s00454-003-2923-8openalex-snapshot
A Fully Dynamic Algorithm for Planar Width
inferredcites →https://doi.org/10.1016/0022-0000(82)90048-4openalex-snapshot
The complexity of selection and ranking in X + Y and matrices with sorted columns
inferredcites →https://doi.org/10.1016/0167-6377(82)90039-6openalex-snapshot
On the complexity of locating linear facilities in the plane
inferredcites →https://doi.org/10.1016/0925-7721(91)90001-uopenalex-snapshot
Off-line dynamic maintenance of the width of a planar point set
inferredcites →https://doi.org/10.1016/j.comgeo.2025.102185openalex-snapshot
Parallel line centers with guaranteed separation
inferredcites →https://doi.org/10.1016/j.dam.2023.05.014openalex-snapshot
Approximation algorithms for orthogonal line centers
inferredcites →https://doi.org/10.1016/j.tcs.2020.05.045openalex-snapshot
Minimum-width double-strip and parallelogram annulus
inferredcites →https://doi.org/10.1016/s0925-7721(03)00017-8openalex-snapshot
A (1+ε)-approximation algorithm for 2-line-center
inferredcites →https://doi.org/10.1016/s0925-7721(98)00017-0openalex-snapshot
On some geometric selection and optimization problems via sorted matrices
inferredcites →https://doi.org/10.1109/sfcs.2002.1181985openalex-snapshot
Dynamic planar convex hull
inferredcites →https://doi.org/10.1137/0213002openalex-snapshot
Generalized Selection and Ranking: Sorted Matrices
inferredcites →https://doi.org/10.1137/s0097539794268649openalex-snapshot
An Expander-Based Approach to Geometric Optimization
inferredcites →https://doi.org/10.1142/s0218195902000748openalex-snapshot
APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
inferredcites →https://doi.org/10.1142/s0218195911003676openalex-snapshot
COVERING A POINT SET BY TWO DISJOINT RECTANGLES
inferredcites →https://doi.org/10.1145/220279.220314openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
inferredcites →https://doi.org/10.1145/336154.336216openalex-snapshot
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
inferredcites →https://doi.org/10.1145/357337.357341openalex-snapshot
Triangulating Simple Polygons and Equivalent Problems
inferredcites →https://doi.org/10.5555/127787.127865openalex-snapshot
Planar geometric location problems and maintaining the width of a planar set
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.