On the public citation graph
Packing cuts in undirected graphs
0 signed · 33 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/(sici)1097-0118(199704)24:4<357::aid-jgt8>3.0.co;2-nopenalex-snapshot
A characterization of Seymour graphs
inferredcites →https://doi.org/10.1006/jagm.1997.0903openalex-snapshot
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
inferredcites →https://doi.org/10.1006/jcss.1995.1078openalex-snapshot
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
inferredcites →https://doi.org/10.1007/3-540-48447-7_3openalex-snapshot
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
inferredcites →https://doi.org/10.1007/3-540-48481-7_42openalex-snapshot
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01202790openalex-snapshot
Conservative weightings and ear-decompositions of graphs
inferredcites →https://doi.org/10.1007/bf01844849openalex-snapshot
On a matroid defined by ear-decompositions of graphs
inferredcites →https://doi.org/10.1007/bf01994876openalex-snapshot
Approximating maximum independent sets by excluding subgraphs
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/s002240000113openalex-snapshot
On Approximation Properties of the Independent Set Problem for Low Degree Graphs
inferredcites →https://doi.org/10.1016/0166-218x(83)90080-xopenalex-snapshot
Efficient bounds for the stable set, vertex cover and set packing problems
inferredcites →https://doi.org/10.1016/s0196-6774(03)00052-xopenalex-snapshot
Packing cycles in undirected graphs
inferredcites →https://doi.org/10.1109/sfcs.1992.267748openalex-snapshot
Witnesses for Boolean matrix multiplication and for shortest paths
inferredcites →https://doi.org/10.1112/jlms/s2-17.3.369openalex-snapshot
A Minimax Theorem for Directed Graphs
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0210054openalex-snapshot
The NP-Completeness of Some Edge-Partition Problems
inferredcites →https://doi.org/10.1137/s089548019731994xopenalex-snapshot
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
inferredcites →https://doi.org/10.1145/115234.115366openalex-snapshot
Faster scaling algorithms for general graph matching problems
inferredcites →https://doi.org/10.1145/174644.174650openalex-snapshot
Approximation algorithms for NP-complete problems on planar graphs
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70957openalex-snapshot
Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_4openalex-snapshot
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_28openalex-snapshot
Approximability of Packing Disjoint Cycles
inferred← citeshttps://doi.org/10.1016/j.actaastro.2023.06.024openalex-snapshot
Configuration design and collision dynamics analysis of flexible nets for space debris removal
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00052-xopenalex-snapshot
Packing cycles in undirected graphs
inferred← citeshttps://doi.org/10.1109/rdcape.2015.7281363openalex-snapshot
Sector Based Clustering Hierarchy (SBCH) protocol for clustered homogenous wireless sensor networks
inferred← citeshttps://doi.org/10.1137/1.9781611973068.114openalex-snapshot
Packing multiway cuts in capacitated graphs
inferred← citeshttps://doi.org/10.1137/23m157020xopenalex-snapshot
Packing Cycles in Planar and Bounded-Genus Graphs
inferred← citeshttps://doi.org/10.1145/2851492openalex-snapshot
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
inferred← citeshttps://doi.org/10.5555/1496770.1496884openalex-snapshot
Packing multiway cuts in capacitated graphs
inferred← citeshttps://doi.org/10.70675/72f96944zb711z4ad5z9d5bzaac3410bdf92openalex-snapshot
TDIness and Multicuts
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.