Publikacje

Marcin Wrochna

Liczba publikacji: 40

2023

• Piotr Wygocki , M Ulfig, Marcin Wrochna , A Zapała, M Zieleń, U Sankowska, K Zieliński, N Gajewska, Piotr Sankowski , Damian Drzyzga, P-674 Automatizing ovarian follicle counting and measurement with artificial intelligence, HUMAN REPRODUCTION, 39th Annual Meeting of the European Society of Human Reproduction and Embryology, Copenhagen, Denmark, 25 czerwca 2023 - 28 czerwca 2023, 38 (Supplement_1) 2023, s. i507. Zobacz w PBN
• Miguel Romero, Marcin Wrochna , Stanislav Živný, Pliability and Approximating Max-CSPs, Journal of the ACM, 70 (6) 2023, s. 1-43. Zobacz w PBN
• Andrei Krokhin, Jakub Opršal, Marcin Wrochna , Stanislav Živný, Topology and Adjunction in Promise Constraint Satisfaction, SIAM Journal on Computing, 52 (1) 2023, s. 38-79. Zobacz w PBN

2022

• Balázs F. Mezei, Stanislav Živný, Marcin Wrochna , PTAS for Sparse General-Valued CSPs, ACM Transactions on Algorithms, 2022. Zobacz w PBN

2021

• Archontia Giannopoulou, Michał Pilipczuk , Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Linear kernels for edge deletion problems to immersion-closed graph classes, SIAM Journal on Discrete Mathematics, 35 (1) 2021, s. 105-151. Zobacz w PBN
• Balazs F. Mezei, Marcin Wrochna , Stanislav Zivny, PTAS for Sparse General-Valued CSPs, 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 29 czerwca 2021 - 2 lipca 2021. Zobacz w PBN
• Alex Brandts, Marcin Wrochna , Stanislav Živný, The Complexity of Promise SAT on Non-Boolean Domains, ACM Transactions on Computation Theory, 13 (4) 2021, s. 1-20. Zobacz w PBN
• Miguel Romero, Marcin Wrochna , Stanislav Živný, Treewidth-pliability and PTAS for Max-CSPS, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 stycznia 2021 - 13 stycznia 2021. Zobacz w PBN

2020

• Marcin Wrochna , Homomorphism Reconfiguration via Homotopy, SIAM Journal on Discrete Mathematics, 34 (1) 2020, s. 328-350. Zobacz w PBN
• Marcin Wrochna , Stanislav Živný, Improved hardness for H-colourings of G-colourable graphs, 31st ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, the United States of America, 5 stycznia 2020 - 8 stycznia 2020. Zobacz w PBN
• Marcin Wrochna , PACE solver description: Sallow: A heuristic algorithm for treedepth decompositions, Leibniz International Proceedings in Informatics, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 grudnia 2020 - 18 grudnia 2020. Zobacz w PBN
• Alex Brandts, Marcin Wrochna , Stanislav Zivny, The complexity of promise SAT on non-boolean domains, Leibniz International Proceedings in Informatics, 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, 8 lipca 2020 - 11 lipca 2020. Zobacz w PBN
• Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna , Stanislav Živný, The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems, SIAM Journal on Computing, 49 (6) 2020, s. 1232-1248. Zobacz w PBN
• Dusan Knop, Michał Pilipczuk , Marcin Wrochna , Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints, ACM Transactions on Computation Theory, 12 (3) 2020, s. 19:1--19:19. Zobacz w PBN

2019

• Archontia C. Giannopoulou, Michał Pilipczuk , Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Cutwidth: Obstructions and Algorithmic Aspects, Algorithmica, 81 (2) 2019, s. 557-588. Zobacz w PBN
• Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Edge Bipartization Faster than 2^k, Algorithmica, 81 (3) 2019, s. 917–966. Zobacz w PBN
• Claude Tardif, Marcin Wrochna , Hedetniemi's conjecture and strongly multiplicative graphs, SIAM Journal on Discrete Mathematics, 33 (4) 2019, s. 2218-2250. Zobacz w PBN
• Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak, Michał Pilipczuk , Marcin Wrochna , Integer Programming and Incidence Treedepth, 20th Conference on Integer Programming and Combinatorial Optimization, Ann Arbor, the United States of America, 22 maja 2019 - 24 maja 2019. Zobacz w PBN
• Marcin Wrochna , On inverse powers of graphs and topological implications of Hedetniemi's conjecture, Journal of Combinatorial Theory. Series B, 139 2019, s. 267-295. Zobacz w PBN
• Daniel Král', Taísa L. Martins, Péter Pál Pach, Marcin Wrochna , The step Sidorenko property and non-norming edge-transitive graphs, Journal of Combinatorial Theory - Series A, 162 2019, s. 34-54. Zobacz w PBN
• Dušan Knop, Michał Pilipczuk , Marcin Wrochna , Tight complexity lower bounds for integer linear programming with few constraints, Leibniz International Proceedings in Informatics, 36th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, 13 marca 2019 - 16 marca 2019, 126 2019, s. 44:1--44:15. Zobacz w PBN
• Marthe Bonamy, Łukasz Kowalik , Michał Pilipczuk , Arkadiusz Socała, Marcin Wrochna , Tight Lower Bounds for the Complexity of Multicoloring, ACM Transactions on Computation Theory, 11 (3) 2019, s. 1-19. Zobacz w PBN
• Bart M. P. Jansen, Marcin Pilipczuk , Marcin Wrochna , Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor, Algorithmica, 81 (10) 2019, s. 3936-3967. Zobacz w PBN

