On search decision and the efficiency of polynomial-time algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Regular Article: On search, decision, and the efficiency of polynomial-time algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Two applications of analytic functors
Theoretical Computer Science - Special issue on theories of types and proofs
Branch-width and well-quasi-ordering in matroids and graphs
Journal of Combinatorial Theory Series B
Branch-width and Rota's conjecture
Journal of Combinatorial Theory Series B
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
A differential approach to inference in Bayesian networks
Journal of the ACM (JACM)
Graph minors. XVIII. tree-decompositions and well-quasi-ordering
Journal of Combinatorial Theory Series B
Two Short Proofs Concerning Tree-Decompositions
Combinatorics, Probability and Computing
Graph Minors. XIX. Well-quasi-ordering on a surface
Journal of Combinatorial Theory Series B
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Journal of Algorithms
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics
European Journal of Combinatorics - Special issue: Topological graph theory
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Journal of Combinatorial Theory Series B
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Minor-minimal planar graphs of even branch-width
Combinatorics, Probability and Computing
Nested cycles in large triangulations and crossing-critical graphs
Journal of Combinatorial Theory Series B
New advances in inference by recursive conditioning
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
European Journal of Combinatorics
Fixed-Parameter tractability, a prehistory,
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |