On the public citation graph
On cuts and matchings in planar graphs
0 signed · 88 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/bf01361181openalex-snapshot
Beweis einer Abschw�chung der Hadwiger-Vermutung
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01584085openalex-snapshot
Blocking and anti-blocking pairs of polyhedra
inferredcites →https://doi.org/10.1007/bf02612335openalex-snapshot
A dual ascent approach for steiner tree problems on a directed graph
inferredcites →https://doi.org/10.1007/springerreference_5846openalex-snapshot
Multicommodity network flows
inferredcites →https://doi.org/10.1016/0012-365x(92)90133-zopenalex-snapshot
Compositions in the bipartite subgraph polytope
inferredcites →https://doi.org/10.1016/0167-6377(83)90016-0openalex-snapshot
The max-cut problem on graphs not contractible to K5
inferredcites →https://doi.org/10.1016/0167-6377(83)90031-7openalex-snapshot
On some weakly bipartite graphs
inferredcites →https://doi.org/10.1016/s0195-6698(81)80033-9openalex-snapshot
Matroids and Multicommodity Flows
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1090/dimacs/001/17openalex-snapshot
Planar multicommodity flows, max cut, and the Chinese postman problem
inferredcites →https://doi.org/10.1112/plms/s3-42.1.178openalex-snapshot
On Odd Cuts and Plane Multicommodity Flows
inferredcites →https://doi.org/10.1137/0803035openalex-snapshot
Reducing Matching to Polynomial Size Linear Programming
inferredcites →https://doi.org/10.1137/s0895480190182666openalex-snapshot
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
inferredcites →https://doi.org/10.1137/s0895480190182678openalex-snapshot
Compositions of Graphs and Polyhedra II: Stable Sets
inferredcites →https://doi.org/10.1137/s089548019018268xopenalex-snapshot
Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor
inferredcites →https://doi.org/10.1145/3149.3154openalex-snapshot
The traveling salesman problem in graphs with 3-edge cutsets
inferredcites →https://doi.org/10.1145/62212.62232openalex-snapshot
Expressing combinatorial optimization problems by linear programs
inferredcites →https://doi.org/10.1287/opre.14.6.1121openalex-snapshot
Feasibility of Two Commodity Network Flows
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
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.10106openalex-snapshot
An exact algorithm for the min‐cost network containment problem
inferred← citeshttps://doi.org/10.1002/net.20129openalex-snapshot
Solving minimum K‐cardinality cut problems in planar graphs
inferred← citeshttps://doi.org/10.1002/net.21723openalex-snapshot
Reduced‐size formulations for metric and cut polyhedra in sparse graphs
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_5openalex-snapshot
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
inferred← citeshttps://doi.org/10.1007/3-540-63774-5_98openalex-snapshot
Solving and approximating combinatorial optimization problems (Towards MAX CUT and TSP)
inferred← citeshttps://doi.org/10.1007/978-1-4613-0279-7_25openalex-snapshot
Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_29openalex-snapshot
Strong Reductions for Extended Formulations
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_6openalex-snapshot
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-44914-2_17openalex-snapshot
On Integer Recognition over Some Boolean Quadric Polytope Extension
inferred← citeshttps://doi.org/10.1007/978-3-319-93800-4_13openalex-snapshot
On Vertices of the Simple Boolean Quadric Polytope Extension
inferred← citeshttps://doi.org/10.1007/bf01592243openalex-snapshot
One-third-integrality in the max-cut problem
inferred← citeshttps://doi.org/10.1007/bf02614320openalex-snapshot
Cuts, matrix completions and graph rigidity
inferred← citeshttps://doi.org/10.1007/bf02614436openalex-snapshot
Connections between semidefinite relaxations of the max-cut and stable set problems
inferred← citeshttps://doi.org/10.1007/s00453-025-01347-3openalex-snapshot
Max-Utility Matchings with Popularity via Critical Vertices
inferred← citeshttps://doi.org/10.1007/s10107-012-0574-3openalex-snapshot
Some 0/1 polytopes need exponential size extended formulations
inferred← citeshttps://doi.org/10.1007/s10107-013-0688-2openalex-snapshot
Lifting and separation procedures for the cut polytope
inferred← citeshttps://doi.org/10.1007/s10107-017-1227-3openalex-snapshot
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
inferred← citeshttps://doi.org/10.1007/s10288-010-0122-zopenalex-snapshot
Extended formulations in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s10288-014-0262-7openalex-snapshot
Deriving compact extended formulations via LP-based separation techniques
inferred← citeshttps://doi.org/10.1007/s10479-012-1269-0openalex-snapshot
Extended formulations in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s10479-015-2012-4openalex-snapshot
Deriving compact extended formulations via LP-based separation techniques
inferred← citeshttps://doi.org/10.1007/s11590-018-1358-3openalex-snapshot
Generalized cut and metric polytopes of graphs and simplicial complexes
inferred← citeshttps://doi.org/10.1007/s11590-020-01667-zopenalex-snapshot
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results
inferred← citeshttps://doi.org/10.1007/s12532-018-0133-xopenalex-snapshot
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90640-2openalex-snapshot
Matching theory—a sampler: from Dénes König to the present
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00091-vopenalex-snapshot
Graphic vertices of the metric polytope
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00741-5openalex-snapshot
The real positive semidefinite completion problem for series-parallel graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00155-7openalex-snapshot
Solving the max-cut problem using eigenvalues
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90028-nopenalex-snapshot
Using separation algorithms to generate mixed integer model reformulations
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90020-5openalex-snapshot
Applications of cut polyhedra — I
inferred← citeshttps://doi.org/10.1016/j.disopt.2023.100807openalex-snapshot
On cut polytopes and graph minors
inferred← citeshttps://doi.org/10.1016/j.endm.2016.03.017openalex-snapshot
Improved compact formulations for metric and cut polyhedra
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)83714-7openalex-snapshot
A connection between positive semidefinite and Euclidean distance matrix completion problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00266-9openalex-snapshot
Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
inferred← citeshttps://doi.org/10.1016/s0167-6377(03)00052-xopenalex-snapshot
A compact linear program for testing optimality of perfect matchings
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1023/a:1014895808844openalex-snapshot
Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks
inferred← citeshttps://doi.org/10.1109/istcs.1995.377033openalex-snapshot
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
inferred← citeshttps://doi.org/10.1137/0803035openalex-snapshot
Reducing Matching to Polynomial Size Linear Programming
inferred← citeshttps://doi.org/10.1137/140980053openalex-snapshot
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
inferred← citeshttps://doi.org/10.1137/s1052623400379371openalex-snapshot
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure
inferred← citeshttps://doi.org/10.1137/s1052623401394092openalex-snapshot
Computational Experience with Stable Set Relaxations
inferred← citeshttps://doi.org/10.1145/2591796.2591834openalex-snapshot
The matching polytope has exponential extension complexity
inferred← citeshttps://doi.org/10.1145/3127497openalex-snapshot
The Matching Polytope has Exponential Extension Complexity
inferred← citeshttps://doi.org/10.1201/9780429463976-6openalex-snapshot
MAP Estimation: Linear Programming Relaxation and Message-Passing Algorithms
inferred← citeshttps://doi.org/10.17863/cam.162openalex-snapshot
Characterizing Tightness of LP Relaxations by Forbidding Signed Minors
inferred← citeshttps://doi.org/10.22405/2226-8383-2019-20-2openalex-snapshot
The hypermetric cone and polytope on graphs
inferred← citeshttps://doi.org/10.22405/2226-8383-2019-20-2-161-169openalex-snapshot
The hypermetric cone and polytope on graphs
inferred← citeshttps://doi.org/10.22405/2226-8383-2019-20-2-169-177openalex-snapshot
Гиперметрический конус и многогранник на графах
inferred← citeshttps://doi.org/10.25673/3850openalex-snapshot
Extended formulations for combinatorial polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.1104.1023openalex-snapshot
Extended Formulations in Combinatorial Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1104.1204openalex-snapshot
Planar Cycle Covering Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0036openalex-snapshot
Some 0/1 polytopes need exponential size extended formulations
inferred← citeshttps://doi.org/10.48550/arxiv.1210.4902openalex-snapshot
Efficiently Searching for Frustrated Cycles in MAP Inference
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2369openalex-snapshot
The matching polytope has exponential extension complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02407openalex-snapshot
Planar Ultrametric Rounding for Image Segmentation
inferred← citeshttps://doi.org/10.48550/arxiv.1511.01994openalex-snapshot
Next Generation Multicuts for Semi-Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01645openalex-snapshot
Some characteristics of the simple Boolean quadric polytope extension
inferred← citeshttps://doi.org/10.48550/arxiv.1709.07337openalex-snapshot
Efficient Column Generation for Cell Detection and Segmentation
inferred← citeshttps://doi.org/10.7916/d8jd4vdcopenalex-snapshot
Methods for Inference in Graphical Models
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.