Karolina Okrasa

1. Sparsification Lower Bounds for List H-Coloring
   2020/09/17 by Hubie Chen, Bart M. P. Jansen, Chen, Hubie +7 · 2 citations
   Computer Science · Decision Sciences · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Scheduling and Timetabling Solutions
2. Subexponential-time algorithms for finding large induced sparse\n subgraphs
   2019/10/02 by Jana Novotná, Novotná, Jana, Karolina Okrasa +9 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Optimization and Search Problems
3. On objects dual to tree-cut decompositions
   2021/03/26 by Łukasz Bożyk, Oscar Defrain, Bożyk, Łukasz +5 · 1 citation
   Economics, Econometrics and Finance · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Game Theory and Voting Systems #Sports Analytics and Performance