Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Marcin Wrochna
2018
- Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michał Pilipczuk and Marcin Wrochna, Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth, Acm Transactions On Algorithms 14 (3) 2018, p. 34:1–34:45.see in PBN
- Michał Pilipczuk and Marcin Wrochna, On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, Acm Transactions On Computation Theory 9 (4) 2018, p. 18:1–18:36.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Jesper Nederlof, Michał Pilipczuk, Arkadiusz Aleksander Socała and Marcin Wrochna, On Directed Feedback Vertex Set Parameterized by Treewidth, in: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, Springer, 2018, p. 65–78.see in PBN
2017
- Bart M. P. Jansen, Marcin Pilipczuk and Marcin Wrochna, Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor, in: 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, 2017, p. 23:1–23:13.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk, Arkadiusz Aleksander Socała and Marcin Wrochna, Tight Lower Bounds for the Complexity of Multicoloring, in: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, p. 18:1–18:14.see in PBN
- Marcin Wrochna, Reconfiguration in bounded bandwidth and tree-depth, Journal Of Computer And System Sciences 93 2017, p. 1–10.see in PBN
- Marcin Pilipczuk, Michał Pilipczuk and Marcin Wrochna, Edge Bipartization Faster Than 2^k, in: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2017, r. 26, p. 26:1–26:13.see in PBN
- Marcin Pilipczuk, Michał Pilipczuk and Marcin Wrochna, Edge Bipartization Faster than 2^k, Algorithmica 2017.see in PBN
- Archontia Giannopoulou, Michał Pilipczuk, Jean-florent Raymond, Dimitrios M. Thilikos and Marcin Wrochna, Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes, in: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 57, p. 57:1–57:15.see in PBN
- Archontia Giannopoulou, Michał Pilipczuk, Jean-florent Raymond, Dimitrios M. Thilikos and Marcin Wrochna, Cutwidth: Obstructions and Algorithmic Aspects, in: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2017, r. 15, p. 15:1–15:13.see in PBN
- Fedor V. Fomin, Daniel Lokshtanov, Michał Pilipczuk, Saket Saurabh and Marcin Wrochna, Fully polynomial-time parameterized computations for graphs and matrices of low treewidth, in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, Society for Industrial and Applied Mathematics, 2017, p. 1419–1432.see in PBN
2016
- Michał Pilipczuk and Marcin Wrochna, On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, in: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, r. 57, p. 57:1–57:15.see in PBN
- Marcin Wrochna, Square-free graphs are multiplicative, Journal Of Combinatorial Theory Series B 122 2016, p. 479–507.see in PBN
- Marek Adam Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van Leeuwen and Marcin Wrochna, Polynomial Kernelization for Removing Induced Claws and Diamonds, in: Graph-Theoretic Concepts in Computer Science - 41st International Workshop, Springer, 2016, p. 440–455.see in PBN
- Marek Adam Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van Leeuwen and Marcin Wrochna, Polynomial Kernelization for Removing Induced Claws and Diamonds, Theory Of Computing Systems 2016, p. 1–22.see in PBN
2014
- Paul S. Bonsma, Marcin Kamiński and Marcin Wrochna, Reconfiguring Independent Sets in Claw-Free Graphs, in: Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, 2014, p. 86–97.see in PBN
- Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman and Marcin Wrochna, Reconfiguration over Tree Decompositions, in: 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), 2014, p. 246–257.see in PBN
You are not logged in | log in
