On the public citation graph
Geometric Lower Bounds for Parametric Matroid Optimization
0 signed · 61 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230210206openalex-snapshot
Faster parametric shortest path and minimum‐balance algorithms
inferredcites →https://doi.org/10.1006/jagm.1994.1019openalex-snapshot
Parametric Problems on Graphs of Bounded Tree-Width
inferredcites →https://doi.org/10.1006/jagm.1996.0849openalex-snapshot
Choosing Subsets with Maximum Weighted Average
inferredcites →https://doi.org/10.1007/3-540-55706-7_26openalex-snapshot
Parametric problems on graphs of bounded tree-width
inferredcites →https://doi.org/10.1007/3-540-55706-7_34openalex-snapshot
Convex polygons made from few lines and convex decompositions of polyhedra
inferredcites →https://doi.org/10.1007/3-540-59175-3_94openalex-snapshot
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
inferredcites →https://doi.org/10.1007/3-540-61422-2_121openalex-snapshot
The constrained minimum spanning tree problem
inferredcites →https://doi.org/10.1007/3-540-61422-2_128openalex-snapshot
Using sparsification for parametric minimum spanning tree problems
inferredcites →https://doi.org/10.1007/bf01185430openalex-snapshot
Parametric optimization of sequence alignment
inferredcites →https://doi.org/10.1007/bf01589104openalex-snapshot
Multi-constrained matroidal knapsack problems
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferredcites →https://doi.org/10.1007/bf02187829openalex-snapshot
An upper bound on the number of planarK-sets
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02574035openalex-snapshot
On minimum and maximum spanning trees of linearly moving points
inferredcites →https://doi.org/10.1007/bf02574381openalex-snapshot
Counting triangle crossings and halving planes
inferredcites →https://doi.org/10.1007/bf02574700openalex-snapshot
Points and triangles in the plane and halving planes in space
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/pl00009345openalex-snapshot
How to Cut Pseudoparabolas into Segments
inferredcites →https://doi.org/10.1016/0020-0190(94)00057-3openalex-snapshot
On disjoint concave chains in arrangements of (pseudo) lines
inferredcites →https://doi.org/10.1016/0097-3165(93)90082-jopenalex-snapshot
Improved bounds for intersecting triangles and halving planes
inferredcites →https://doi.org/10.1016/0166-218x(81)90004-4openalex-snapshot
Stochastic spanning tree problem
inferredcites →https://doi.org/10.1016/0166-218x(81)90026-3openalex-snapshot
Parametric shortest path algorithms with an application to cyclic staffing
inferredcites →https://doi.org/10.1016/b978-0-7204-2262-7.50018-1openalex-snapshot
Dissection Graphs of Planar Point Sets
inferredcites →https://doi.org/10.1016/s0304-3975(96)00262-9openalex-snapshot
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
inferredcites →https://doi.org/10.1109/sfcs.1981.11openalex-snapshot
Applying parallel computation algorithms in the design of serial algorithms
inferredcites →https://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferredcites →https://doi.org/10.1109/sfcs.1992.267783openalex-snapshot
Maximizing non-linear concave functions in fixed dimension
inferredcites →https://doi.org/10.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
inferredcites →https://doi.org/10.1137/0219068openalex-snapshot
Linear Programming with Two Variables Per Inequality in Poly-Log Time
inferredcites →https://doi.org/10.1142/9789814354363_0019openalex-snapshot
Maximizing Non-Linear Concave Functions in Fixed Dimension
inferredcites →https://doi.org/10.1145/12130.12150openalex-snapshot
Linear programming with two variables per inequality in poly-log time
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/220279.220304openalex-snapshot
How to cut pseudo-parabolas into segments
inferredcites →https://doi.org/10.1145/800057.808677openalex-snapshot
On k-hulls and related problems
inferredcites →https://doi.org/10.1201/9781420010749-38openalex-snapshot
Sensitivity Analysis in Combinatorial Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10719839_22openalex-snapshot
Multi-parameter Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-1-4757-2807-1_4openalex-snapshot
An Annotated Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_25openalex-snapshot
A Stronger Lower Bound on Parametric Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_27openalex-snapshot
The Parametric Closure Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_1openalex-snapshot
Graph-Theoretic Solutions to Computational Geometry Problems
inferred← citeshttps://doi.org/10.1007/pl00009354openalex-snapshot
Improved Bounds for Planar k -Sets and Related Problems
inferred← citeshttps://doi.org/10.1007/s00453-022-01024-9openalex-snapshot
A Stronger Lower Bound on Parametric Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/s00454-002-2840-2openalex-snapshot
On Levels in Arrangements of Curves
inferred← citeshttps://doi.org/10.1007/s00454-005-1165-3openalex-snapshot
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
inferred← citeshttps://doi.org/10.1007/s10898-025-01512-6openalex-snapshot
A survey of exact and approximation algorithms for linear-parametric optimization problems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
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/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00253-5openalex-snapshot
The k-centrum multi-facility location problem
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743510openalex-snapshot
Parametric and kinetic minimum spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892109openalex-snapshot
On levels in arrangements of curves
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238227openalex-snapshot
On levels in arrangements of curves. II. A simple inequality and its consequences
inferred← citeshttps://doi.org/10.1142/s0218195902000967openalex-snapshot
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
inferred← citeshttps://doi.org/10.1145/378583.378675openalex-snapshot
Notes on computing peaks in k-levels and parametric spanning trees
inferred← citeshttps://doi.org/10.48550/arxiv.1707.02428openalex-snapshot
Combinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases
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.