Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Michał Pilipczuk
2018
- Jakub Gajarský, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Sebastian Siebertz and Szymon Toruńczyk, First-Order Interpretations of Bounded Expansion Classes, in: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, p. 126:1–126:14.see in PBN
- Mikołaj Bojańczyk, Martin Grohe and Michał Pilipczuk, Definable decompositions for graphs of bounded linear cliquewidth, in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, p. 135–144.see in PBN
- Michał Pilipczuk, Sebastian Siebertz and Szymon Toruńczyk, Parameterized circuit complexity of model-checking on sparse structures, in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, p. 789–798.see in PBN
- Michał Pilipczuk, Sebastian Siebertz and Szymon Toruńczyk, On the number of types in sparse graphs, in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, p. 799–808.see in PBN
- Daniel Lokshtanov, Michał Pilipczuk and Saket Saurabh, Below All Subsets for Minimal Connected Dominating Set, Siam Journal On Discrete Mathematics 32 (3) 2018, p. 2332–2345.see in PBN
- Florian Barbero, Christophe Paul and Michał Pilipczuk, Strong immersion is a well-quasi-ordering for semicomplete digraphs, Journal Of Graph Theory 2018.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
- Daniel Marx, Marcin Pilipczuk and Michał Pilipczuk, On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs, in: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, 2018, p. 474–484.see in PBN
- Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski and Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, Acm Transactions On Algorithms 14 (4) 2018, p. 53:1–53:73.see in PBN
- Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk and Michał Pilipczuk, Subexponential Parameterized Algorithm for Interval Completion, Acm Transactions On Algorithms 14 (3) 2018, p. 35:1–35:62.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
- Pål Grønås Drange and Michał Pilipczuk, A Polynomial Kernel for Trivially Perfect Editing, Algorithmica 80 (12) 2018, p. 3481–3524.see in PBN
- 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
- Florian Barbero, Christophe Paul and Michał Pilipczuk, Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs, Acm Transactions On Algorithms 14 (3) 2018, p. 38:1–38:31.see in PBN
- Ivan Bliznets, Marek Cygan, Paweł Komosa and Michał Pilipczuk, Hardness of Approximation for H-free Edge Modification Problems, Acm Transactions On Computation Theory 10 (2) 2018, p. 9:1–9:32.see in PBN
- Michał Pilipczuk, Erik Jan van Leeuwen and Andreas Wiese, Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs, in: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, p. 65:1–65:13.see in PBN
2017
- Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk and Michał Pilipczuk, Hardness of Approximation for Strip Packing, Acm Transactions On Computation Theory 9 (3) 2017, p. 14:1–14:7.see in PBN
- Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, Siam Journal On Computing 46 (1) 2017, p. 161–189.see in PBN
- Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michał Pilipczuk, Roman Rabinovich and Sebastian Siebertz, Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs, 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. 63, p. 63:1–63:14.see in PBN
- Florian Barbero, Christophe Paul and Michał Pilipczuk, Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs, 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. 70, p. 70:1–70:13.see in PBN
- O-joung Kwon, Michał Pilipczuk and Sebastian Siebertz, On Low Rank-Width Colorings, in: Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, 2017, p. 372–385.see in PBN
- Mikołaj Bojańczyk, Wojciech Czerwiński, Piotr Hofman, Szczepan Hummel, Bartosz Klin, Eryk Kopczyński, Sławomir Lasota, Filip Aleksander Mazowiecki, Henryk Michalewski, Damian Niwiński, Joanna Ochremiak, Paweł Parys, Michał Pilipczuk, Wojciech Rytter, Michał Paweł Skrzypczak, Szymon Toruńczyk, Igor Walukiewicz, Joost Winter and Lorenzo ClementeFilip Murlak (ed.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.see in PBN
- Michał Pilipczuk, Erik Jan van Leeuwen and Andreas Wiese, Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking, in: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, p. 42:1–42:13.see in PBN
- Marek Adam Cygan, Daniel Marx, Marcin Pilipczuk and Michał Pilipczuk, Hitting forbidden subgraphs in graphs of bounded treewidth, Information And Computation 256 2017, p. 62–82.see in PBN
- Jan van den Heuvel, Stephan Kreutzer, Michał Pilipczuk, Daniel A. Quiroz, Roman Rabinovich and Sebastian Siebertz, Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion, in: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, 2017, p. 1–11.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk and Arkadiusz Aleksander Socała, Linear Kernels for Outbranching Problems in Sparse Digraphs, Algorithmica 79 (1) 2017, p. 159–188.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 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
- Mikołaj Bojańczyk and Michał Pilipczuk, Optimizing Tree Decompositions in MSO, in: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, 2017, p. 15:1–15:13.see in PBN
2016
- Michał Pilipczuk and Szymon Toruńczyk, On Ultralimits of Sparse Graph Classes, Electronic Journal Of Combinatorics 23 (2) 2016, p. P2.32.see in PBN
- Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk and Michał Pilipczuk, Subexponential parameterized algorithm for Interval Completion, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, p. 1116–1131.see in PBN
- Ivan Bliznets, Fedor V. Fomin, Michał Pilipczuk and Yngve Villanger, Largest Chordal and Interval Subgraphs Faster than 2^n, Algorithmica 76 (2) 2016, p. 569–594.see in PBN
- Marek Adam Cygan, Marcin Pilipczuk and Michał Pilipczuk, On Group Feedback Vertex Set Parameterized by the Size of the Cutset, Algorithmica 74 (2) 2016, p. 630–642.see in PBN
- Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach and Michał Pilipczuk, How to hunt an invisible rabbit on a graph, European Journal Of Combinatorics 52 (A) 2016, p. 12–26.see in PBN
- 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
- Hans L. Bodlaender, Pål Grønås Drange Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov and Michał Pilipczuk, A c^k n 5-Approximation Algorithm for Treewidth, Siam Journal On Computing 45 (2) 2016, p. 317–378.see in PBN
- Mikołaj Bojańczyk and Michał Pilipczuk, Definability equals recognizability for graphs of bounded treewidth, in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, 2016, p. 407–416.see in PBN
- Filip Murlak, Charles Paperman and Michał Pilipczuk, Schema Validation via Streaming Circuits, in: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, ACM, New York 2016, p. 237–249.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
- Dmitry Chistikov, Wojciech Czerwiński, Piotr Hofman, Michał Pilipczuk and Michael Wehar, Shortest Paths in One-Counter Systems, in: Foundations of Software Science and Computation Structures 19th International Conference, FOSSACS 2016, Springer, 2016, p. 462–478.see in PBN
- Ivan Bliznets, Marek Adam Cygan, Paweł Komosa and Michał Pilipczuk, Hardness of Approximation for H-Free Edge Modification Problems, in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, 2016, p. 3:1–3:17.see in PBN
- Ivan Bliznets, Marek Adam Cygan, Paweł Komosa, Lukas Mach and Michał Pilipczuk, Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, p. 1132–1151.see in PBN
- Marek Adam Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, Lower Bounds for Approximation Schemes for Closest String, in: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland, 2016, p. 12:1–12:10.see in PBN
- Marek Adam Cygan, Marcin Pilipczuk and Michał Pilipczuk, Known Algorithms for Edge Clique Cover are Probably Optimal, Siam Journal On Computing 45 (1) 2016, p. 67–83.see in PBN
- Rajesh Chitnis, Marek Adam Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk and Michał Pilipczuk, Designing FPT Algorithms for Cut Problems Using Randomized Contractions, Siam Journal On Computing 45 (4) 2016, p. 1171–1229.see in PBN
- Paal Gronaas Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Felix Reidl, Fernando S\'anchez Villaamil, Saket Saurabh, Sebastian Siebertz and Somnath Sikdar, Kernelization and Sparseness: the Case of Dominating Set, in: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, p. 31:1–31:14.see in PBN
- Fedor V. Fomin, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering, in: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, IEEE, 2016, p. 515–524.see in PBN
- Stephan Kreutzer, Michał Pilipczuk, Roman Rabinovich and Sebastian Siebertz, The Generalised Colouring Numbers on Classes of Bounded Expansion, in: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, r. 85, p. 85:1–85:13.see in PBN
2015
- Fedor V. Fomin, Archontia C. Giannopoulou and Michał Pilipczuk, Computing Tree-Depth Faster Than 2^n, Algorithmica 73 (1) 2015, p. 202–216.see in PBN
- Marek Adam Cygan, Fedor Fomin, Łukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, Parameterized Algorithms, Springer, 2015.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Arkadiusz Aleksander Socała and Michał Pilipczuk, Linear Kernels for Outbranching Problems in Sparse Digraphs, in: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, 2015, p. 199–211.see in PBN
- Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström, Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs, Siam Journal On Discrete Mathematics 29 (1) 2015, p. 122–144.see in PBN
- Marek Adam Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk, Sitting Closer to Friends than Enemies, Revisited, Theory Of Computing Systems 56 (2) 2015, p. 394–405.see in PBN
- Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk and Michał Pilipczuk, A Subexponential Parameterized Algorithm for Proper Interval Completion, Siam Journal On Discrete Mathematics 29 (4) 2015, p. 1961–1987.see in PBN
- Dániel Marx and Michał Pilipczuk, Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams, in: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, Springer, 2015, p. 865–877.see in PBN
- Pål Grønås Drange and Michał Pilipczuk, A Polynomial Kernel for Trivially Perfect Editing, in: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, Springer, 2015, p. 424–436.see in PBN
- Ariel Gabizon, Daniel Lokshtanov and Michał Pilipczuk, Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints, in: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, Springer, 2015, p. 545–556.see in PBN
- Pål Grønås Drange, Fedor V. Fomin, Michał Pilipczuk and Yngve Villanger, Exploring the Subexponential Complexity of Completion Problems, Acm Transactions On Computation Theory 7 (4) 2015, p. 14.see in PBN
- Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma and Michał Pilipczuk, Modifying a Graph Using Vertex Elimination, Algorithmica 72 (1) 2015, p. 99–125.see in PBN
- Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof and Michał Pilipczuk, Minimizing Rosenthal Potential in Multicast Games, Theory Of Computing Systems 57 (1) 2015, p. 81–96.see in PBN
2014
- Ivan Bliznets, Fedor Fomin, Marcin Pilipczuk and Michał Pilipczuk, A Subexponential Parameterized Algorithm for Proper Interval Completion, in: Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings, Springer, 2014, p. 173–184.see in PBN
- Marek Adam Cygan, Dániel Marx, Marcin Pilipczuk and Michał Pilipczuk, Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth, in: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, Springer, 2014, p. 189–200.see in PBN
- Marek Adam Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, Minimum bisection is fixed parameter tractable, in: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, ACM, 2014, p. 323–332.see in PBN
- Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, in: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, IEEE Computer Society, 2014, p. 186–195.see in PBN
- Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski and Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, in: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, IEEE Computer Society, 2014, p. 276–285.see in PBN
- Marek Adam Cygan, Dániel Marx, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Ildikó Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Algorithmica 68 (1) 2014, p. 41–61.see in PBN
- Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk, Scheduling Partially Ordered Jobs Faster than 2^n, Algorithmica 68 (3) 2014, p. 692–714.see in PBN
- Marek Adam Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, On Cutwidth Parameterized by Vertex Cover, Algorithmica 68 (4) 2014, p. 940–953.see in PBN
- Marek Adam Cygan, Daniel Lokshtanov, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Saket Saurabh, On the Hardness of Losing Width, Theory Of Computing Systems 54 (1) 2014, p. 73–82.see in PBN
- Marek Adam Cygan, Marcin Pilipczuk, Michał Paweł Pilipczuk and Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n, Algorithmica 70 (2) 2014, p. 195–207.see in PBN
- Marek Adam Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, Acm Transactions On Computation Theory 6 (2) 2014, p. 6.see in PBN
- Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Yngve Villanger, Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters, Journal Of Computer And System Sciences 80 (7) 2014, p. 1430–1447.see in PBN
2013
- Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Siam Journal On Discrete Mathematics 27 (1) 2013, p. 290–309.see in PBN
- Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk, On multiway cut parameterized above lower bounds, Acm Transactions On Computation Theory 5 (1) 2013, p. 3.see in PBN
- Marek Adam Cygan, Dániel Marx, Marcin Łukasz Pilipczuk and Michał Pilipczuk, The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable, in: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, IEEE Computer Society, 2013, p. 197–206.see in PBN
- Marcin Łukasz Pilipczuk, Michał Pilipczuk, Piotr Sankowski and Erik Jan van Leeuwen, Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs, in: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, p. 353–364.see in PBN
- Fedor V. Fomin, Stefan Kratsch, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Yngve Villanger, Tight bounds for Parameterized Complexity of Cluster Editing, in: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, p. 32–43.see in PBN
- Marek Adam Cygan, Marcin Łukasz Pilipczuk and Michał Pilipczuk, Known algorithms for EDGE CLIQUE COVER are probably optimal, in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 2013, p. 1044–1053.see in PBN
2012
- Marek Cygan, Marcin Pilipczuk and Michał Pilipczuk, On Group Feedback Vertex Set Parameterized by the Size of the Cutset, in: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, Springer, 2012, p. 194–205.see in PBN
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n, in: LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Springer, Berlin 2012, p. 195–206.see in PBN
- Marcin Pilipczuk, Michał Pilipczuk and Riste Skrekovski, Some results on Vizing's conjecture and related problems, Discrete Applied Mathematics 160 (16-17) 2012, p. 2484–2490.see in PBN
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Wojtaszczyk, Sitting Closer to Friends Than Enemies, Revisited, in: Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Springer, Berlin 2012, p. 296–307.see in PBN
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Wojtaszczyk, A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More), Siam Journal On Computing 41 (4) 2012, p. 815–828.see in PBN
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Wojtaszczyk, An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion, Algorithmica 64 (1) 2012, p. 170–188.see in PBN
- Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, in: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Part I, 2012, p. 254–265.see in PBN
- Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk and Michał Pilipczuk, Designing FPT Algorithms for Cut Problems Using Randomized Contractions, in: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012, p. 460–469.see in PBN
- Marcin Pilipczuk and Michał Pilipczuk, Finding a Maximum Induced Degenerate Subgraph Faster Than 2^n, in: 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), Springer, 2012, p. 3–12.see in PBN
- Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström, Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs, in: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Part I, 2012, p. 581–593.see in PBN
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, Discrete Applied Mathematics 160 (15) 2012, p. 2131–2141.see in PBN
2011
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Ildiko Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Lecture Notes In Computer Science 6986 2011, p. 131–142.see in PBN
- Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk and Jakub Wojtaszczyk, Dominating set is fixed parameter tractable in claw-free graphs, Theoretical Computer Science 412 (50) 2011, p. 6982–7000.see in PBN
- Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Lecture Notes In Computer Science 6755 2011, p. 449–461.see in PBN
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Wojtaszczyk, Scheduling Partially Ordered Jobs Faster Than 2n, Lecture Notes In Computer Science 6942 2011, p. 299–310.see in PBN
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Wojtaszczyk, The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem), in: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, ACM, San Francisco 2011, p. 1666–1674.see in PBN
- Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan van Rooij and Jakub Wojtaszczyk, Solving connectivity problems parameterized by treewidth in single exponential time, in: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, IEEE, Palm Springs 2011, p. 150–159.see in PBN
2010
- Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, in: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Springer, 2010, p. 147–158.see in PBN
- Jakub Onufry Wojtaszczyk, Marek Adam Cygan, Marcin Łukasz Pilipczuk and Michał Pilipczuk, An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion, Lecture Notes In Computer Science (6478) 2010, p. 95–106.see in PBN
You are not logged in | log in
