Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
A theory of diagnosis from first principles
Artificial Intelligence
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Journal of the ACM (JACM)
The Power of Dominance Relations in Branch-and-Bound Algorithms
Journal of the ACM (JACM)
Software—Practice & Experience - Special issue on discrete algorithm engineering
Using Fractal Geometry for Solving Divide-and-Conquer Recurrences
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Measure and conquer: a simple O(20.288n) independent set algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
Algorithmica - Parameterized and Exact Algorithms
The Travelling Salesman Problem in Bounded Degree Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
ACM Transactions on Algorithms (TALG)
Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Analytic Combinatorics
An expected-cost analysis of backtracking and non-backtracking algorithms
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set
Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Solving connected dominating set faster than 2n
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Automated generation of simplification rules for SAT and MAXSAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Parameterized algorithms for HITTING SET: the weighted case
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Branch and recharge: exact algorithms for generalized domination
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A fixed-parameter algorithm for string-to-string correction
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
A new upper bound for Max-2-SAT: A graph-theoretic approach
Journal of Discrete Algorithms
A linear kernel for co-path/cycle packing
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Constraint bipartite vertex cover: simpler exact algorithms and implementations
Journal of Combinatorial Optimization
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
Discrete Optimization
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
Computing the differential of a graph: Hardness, approximability and exact algorithms
Discrete Applied Mathematics
| Hi-index | 0.00 |
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimensions of this topic.