Pilipczuk, Michal

1. Hardness of approximation for H-free edge modification problems
   2016/06/08 by Bliznets, Ivan, Cygan, Marek, Komosa, Pawel +1 · 2 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. Shorter Labeling Schemes for Planar Graphs
   2019/08/09 by Bonamy, Marthe, Gavoille, Cyril, Pilipczuk, Michal · 2 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Finding large induced sparse subgraphs in C_>t-free graphs in quasipolynomial time
   2020/07/21 by Peter Gartland, Gartland, Peter, Daniel Lokshtanov +7 · 2 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Limits and Structures in Graph Theory
4. Rankwidth meets stability
   2020/07/15 by Nesetril, Jaroslav, de Mendez, Patrice Ossona, Pilipczuk, Michal +2 · 2 citations
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
5. An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
   2021/03/31 by Daniel Lokshtanov, Pranabendu Misra, Lokshtanov, Daniel +7 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences