Bartosz Walczak
- Outerstring graphs are χ-bounded
2013/12/05 by Alexandre Rok, Rok, Alexandre, Bartosz Walczak +1 · 2 citations
Computer Science · Engineering · #05C15 #05C62 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Packing Problems
- Subexponential-time algorithms for finding large induced sparse\n subgraphs
2019/10/02 by Jana Novotná, Novotná, Jana, Karolina Okrasa +9 · 2 citations
Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Optimization and Search Problems
- Excluding a clique or a biclique in graphs of bounded induced matching treewidth
2024/05/07 by Tara Abrishami, Marcin Briański, Abrishami, Tara +11 · 5 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Graph theory and applications
- Graph drawings with one bend and few slopes
2015/06/14 by Kolja Knauer, Knauer, Kolja, Bartosz Walczak +1 · 1 citation
Computer Science · Mathematics · #05C62 #68R10 #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.CG #cs.DM #math.CO #msc:05C62 #msc:68R10
- Triangle-free geometric intersection graphs with no large independent sets
2014/04/30 by Bartosz Walczak · 1 citation
Mathematics · Computer Science · #math.CO #cs.CG #cs.DM #math.MG #msc:05C62 #msc:05C15
- Outerplanar graph drawings with few slopes
2012/05/31 by Kolja Knauer, Piotr Micek, Bartosz Walczak · 1 citation
Computer Science · Mathematics · #cs.CG #cs.DM #math.CO #msc:05C62 #msc:68R10