default search action
Sophie Spirkl
Sophie Theresa Spirkl
Person information
- affiliation: University of Waterloo, Department of Combinatorics and Optimization, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j69]Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets. Discret. Math. 348(1): 114195 (2025) - [j68]Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole. Eur. J. Comb. 124: 104074 (2025) - 2024
- [j67]Logan Crew, Evan Haithcock, Josephine Reynes, Sophie Spirkl:
Homogeneous sets in graphs and a chromatic multisymmetric function. Adv. Appl. Math. 158: 102718 (2024) - [j66]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs. Comb. 44(5): 921-948 (2024) - [j65]Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
List-k-Coloring H-Free Graphs for All k>4. Comb. 44(5): 1063-1068 (2024) - [j64]Patrick Hompe, Zishen Qu, Sophie Spirkl
:
Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture. Discret. Math. 347(1): 113691 (2024) - [j63]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. Eur. J. Comb. 115: 103786 (2024) - [j62]Maria Chudnovsky, Alex D. Scott
Bipartite graphs with no K6 minor. J. Comb. Theory B 164: 68-104 (2024) - [j61]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. J. Comb. Theory B 164: 371-403 (2024) - [j60]Tara Abrishami, Bogdan Alecu
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. J. Comb. Theory B 164: 443-472 (2024) - [j59]Sepehr Hajebi
Hitting all maximum stable sets in P5-free graphs. J. Comb. Theory B 165: 142-163 (2024) - [j58]Tara Abrishami, Bogdan Alecu
Induced subgraphs and tree decompositions V. one neighbor in a hole. J. Graph Theory 105(4): 542-561 (2024) - [j57]Maria Chudnovsky
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring. SIAM J. Comput. 53(1): 111-145 (2024) - [j56]Maria Chudnovsky
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring. SIAM J. Comput. 53(1): 146-187 (2024) - [j55]Alex D. Scott, Paul D. Seymour, Sophie Theresa Spirkl
Pure Pairs. IX. Transversal Trees. SIAM J. Discret. Math. 38(1): 645-667 (2024) - [j54]Sepehr Hajebi, Yanjia Li, Sophie Spirkl:
List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph. SIAM J. Discret. Math. 38(1): 1158-1190 (2024) - [i15]Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo, Sophie Spirkl:
The sandwich problem for odd-hole-free and even-hole-free graphs. CoRR abs/2404.10888 (2024) - [i14]Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl:
Tree Independence Number IV. Even-hole-free Graphs. CoRR abs/2407.08927 (2024) - 2023
- [j53]Alex Scott, Paul D. Seymour
Pure Pairs. V. Excluding Some Long Subdivision. Comb. 43(3): 571-593 (2023) - [j52]Alex Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path. Comb. 43(5): 845-852 (2023) - [j51]Tara Abrishami, Maria Chudnovsky
Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs. Electron. J. Comb. 30(2) (2023) - [j50]Aristotelis Chaniotis, Zishen Qu, Sophie Spirkl
Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs. Discret. Math. 346(3): 113289 (2023) - [j49]Yanjia Li, Sophie Spirkl
The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size. Discret. Math. 346(4): 113342 (2023) - [j48]Maria Chudnovsky
Polynomial bounds for chromatic number VI. Adding a four-vertex path. Eur. J. Comb. 110: 103710 (2023) - [j47]Maria Chudnovsky
Complexity of Ck-coloring in hereditary classes of graphs. Inf. Comput. 292: 105015 (2023) - [j46]Alvaro Carbonero, Patrick Hompe
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number. J. Comb. Theory B 158(Part): 63-69 (2023) - [j45]Alex D. Scott
Pure pairs. IV. Trees in bipartite graphs. J. Comb. Theory B 161: 120-146 (2023) - [j44]Alex Scott
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix. J. Comb. Theory B 161: 437-464 (2023) - [j43]Maria Chudnovsky, Alex D. Scott
Strengthening Rödl's theorem. J. Comb. Theory B 163: 256-271 (2023) - [j42]Alexander D. Scott
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree. J. Graph Theory 102(3): 458-471 (2023) - [j41]Maria Chudnovsky
Polynomial bounds for chromatic number VII. Disjoint holes. J. Graph Theory 104(3): 499-515 (2023) - 2022
- [j40]Patrick Hompe, Sophie Spirkl:
Further Approximations for Aharoni's Rainbow Generalization of the Caccetta-Häggkvist Conjecture. Electron. J. Comb. 29(1) (2022) - [j39]Maria Chudnovsky
Concatenating Bipartite Graphs. Electron. J. Comb. 29(2) (2022) - [j38]Logan Crew, Sophie Spirkl:
Plethysms of Chromatic and Tutte Symmetric Functions. Electron. J. Comb. 29(3) (2022) - [j37]Alvaro Carbonero, Patrick Hompe, Benjamin R. Moore
Digraphs with All Induced Directed Cycles of the Same Length are not $\vec{\chi}$-Bounded. Electron. J. Comb. 29(4) (2022) - [j36]Joseph Cheriyan
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs. Discret. Math. 345(7): 112869 (2022) - [j35]Logan Crew, Sophie Spirkl
Modular relations of the Tutte symmetric function. J. Comb. Theory A 187: 105572 (2022) - [j34]Alex D. Scott
Polynomial bounds for chromatic number II: Excluding a star-forest. J. Graph Theory 101(2): 318-322 (2022) - [j33]Alex D. Scott
Polynomial bounds for chromatic number. III. Excluding a double star. J. Graph Theory 101(2): 323-340 (2022) - [j32]Alex Scott, Paul D. Seymour
Pure Pairs VI: Excluding an Ordered Tree. SIAM J. Discret. Math. 36(1): 170-187 (2022) - [j31]Sepehr Hajebi, Yanjia Li, Sophie Spirkl
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph. SIAM J. Discret. Math. 36(3): 2004-2027 (2022) - 2021
- [j30]Maria Chudnovsky
List 3-Coloring Graphs with No Induced P6+rP3. Algorithmica 83(1): 216-251 (2021) - [j29]Maria Chudnovsky
Pure Pairs. II. Excluding All Subdivisions of A Graph. Comb. 41(3): 379-405 (2021) - [j28]José Aliste-Prieto, Logan Crew, Sophie Spirkl
A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function. Electron. J. Comb. 28(2): 2 (2021) - [j27]Sean Eberhard
On symmetric intersecting families of vectors. Comb. Probab. Comput. 30(6): 899-904 (2021) - [j26]Patrick Hompe
On Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture. Discret. Math. 344(5): 112319 (2021) - [j25]Eli Berger, Paul D. Seymour
Finding an induced path that is not a shortest path. Discret. Math. 344(7): 112398 (2021) - [j24]Maria Chudnovsky
A note on simplicial cliques. Discret. Math. 344(9): 112470 (2021) - [j23]Maria Chudnovsky
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. SIAM J. Discret. Math. 35(4): 2357-2386 (2021) - [j22]Logan Crew, Sophie Spirkl:
A Complete Multipartite Basis for the Chromatic Symmetric Function. SIAM J. Discret. Math. 35(4): 2647-2661 (2021) - 2020
- [j21]Paul D. Seymour
Short Directed Cycles in Bipartite Digraphs. Comb. 40(4): 575-599 (2020) - [j20]Maria Chudnovsky
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s. Discret. Math. 343(11): 112086 (2020) - [j19]Logan Crew, Sophie Spirkl
A deletion-contraction relation for the chromatic symmetric function. Eur. J. Comb. 89: 103143 (2020) - [j18]Maria Chudnovsky
Detecting an Odd Hole. J. ACM 67(1): 5:1-5:12 (2020) - [j17]Maria Chudnovsky
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. J. Comb. Theory, Ser. B 140: 84-97 (2020) - [j16]Maria Chudnovsky
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. J. Graph Theory 95(3): 315-340 (2020) - [c5]Maria Chudnovsky
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. ESA 2020: 35:1-35:17 - [i13]Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl:
Finding large $H$-colorable subgraphs in hereditary graph classes. CoRR abs/2004.09425 (2020) - [i12]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. CoRR abs/2005.01824 (2020) - [i11]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
List-three-coloring Pt-free graphs with no induced 1-subdivision of K1, s. CoRR abs/2006.03009 (2020)
2010 – 2019
- 2019
- [j15]Maria Chudnovsky
Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81(8): 3186-3199 (2019) - [j14]Maria Chudnovsky
Towards Erdős-Hajnal for Graphs with No 5-Hole. Comb. 39(5): 983-991 (2019) - [j13]Carla Groenland
H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. 267: 184-189 (2019) - [j12]Emmanuel Abbe
Entropic Matroids and Their Representation. Entropy 21(10): 948 (2019) - [j11]Anita Liebenau
Caterpillars in Erdős-Hajnal. J. Comb. Theory B 136: 33-43 (2019) - [j10]Maria Chudnovsky
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. J. Graph Theory 92(2): 67-95 (2019) - [c4]Maria Chudnovsky
Complexity of Ck-Coloring in Hereditary Classes of Graphs. ESA 2019: 31:1-31:15 - [c3]Sophie Spirkl, Maria Chudnovsky, Mingxian Zhong:
Four-coloring P6-free graphs. SODA 2019: 1239-1256 - [i10]Logan Crew, Bhargav Narayanan, Sophie Spirkl:
Disproportionate division. CoRR abs/1909.07141 (2019) - [i9]Emmanuel Abbe, Sophie Spirkl:
Entropic matroids and their representation. CoRR abs/1909.12175 (2019) - 2018
- [j9]Maria Chudnovsky
The Sandwich Problem for Decompositions and Almost Monotone Properties. Algorithmica 80(12): 3618-3645 (2018) - [j8]Maria Chudnovsky
Piercing Axis-Parallel Boxes. Electron. J. Comb. 25(1): 1 (2018) - [j7]Celina M. H. de Figueiredo
Sandwich and probe problems for excluding paths. Discret. Appl. Math. 251: 146-154 (2018) - [j6]Maria Chudnovsky
Triangle-free graphs with no six-vertex induced path. Discret. Math. 341(8): 2179-2196 (2018) - [j5]Maria Chudnovsky
Even pairs and prism corners in square-free Berge graphs. J. Comb. Theory B 131: 12-39 (2018) - [j4]Maria Chudnovsky
Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39]. J. Comb. Theory B 133: 259-260 (2018) - [j3]Stephan Held, Sophie Theresa Spirkl
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. ACM Trans. Algorithms 14(1): 4:1-4:18 (2018) - [i8]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-coloring Ps6-free graphs. I. Extending an excellent precoloring. CoRR abs/1802.02282 (2018) - [i7]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-coloring P6-free graphs. II. Finding an excellent precoloring. CoRR abs/1802.02283 (2018) - [i6]Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl:
Caterpillars in Erdős-Hajnal. CoRR abs/1810.00811 (2018) - 2017
- [j2]Stephan Held, Sophie Spirkl
Fast Prefix Adders for Non-uniform Input Arrival Times. Algorithmica 77(1): 287-308 (2017) - [j1]Maria Chudnovsky
Colouring perfect graphs with bounded clique number. J. Comb. Theory B 122: 757-775 (2017) - [c2]Maria Chudnovsky
Approximately Coloring Graphs Without Long Induced Paths. WG 2017: 193-205 - [i5]Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl:
Colouring perfect graphs with bounded clique number. CoRR abs/1707.03747 (2017) - 2016
- [i4]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately coloring graphs without long induced paths. CoRR abs/1606.02967 (2016) - 2015
- [i3]Stephan Held, Sophie Theresa Spirkl:
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. CoRR abs/1503.08659 (2015) - 2014
- [c1]Stephan Held, Sophie Theresa Spirkl:
A fast algorithm for rectilinear steiner trees with length restrictions on obstacles. ISPD 2014: 37-44 - [i2]Stephan Held, Sophie Theresa Spirkl:
Fast Prefix Adders for Non-Uniform Input Arrival Times. CoRR abs/1411.2917 (2014) - 2013
- [i1]Sophie Theresa Spirkl:
The guillotine approach for TSP with neighborhoods revisited. CoRR abs/1312.0378 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: