On the public citation graph

On the minimum cut separator problem

0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1999.1687openalex-snapshot
An Improved Approximation Algorithm for MULTIWAY CUT
inferredcites →https://doi.org/10.1007/s10107-005-0574-7openalex-snapshot
The vertex separator problem: a polyhedral investigation
inferredcites →https://doi.org/10.1007/s10107-006-0086-0openalex-snapshot
Valid inequalities for mixed integer linear programs
inferredcites →https://doi.org/10.1007/s10107-007-0101-0openalex-snapshot
Compact formulations as a union of polyhedra
inferredcites →https://doi.org/10.1016/j.ejor.2003.10.037openalex-snapshot
Minimal multicut and maximal integer multiflow: A survey
inferredcites →https://doi.org/10.1016/s0166-218x(98)00096-1openalex-snapshot
On the dimension of projected polyhedra
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1145/276698.276711openalex-snapshot
An improved approximation algorithm for multiway cut

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.20474openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_28openalex-snapshot
The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness
inferred← citeshttps://doi.org/10.1007/s10288-020-00456-9openalex-snapshot
Models and algorithms for decomposition problems
inferred← citeshttps://doi.org/10.1007/s10878-014-9808-zopenalex-snapshot
Extended cuts
inferred← citeshttps://doi.org/10.1007/s10878-025-01349-5openalex-snapshot
The multi-terminal vertex separator problem: total dual integrality and polytope composition
inferred← citeshttps://doi.org/10.1007/s12532-019-00167-1openalex-snapshot
On integer and bilevel formulations for the k-vertex cut problem
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106708openalex-snapshot
Minimum st -cut interdiction problem
inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.005openalex-snapshot
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.021openalex-snapshot
The multi-terminal vertex separator problem: Branch-and-Cut-and-Price
inferred← citeshttps://doi.org/10.1016/j.dam.2022.12.022openalex-snapshot
Models and algorithms for the Weighted Safe Set Problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.07.003openalex-snapshot
The vertex k -cut problem
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.124openalex-snapshot
Algorithms and formulations for the minimum cut separator problem
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.061openalex-snapshot
A new formulation for the Weighted Safe Set Problem
inferred← citeshttps://doi.org/10.1109/case59546.2024.10711754openalex-snapshot
Simulated Hill Climbing Search for the Solutions of k-Vertex Cut Problems
inferred← citeshttps://doi.org/10.1109/codit.2016.7593645openalex-snapshot
The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price
inferred← citeshttps://doi.org/10.1109/tcss.2023.3238042openalex-snapshot
Detecting k-Vertex Cuts in Sparse Networks via a Fast Local Search Approach
inferred← citeshttps://doi.org/10.1109/tsmc.2022.3212045openalex-snapshot
Graph-Based Deep Decomposition for Overlapping Large-Scale Optimization Problems
inferred← citeshttps://doi.org/10.4307/jsee.66.6_46openalex-snapshot
A Method of Design Education which Supports Students to Make New Ideas in the Department of Architecture
inferred← citeshttps://doi.org/10.70675/3132197ezbf73z4ad9zb29fz20b8a8e35a63openalex-snapshot
Parallelisation of hybrid metaheuristics for COP solving
inferred← citeshttps://doi.org/10.70675/a306e547z7b73z4ff4z9789z32dd693fd1d1openalex-snapshot
The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms
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.