The guillotine approach for TSP with neighborhoods revisited. - Sophie Theresa Spirkl (CoRR, 2013)

A fast algorithm for rectilinear steiner trees with length restrictions on obstacles. - Stephan Held; Sophie Theresa Spirkl (ISPD, 2014)

Fast Prefix Adders for Non-uniform Input Arrival Times. - Stephan Held; Sophie Spirkl (Algorithmica, 2017)

Colouring perfect graphs with bounded clique number. - Maria Chudnovsky; Aurélie Lagoutte; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2017)

The Sandwich Problem for Decompositions and Almost Monotone Properties. - Maria Chudnovsky; Celina M. H. de Figueiredo; Sophie Spirkl (Algorithmica, 2018)

Piercing Axis-Parallel Boxes. - Maria Chudnovsky; Sophie Spirkl; Shira Zerbib (Electron. J. Comb., 2018)

Four-coloring Ps6-free graphs. I. Extending an excellent precoloring. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (CoRR, 2018)

Four-coloring P6-free graphs. II. Finding an excellent precoloring. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (CoRR, 2018)

Sandwich and probe problems for excluding paths. - Celina M. H. de Figueiredo; Sophie Spirkl (Discret. Appl. Math., 2018)

Triangle-free graphs with no six-vertex induced path. - Maria Chudnovsky; Paul D. Seymour; Sophie Spirkl; Mingxian Zhong (Discret. Math., 2018)

Even pairs and prism corners in square-free Berge graphs. - Maria Chudnovsky; Frédéric Maffray; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2018)

Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39]. - Maria Chudnovsky; Frédéric Maffray; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2018)

Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. - Stephan Held; Sophie Theresa Spirkl (ACM Trans. Algorithms, 2018)

Complexity of Ck-Coloring in Hereditary Classes of Graphs. - Maria Chudnovsky; Shenwei Huang; Pawel Rzazewski; Sophie Spirkl; Mingxian Zhong (ESA, 2019)

Four-coloring P6-free graphs. - Sophie Spirkl; Maria Chudnovsky; Mingxian Zhong (SODA, 2019)

Approximately Coloring Graphs Without Long Induced Paths. - Maria Chudnovsky; Oliver Schaudt; Sophie Spirkl; Maya Stein; Mingxian Zhong (Algorithmica, 2019)

Towards Erdős-Hajnal for Graphs with No 5-Hole. - Maria Chudnovsky; Jacob Fox; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Comb., 2019)

Disproportionate division. - Logan Crew; Bhargav Narayanan; Sophie Spirkl (CoRR, 2019)

H-colouring Pt-free graphs in subexponential time. - Carla Groenland; Karolina Okrasa; Pawel Rzazewski; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Discret. Appl. Math., 2019)

Entropic Matroids and Their Representation. - Emmanuel Abbe; Sophie Spirkl (Entropy, 2019)

Caterpillars in Erdős-Hajnal. - Anita Liebenau; Marcin Pilipczuk; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2019)

Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. - Maria Chudnovsky; Chun-Hung Liu; Oliver Schaudt; Sophie Spirkl; Nicolas Trotignon; Kristina Vuskovic (J. Graph Theory, 2019)

Short Directed Cycles in Bipartite Digraphs. - Paul D. Seymour; Sophie Spirkl (Comb., 2020)

List-three-coloring Pt-free graphs with no induced 1-subdivision of K1, s. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (CoRR, 2020)

List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (Discret. Math., 2020)

A deletion-contraction relation for the chromatic symmetric function. - Logan Crew; Sophie Spirkl (Eur. J. Comb., 2020)

Detecting an Odd Hole. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. ACM, 2020)

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory, Ser. B, 2020)

Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. - Maria Chudnovsky; Jacob Fox; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2020)

List 3-Coloring Graphs with No Induced P6+rP3. - Maria Chudnovsky; Shenwei Huang; Sophie Spirkl; Mingxian Zhong (Algorithmica, 2021)

Pure Pairs. II. Excluding All Subdivisions of A Graph. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Comb., 2021)

A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function. - José Aliste-Prieto; Logan Crew; Sophie Spirkl; José Zamora (Electron. J. Comb., 2021)

On symmetric intersecting families of vectors. - Sean Eberhard; Jeff Kahn 001; Bhargav Narayanan; Sophie Spirkl (Comb. Probab. Comput., 2021)

Finding an induced path that is not a shortest path. - Eli Berger; Paul D. Seymour; Sophie Spirkl (Discret. Math., 2021)

A note on simplicial cliques. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Discret. Math., 2021)

On Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture. - Patrick Hompe; Petra Pelikánová; Aneta Pokorná; Sophie Spirkl (Discret. Math., 2021)

Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. - Maria Chudnovsky; Jason King; Michal Pilipczuk; Pawel Rzazewski; Sophie Spirkl (SIAM J. Discret. Math., 2021)

A Complete Multipartite Basis for the Chromatic Symmetric Function. - Logan Crew; Sophie Spirkl (SIAM J. Discret. Math., 2021)

Digraphs with All Induced Directed Cycles of the Same Length are not $ vec{ chi}$-Bounded. - Alvaro Carbonero; Patrick Hompe; Benjamin R. Moore; Sophie Spirkl (Electron. J. Comb., 2022)

