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