Các bài viết có thể truy cập công khai - Michał PilipczukTìm hiểu thêm
Không có ở bất kỳ nơi nào: 1
Computing tree decompositions
M Pilipczuk
Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender …, 2020
Các cơ quan ủy nhiệm: European Commission
Có tại một số nơi: 101
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
Các cơ quan ủy nhiệm: Netherlands Organisation for Scientific Research, European Commission
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
Các cơ quan ủy nhiệm: Helmholtz Association, Hungarian Scientific Research Fund, European …
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
Các cơ quan ủy nhiệm: European Commission
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
Các cơ quan ủy nhiệm: US National Science Foundation, European Commission
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
Các cơ quan ủy nhiệm: European Commission, Research Council of Norway
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
Các cơ quan ủy nhiệm: European Commission, Agence Nationale de la Recherche, Narodowe Centrum Nauki
Known algorithms for edge clique cover are probably optimal
M Cygan, M Pilipczuk, M Pilipczuk
SIAM Journal on Computing 45 (1), 67-83, 2016
Các cơ quan ủy nhiệm: European Commission
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
Các cơ quan ủy nhiệm: European Commission
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
Các cơ quan ủy nhiệm: European Commission
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
Các cơ quan ủy nhiệm: European Commission
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
Các cơ quan ủy nhiệm: European Commission
Definability equals recognizability for graphs of bounded treewidth
M Bojańczyk, M Pilipczuk
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
Các cơ quan ủy nhiệm: European Commission
How to hunt an invisible rabbit on a graph
TV Abramovskaya, FV Fomin, PA Golovach, M Pilipczuk
European Journal of Combinatorics 52, 12-26, 2016
Các cơ quan ủy nhiệm: European Commission
Parameterized complexity of Eulerian deletion problems
M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter
Algorithmica 68, 41-61, 2014
Các cơ quan ủy nhiệm: Hungarian Scientific Research Fund, European Commission
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
Các cơ quan ủy nhiệm: European Commission
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
Các cơ quan ủy nhiệm: European Commission
A polynomial kernel for trivially perfect editing
PG Drange, M Pilipczuk
Algorithmica 80, 3481-3524, 2018
Các cơ quan ủy nhiệm: European Commission
Polynomial bounds for centered colorings on proper minor-closed graph classes
M Pilipczuk, S Siebertz
Journal of Combinatorial Theory, Series B 151, 111-147, 2021
Các cơ quan ủy nhiệm: European Commission, Narodowe Centrum Nauki
Rankwidth meets stability
J Nešetřil, PO Mendez, M Pilipczuk, R Rabinovich, S Siebertz
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Các cơ quan ủy nhiệm: European Commission
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