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
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Decision algorithms for unsplittable flow and the half-disjoint paths problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Computing crossing numbers in quadratic time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Learnability and Definability in Trees and Similar Structures
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Automata logics, and infinite games
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing crossing numbers in quadratic time
Journal of Computer and System Sciences - STOC 2001
Excluding any graph as a minor allows a low tree-width 2-coloring
Journal of Combinatorial Theory Series B
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
On preservation under homomorphisms and unions of conjunctive queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Combinatorial Theory Series B
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Obstructions to branch-decomposition of matroids
Journal of Combinatorial Theory Series B
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Excluding a planar graph from GF(q)-representable matroids
Journal of Combinatorial Theory Series B
Vertex-minor reductions can simulate edge contractions
Discrete Applied Mathematics
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Planar graph bipartization in linear time
Discrete Applied Mathematics
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Efficient First-Order Model-Checking Using Short Labels
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
The Maximum Independent Set Problem in Planar Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
A nearly linear time algorithm for the half integral parity disjoint paths packing problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graph operations characterizing rank-width
Discrete Applied Mathematics
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
Tree-width of graphs without a 3×3 grid minor
Discrete Applied Mathematics
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
Recognizability in the Simply Typed Lambda-Calculus
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Benchmarks for strictly fundamental cycle bases
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Note: Crossing-critical graphs with large maximum degree
Journal of Combinatorial Theory Series B
Graph operations characterizing rank-width and balanced graph expressions
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
An improved algorithm for finding cycles through elements
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
European Journal of Combinatorics
Proceedings of the forty-second ACM symposium on Theory of computing
On the parameterised intractability of monadic second-order logic
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Vertex-bipartition method for colouring minor-closed classes of graphs
Combinatorics, Probability and Computing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Structural tractability of enumerating CSP solutions
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Improved algorithm for the half-disjoint paths problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The edge-density for K2,t minors
Journal of Combinatorial Theory Series B
MAX-CUT and containment relations in graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Boundary properties of graphs for algorithmic graph problems
Theoretical Computer Science
Contraction obstructions for treewidth
Journal of Combinatorial Theory Series B
Notes: Packing cycles through prescribed vertices
Journal of Combinatorial Theory Series B
A simpler algorithm and shorter proof for the graph minor decomposition
Proceedings of the forty-third annual ACM symposium on Theory of computing
F-rank-width of (edge-colored) graphs
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Implicit branching and parameterized partial cover problems
Journal of Computer and System Sciences
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Polynomial treewidth forces a large grid-like-minor
European Journal of Combinatorics
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
Random graphs with few disjoint cycles
Combinatorics, Probability and Computing
The Erdős-Pósa property for clique minors in highly connected graphs
Journal of Combinatorial Theory Series B
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM (JACM)
Note: max-cut and containment relations in graphs
Theoretical Computer Science
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The power of counting logics on restricted classes of finite structures
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
On the excluded minor structure theorem for graphs of large tree-width
Journal of Combinatorial Theory Series B
The tractability of CSP classes defined by forbidden patterns
Journal of Artificial Intelligence Research
Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Square roots of minor closed graph classes
Discrete Applied Mathematics
| Hi-index | 0.00 |