2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2018★ 2 cited
Experimental Evaluation of Parameterized Algorithms for Graph Separation Problems: Half-Integral Relaxations and Matroid-based Kernelization
Marcin Pilipczuk, Michał Ziobro
In the recent years we have witnessed a rapid development of new algorithmic techniques for parameterized algorithms for graph separation problems. We present experimental evaluati…
cs.DS2018★ 1 cited
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation
Michał Ziobro, Marcin Pilipczuk
The notion of treewidth, introduced by Robertson and Seymour in their seminal Graph Minors series, turned out to have tremendous impact on graph algorithmics. Many hard computation…