On the public citation graph

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems

0 signed · 38 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.1002/jgt.20041openalex-snapshot
On the number of maximal bipartite subgraphs of a graph
inferredcites →https://doi.org/10.1002/jgt.v48:2openalex-snapshot
inferredcites →https://doi.org/10.1007/11534273_15openalex-snapshot
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
inferredcites →https://doi.org/10.1007/3-540-36478-1openalex-snapshot
Combinatorial Optimization — Eureka, You Shrink!
inferredcites →https://doi.org/10.1007/3-540-36478-1_17openalex-snapshot
Exact Algorithms for NP-Hard Problems: A Survey
inferredcites →https://doi.org/10.1007/3-540-44634-6openalex-snapshot
Algorithms and Data Structures
inferredcites →https://doi.org/10.1007/3-540-45784-4_3openalex-snapshot
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-540-28639-4_23openalex-snapshot
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments
inferredcites →https://doi.org/10.1016/0012-365x(88)90226-9openalex-snapshot
On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
inferredcites →https://doi.org/10.1016/j.jalgor.2004.01.001openalex-snapshot
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
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.010openalex-snapshot
Parameterized algorithms for feedback set problems and their duals in tournaments
inferredcites →https://doi.org/10.1016/s0166-218x(02)00402-xopenalex-snapshot
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
inferredcites →https://doi.org/10.1016/s1570-8667(03)00009-1openalex-snapshot
An efficient fixed-parameter algorithm for 3-Hitting Set
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1109/ccc.2003.1214417openalex-snapshot
Parameterized complexity for the skeptic
inferredcites →https://doi.org/10.1109/pact.2003.1238022openalex-snapshot
Resolving register bank conflicts for a network processor
inferredcites →https://doi.org/10.1137/0402004openalex-snapshot
Graph Bipartization and via minimization
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
inferredcites →https://doi.org/10.4153/cjm-1982-036-8openalex-snapshot
A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
inferredcites →https://doi.org/10.5555/942806.943845openalex-snapshot
Resolving register bank conflicts for a network processor

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11758471_32openalex-snapshot
Parameterized Algorithms for Hitting Set: The Weighted Case
inferred← citeshttps://doi.org/10.1007/11785293_17openalex-snapshot
Exact Computation of Maximum Induced Forest
inferred← citeshttps://doi.org/10.1007/978-3-031-10515-9_1openalex-snapshot
Feedback Arc Set
inferred← citeshttps://doi.org/10.1007/978-3-031-10515-9_3openalex-snapshot
Papers and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-70600-7_32openalex-snapshot
A New Approximation Algorithm for the Minimum Fragment Removal Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_13openalex-snapshot
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_6openalex-snapshot
Enumerate and Measure: Improving Parameter Budget Management
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_11openalex-snapshot
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
inferred← citeshttps://doi.org/10.1007/s00224-007-1334-2openalex-snapshot
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
inferred← citeshttps://doi.org/10.1007/s00453-007-9152-0openalex-snapshot
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-011-9566-6openalex-snapshot
Parameterized Measure & Conquer for Problems with No Small Kernels
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.05.014openalex-snapshot
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
inferred← citeshttps://doi.org/10.1016/j.laa.2018.12.019openalex-snapshot
New bounds for the signless Laplacian spread
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.001openalex-snapshot
Parameterized algorithms for d -Hitting Set: The weighted case
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.011openalex-snapshot
An exact algorithm for the Maximum Leaf Spanning Tree problem
inferred← citeshttps://doi.org/10.1080/00207160903176868openalex-snapshot
Parameterized algorithmics for d-H itting S et
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.