Reconfiguration in bounded bandwidth and tree-depth M Wrochna
Journal of Computer and System Sciences 93, 1-10, 2018
124 2018 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
118 2018 Reconfiguring independent sets in claw-free graphs P Bonsma, M Kamiński, M Wrochna
Scandinavian Workshop on Algorithm Theory, 86-97, 2014
89 2014 On space efficiency of algorithms working on structural decompositions of graphs M Pilipczuk, M Wrochna
ACM Transactions on Computation Theory (TOCT) 9 (4), 1-36, 2018
53 2018 Homomorphism Reconfiguration via Homotopy M Wrochna
SIAM Journal on Discrete Mathematics 34 (1), 328-350, 2020
49 2020 Tight complexity lower bounds for integer linear programming with few constraints D Knop, M Pilipczuk, M Wrochna
ACM Transactions on Computation Theory (TOCT) 12 (3), 1-19, 2020
46 2020 Reconfiguration over tree decompositions AE Mouawad, N Nishimura, V Raman, M Wrochna
Parameterized and Exact Computation: 9th International Symposium, IPEC 2014 …, 2014
43 2014 The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems J Brakensiek, V Guruswami, M Wrochna, S Živný
SIAM Journal on Computing 49 (6), 1232-1248, 2020
42 2020 Topology and adjunction in promise constraint satisfaction A Krokhin, J Opršal, M Wrochna, S Živný
SIAM Journal on Computing 52 (1), 38-79, 2023
36 2023 Improved hardness for H -colourings of G -colourable graphs M Wrochna, S Živný
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
36 2020 Cutwidth: Obstructions and algorithmic aspects AC Giannopoulou, M Pilipczuk, JF Raymond, DM Thilikos, M Wrochna
Algorithmica 81 (2), 557-588, 2019
33 2019 Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes A Giannopoulou, M Pilipczuk, JF Raymond, DM Thilikos, M Wrochna
SIAM Journal on Discrete Mathematics 35 (1), 105-151, 2021
30 * 2021 On directed feedback Vertex Set parameterized by treewidth M Bonamy, Ł Kowalik, J Nederlof, M Pilipczuk, A Socała, M Wrochna
International Workshop on Graph-Theoretic Concepts in Computer Science, 65-78, 2018
27 2018 On inverse powers of graphs and topological implications of Hedetniemi's conjecture M Wrochna
Journal of Combinatorial Theory, Series B 139, 267-295, 2019
25 2019 The complexity of promise SAT on non-Boolean domains A Brandts, M Wrochna, S Živný
ACM Transactions on Computation Theory (TOCT) 13 (4), 1-20, 2021
24 2021 Polynomial kernelization for removing induced claws and diamonds M Cygan, M Pilipczuk, M Pilipczuk, EJ Van Leeuwen, M Wrochna
Theory of Computing Systems 60, 615-636, 2017
24 2017 Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor BMP Jansen, M Pilipczuk, M Wrochna
LIPIcs-Leibniz International Proceedings in Informatics 89, 2018
15 * 2018 Edge Bipartization Faster than M Pilipczuk, M Pilipczuk, M Wrochna
Algorithmica 81 (3), 917-966, 2019
14 2019 Square-free graphs are multiplicative M Wrochna
Journal of Combinatorial Theory, Series B 122, 479-507, 2017
14 2017 Integer programming and incidence treedepth E Eiben, R Ganian, D Knop, S Ordyniak, M Pilipczuk, M Wrochna
Integer Programming and Combinatorial Optimization: 20th International …, 2019
13 2019 