Decision algorithms for unsplittable flow and the half-disjoint paths problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Covering a hypergraph of subgraphs
Discrete Mathematics - Kleitman and combinatorics: a celebration
Dominating sets in planar graphs: branch-width and exponential speed-up
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Excluding any graph as a minor allows a low tree-width 2-coloring
Journal of Combinatorial Theory Series B
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ACM Transactions on Algorithms (TALG)
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
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
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)
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Quickly deciding minor-closed parameters in general graphs
European Journal of Combinatorics
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Additive approximation algorithms for list-coloring minor-closed class of graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Searching for a Visible, Lazy Fugitive
Graph-Theoretic Concepts in Computer Science
Graph minors. XXI. Graphs with unique linkages
Journal of Combinatorial Theory Series B
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
Tangles, tree-decompositions and grids in matroids
Journal of Combinatorial Theory Series B
Induced Packing of Odd Cycles in a Planar Graph
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Bounded tree-width and CSP-related problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
An improved algorithm for finding cycles through elements
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
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
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
A bound on the treewidth of planar even-hole-free graphs
Discrete Applied Mathematics
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
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
Fast minor testing in planar graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Contraction obstructions for treewidth
Journal of Combinatorial Theory Series B
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
Proceedings of the forty-third annual ACM symposium on Theory of computing
Contracting planar graphs to contractions of triangulations
Journal of Discrete Algorithms
Subexponential algorithms for partial cover problems
Information Processing Letters
Theoretical Computer Science
Journal of Computer and System Sciences
Implicit branching and parameterized partial cover problems
Journal of Computer and System Sciences
Fast sub-exponential algorithms and compactness in planar graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Faster parameterized algorithms for minor containment
Theoretical Computer Science
Finding an induced path of given parity in planar graphs in polynomial time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Treewidth lower bounds with brambles
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Polynomial treewidth forces a large grid-like-minor
European Journal of Combinatorics
The complexity of two graph orientation problems
Discrete Applied Mathematics
Induced packing of odd cycles in planar graphs
Theoretical Computer Science
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
Note: A note on planar graphs with large width parameters and small grid-minors
Discrete Applied Mathematics
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Computational study on bidimensionality theory based algorithm for longest path problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Survey: Subexponential parameterized algorithms
Computer Science Review
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
Minors in large almost-5-connected non-planar graphs
Journal of Graph Theory
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Effective computation of immersion obstructions for unions of graph classes
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Obtaining planarity by contracting few edges
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Subexponential parameterized algorithms
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Obtaining planarity by contracting few edges
Theoretical Computer Science
Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Effective computation of immersion obstructions for unions of graph classes
Journal of Computer and System Sciences
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
Hi-index | 0.01 |