Volgen
Michał Pilipczuk
Michał Pilipczuk
University of Warsaw
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 5 (4), 16, 2015
20522015
Solving connectivity problems parameterized by treewidth in single exponential time
M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM van Rooij, ...
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 150-159, 2011
3432011
A 5-Approximation Algorithm for Treewidth
HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ...
SIAM Journal on Computing 45 (2), 317-378, 2016
3052016
On multiway cut parameterized above lower bounds
M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk
ACM Transactions on Computation Theory (TOCT) 5 (1), 1-11, 2013
1292013
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams
D Marx, M Pilipczuk
Algorithms-ESA 2015, 865-877, 2015
912015
Tight bounds for parameterized complexity of cluster editing with a small number of clusters
FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger
Journal of Computer and System Sciences 80 (7), 1430-1447, 2014
90*2014
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
832013
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
812016
Known algorithms for edge clique cover are probably optimal
M Cygan, M Pilipczuk, M Pilipczuk
SIAM Journal on Computing 45 (1), 67-83, 2016
802016
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
FV Fomin, D Lokshtanov, S Saurabh, M Pilipczuk, M Wrochna
ACM Transactions on Algorithms (TALG) 14 (3), 1-45, 2018
772018
Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask)
D Marx, M Pilipczuk
arXiv preprint arXiv:1307.2187, 2013
702013
Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs
A Grzesik, T Klimošová, M Pilipczuk, M Pilipczuk
ACM Transactions on Algorithms (TALG) 18 (1), 1-57, 2022
652022
Minimum bisection is fixed-parameter tractable
M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh
SIAM Journal on Computing 48 (2), 417-450, 2019
642019
The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable
M Cygan, D Marx, M Pilipczuk, M Pilipczuk
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 197-206, 2013
612013
Network sparsification for steiner problems on planar and bounded-genus graphs
M Pilipczuk, M Pilipczuk, P Sankowski, EJ Leeuwen
ACM Transactions on Algorithms (TALG) 14 (4), 1-73, 2018
59*2018
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
582014
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth
D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh
SIAM Journal on Computing 46 (1), 161-189, 2017
572017
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
562012
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
542014
Exploring the subexponential complexity of completion problems
PG Drange, FV Fomin, M Pilipczuk, Y Villanger
ACM Transactions on Computation Theory (TOCT) 7 (4), 1-38, 2015
53*2015
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20