Concatenating Bipartite Graphs. - Maria Chudnovsky; Patrick Hompe; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Electron. J. Comb., 2022)

Plethysms of Chromatic and Tutte Symmetric Functions. - Logan Crew; Sophie Spirkl (Electron. J. Comb., 2022)

Further Approximations for Aharoni's Rainbow Generalization of the Caccetta-Häggkvist Conjecture. - Patrick Hompe; Sophie Spirkl (Electron. J. Comb., 2022)

Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs. - Joseph Cheriyan; Sepehr Hajebi; Zishen Qu; Sophie Spirkl (Discret. Math., 2022)

Modular relations of the Tutte symmetric function. - Logan Crew; Sophie Spirkl (J. Comb. Theory A, 2022)

Polynomial bounds for chromatic number II: Excluding a star-forest. - Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2022)

Polynomial bounds for chromatic number. III. Excluding a double star. - Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2022)

Pure Pairs VI: Excluding an Ordered Tree. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (SIAM J. Discret. Math., 2022)

Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph. - Sepehr Hajebi; Yanjia Li; Sophie Spirkl (SIAM J. Discret. Math., 2022)

Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs. - Tara Abrishami; Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl (Electron. J. Comb., 2023)

Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs. - Aristotelis Chaniotis; Zishen Qu; Sophie Spirkl (Discret. Math., 2023)

A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number. - Alvaro Carbonero; Patrick Hompe; Benjamin R. Moore; Sophie Spirkl (J. Comb. Theory B, 2023)

Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree. - Alexander D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2023)

The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size. - Yanjia Li; Sophie Spirkl (Discret. Math., 2023)

Polynomial bounds for chromatic number VI. Adding a four-vertex path. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Eur. J. Comb., 2023)

Pure Pairs. V. Excluding Some Long Subdivision. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Comb., 2023)

Complexity of Ck-coloring in hereditary classes of graphs. - Maria Chudnovsky; Shenwei Huang; Pawel Rzazewski; Sophie Spirkl; Mingxian Zhong (Inf. Comput., 2023)

Pure pairs. IV. Trees in bipartite graphs. - Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2023)

Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2023)

Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Comb., 2023)

Strengthening Rödl's theorem. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2023)

Polynomial bounds for chromatic number VII. Disjoint holes. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2023)

Homogeneous sets in graphs and a chromatic multisymmetric function. - Logan Crew; Evan Haithcock; Josephine Reynes; Sophie Spirkl (Adv. Appl. Math., 2024)

Tree independence number I. (Even hole, diamond, pyramid)-free graphs. - Tara Abrishami; Bogdan Alecu; Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl; Kristina Vuskovic (J. Graph Theory, 2024)

Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture. - Patrick Hompe; Zishen Qu; Sophie Spirkl (Discret. Math., 2024)

Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Eur. J. Comb., 2024)

Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. - Tara Abrishami; Bogdan Alecu; Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl (J. Comb. Theory B, 2024)

Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. - Tara Abrishami; Maria Chudnovsky; Cemil Dibek; Sepehr Hajebi; Pawel Rzazewski; Sophie Spirkl; Kristina Vuskovic (J. Comb. Theory B, 2024)

Bipartite graphs with no K6 minor. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2024)

Four-Coloring (P_6 )-Free Graphs. I. Extending an Excellent Precoloring. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (SIAM J. Comput., 2024)

Four-Coloring ( boldsymbol{P_6} )-Free Graphs. II. Finding an Excellent Precoloring. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (SIAM J. Comput., 2024)

Hitting all maximum stable sets in P5-free graphs. - Sepehr Hajebi; Yanjia Li; Sophie Spirkl (J. Comb. Theory B, 2024)

List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph. - Sepehr Hajebi; Yanjia Li; Sophie Spirkl (SIAM J. Discret. Math., 2024)

Pure Pairs. IX. Transversal Trees. - Alex D. Scott; Paul D. Seymour; Sophie Theresa Spirkl (SIAM J. Discret. Math., 2024)

Induced subgraphs and tree decompositions V. one neighbor in a hole. - Tara Abrishami; Bogdan Alecu; Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl; Kristina Vuskovic (J. Graph Theory, 2024)

Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs. - Tara Abrishami; Bogdan Alecu; Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl (Comb., 2024)

List-k-Coloring H-Free Graphs for All k>4. - Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl (Comb., 2024)

Pure Pairs. VIII. Excluding a Sparse Graph. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Comb., 2024)

Tree Independence Number IV. Even-hole-free graphs. - Maria Chudnovsky; Peter Gartland; Sepehr Hajebi; Daniel Lokshtanov; Sophie Spirkl (SODA, 2025)

Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets. - Tara Abrishami; Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl (Discret. Math., 2025)

The sandwich problem for odd-hole-free and even-hole-free graphs. - Kathie Cameron; Aristotelis Chaniotis; Celina M. H. de Figueiredo; Sophie Spirkl (Discret. Math., 2025)

On heroes in digraphs with forbidden induced forests. - Alvaro Carbonero; Hidde Koerts; Benjamin R. Moore; Sophie Spirkl (Eur. J. Comb., 2025)

Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole. - Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl (Eur. J. Comb., 2025)

A simple layered-wheel-like construction. - Maria Chudnovsky; David Fischer; Sepehr Hajebi; Sophie Spirkl; Bartosz Walczak (CoRR, 2025)