Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Marcin Pilipczuk
2018
- Anita Liebenau, Marcin Pilipczuk, Paul Seymour and Sophie Spirkl, Caterpillars in Erdős–Hajnal, Journal Of Combinatorial Theory Series B 2018.see in PBN
- Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel and Marcin Pilipczuk, Excluding Hooks and their Complements, Electronic Journal Of Combinatorics 25 (3) 2018, p. P3.27.see in PBN
- Shaohua Li and Marcin Pilipczuk, An Improved FPT Algorithm for Independent Feedback Vertex Set, in: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, Springer, 2018, p. 344–355.see in PBN
- Michał Ziobro and Marcin Pilipczuk, Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation, in: 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy, 2018, p. 29:1–29:14.see in PBN
- Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl and Sebastian Siebertz, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness, in: 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy, 2018, p. 14:1–14:16.see in PBN
- Krzysztof Kiljan and Marcin Pilipczuk, Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set, in: 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy, 2018, p. 12:1–12:12.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 and Magnus Wahlström, Directed Multicut is W[1]-hard, Even for Four Terminal Pairs, Acm Transactions On Computation Theory 10 (3) 2018, p. 13:1–13:18.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
- Daniel Lokshtanov, Marcin Pilipczuk and Erik Jan van Leeuwen, Independence and Efficient Domination on P_6-free Graphs, Acm Transactions On Algorithms 14 (1) 2018, p. 3:1–3:30.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
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
- Nikolai Karpov, Marcin Pilipczuk and Anna Katarzyna Zych, An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs, in: 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, 2017, p. 24:1–24:11.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
- Daniel Marx and Marcin Pilipczuk, Subexponential Parameterized Algorithms for Graphs of Polynomial Growth, in: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, p. 59:1–59:15.see in PBN
- Bart M. P. Jansen and Marcin Pilipczuk, Approximation and Kernelization for Chordal Vertex Deletion, 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. 1399–1418.see in PBN
- Marcin Pilipczuk, A tight lower bound for Vertex Planarization on graphs of bounded treewidth, Discrete Applied Mathematics 231 2017, p. 211–216.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
- 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
- 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
2016
- Marcin Pilipczuk and Magnus Wahlström, Directed multicut is W[1]-hard, even for four terminal pairs, 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. 1167–1178.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
- Anudhyan Boral, Marek Adam Cygan, Tomasz Kociumaka and Marcin Pilipczuk, A Fast Branching Algorithm for Cluster Vertex Deletion, Theory Of Computing Systems 58 (2) 2016, p. 357–376.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
- 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
- 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
- Alina Ene, Matthias Mnich, Marcin Pilipczuk and Andrej Risteski, On Routing Disjoint Paths in Bounded Treewidth Graphs, in: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland, 2016, p. 15:1–15:15.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
- Chandra Chekuri, Alina Ene and Marcin Pilipczuk, Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs, in: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, 2016, p. 7:1–7: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
- Daniel Lokshtanov, Marcin Pilipczuk and Erik Jan van Leeuwen, Independence and Efficient Domination on P6-free Graphs, 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. 1784–1803.see in PBN
2015
- 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
- Marek Adam Cygan and Marcin Pilipczuk, Faster exponential-time algorithms in graphs of bounded average degree, Information And Computation 243 2015, p. 75–85.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
- Jakub Włodzimierz Łącki, Jakub Oćwieja, Marcin Pilipczuk, Piotr Sankowski and Anna Katarzyna Zych, The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree, in: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, ACM, 2015, p. 11–20.see in PBN
2014
- Tomasz Kociumaka and Marcin Pilipczuk, Faster deterministic Feedback Vertex Set, Information Processing Letters 114 (10) 2014, p. 556–560.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
- Anudhyan Boral, Marek Adam Cygan, Tomasz Kociumaka and Marcin Pilipczuk, A Fast Branching Algorithm for Cluster Vertex Deletion, in: Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings, 2014, p. 111–124.see in PBN
- 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, 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, 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
- 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
- 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
- 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
- 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, 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
2013
- Łukasz Kowalik, Marcin Pilipczuk and Karol Suchan, Towards optimal kernel for connected vertex cover in planar graphs, Discrete Applied Mathematics 161 2013, p. 1154–1161.see in PBN
- Marek Adam Cygan, Marcin Łukasz Pilipczuk and Riste Skrekovski, A bound on the number of perfect matchings in Klee-graphs, Discrete Mathematics And Theoretical Computer Science 15 (1) 2013, p. 37–54.see in PBN
- Marek Adam Cygan and Marcin Łukasz Pilipczuk, Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms, Information Processing Letters 113 (5-6) 2013, p. 179–182.see in PBN
- 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
- Marek Adam Cygan and Marcin Łukasz Pilipczuk, Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree, in: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Part I, 2013, p. 364–375.see in PBN
2012
- 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 and Marcin Pilipczuk, Bandwidth and distortion revisited, Discrete Applied Mathematics 160 (4-5) 2012, p. 494–504.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
- Marek Cygan and Marcin Pilipczuk, Even Faster Exact Bandwidth, Acm Transactions On Algorithms 8 (1) 2012.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
- Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai and Venkatesh Raman, Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs, in: Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Springer, 2012, p. 364–375.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
- Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk and Piotr Sankowski, A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees, in: Algorithms - ESA 2012 - 20th Annual European Symposium, Springer, 2012, p. 349–360.see in PBN
- 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
2011
- 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
- Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk and Riste Skrekovski, On the Zagreb index inequality of graphs with prescribed vertex degrees, Discrete Applied Mathematics 159 (8) 2011, p. 852–858.see in PBN
- Marek Adam Cygan, Marcin Łukasz Pilipczuk and Jakub Onufry Wojtaszczyk, Capacitated domination faster than O(2^n), Information Processing Letters 111 (23) 2011, p. 1099–1103.see in PBN
- Marcin Pilipczuk, Characterization of compact subsets of curves with omega-continuous derivatives, Fundamenta Mathematicae 211 (2) 2011, p. 175–195.see in PBN
- Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk and Piotr Sankowski, Approximation Algorithms for Union and Intersection Covering Problems, in: Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 2011, Leibniz-Zentrum fuer Informatik, Dagstuhl 2011, p. 28–40.see in PBN
- Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith and Jakub Wojtaszczyk, Breaking the 2^n-barrier for Irredundance: Two lines of attack, Journal Of Discrete Algorithms 9 (3) 2011, p. 214–230.see in PBN
- 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
2010
- Marek Adam Cygan, Marcin Łukasz Pilipczuk and Jakub Wojtaszczyk, Capacitated domination faster than O(2^n), in: Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Springer, Heidelberg 2010, p. 74–80.see in PBN
- 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
- Marek Cygan and Marcin Pilipczuk, Exact and approximate bandwidth, Theoretical Computer Science 411 (40-42) 2010, p. 3701–3713.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
- Marek Cygan, Marcin Pilipczuk and Jakub Wojtaszczyk, Irredundant set faster than O(2^n), in: Algorithms and Complexity, 7th International Conference, CIAC 2010, Springer, Berlin, Heidelberg 2010, p. 288–298.see in PBN
You are not logged in | log in
