The Erdos-Posa property for clique minors in highly connected graphs (with R. Diestel and K. Kawarabayashi).

Relations between pairs of representations of signed binary matroids (with B. Guenin and I. Pivotto).

Finite connectivity in infinite matroids (with H. Bruhn).

The Graph Minors Algorithm with Parity Conditions (with K. Kawarabayashi and B. Reed), FOCS'11 Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science.

Packing cycles with modularity constraints, Combinatorica 31 (2011), 95-126.

Finding topological subgraphs is fixed parameter tractable (with M. Grohe, K. Kawarabayashi, and D. Marx), STOC'11 Proceedings of the 43rd ACM Symposium on Theory of Computing, 479-488. For a full version of the article, see here.

A simpler algorithm and shorter proof for the graph minor decomposition (with K. Kawarabayashi), STOC'11 Proceedings of the 43rd ACM Symposium on Theory of Computing, 451-458. For a full version of the article, see here.

Bridges in highly connected graphs, SIAM J. of Disc. Math. 24 (2010), 1731-1741

Packing non-zero A-paths in an undirected model of group labeled graphs, J. Combin. Theory Ser. B 100 (2010), 141-150.

Voting in agreeable societies (with D. Berg, S. Norine, F.E. Su, and R. Thomas), AMS Math. Monthly 117 (2010), 27-39.

A shorter proof of the Graph Minors Algorithm - the Unique Linkage Theorem (with K. Kawarabayashi), STOC'10 Proceedings of the 42nd ACM Symposium on Theory of Computing, 687-694.

The extremal function for 3-linked graphs (with R. Thomas), J. Combin. Theory Ser. B 98 (2008), 939 - 971.

A weaker version of Lovasz' path removal conjecture (with K. Kawarabayashi, O. Lee, and B. Reed), J. of Combin Theory Ser. B 98 (2008), 972 - 979.

Extremal functions for rooted minors, J. Graph Theory, 58 (2008), 159-178.

Non-zero disjoint cycles in highly connected group labeled graphs (with K. Kawarabayashi), J. Combin. Theory Ser. B, 96 (2006), 296 - 301.

Proper minor-closed families are small (with S. Norine, P. Seymour, and R. Thomas), J. Combin. Theory Ser. B 96 (2006), 754 - 757.

Extremal functions for shortening sets of paths, Combinatorics, Probability, and Computing 15 (2006), 927 - 932.

An improved linear edge bound for graph linkages (with R. Thomas), European J. of Combinatorics 26 (2005), 309 - 324.

Generation of simple quadrangulations of the sphere (with G. Brinkmann, S. Greenberg, C. Greenhill, B. McKay, and R. Thomas), Discrete Math. 305 (2005), 33-54.

K₆ minors in 6-connected graphs of bounded treewidth (with K. Kawarabayashi, S. Norine, and R. Thomas) submitted.

K₆ minors in large 6-connected graphs (with K. Kawarabayashi, S. Norine, and R. Thomas), submitted.

On the excluded minor structure theorem for graphs of large tree width (with R. Diestel, K. Kawarabayashi, and T. Muller), submitted.

Disjoint cycles intersecting a set of vertices (with M. Pontecorvi), submitted.

Axioms for infinite matroids (with H. Bruhn, R. Diestel, M. Kriesell, and R. Pendavingh).

Isomorphism for even cycle matroids I (with B. Guenin and I. Pivotto), submitted.