**Publications and preprints
**

**Accepted for Publication**

- Space proof complexity for random 3-CNFs (with P. Bennett, I. Bonacina, N. Galesi, T. Huynh, and M. Molloy)
*Information and Computation*.

- A unified Erdos-Posa theorem for constrained cycles (with F. Joos and T. Huynh)
*Combinatorica*.

**2017**

**2016**

- Displaying blocking pairs in signed graphs (with B. Guenin and I. Pivotto),
*European J. of Combinatorics***51**, (2016) 135 - 164.

- Stabilizer theorems for even cycle matroids (with B. Guenin and I. Pivotto),
*J. Combin. Theory Ser. B***118**(2016) 44 - 75.

**2015**

- The structure of graphs not admitting a fixed immersion
*J. Combin. Theory Ser. B***110**(1), (2016) 47 - 66.

- An exact characterization of tractable demand patterns for maximum disjoint path problems (with D. Marx), 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, 642-661. For a full version of the article, see here.

**2014**

- Immersions in highly connected graphs (with D. Marx)
*SIAM J. of Disc. Math.***28**(1), (2014) 503 - 520.

**2013**

- Axioms for infinite matroids (with H. Bruhn, R. Diestel, M. Kriesell, and R. Pendavingh)
*Advances in Mathematics***239**(2013) 18 - 46.

- Relations between pairs of representations of signed binary matroids (with B. Guenin and I. Pivotto)
*SIAM J. of Disc. Math.***27**(2013) 329 - 341.

**2012**

- On the excluded minor structure theorem for graphs of large tree width (with R. Diestel, K. Kawarabayashi, and T. Muller),
*J. Combin. Theory Ser. B***102**(2012) 1189 - 1210.

- Disjoint cycles intersecting a set of vertices (with M. Pontecorvi)
*J. Combin. Theory Ser. B***102**(2012) 1134 - 1141.

- Finite connectivity in infinite matroids (with H. Bruhn)
*European J. of Combinatorics***33**(2012), 1900 - 1912.

- The Erdos-Posa property for clique minors in highly connected graphs (with R. Diestel and K. Kawarabayashi),
*J. Combin. Theory Ser. B*,**102**(2012), 454 - 469.

**2011**

- 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, 27 - 36.

- 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.

**2010**

- 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.

**2008**

- 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.

**2006**

- 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.

**2005**

- 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
_{6}minors in 6-connected graphs of bounded treewidth (with K. Kawarabayashi, S. Norine, and R. Thomas) submitted.

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

- Linkages in large graphs of bounded treewidth (with J. Froehlich, K. Kawarabayashi, T. Mueller and J. Pott) manuscript.

- Half-integral linkages in highly connected directed graphs (with K. Edwards and I. Muzi) submitted.

- Nonrepetitive colourings of graphs excluding a fixed immersion or topological minor (with D. Wood) submitted.

- Chi-boundedness of graph classes excluding wheel vertex-minors (with H. Choi, O. Kwon and S. Oum) submitted.

- Forcing clique immersions through chromatic number (with G. Gauthier and T. Le) submitted.