2018

• Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michał Pilipczuk , Marcin Wrochna , Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth, ACM Transactions on Algorithms, 14 (3) 2018, s. 1–45. Zobacz w PBN
• Marthe Bonamy, Łukasz Kowalik , Jesper Nederlof, Michał Pilipczuk , Arkadiusz Socała, Marcin Wrochna , On Directed Feedback Vertex Set Parameterized by Treewidth, 44th International Workshop on Graph-Theoretic Concepts in Computer, Cottbus, Germany, 27 czerwca 2018 - 29 czerwca 2018. Zobacz w PBN
• Michał Pilipczuk , Marcin Wrochna , On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, ACM Transactions on Computation Theory, 9 (4) 2018, s. 18: 1–36. Zobacz w PBN
• Bart M. P. Jansen, Marcin Pilipczuk , Marcin Wrochna , Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor, 12th International Symposium on Parameterized and Exact Computation, Vienna, Austria, 6 września 2017 - 8 września 2017. Zobacz w PBN

2017

• Archontia Giannopoulou, Michał Pilipczuk , Jean-florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Cutwidth: Obstructions and Algorithmic Aspects, 11th International Symposium on Parameterized and Exact Computation, Aarhus, Denmark, 24 sierpnia 2016 - 26 sierpnia 2016. Zobacz w PBN
• Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Edge Bipartization Faster Than 2 k∗, 11th International Symposium on Parameterized and Exact Computation, Aarhus, Denmark, 24 sierpnia 2016 - 26 sierpnia 2016, 63 2017, s. 26:1--26:13. Zobacz w PBN
• Fedor V. Fomin, Daniel Lokshtanov, Michał Pilipczuk , Saket Saurabh, Marcin Wrochna , Fully polynomial-time parameterized computations for graphs and matrices of low treewidth, 28th ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 16 stycznia 2017 - 19 stycznia 2017. Zobacz w PBN
• Archontia Giannopoulou, Michał Pilipczuk , Jean-florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 lipca 2017 - 14 lipca 2017. Zobacz w PBN
• Marcin Wrochna , Reconfiguration in bounded bandwidth and tree-depth, Journal of Computer and System Sciences, 93 2017, s. 1-10. Zobacz w PBN
• Marthe Bonamy, Łukasz Kowalik , Michał Pilipczuk , Arkadiusz Socała, Marcin Wrochna , Tight Lower Bounds for the Complexity of Multicoloring, 25th Annual European Symposium on Algorithms, Vienna, Austria, 4 września 2017 - 6 września 2017, 87 2017, s. 18:1--18:14. Zobacz w PBN

2016

• Michał Pilipczuk , Marcin Wrochna , On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orlean, France, 17 lutego 2016 - 20 lutego 2016. Zobacz w PBN
• Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Erik Jan van Leeuwen, Polynomial Kernelization for Removing Induced Claws and Diamonds, Theory of Computing Systems, 2016. Zobacz w PBN
• Marek Cygan , Erik Jan van Leeuwen, Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Polynomial Kernelization for Removing Induced Claws and Diamonds, 41st International Workshop on Graph-Theoretic Concepts in Computer Science, Garching, Germany, 17 czerwca 2015 - 19 czerwca 2015. Zobacz w PBN
• Marcin Wrochna , Square-free graphs are multiplicative, Journal of Combinatorial Theory. Series B, 122 2016, s. 479-507. Zobacz w PBN

2015

• Marcin Wrochna , Homomorphism Reconfiguration via Homotopy, 32nd International Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 4 marca 2015 - 7 marca 2015. Zobacz w PBN

2014

• Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna , Reconfiguration over Tree Decompositions, 9th International Symposium on Parameterized and Exact Computation, Wrocław, Poland, 10 września 2014 - 12 września 2014. Zobacz w PBN
• Paul S. Bonsma, Marcin Kamiński, Marcin Wrochna , Reconfiguring Independent Sets in Claw-Free Graphs, 14th Scandinavian Symposium and Workshops on Algorithm Theory, Kopenhaga, Denmark, 2 lipca 2014 - 4 lipca 2014. Zobacz w PBN