Algorithm Engineering for Optimal Graph Bipartization

This publication has 17 references indexed in Scilit:

• An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
  Lecture Notes in Computer Science, 2005
• Finding odd cycle transversals
  Operations Research Letters, 2004
• Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms
  2004
• Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction
  2004
• New Directions and New Challenges in Algorithm Design and Complexity, Parameterized
  Lecture Notes in Computer Science, 2003
• Parameterizing above Guaranteed Values: MaxSat and MaxCut
  Journal of Algorithms, 1999
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
  SIAM Journal on Computing, 1996
• Optimization, approximation, and complexity classes
  Journal of Computer and System Sciences, 1991
• Graph Bipartization and via minimization
  SIAM Journal on Discrete Mathematics, 1989
• The node-deletion problem for hereditary properties is NP-complete
  Journal of Computer and System Sciences, 1980