Breaking the 2n-barrier for Irredundance: Two lines of attack
Journal of Discrete Algorithms
Fast exact algorithm for L(2, 1)-labeling of graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Invitation to algorithmic uses of inclusion-exclusion
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Discrete Applied Mathematics
Enumerating minimal subset feedback vertex sets
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
An exact algorithm for the Maximum Leaf Spanning Tree problem
Theoretical Computer Science
Exact algorithm for the maximum induced planar subgraph problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Scheduling partially ordered jobs faster than 2n
ESA'11 Proceedings of the 19th European conference on Algorithms
Capacitated domination faster than O(2n)
Information Processing Letters
On computing the minimum 3-path vertex cover and dissociation number of graphs
Theoretical Computer Science
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bicolored independent sets and bicliques
Information Processing Letters
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Counting maximal independent sets in subcubic graphs
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A faster algorithm for dominating set analyzed by the potential method
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
Journal of Discrete Algorithms
Solving the 2-disjoint connected subgraphs problem faster than 2n
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Kernels for global constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Reducing a target interval to a few exact queries
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
An exact algorithm for subset feedback vertex set on chordal graphs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Homomorphic hashing for sparse coefficient extraction
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Computing directed pathwidth in O(1.89n) time
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Communications of the ACM
Recognizing 3-colorings cycle-patterns on graphs
Pattern Recognition Letters
Trees having many minimal dominating sets
Information Processing Letters
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
TREEWIDTH and PATHWIDTH parameterized by the vertex cover number
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Bounding the running time of algorithms for scheduling and packing problems
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
An o *(1.84 k) parameterized algorithm for the multiterminal cut problem
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Fast exact algorithm for L(2,1)-labeling of graphs
Theoretical Computer Science
On an extension of the Sort & Search method with application to scheduling theory
Theoretical Computer Science
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
An O*(1.84k) parameterized algorithm for the multiterminal cut problem
Information Processing Letters
Computing the differential of a graph: Hardness, approximability and exact algorithms
Discrete Applied Mathematics
Hi-index | 0.02 |
Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others? Are there algorithmic techniques for solving hard problems that are significantly faster than the exhaustive, brute-force methods? The algorithms that address these questions are known as exact exponential algorithms.The history of exact exponential algorithms for NP-hard problems dates back to the 1960s. The two classical examples are Bellman, Held and Karps dynamic programming algorithm for the traveling salesman problem and Rysers inclusionexclusion formula for the permanent of a matrix. The design and analysis of exact algorithms leads to a better understanding of hard problems and initiates interesting new combinatorial and algorithmic challenges. The last decade has witnessed a rapid development of the area, with many new algorithmic techniques discovered. This has transformed exact algorithms into a very active research field. This book provides an introduction to the area and explains the most common algorithmic techniques, and the text is supported throughout with exercises and detailed notes for further reading.The book is intended for advanced students and researchers in computer science, operations research, optimization and combinatorics.