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