Marcin Pilipczuk
Marcin Pilipczuk
Instytut Informatyki, Uniwersytet Warszawski
Geverifieerd e-mailadres voor mimuw.edu.pl - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Parameterized Algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer, 2015
13242015
Solving connectivity problems parameterized by treewidth in single exponential time
M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM van Rooij, ...
Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on …, 2011
2972011
On multiway cut parameterized above lower bounds
M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk
ACM Transactions on Computation Theory (TOCT) 5 (1), 3, 2013
1162013
Faster deterministic feedback vertex set
T Kociumaka, M Pilipczuk
Information Processing Letters 114 (10), 556-560, 2014
822014
Tight bounds for Parameterized Complexity of Cluster Editing.
FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger
STACS 20, 32-43, 2013
72*2013
Exact and approximate bandwidth
M Cygan, M Pilipczuk
Theoretical Computer Science 411 (40), 3701-3713, 2010
702010
Subset feedback vertex set is fixed-parameter tractable
M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk
SIAM Journal on Discrete Mathematics 27 (1), 290-309, 2013
662013
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
R Chitnis, M Cygan, MT Hajiaghayi, M Pilipczuk, M Pilipczuk
SIAM Journal on Computing 45 (4), 1171-1229, 2016
63*2016
Known algorithms for EDGE CLIQUE COVER are probably optimal
M Cygan, M Pilipczuk, M Pilipczuk
SIAM Journal on Computing 45 (1), 67-83, 2016
542016
Minimum bisection is fixed parameter tractable
M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh
Proceedings of the 46th Annual ACM Symposium on Theory of Computing, 323-332, 2014
51*2014
Kernelization hardness of connectivity problems in d-degenerate graphs
M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk
Discrete Applied Mathematics 160 (15), 2131-2141, 2012
482012
Fixed-parameter tractability of multicut in directed acyclic graphs
S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström
SIAM Journal on Discrete Mathematics 29 (1), 122-144, 2015
472015
Clique cover and graph separation: New incompressibility results
M Cygan, S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström
ACM Transactions on Computation Theory (TOCT) 6 (2), 1-19, 2014
472014
The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable
M Cygan, D Marx, M Pilipczuk, M Pilipczuk
Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on …, 2013
462013
A fast branching algorithm for cluster vertex deletion
A Boral, M Cygan, T Kociumaka, M Pilipczuk
Theory of Computing Systems 58 (2), 357-376, 2016
45*2016
Parameterized complexity of eulerian deletion problems
M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter
Algorithmica 68 (1), 41-61, 2014
452014
Kernelization and sparseness: the case of dominating set
PG Drange, MS Dregi, FV Fomin, S Kreutzer, D Lokshtanov, M Pilipczuk, ...
arXiv preprint arXiv:1411.4575, 2014
442014
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth
D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh
Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on …, 2014
432014
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
M Pilipczuk, M Pilipczuk, P Sankowski, EJV Leeuwen
ACM Transactions on Algorithms (TALG) 14 (4), 53, 2018
42*2018
Subexponential Parameterized Algorithm for I nterval C ompletion
I Bliznets, FV Fomin, M Pilipczuk, M Pilipczuk
ACM Transactions on Algorithms (TALG) 14 (3), 35, 2018
352018
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20