Artikler med mandater om offentlig tilgang - Marcin PilipczukLes mer
Tilgjengelige et eller annet sted: 78
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM Van Rooij, ...
ACM Transactions on Algorithms (TALG) 18 (2), 1-31, 2022
Mandater: Norges forskningsråd
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
Mandater: US National Science Foundation, European Commission
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
Mandater: 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
Mandater: European Commission
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
Mandater: European Commission
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
Mandater: European Commission
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
Mandater: European Commission
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five
M Chudnovsky, M Pilipczuk, M Pilipczuk, S Thomassé
arXiv preprint arXiv:1903.04761, 2019
Mandater: US National Science Foundation, US Department of Defense, European Commission
Parameterized complexity of eulerian deletion problems
M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter
Algorithmica 68 (1), 41-61, 2014
Mandater: Hungarian Scientific Research Fund, 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
Mandater: European Commission
Approximation and kernelization for chordal vertex deletion
BMP Jansen, M Pilipczuk
SIAM Journal on Discrete Mathematics 32 (3), 2258-2301, 2018
Mandater: Netherlands Organisation for Scientific Research
Sitting closer to friends than enemies, revisited
M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk
Theory of computing systems 56 (2), 394-405, 2015
Mandater: European Commission
Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths
M Pilipczuk, M Pilipczuk, P Rzążewski
Symposium on Simplicity in Algorithms (SOSA), 204-209, 2021
Mandater: European Commission, Narodowe Centrum Nauki
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree
J Łącki, J Oćwieja, M Pilipczuk, P Sankowski, A Zych
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of …, 2015
Mandater: European Commission
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
Mandater: European Commission
Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
H Jacob, M Pilipczuk
Graph-Theoretic Concepts in Computer Science: 48th International Workshop …, 2022
Mandater: European Commission
Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time
P Gartland, D Lokshtanov, M Pilipczuk, M Pilipczuk, P Rzążewski
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Mandater: US National Science Foundation, European Commission, Narodowe Centrum Nauki
On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs
D Marx, M Pilipczuk, M Pilipczuk
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
Mandater: European Commission
Independence and Efficient Domination on P6-free Graphs
D Lokshtanov, M Pilipczuk, EJV Leeuwen
ACM Transactions on Algorithms (TALG) 14 (1), 1-30, 2017
Mandater: European Commission
Induced subgraphs of bounded treewidth and the container method
T Abrishami, M Chudnovsky, M Pilipczuk, P Rzążewski, P Seymour
SIAM Journal on Computing 53 (3), 624-647, 2024
Mandater: European Commission, Narodowe Centrum Nauki
Informasjon om publisering og finansiering fastsettes automatisk av et datamaskinprogram