Marcin Wrochna
Marcin Wrochna
Department of Computer Science, University of Oxford
Verified email at mimuw.edu.pl - Homepage
Title
Cited by
Cited by
Year
Reconfiguration in bounded bandwidth and tree-depth
M Wrochna
Journal of Computer and System Sciences 93, 1-10, 2018
592018
Reconfiguring independent sets in claw-free graphs
P Bonsma, M Kamiński, M Wrochna
Scandinavian Workshop on Algorithm Theory, 86-97, 2014
552014
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
522018
Reconfiguration over tree decompositions
AE Mouawad, N Nishimura, V Raman, M Wrochna
International Symposium on Parameterized and Exact Computation, 246-257, 2014
342014
Homomorphism Reconfiguration via Homotopy
M Wrochna
SIAM Journal on Discrete Mathematics 34 (1), 328-350, 2020
28*2020
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
182018
Polynomial kernelization for removing induced claws and diamonds
M Cygan, M Pilipczuk, M Pilipczuk, EJ Van Leeuwen, M Wrochna
Theory of Computing Systems 60 (4), 615-636, 2017
162017
Linear kernels for edge deletion problems to immersion-closed graph classes
AC Giannopoulou, M Pilipczuk, DM Thilikos, JF Raymond, M Wrochna
arXiv preprint arXiv:1609.07780, 2016
142016
Cutwidth: Obstructions and algorithmic aspects
AC Giannopoulou, M Pilipczuk, JF Raymond, DM Thilikos, M Wrochna
Algorithmica 81 (2), 557-588, 2019
122019
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
112020
Improved hardness for H-colourings of G-colourable graphs
M Wrochna, S Živný
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
102020
On inverse powers of graphs and topological implications of Hedetniemi's conjecture
M Wrochna
Journal of Combinatorial Theory, Series B 139, 267-295, 2019
102019
Square-free graphs are multiplicative
M Wrochna
Journal of Combinatorial Theory, Series B 122, 479-507, 2017
102017
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
82018
Edge Bipartization Faster than
M Pilipczuk, M Pilipczuk, M Wrochna
Algorithmica 81 (3), 917-966, 2019
72019
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
7*2018
Tight Lower Bounds for the Complexity of Multicoloring
M Bonamy, M Pilipczuk, A Socała, M Wrochna
ACM Transactions on Computation Theory (TOCT) 11 (3), 13, 2019
62019
The step Sidorenko property and non-norming edge-transitive graphs
TL Martins, PP Pach, M Wrochna
Journal of Combinatorial Theory, Series A 162, 34-54, 2019
62019
Reconfiguration and structural graph theory
M Wrochna
Master's thesis, University of Warsaw, 2014
62014
Hedetniemi's conjecture and strongly multiplicative graphs
C Tardif, M Wrochna
SIAM Journal on Discrete Mathematics 33 (4), 2218-2250, 2019
42019
The system can't perform the operation now. Try again later.
Articles 1–20