Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Marcin
    Last name: Pilipczuk
    DBLP: 09/4636
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 137  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Bart M. P. Jansen, Marcin Pilipczuk.
    Approximation and Kernelization for Chordal Vertex Deletion.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Journal article
    Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth.
    SIAM J. Comput. 2017, Volume 46 (0) 2017
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna.
    Polynomial Kernelization for Removing Induced Claws and Diamonds.
    Theory Comput. Syst. 2017, Volume 60 (0) 2017
    Conference paper
    Alexandr Andoni, Debmalya Panigrahi, Marcin Pilipczuk.
    Editorial.
    ACM Trans. Algorithms 2016, Volume 13 (0) 2017
    Journal article
    Nikolai Karpov, Marcin Pilipczuk, Anna Zych.
    An exponential lower bound for cut sparsifiers in planar graphs.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Tomasz Kociumaka, Marcin Pilipczuk.
    Deleting vertices to graphs of bounded genus.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Andrzej Grzesik, Tereza Klimosova, Marcin Pilipczuk, Michal Pilipczuk.
    Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk.
    On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna.
    Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen.
    Independence and Efficient Domination on
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Marcin Pilipczuk, Magnus Wahlström.
    Directed multicut is
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk.
    A Fast Branching Algorithm for Cluster Vertex Deletion.
    Theory Comput. Syst. 2016, Volume 58 (0) 2016
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk.
    On Group Feedback Vertex Set Parameterized by the Size of the Cutset.
    Algorithmica 2016, Volume 74 (0) 2016
    Journal article
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk.
    Known Algorithms for Edge Clique Cover are Probably Optimal.
    SIAM J. Comput. 2016, Volume 45 (0) 2016
    Conference paper
    Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk.
    Subexponential parameterized algorithm for Interval Completion.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Marcin Pilipczuk.
    Exact Algorithms on Graphs of Bounded Average Degree.
    Encyclopedia of Algorithms 2016 (0) 2016
    Conference paper
    Marcin Pilipczuk.
    Planar Directed k-Vertex-Disjoint Paths Problem.
    Encyclopedia of Algorithms 2016 (0) 2016
    Conference paper
    Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Bart M. P. Jansen, Marcin Pilipczuk.
    Approximation and Kernelization for Chordal Vertex Deletion.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    Lower Bounds for Approximation Schemes for Closest String.
    15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland 2016 (0) 2016
    Conference paper
    Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski.
    On Routing Disjoint Paths in Bounded Treewidth Graphs.
    15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland 2016 (0) 2016
    Conference paper
    Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar.
    Kernelization and Sparseness: the Case of Dominating Set.
    33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France 2016 (0) 2016
    Conference paper
    Chandra Chekuri, Alina Ene, Marcin Pilipczuk.
    Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk.
    Designing FPT Algorithms for Cut Problems Using Randomized Contractions.
    SIAM J. Comput. 2016, Volume 45 (0) 2016
    Conference paper
    Dániel Marx, Marcin Pilipczuk.
    Subexponential parameterized algorithms for graphs of polynomial growth.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk.
    Hardness of approximation for strip packing.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.
    IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA 2016 (0) 2016
    Conference paper
    Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna.
    Edge Bipartization Faster Than 2^k.
    11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark 2017 (0) 2016
    Book chapter
    Marcin Pilipczuk.
    Planar Directed k-Vertex-Disjoint Paths Problem.
    Encyclopedia of Algorithms 2015 (0) 2015
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    Sitting Closer to Friends than Enemies, Revisited.
    Theory Comput. Syst. 2015, Volume 56 (0) 2015
    Journal article
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna.
    Polynomial kernelization for removing induced claws and diamonds.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström.
    Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs.
    SIAM J. Discrete Math. 2015, Volume 29 (0) 2015
    Conference paper
    Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych.
    The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree.
    Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015 2015 (0) 2015
    Journal article
    Marek Cygan, Marcin Pilipczuk.
    Faster exponential-time algorithms in graphs of bounded average degree.
    Inf. Comput. 2015, Volume 243 (0) 2015
    Conference paper
    Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen.
    Independence and Efficient Domination on P
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna.
    Edge Bipartization faster than 2
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Marcin Pilipczuk, Magnus Wahlström.
    Directed multicut is W[1]-hard, even for four terminal pairs.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    Lower bounds for approximation schemes for Closest String.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Marcin Pilipczuk.
    A tight lower bound for Vertex Planarization on graphs of bounded treewidth.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski.
    On Routing Disjoint Paths in Bounded Treewidth Graphs.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna.
    Polynomial Kernelization for Removing Induced Claws and Diamonds.
    Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers 2016 (0) 2015
    Conference paper
    Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk.
    A Subexponential Parameterized Algorithm for Proper Interval Completion.
    SIAM J. Discrete Math. 2015, Volume 29 (0) 2015
    Journal article
    Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    On the Hardness of Losing Width.
    Theory Comput. Syst. 2014, Volume 54 (0) 2014
    Journal article
    Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter.
    Parameterized Complexity of Eulerian Deletion Problems.
    Algorithmica 2014, Volume 68 (0) 2014
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    Scheduling Partially Ordered Jobs Faster than 2 n.
    Algorithmica 2014, Volume 68 (0) 2014
    Conference paper
    Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    On Cutwidth Parameterized by Vertex Cover.
    Algorithmica 2014, Volume 68 (0) 2014
    Journal article
    Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk.
    A subexponential parameterized algorithm for Proper Interval Completion.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk.
    A subexponential parameterized algorithm for Interval Completion.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Tomasz Kociumaka, Marcin Pilipczuk.
    Faster deterministic Feedback Vertex Set.
    Inf. Process. Lett. 2014, Volume 114 (0) 2014
    Conference paper
    Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk.
    A Fast Branching Algorithm for Cluster Vertex Deletion.
    Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström.
    Clique Cover and Graph Separation: New Incompressibility Results.
    TOCT 2014, Volume 6 (0) 2014
    Conference paper
    Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    Minimum bisection is fixed parameter tractable.
    Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 2014 (0) 2014
    Conference paper
    Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger.
    Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters.
    J. Comput. Syst. Sci. 2014, Volume 80 (0) 2014
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n.
    Algorithmica 2014, Volume 70 (0) 2014
    Conference paper
    Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk.
    A Subexponential Parameterized Algorithm for Proper Interval Completion.
    Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk.
    Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth.
    Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II 2014 (0) 2014
    Journal article
    Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar.
    Kernelization and Sparseness: the case of Dominating Set.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk.
    Hitting forbidden subgraphs in graphs of bounded treewidth.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen.
    Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.
    55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014 2014 (0) 2014
    Conference paper
    Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth.
    55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014 2014 (0) 2014
    Journal article
    Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman 0001.
    Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs.
    TOCT 2014, Volume 7 (0) 2014
    Conference paper
    Marek Cygan, Marcin Pilipczuk.
    Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms.
    Inf. Process. Lett. 2013, Volume 113 (0) 2013
    Journal article
    Marek Cygan, Marcin Pilipczuk, Riste Skrekovski.
    A bound on the number of perfect matchings in Klee-graphs.
    Discrete Mathematics Theoretical Computer Science 2013, Volume 15 (0) 2013
    Journal article
    Marek Cygan, Marcin Pilipczuk.
    Faster exponential-time algorithms in graphs of bounded average degree
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    Subset Feedback Vertex Set Is Fixed-Parameter Tractable.
    SIAM J. Discrete Math. 2013, Volume 27 (0) 2013
    Conference paper
    Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan.
    Towards optimal kernel for connected vertex cover in planar graphs.
    Discrete Applied Mathematics 2013, Volume 161 (0) 2013
    Conference paper
    Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger.
    Tight bounds for Parameterized Complexity of Cluster Editing.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen.
    Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Journal article
    Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk.
    The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk.
    Known algorithms for EDGE CLIQUE COVER are probably optimal.
    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 (0) 2013
    Journal article
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    On multiway cut parameterized above lower bounds.
    TOCT 2013, Volume 5 (0) 2013
    Journal article
    Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk.
    Fast branching algorithm for Cluster Vertex Deletion.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen.
    Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Marek Cygan, Marcin Pilipczuk.
    Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree.
    Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I 2013 (0) 2013
    Conference paper
    Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych.
    Dynamic Steiner Tree in Planar Graphs.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.
    Minimum Bisection is fixed parameter tractable.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk.
    The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable.
    54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA 2013 (0) 2013
    Conference paper
    Tomasz Kociumaka, Marcin Pilipczuk.
    Faster deterministic Feedback Vertex Set.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Marek Cygan, Marcin Pilipczuk.
    Bandwidth and distortion revisited.
    Discrete Applied Mathematics 2012, Volume 160 (0) 2012
    Journal article
    Marek Cygan, Marcin Pilipczuk.
    Even Faster Exact Bandwidth.
    ACM Transactions on Algorithms 2012, Volume 8 (0) 2012
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n.
    LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings 2012 (0) 2012
    Journal article
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion.
    Algorithmica 2012, Volume 64 (0) 2012
    Conference paper
    Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman 0001.
    Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs.
    Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström.
    Clique Cover and Graph Separation: New Incompressibility Results.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012 (0) 2012
    Conference paper
    Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström.
    Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012 (0) 2012
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    Sitting Closer to Friends Than Enemies, Revisited.
    Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski.
    A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees.
    Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    Kernelization hardness of connectivity problems in d-degenerate graphs.
    Discrete Applied Mathematics 2012, Volume 160 (0) 2012
    Conference paper
    Marcin Pilipczuk, Michal Pilipczuk, Riste Skrekovski.
    Some results on Vizing's conjecture and related problems.
    Discrete Applied Mathematics 2012, Volume 160 (0) 2012
    Conference paper
    Marcin Pilipczuk, Michal Pilipczuk.
    Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n.
    Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Marcin Pilipczuk, Michal Pilipczuk.
    Finding a maximum induced degenerate subgraph faster than 2^n
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström.
    Fixed-parameter tractability of multicut in directed acyclic graphs
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Marek Cygan, Marcin Pilipczuk.
    On fixed-parameter algorithms for Split Vertex Deletion
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk.
    Designing FPT algorithms for cut problems using randomized contractions
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    Sitting closer to friends than enemies, revisited
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk.
    Known algorithms for EDGE CLIQUE COVER are probably optimal
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk.
    On Group Feedback Vertex Set Parameterized by the Size of the Cutset.
    Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers 2012 (0) 2012
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk.
    A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More).
    SIAM J. Comput. 2012, Volume 41 (0) 2012
    Conference paper
    Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk.
    Designing FPT Algorithms for Cut Problems Using Randomized Contractions.
    53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012 2012 (0) 2012
    Show item 1 to 100 of 137  

    Your query returned 137 matches in the database.