Marcin Wrochna

1. On space efficiency of algorithms working on structural decompositions\n of graphs
   2015/09/19 by Michał Pilipczuk, Pilipczuk, Michał, Marcin Wrochna +1 · 3 citations
   Computer Science · #Algorithms and Data Compression #Advanced Graph Theory Research #semigroups and automata theory
2. Polynomial kernelization for removing induced claws and diamonds
   2015/03/02 by Marek Cygan, Cygan, Marek, Marcin Pilipczuk +7 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems
3. Reconfiguring Independent Sets in Claw-Free Graphs
   2014/03/03 by Paul Bonsma, Marcin Kamiński, Bonsma, Paul +3 · 3 citations
   Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
4. Edge Bipartization faster than 2^k
   2015/07/08 by Marcin Pilipczuk, Pilipczuk, Marcin, Michał Pilipczuk +3 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Interconnection Networks and Systems
5. Linear kernels for edge deletion problems to immersion-closed graph\n classes
   2016/09/25 by Archontia C. Giannopoulou, Giannopoulou, Archontia C., Michał Pilipczuk +7 · 1 citation
   Computer Science · #05C85 #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.2 #Machine Learning and Algorithms