Faster scaling algorithms for network problems
SIAM Journal on Computing
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
0/1-Integer Programming: Optimization and Augmentation are Equivalent
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Machine Learning
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
Theory of Computing Systems
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
Theory of Computing Systems
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
Theory of Computing Systems
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Data reduction and exact algorithms for clique cover
Journal of Experimental Algorithmics (JEA)
Fixed-Parameter Algorithms for Kemeny Scores
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Iterative Compression and Exact Algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Randomized algorithms for the loop cutset problem
Journal of Artificial Intelligence Research
A cubic kernel for feedback vertex set
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Optimal edge deletions for signed graph balancing
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
The complexity of finding subgraphs whose matching number equals the vertex cover number
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Parameterized complexity and approximability of the SLCS problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Fixed-parameter algorithms for cluster vertex deletion
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Chordal deletion is fixed-parameter tractable
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Fixed-parameter tractability results for feedback set problems in tournaments
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Algorithm engineering for optimal graph bipartization
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Finding a minimum feedback vertex set in time O(1.7548n)
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Finding odd cycle transversals
Operations Research Letters
Improved algorithms for the feedback vertex set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An improved parameterized algorithm for the minimum node multiway cut problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Parameterized Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Separator-based data reduction for signed graph balancing
Journal of Combinatorial Optimization
Measuring indifference: unit interval vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
ACM Transactions on Computation Theory (TOCT)
Parameterized complexity of vertex deletion into perfect graph classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
FPT algorithms for path-transversal and cycle-transversal problems
Discrete Optimization
Fixed-Parameter tractability of almost CSP problem with decisive relations
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Journal of Combinatorial Optimization
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical Computer Science
| Hi-index | 0.00 |
We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven very useful for achieving a number of recent breakthroughs in the development of fixed-parameter algorithms for NP-hard minimization problems. There is a clear potential for further applications as well as a further development of the technique itself. We describe several algorithmic results based on iterative compression and point out some challenges for future research.