Follow
Sophie Spirkl
Sophie Spirkl
University of Waterloo
Verified email at uwaterloo.ca - Homepage
Title
Cited by
Cited by
Year
Four-coloring P 6-free graphs
M Chudnovsky, S Spirkl, M Zhong
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
332019
H-colouring Pt-free graphs in subexponential time
C Groenland, K Okrasa, P Rzążewski, A Scott, P Seymour, S Spirkl
Discrete Applied Mathematics 267, 184-189, 2019
252019
Pure pairs. I. Trees and linear anticomplete pairs
M Chudnovsky, A Scott, P Seymour, S Spirkl
Advances in Mathematics, 107396, 2020
232020
Detecting an odd hole
M Chudnovsky, A Scott, P Seymour, S Spirkl
Journal of the ACM (JACM) 67 (1), 1-12, 2020
232020
A deletion–contraction relation for the chromatic symmetric function
L Crew, S Spirkl
European Journal of Combinatorics 89, 103143, 2020
202020
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
M Chudnovsky, A Scott, P Seymour, S Spirkl
Journal of Combinatorial Theory, Series B 140, 84-97, 2020
192020
List 3-Coloring Graphs with No Induced P 6 + r P 3
M Chudnovsky, S Huang, S Spirkl, M Zhong
Algorithmica, 1-36, 2020
18*2020
Four-coloring -free graphs. II. Finding an excellent precoloring
M Chudnovsky, S Spirkl, M Zhong
arXiv preprint arXiv:1802.02283, 2018
16*2018
Caterpillars in Erdős–Hajnal
A Liebenau, M Pilipczuk, P Seymour, S Spirkl
Journal of Combinatorial Theory, Series B 136, 33-43, 2019
152019
Erdos-Hajnal for graphs with no 5-hole
M Chudnovsky, A Scott, P Seymour, S Spirkl
arXiv preprint arXiv:2102.04994, 2021
14*2021
Pure pairs. II. Excluding all subdivisions of a graph
M Chudnovsky, A Scott, P Seymour, S Spirkl
Combinatorica, 2021
13*2021
A fast algorithm for rectilinear steiner trees with length restrictions on obstacles
S Held, ST Spirkl
Proceedings of the 2014 on International symposium on physical design, 37-44, 2014
122014
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree
T Abrishami, M Chudnovsky, C Dibek, S Hajebi, P Rzążewski, S Spirkl, ...
arXiv preprint arXiv:2108.01162, 2021
112021
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s
M Chudnovsky, S Spirkl, M Zhong
Discrete Mathematics 343 (11), 112086, 2020
112020
Proof of the Kalai-Meshulam conjecture
M Chudnovsky, A Scott, P Seymour, S Spirkl
Israel Journal of Mathematics 238 (2), 639-661, 2020
112020
Finding an induced path that is not a shortest path
E Berger, P Seymour, S Spirkl
Discrete Mathematics 344 (7), 112398, 2021
92021
Finding large -colorable subgraphs in hereditary graph classes
M Chudnovsky, J King, M Pilipczuk, P Rzążewski, S Spirkl
arXiv preprint arXiv:2004.09425, 2020
92020
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
S Held, ST Spirkl
ACM Transactions on Algorithms (TALG) 14 (1), 4, 2018
92018
Piercing axis-parallel boxes
M Chudnovsky, S Spirkl, S Zerbib
arXiv preprint arXiv:1705.00089, 2017
92017
Fast Prefix Adders for Non-Uniform Input Arrival Times
S Held, S Spirkl
Algorithmica 77 (1), 287-308, 2017
92017
The system can't perform the operation now. Try again later.
Articles 1–20