On the public citation graph
A faster parametric minimum-cut algorithm
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.
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.3230190607openalex-snapshot
A comparison of phase and nonphase network flow algorithms
inferredcites →https://doi.org/10.1007/bf01070282openalex-snapshot
Effective algorithm for the weber problem with a rectangular metric
inferredcites →https://doi.org/10.1007/bf01187018openalex-snapshot
On the complexity of preflow-push algorithms for maximum-flow problems
inferredcites →https://doi.org/10.1007/bf01758775openalex-snapshot
A fast algorithm for the generalized parametric minimum cut problem and applications
inferredcites →https://doi.org/10.1016/0020-0190(89)90204-4openalex-snapshot
Parametric stable marriage and minimum cuts
inferredcites →https://doi.org/10.1038/190864b0openalex-snapshot
Journal of the Association for Computing Machinery
inferredcites →https://doi.org/10.1057/jors.1991.61openalex-snapshot
The Stable Marriage Problem: Structure and Algorithms
inferredcites →https://doi.org/10.1137/0218003openalex-snapshot
A Fast Parametric Maximum Flow Algorithm and Applications
inferredcites →https://doi.org/10.1137/0218072openalex-snapshot
Analysis of Preflow Push Algorithms for Maximum Network Flow
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
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/net.22043openalex-snapshot
Optimal hierarchical clustering on a graph
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_14openalex-snapshot
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
inferred← citeshttps://doi.org/10.1007/bf01585179openalex-snapshot
The least element property of center location on tree networks with applications to distance and precedence constrained problems
inferred← citeshttps://doi.org/10.1007/bf01758775openalex-snapshot
A fast algorithm for the generalized parametric minimum cut problem and applications
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/s10898-025-01512-6openalex-snapshot
A survey of exact and approximation algorithms for linear-parametric optimization problems
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00188-ropenalex-snapshot
Computing maximum mean cuts
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.jnca.2018.10.009openalex-snapshot
A Distributed Evolutionary algorithm for detecting minimum vertex cuts for wireless ad hoc and sensor networks
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.1109/cvpr.2008.4587429openalex-snapshot
Globally optimal surface segmentation using regional properties of segmented objects
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/opre.1080.0524openalex-snapshot
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
inferred← citeshttps://doi.org/10.17077/etd.2eifjxa2openalex-snapshot
New algorithms for target delineation and radiation delivery in intensity-modulated radiation therapy
inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot
Decision algorithms for probabilistic simulations
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.