M
Marek Cygan
Researcher at University of Warsaw
Publications - 186
Citations - 6037
Marek Cygan is an academic researcher from University of Warsaw. The author has contributed to research in topics: Parameterized complexity & Exponential time hypothesis. The author has an hindex of 33, co-authored 180 publications receiving 5334 citations. Previous affiliations of Marek Cygan include Dalle Molle Institute for Artificial Intelligence Research & University of Lugano.
Papers
More filters
Book
Parameterized Algorithms
Marek Cygan,Fedor V. Fomin,Lukasz Kowalik,Daniel Lokshtanov,Dániel Marx,Marcin Pilipczuk,Michał Pilipczuk,Saket Saurabh +7 more
TL;DR: This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area, providing a toolbox of algorithmic techniques.
Posted Content
Solving connectivity problems parameterized by treewidth in single exponential time
Marek Cygan,Jesper Nederlof,Marcin Pilipczuk,Michał Pilipczuk,Joham M.M. van Rooij,Jakub Onufry Wojtaszczyk +5 more
TL;DR: It is shown that the aforementioned gap cannot be breached for some problems that aim to maximize the number of connected components like Cycle Packing, and in several cases it is able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail.
Proceedings ArticleDOI
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Marek Cygan,Jesper Nederlof,Marcin Pilipczuk,Michał Pilipczuk,Joham M.M. van Rooij,Jakub Onufry Wojtaszczyk +5 more
TL;DR: Cut&Count as mentioned in this paper is a Monte Carlo algorithm that runs in O(1) time for most connectivity-type problems, including Hamiltonian Path, Steiner Tree, Feedback Vertex Set and Connected Dominating Set.
Book ChapterDOI
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
TL;DR: Two new approaches rooted in linear algebra, based on matrix rank and determinants, which provide deterministic c tw | V | O ( 1 ) time algorithms, also for weighted and counting versions of connectivity problems are presented.
Journal ArticleDOI
On Problems as Hard as CNF-SAT
Marek Cygan,Holger Dell,Daniel Lokshtanov,Dániel Marx,Jesper Nederlof,Yoshio Okamoto,Ramamohan Paturi,Saket Saurabh,Magnus Wahlström +8 more
TL;DR: The field of exact exponential time algorithms for non-deterministic polynomial-time hard problems has thrived since the mid-2000s as discussed by the authors, and exhaustive search remains asymptotically the fastest known algorithm for some basic problems.