A separator theorem for graphs with an excluded minor and its applications

Finding approximate separators and computing tree width quickly

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

New graph decompositions and fast emulations in hypercubes and butterflies

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures

Faster shortest-path algorithms for planar graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Pseudorandomness for network algorithms

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Separators for sphere-packings and nearest neighbor graphs

Journal of the ACM (JACM)

Using random sampling to find maximum flows in uncapacitated undirected graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Moments of inertia and graph separators

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Shallow excluded minors and improved graph decompositions

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Distance labeling in graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Hard examples for bounded depth frege

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

A Dynamic Algorithm for Maintaining Graph Partitions

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory

Approximate TSP in Graphs with Forbidden Minors

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming

Min-Max-Boundary Domain Decomposition

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics

-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization

Polynomial Vicinity Circuits and Nonlinear Lower Bounds

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity

A spectral lower bound for the treewidth of a graph and its consequences

Information Processing Letters

Graph separators: a parameterized view

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity

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

Hard examples for the bounded depth Frege proof system

Computational Complexity

Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

Journal of Computer and System Sciences

Distance labeling in graphs

Journal of Algorithms

Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)

Detachments of Complete Graphs

Combinatorics, Probability and Computing

Object location using path separators

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

Tight bounds for the Min-Max boundary decomposition cost of weighted graphs

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

Counting models for 2SAT and 3SAT formulae

Theoretical Computer Science

Approximating the maximum clique minor and some subgraph homeomorphism problems

Theoretical Computer Science

On testable properties in bounded degree graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Grad and classes with bounded expansion II. Algorithmic aspects

European Journal of Combinatorics

Exact Max 2-Sat: Easier and Faster

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science

The Valve Location Problem in Simple Network Topologies

Graph-Theoretic Concepts in Computer Science

A linear-time algorithm to find a separator in a graph excluding a minor

ACM Transactions on Algorithms (TALG)

The valve location problem: Minimizing environmental damage of a spill in long oil pipelines

Computers and Industrial Engineering

Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)

Algorithmic and Analysis Techniques in Property Testing

Foundations and Trends® in Theoretical Computer Science

The Valve Location Problem in Simple Network Topologies

INFORMS Journal on Computing

Improved sublinear time algorithm for width-bounded separators

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics

Testing outerplanarity of bounded degree graphs

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Theory and application of width bounded geometric separators

Journal of Computer and System Sciences

Sublinear graph approximation algorithms

Property testing

Sublinear graph approximation algorithms

Property testing

How to cut a graph into many pieces

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation

An efficient partitioning oracle for bounded-treewidth graphs

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

Sublinear time width-bounded separators and their application to the protein side-chain packing problem

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

The size and depth of layered boolean circuits

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

A generalization of spira's theorem and circuits with small segregators or separators

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Sublinear Time Algorithms

SIAM Journal on Discrete Mathematics

Coalition structure generation over graphs

Journal of Artificial Intelligence Research

Testing subdivision-freeness: property testing meets structural graph theory

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

A quasi-polynomial time partition oracle for graphs with an excluded minor

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I