Marcin Wrochna
Marcin Wrochna
Institute of Informatics, University of Warsaw
E-mailová adresa ověřena na: mimuw.edu.pl - Domovská stránka
Název
Citace
Citace
Rok
Reconfiguration in bounded bandwidth and tree-depth
M Wrochna
Journal of Computer and System Sciences 93, 1-10, 2018
692018
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
672018
Reconfiguring independent sets in claw-free graphs
P Bonsma, M Kamiński, M Wrochna
Scandinavian Workshop on Algorithm Theory, 86-97, 2014
602014
Reconfiguration over tree decompositions
AE Mouawad, N Nishimura, V Raman, M Wrochna
International Symposium on Parameterized and Exact Computation, 246-257, 2014
362014
Homomorphism Reconfiguration via Homotopy
M Wrochna
SIAM Journal on Discrete Mathematics 34 (1), 328-350, 2020
32*2020
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
20*2021
Improved hardness for H-colourings of G-colourable graphs
M Wrochna, S Živný
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
202020
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
202018
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
182020
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
182017
Cutwidth: Obstructions and algorithmic aspects
AC Giannopoulou, M Pilipczuk, JF Raymond, DM Thilikos, M Wrochna
Algorithmica 81 (2), 557-588, 2019
162019
On inverse powers of graphs and topological implications of Hedetniemi's conjecture
M Wrochna
Journal of Combinatorial Theory, Series B 139, 267-295, 2019
142019
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
142018
Square-free graphs are multiplicative
M Wrochna
Journal of Combinatorial Theory, Series B 122, 479-507, 2017
132017
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
112020
Edge Bipartization Faster than
M Pilipczuk, M Pilipczuk, M Wrochna
Algorithmica 81 (3), 917-966, 2019
82019
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
82019
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
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
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
62021
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20