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