On the public citation graph
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
0 signed · 126 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.20081openalex-snapshot
Fixed‐parameter tractability and data reduction for multicut in trees
inferredcites →https://doi.org/10.1007/s00037-006-0210-9openalex-snapshot
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
inferredcites →https://doi.org/10.1007/s00453-007-9130-6openalex-snapshot
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
inferredcites →https://doi.org/10.1016/j.disopt.2010.05.003openalex-snapshot
FPT algorithms for path-transversal and cycle-transversal problems
inferredcites →https://doi.org/10.1016/j.ejor.2007.02.014openalex-snapshot
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
inferredcites →https://doi.org/10.1016/j.ic.2012.10.016openalex-snapshot
Clustering with local restrictions
inferredcites →https://doi.org/10.1016/j.ipl.2007.03.005openalex-snapshot
A logical approach to multicut problems
inferredcites →https://doi.org/10.1016/j.ipl.2009.07.016openalex-snapshot
Constant ratio fixed-parameter approximation of the edge multicut problem
inferredcites →https://doi.org/10.1016/j.jcss.2009.04.002openalex-snapshot
Almost 2-SAT is fixed-parameter tractable
inferredcites →https://doi.org/10.1016/j.orl.2003.10.009openalex-snapshot
Finding odd cycle transversals
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.007openalex-snapshot
Parameterized graph separation problems
inferredcites →https://doi.org/10.1016/j.tcs.2006.05.008openalex-snapshot
Correlation clustering in general weighted graphs
inferredcites →https://doi.org/10.1016/j.tcs.2009.12.016openalex-snapshot
Clustering with partial information
inferredcites →https://doi.org/10.1016/s0196-6774(03)00073-7openalex-snapshot
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
inferredcites →https://doi.org/10.1023/b:mach.0000033116.57574.95openalex-snapshot
Correlation Clustering
inferredcites →https://doi.org/10.1093/comjnl/bxm040openalex-snapshot
Techniques for Practical Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1137/05064299xopenalex-snapshot
Improved Approximation Algorithms for Minimum Weight Vertex Separators
inferredcites →https://doi.org/10.1137/12086217xopenalex-snapshot
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
inferredcites →https://doi.org/10.1137/s0097539792225297openalex-snapshot
The Complexity of Multiterminal Cuts
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
inferredcites →https://doi.org/10.1145/1502793.1502794openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/1502793.1502795openalex-snapshot
Polynomial flow-cut gaps and hardness of directed cut problems
inferredcites →https://doi.org/10.1145/2462896.2462899openalex-snapshot
On multiway cut parameterized above lower bounds
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_763openalex-snapshot
Fixed-Parameter Approximability and Hardness
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_12openalex-snapshot
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_16openalex-snapshot
Feedback Edge Sets in Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_23openalex-snapshot
Finding All Leftmost Separators of Size $$\le k$$
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_19openalex-snapshot
Parameterized Complexity of Weighted Multicut in Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_20openalex-snapshot
On the Parameterized Complexity of Colorful Components and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_763-1openalex-snapshot
Fixed-Parameter Approximability and Hardness
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_76openalex-snapshot
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_50openalex-snapshot
A Parameterized Algorithm for Mixed-Cut
inferred← citeshttps://doi.org/10.1007/s00453-016-0139-6openalex-snapshot
List H-Coloring a Graph by Removing Few Vertices
inferred← citeshttps://doi.org/10.1007/s00453-018-0443-4openalex-snapshot
An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face
inferred← citeshttps://doi.org/10.1007/s00453-019-00609-1openalex-snapshot
Multi-budgeted Directed Cuts
inferred← citeshttps://doi.org/10.1007/s00453-023-01196-yopenalex-snapshot
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100556openalex-snapshot
A survey of parameterized algorithms and the complexity of edge modification
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100869openalex-snapshot
Applications of flow-augmentation
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.012openalex-snapshot
The complexity of cluster vertex splitting and company
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.021openalex-snapshot
Adapting The Directed Grid Theorem into an FPT Algorithm
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.12.001openalex-snapshot
An O⁎(1.84k) parameterized algorithm for the multiterminal cut problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.03.003openalex-snapshot
Parameterized complexity dichotomy for Steiner Multicut
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.01.003openalex-snapshot
Parameterized algorithms for min-max multiway cut and list digraph homomorphism
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.04.004openalex-snapshot
Linear kernels for separating a graph into components of bounded size
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.11.001openalex-snapshot
Faster Graph bipartization
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103597openalex-snapshot
Single-exponential FPT algorithms for enumerating secluded F -free subgraphs and deleting to scattered graph classes
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103730openalex-snapshot
Search-space reduction via essential vertices revisited: Vertex multicut and cograph deletion
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.11.002openalex-snapshot
When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.018openalex-snapshot
Parameterized complexity of critical node cuts
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.040openalex-snapshot
Colourful components in k-caterpillars and planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114174openalex-snapshot
Parameterized complexity of multicut in weighted trees
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch81openalex-snapshot
Directed multicut is W [1]-hard, even for four terminal pairs
inferred← citeshttps://doi.org/10.1137/1.9781611975031.125openalex-snapshot
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices
inferred← citeshttps://doi.org/10.1137/1.9781611975031.177openalex-snapshot
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611975482.104openalex-snapshot
Losing Treewidth by Separating Subsets
inferred← citeshttps://doi.org/10.1137/1.9781611975994.134openalex-snapshot
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
inferred← citeshttps://doi.org/10.1137/1.9781611976465.11openalex-snapshot
Solving hard cut problems via flow-augmentation
inferred← citeshttps://doi.org/10.1137/1.9781611976465.14openalex-snapshot
FPT-approximation for FPT Problems
inferred← citeshttps://doi.org/10.1137/1.9781611977073.82openalex-snapshot
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H -Minor-Free Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch121openalex-snapshot
Almost Consistent Systems of Linear Equations
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch123openalex-snapshot
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
inferred← citeshttps://doi.org/10.1137/120904202openalex-snapshot
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1137/140988553openalex-snapshot
Minimum Bisection Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1137/15m1032077openalex-snapshot
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
inferred← citeshttps://doi.org/10.1137/17m1151250openalex-snapshot
Covering Vectors by Spaces: Regular Matroids
inferred← citeshttps://doi.org/10.1137/17m1155612openalex-snapshot
Balanced Judicious Bipartition is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1137/18m1176087openalex-snapshot
Odd Multiway Cut in Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1137/18m1183297openalex-snapshot
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals
inferred← citeshttps://doi.org/10.1137/21m1452664openalex-snapshot
Adapting the Directed Grid Theorem into an FPT Algorithm
inferred← citeshttps://doi.org/10.1137/22m153118xopenalex-snapshot
On Weighted Graph Separation Problems and Flow Augmentation
inferred← citeshttps://doi.org/10.1137/23m1595059openalex-snapshot
An Improved Parameterized Algorithm for Treewidth
inferred← citeshttps://doi.org/10.1142/s1793830922500483openalex-snapshot
Fission: Practical algorithms for computing minimum balanced node separators
inferred← citeshttps://doi.org/10.1145/2700209openalex-snapshot
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1145/3128600openalex-snapshot
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
inferred← citeshttps://doi.org/10.1145/3155299openalex-snapshot
Linear Time Parameterized Algorithms for S ubset F eedback V ertex S et
inferred← citeshttps://doi.org/10.1145/3201775openalex-snapshot
Directed Multicut is W[1]-hard, Even for Four Terminal Pairs
inferred← citeshttps://doi.org/10.1145/3390887openalex-snapshot
Representative Sets and Irrelevant Vertices
inferred← citeshttps://doi.org/10.1145/3426738openalex-snapshot
Randomized Contractions Meet Lean Decompositions
inferred← citeshttps://doi.org/10.1145/3447584openalex-snapshot
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
inferred← citeshttps://doi.org/10.1145/3626526openalex-snapshot
Cluster Editing Parameterized above Modification-disjoint P 3 -packings
inferred← citeshttps://doi.org/10.1145/3641105openalex-snapshot
Flow-augmentation II: Undirected Graphs
inferred← citeshttps://doi.org/10.1145/3696451openalex-snapshot
Compound Logics for Modification Problems
inferred← citeshttps://doi.org/10.1145/3733107openalex-snapshot
Almost Consistent Systems of Linear Equations
inferred← citeshttps://doi.org/10.3390/a13060146openalex-snapshot
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
inferred← citeshttps://doi.org/10.4230/lipics.esa.2017.57openalex-snapshot
A Linear Time Parameterized Algorithm for Node Unique Label Cover
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2019.8openalex-snapshot
FPT Inapproximability of Directed Cut and Connectivity Problems
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2020.60openalex-snapshot
Efficient Enumerations for Minimal Multicuts and Multiway Cuts
inferred← citeshttps://doi.org/10.48550/arxiv.1509.07404openalex-snapshot
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism
inferred← citeshttps://doi.org/10.48550/arxiv.1710.05491openalex-snapshot
Balanced Judicious Partition is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.70675/909bbe94z5fa8z4ba3z80bbzc56545575d65openalex-snapshot
Characterizing edges in signed and vector-valued graphs
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.