Lokshtanov D, Saurabh S and Zehavi M. (2020). Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. Treewidth, Kernels, and Algorithms. 10.1007/978-3-030-42071-0_9. (112-128).

https://link.springer.com/10.1007/978-3-030-42071-0_9

Verbitsky O and Zhukovskii M. (2019). The Descriptive Complexity of Subgraph Isomorphism Without Numerics. Theory of Computing Systems. 63:4. (902-921). Online publication date: 1-May-2019.

https://doi.org/10.1007/s00224-018-9864-3

Garnero V, Paul C, Sau I and Thilikos D. (2019). Explicit Linear Kernels for Packing Problems. Algorithmica. 81:4. (1615-1656). Online publication date: 1-Apr-2019.

https://doi.org/10.1007/s00453-018-0495-5

Dragan F and Guarnera H. (2019). Obstructions to a small hyperbolicity in Helly graphs. Discrete Mathematics. 10.1016/j.disc.2018.10.017. 342:2. (326-338). Online publication date: 1-Feb-2019.

https://linkinghub.elsevier.com/retrieve/pii/S0012365X18303510

Hatzel M, Kawarabayashi K and Kreutzer S. Polynomial planar directed grid theorem. Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. (1465-1484).

/doi/10.5555/3310435.3310524

Berger E, Dvořák Z and Norin S. (2018). Treewidth of Grid Subsets. Combinatorica. 38:6. (1337-1352). Online publication date: 1-Dec-2018.

https://doi.org/10.1007/s00493-017-3538-5

Kawarabayashi K and Rossman B. A polynomial excluded-minor approximation of treedepth. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. (234-246).

/doi/10.5555/3174304.3175283

Raymond J and Thilikos D. (2017). Recent techniques and results on the Erdős–Pósa property. Discrete Applied Mathematics. 10.1016/j.dam.2016.12.025. 231. (25-43). Online publication date: 1-Nov-2017.

https://linkinghub.elsevier.com/retrieve/pii/S0166218X17300045

Giannopoulou A, Kwon O, Raymond J and Thilikos D. (2017). Packing and covering immersion-expansions of planar sub-cubic graphs. European Journal of Combinatorics. 10.1016/j.ejc.2017.05.009. 65. (154-167). Online publication date: 1-Oct-2017.

https://linkinghub.elsevier.com/retrieve/pii/S0195669817300677

Zhukovskii M. (2017). On first-order definitions of subgraph isomorphism properties. Doklady Mathematics. 10.1134/S1064562417050167. 96:2. (454-456). Online publication date: 1-Sep-2017.

http://link.springer.com/10.1134/S1064562417050167

Giannopoulou A, Jansen B, Lokshtanov D and Saurabh S. (2017). Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Transactions on Algorithms. 13:3. (1-35). Online publication date: 31-Jul-2017.

https://doi.org/10.1145/3029051

Harvey D and Wood D. (2016). Parameters Tied to Treewidth. Journal of Graph Theory. 10.1002/jgt.22030. 84:4. (364-385). Online publication date: 1-Apr-2017.

https://onlinelibrary.wiley.com/doi/10.1002/jgt.22030

Kawarabayashi K and Kobayashi Y. (2016). An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two. ACM Transactions on Algorithms. 13:1. (1-17). Online publication date: 31-Jan-2017.

https://doi.org/10.1145/2960410

Chalermsook P, Das S, Laekhanukit B and Vaz D. Beyond metric embedding. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. (737-751).

/doi/10.5555/3039686.3039733

Verbitsky O and Zhukovskii M. (2017). The Descriptive Complexity of Subgraph Isomorphism Without Numerics. Computer Science – Theory and Applications. 10.1007/978-3-319-58747-9_27. (308-322).

https://link.springer.com/10.1007/978-3-319-58747-9_27

Chuzhoy J and Li S. (2016). A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. Journal of the ACM. 63:5. (1-51). Online publication date: 20-Dec-2016.

https://doi.org/10.1145/2893472

Rossman B. (2016). An improved homomorphism preservation theorem from lower bounds in circuit complexity. ACM SIGLOG News. 3:4. (33-46). Online publication date: 15-Dec-2016.

https://doi.org/10.1145/3026744.3026746

Kakimura N and Kawarabayashi K. (2016). Coloring immersion-free graphs. Journal of Combinatorial Theory Series B. 121:C. (284-307). Online publication date: 1-Nov-2016.

https://doi.org/10.1016/j.jctb.2016.07.005

Giannopoulou A, Kwon O, Raymond J and Thilikos D. Packing and Covering Immersion Models of Planar Subcubic Graphs. Revised Selected Papers of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 9941. (74-84).

https://doi.org/10.1007/978-3-662-53536-3_7

Amarilli A, Bourhis P and Senellart P. Tractable Lineages on Treelike Instances. Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. (355-370).

https://doi.org/10.1145/2902251.2902301

Chuzhoy J. (2016). Large-Treewidth Graph Decompositions. Encyclopedia of Algorithms. 10.1007/978-1-4939-2864-4_691. (1057-1059).

http://link.springer.com/10.1007/978-1-4939-2864-4_691

Chekuri C and Ene A. (2015). The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Mathematical Programming: Series A and B. 154:1-2. (249-272). Online publication date: 1-Dec-2015.

https://doi.org/10.1007/s10107-014-0856-z

Kawarabayashi K and Kreutzer S. Towards the Graph Minor Theorems for Directed Graphs. Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 9135. (3-10).

https://doi.org/10.1007/978-3-662-47666-6_1

Norin S. (2015). New tools and results in graph minor structure theory. Surveys in Combinatorics 2015. 10.1017/CBO9781316106853.008. (221-260).

https://www.cambridge.org/core/product/identifier/CBO9781316106853A016/type/book_part

Bousquet N, Li Z and Vetta A. Coalition Games on Interaction Graphs. Proceedings of the Sixteenth ACM Conference on Economics and Computation. (95-112).

https://doi.org/10.1145/2764468.2764477

Kawarabayashi K and Kreutzer S. The Directed Grid Theorem. Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. (655-664).

https://doi.org/10.1145/2746539.2746586

Chuzhoy J. Excluded Grid Theorem. Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. (645-654).

https://doi.org/10.1145/2746539.2746551

Fomin F, Lokshtanov D, Misra N, Ramanujan M and Saurabh S. Solving d-SAT via backdoors to small treewidth. Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. (630-641).

/doi/10.5555/2722129.2722172

Chekuri C and Chuzhoy J. Degree-3 treewidth sparsifiers. Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. (242-255).

/doi/10.5555/2722129.2722148

Giannopoulou A, Jansen B, Lokshtanov D and Saurabh S. (2015). Uniform Kernelization Complexity of Hitting Forbidden Minors. Automata, Languages, and Programming. 10.1007/978-3-662-47672-7_51. (629-641).

https://link.springer.com/10.1007/978-3-662-47672-7_51

Kawarabayashi K, Kobayashi Y and Kreutzer S. An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. Proceedings of the forty-sixth annual ACM symposium on Theory of computing. (70-78).

https://doi.org/10.1145/2591796.2591876

Chekuri C and Ene A. (2014). The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. Integer Programming and Combinatorial Optimization. 10.1007/978-3-319-07557-0_19. (222-233).

http://link.springer.com/10.1007/978-3-319-07557-0_19