On the public citation graph
A fast algorithm for the generalized parametric minimum cut problem and applications
0 signed · 52 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.1007/978-0-8176-4953-1openalex-snapshot
Notes on Introductory Combinatorics
inferredcites →https://doi.org/10.1007/978-1-4757-1101-1openalex-snapshot
Notes on Introductory Combinatorics
inferredcites →https://doi.org/10.1007/bf01070282openalex-snapshot
Effective algorithm for the weber problem with a rectangular metric
inferredcites →https://doi.org/10.1007/bf01240737openalex-snapshot
A faster parametric minimum-cut algorithm
inferredcites →https://doi.org/10.1016/0166-218x(90)90072-kopenalex-snapshot
Computing the binding number of a graph
inferredcites →https://doi.org/10.1057/jors.1991.61openalex-snapshot
The Stable Marriage Problem: Structure and Algorithms
inferredcites →https://doi.org/10.1080/00029890.1962.11989827openalex-snapshot
College Admissions and the Stability of Marriage
inferredcites →https://doi.org/10.1109/tse.1978.231502openalex-snapshot
Critical Load Factors in Two-Processor Distributed Systems
inferredcites →https://doi.org/10.1137/0215048openalex-snapshot
The Complexity of Counting Stable Marriages
inferredcites →https://doi.org/10.1137/0218003openalex-snapshot
A Fast Parametric Maximum Flow Algorithm and Applications
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1137/1008062openalex-snapshot
Possible Winners in Partially Completed Tournaments
inferredcites →https://doi.org/10.1145/1008369.1008376openalex-snapshot
Review of "Mariages stables et leur relations avec d'autre problèmes combinatoires
inferredcites →https://doi.org/10.1145/28869.28871openalex-snapshot
An efficient algorithm for the “optimal” stable marriage
inferredcites →https://doi.org/10.1145/321978.321982openalex-snapshot
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
inferredcites →https://doi.org/10.1145/355900.355910openalex-snapshot
Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1287/opre.26.3.422openalex-snapshot
A Cut Approach to the Rectilinear Distance Facility Location Problem
inferredcites →https://doi.org/10.2307/2583328openalex-snapshot
The Stable Marriage Problem: Structure and Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.20081openalex-snapshot
A continuous‐time strategic capacity planning model
inferred← citeshttps://doi.org/10.1002/net.1030openalex-snapshot
Universally maximum flow with piecewise‐constant capacities
inferred← citeshttps://doi.org/10.1002/net.21892openalex-snapshot
Monotonicity and conformality in multicommodity network‐flow problems
inferred← citeshttps://doi.org/10.1002/net.22043openalex-snapshot
Optimal hierarchical clustering on a graph
inferred← citeshttps://doi.org/10.1007/11841036_55openalex-snapshot
Balancing Applied to Maximum Network Flow Problems
inferred← citeshttps://doi.org/10.1007/11940128_30openalex-snapshot
Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_33openalex-snapshot
Thresholds for Sports Elimination Numbers: Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/bf01240737openalex-snapshot
A faster parametric minimum-cut algorithm
inferred← citeshttps://doi.org/10.1007/bf02032129openalex-snapshot
On some large-scale LP relaxations for the Graph Partitioning Problem and their optimal solutions
inferred← citeshttps://doi.org/10.1007/bf02293049openalex-snapshot
Transitions in geometric minimum spanning trees
inferred← citeshttps://doi.org/10.1007/s00453-001-0074-yopenalex-snapshot
The Structure and Complexity of Sports Elimination Numbers
inferred← citeshttps://doi.org/10.1007/s00453-016-0256-2openalex-snapshot
A Connection Between Sports and Matroids: How Many Teams Can We Beat?
inferred← citeshttps://doi.org/10.1007/s10107-011-0463-1openalex-snapshot
Structural and algorithmic properties for parametric minimum cuts
inferred← citeshttps://doi.org/10.1007/s10479-006-0155-zopenalex-snapshot
A note on the parametric maximum flow problem and some related reoptimization issues
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90046-ropenalex-snapshot
Baseball playoff eliminations: An application of linear programming
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90099-3openalex-snapshot
Complexity results for the p-median problem with mutual communication
inferred← citeshttps://doi.org/10.1016/j.dam.2015.01.021openalex-snapshot
Refining the complexity of the sports elimination problem
inferred← citeshttps://doi.org/10.1016/j.orl.2021.12.009openalex-snapshot
Complexity of Source-Sink Monotone 2-parameter min cut
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80118-5openalex-snapshot
Chapter 1 Applications of network optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80205-1openalex-snapshot
Chapter 8 Design (with analysis) of efficient algorithms
inferred← citeshttps://doi.org/10.1137/070706318openalex-snapshot
Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
inferred← citeshttps://doi.org/10.1137/s0895480198348847openalex-snapshot
A New Property and a Faster Algorithm for Baseball Elimination
inferred← citeshttps://doi.org/10.1142/s0218195909002873openalex-snapshot
EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
inferred← citeshttps://doi.org/10.1145/109648.109675openalex-snapshot
Transitions in geometric minimum spanning trees (extended abstract)
inferred← citeshttps://doi.org/10.1145/237814.237978openalex-snapshot
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow
inferred← citeshttps://doi.org/10.1287/inte.32.2.12.67openalex-snapshot
Baseball, Optimization, and the World Wide Web
inferred← citeshttps://doi.org/10.1287/moor.22.4.803openalex-snapshot
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
inferred← citeshttps://doi.org/10.1287/msom.5.1.63.12762openalex-snapshot
A Continuous-Time Strategic Capacity Planning Model Based on the Minimum-Cut Problem
inferred← citeshttps://doi.org/10.1287/opre.47.5.744openalex-snapshot
Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
inferred← citeshttps://doi.org/10.48550/arxiv.2103.03868openalex-snapshot
Decomposable Submodular Function Minimization via Maximum Flow
inferred← citeshttps://doi.org/10.5555/127787.127805openalex-snapshot
Dynamic expression trees and their applications
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.