Shallow excluded minors and improved graph decompositions

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

Distance labeling in graphs

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

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

Distance labeling in graphs

Journal of Algorithms

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)

Confronting hardness using a hybrid approach

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs

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

Approximating the maximum clique minor and some subgraph homeomorphism problems

Theoretical Computer Science

Grad and classes with bounded expansion II. Algorithmic aspects

European Journal of Combinatorics

Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces

Theoretical Computer Science

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

ACM Transactions on Algorithms (TALG)

Minors in random regular graphs

Random Structures & Algorithms

Eigenvalue bounds, spectral partitioning, and metrical deformations via flows

Journal of the ACM (JACM)

Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation

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

On nowhere dense graphs

European Journal of Combinatorics

A simpler algorithm and shorter proof for the graph minor decomposition

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

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

Characterisations and examples of graph classes with bounded expansion

European Journal of Combinatorics

Parallel graph decompositions using random shifts

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Structured recursive separator decompositions for planar graphs in linear time

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

Matrix sparsification and nested dissection over arbitrary fields

Journal of the ACM (JACM)