Folgen
Michał Pilipczuk
Michał Pilipczuk
University of Warsaw
Bestätigte E-Mail-Adresse bei mimuw.edu.pl - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer 5 (4), 16, 2015
3323*2015
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
4102011
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
3812016
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams
D Marx, M Pilipczuk
ACM Transactions on Algorithms (TALG) 18 (2), 1-64, 2022
122*2022
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
1142018
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
1132016
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
1122013
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
106*2014
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
1022022
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
992013
Known algorithms for edge clique cover are probably optimal
M Cygan, M Pilipczuk, M Pilipczuk
SIAM Journal on Computing 45 (1), 67-83, 2016
932016
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
912013
Minimum bisection is fixed parameter tractable
M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
852014
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
812013
First-order interpretations of bounded expansion classes
J Gajarský, S Kreutzer, J Nešetřil, POD Mendez, M Pilipczuk, S Siebertz, ...
ACM Transactions on Computational Logic (TOCL) 21 (4), 1-41, 2020
772020
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
752017
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
72*2018
Problems parameterized by treewidth tractable in single exponential time: A logical approach
M Pilipczuk
Mathematical Foundations of Computer Science 2011: 36th International …, 2011
682011
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
672014
Neighborhood complexity and kernelization for nowhere dense classes of graphs
K Eickmeyer, AC Giannopoulou, S Kreutzer, O Kwon, M Pilipczuk, ...
arXiv preprint arXiv:1612.08197, 2016
642016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20