Wojtaszczyk, Jakub Onufry

1. Solving connectivity problems parameterized by treewidth in single exponential time
   2011/03/02 by Marek Cygan, Jesper Nederlof, Cygan, Marek +10 · 18 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems #cs.DS
2. On Multiway Cut parameterized above lower bounds
   2011/07/08 by Marek Cygan, Marcin Pilipczuk, Cygan, Marek +5 · 5 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #Optimization and Search Problems #cs.DS
3. Dominating Set is Fixed Parameter Tractable in Claw-free Graphs
   2010/11/29 by Marek Cygan, Cygan, Marek, Geevarghese Philip +7 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Optimization and Search Problems #cs.CC #cs.DS