Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Marek Cygan
2018
- Marek Adam Cygan, Artur Czumaj, Marcin Ireneusz Mucha and Piotr Sankowski, Online Facility Location with Deletions, in: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, r. 21, p. 1–15.see in PBN
- Ivan Bliznets, Marek Cygan, Paweł Komosa and Michał Pilipczuk, Hardness of Approximation for H-free Edge Modification Problems, Acm Transactions On Computation Theory 10 (2) 2018, p. 9:1–9:32.see in PBN
- Marek Adam Cygan, Stefan Kratsch and Jesper Nederlof, Fast Hamiltonicity Checking Via Bases of Perfect Matchings, Journal Of The Acm 12 2018, p. 1:46.see in PBN
- Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała and Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, Journal Of Artificial Intelligence Research 63 2018, p. 495–513.see in PBN
2017
- Marek Adam Cygan, Łukasz Kowalik and Arkadiusz Aleksander Socała, Improving TSP Tours Using Dynamic Programming over Tree Decompositions, in: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, p. 30:1–30:14.see in PBN
- Parinya Chalermsook, Marek Adam Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai and Luca Trevisan, From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More, in: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, 2017, p. 743–754.see in PBN
- Marek Adam Cygan, Marcin Ireneusz Mucha, Karol Zbigniew Węgrzycki and Michał Włodarczyk, On Problems Equivalent to (min, +)-Convolution, in: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 22, p. 1–15.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
- Marek Adam Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki and Arkadiusz Aleksander Socała, Tight Lower Bounds on Graph Embedding Problems, Journal Of The Acm 64 (3) 2017, p. 18:1–18:22.see in PBN
- Marek Adam Cygan, Fabrizio Grandoni and Danny Hermelin, Tight Kernel Bounds for Problems on Graphs with Small Degeneracy, Acm Transactions On Algorithms 13 (3) 2017, p. 43:1–43:22.see in PBN
- Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała and Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., 2017, p. 459–465.see in PBN
2016
- 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, Marcin Ireneusz Mucha, Piotr Sankowski and Qiang Zhang, Online Pricing with Impatient Bidders, 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. 190–201.see in PBN
- Paweł Jarosław Brach, Marek Adam Cygan, Jakub Włodzimierz Łącki and Piotr Sankowski, Algorithmic Complexity of Power Law Networks, 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. 1306–1325.see in PBN
- Ivan Bliznets, Marek Adam Cygan, Paweł Komosa and Michał Pilipczuk, Hardness of Approximation for H-Free Edge Modification Problems, in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, 2016, p. 3:1–3:17.see in PBN
- Ivan Bliznets, Marek Adam Cygan, Paweł Komosa, Lukas Mach and Michał Pilipczuk, Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, p. 1132–1151.see in PBN
- Marek Adam Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, Lower Bounds for Approximation Schemes for Closest String, in: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland, 2016, p. 12:1–12:10.see in PBN
- Marek Adam Cygan, Lukasz Jez and Jiri Sgall, Online Knapsack Revisited, Theory Of Computing Systems 58 (1) 2016, p. 153–190.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
- Marek Adam Cygan, Holger Dell, Daniel Lokshtanov, D\'aniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh and Magnus Wahlstr\öm, On Problems as Hard as CNF-SAT, Acm Transactions On Algorithms 12 (3) 2016, p. 41:1–41:24.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, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki and Arkadiusz Aleksander Socała, Tight Bounds for Graph Homomorphism and Subgraph Isomorphism, 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. 1643–1649.see in PBN
- Marek Adam Cygan, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter and Tomasz Waleń, Polynomial-time approximation algorithms for weighted LCS problem, Discrete Applied Mathematics 204 2016, p. 38–48.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
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 Cygan and Tomasz Kociumaka, Approximating Upper Degree-Constrained Partial Orientations, in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015, p. 212–224.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
- Hans L. Bodlaender, Marek Adam Cygan, Stefan Kratsch and Jesper Nederlof, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information And Computation 243 2015, p. 86–111.see in PBN
- Marek Adam Cygan, Harold N. Gabow and Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings, Journal Of The Acm 62 (4) 2015, p. 28.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
- Rajesh Hemant Chitnis, Marek Adam Cygan, Mohammad Taghi Hajiaghayi and D\'aniel Marx, Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Acm Transactions On Algorithms 11 (4) 2015, p. 28.see in PBN
- Ivan Bliznets, Marek Adam Cygan, Paweł Komosa and Luk\'as Mach, Kernelization lower bound for Permutation Pattern Matching, Information Processing Letters 115 (5) 2015, p. 527–531.see in PBN
2014
- Marek Adam Cygan, Dániel Marx, Marcin Pilipczuk and Michał Pilipczuk, Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth, in: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, Springer, 2014, p. 189–200.see in PBN
- Marek Adam Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, Minimum bisection is fixed parameter tractable, in: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, ACM, 2014, p. 323–332.see in PBN
- Marek Cygan and Tomasz Kociumaka, Constant Factor Approximation for Capacitated k-Center with Outliers, Leibniz International Proceedings In Informatics 25 2014, p. 251–262.see in PBN
- Marek Adam Cygan, Dániel Marx, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Ildikó Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Algorithmica 68 (1) 2014, p. 41–61.see in PBN
- Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk, Scheduling Partially Ordered Jobs Faster than 2^n, Algorithmica 68 (3) 2014, p. 692–714.see in PBN
- Marek Adam Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, On Cutwidth Parameterized by Vertex Cover, Algorithmica 68 (4) 2014, p. 940–953.see in PBN
- Marek Adam Cygan, Daniel Lokshtanov, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Saket Saurabh, On the Hardness of Losing Width, Theory Of Computing Systems 54 (1) 2014, p. 73–82.see in PBN
- Cristina Bazgan, Morgan Chopin, Marek Adam Cygan, Michael R. Fellows, Fedor V. Fomin and Erik Jan van Leeuwen, Parameterized complexity of firefighting, Journal Of Computer And System Sciences 80 (7) 2014, p. 1285–1297.see in PBN
- Marek Adam Cygan and Pinar Heggernes (eds.), 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), 2014.see in PBN
- Marek Adam Cygan, Marcin Pilipczuk, Michał Paweł Pilipczuk and Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n, Algorithmica 70 (2) 2014, p. 195–207.see in PBN
- Marek Adam Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, Acm Transactions On Computation Theory 6 (2) 2014, p. 6.see in PBN
- 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
2013
- 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, Guy Kortsarz and Zeev Nutov, Steiner Forest Orientation Problems, Siam Journal On Discrete Mathematics 27 (3) 2013, p. 1503–1513.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
- 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
- Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski, Matthias Englert and Anupam Gupta, Catch them if you can: how to serve impatient users, in: Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, ACM, 2013.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
2012
- 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, Jian-Feng Hou, Łukasz Kowalik, Borut Luzar and Jian-Liang Wu, A Planar linear arboricity conjecture, Journal Of Graph Theory 69 (4) 2012, p. 403–425.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, Harold N. Gabow and Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings, in: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012.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, Deterministic Parameterized Connected Vertex Cover, in: Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Springer, 2012.see in PBN
- Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi and Dániel Marx, Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable, in: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Part I, 2012.see in PBN
- Marek Cygan and Marcin Pilipczuk, Even Faster Exact Bandwidth, Acm Transactions On Algorithms 8 (1) 2012.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 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
- Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Polynomial-Time Approximation Algorithms for Weighted LCS Problem, Lecture Notes In Computer Science 6661 2011, p. 455–466.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
- Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan van Rooij and Jakub Wojtaszczyk, Solving connectivity problems parameterized by treewidth in single exponential time, in: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, IEEE, Palm Springs 2011, p. 150–159.see in PBN
2010
- Marek Adam Cygan, Marcin Łukasz Pilipczuk 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
- Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń, Algorithms for Three Versions of the Shortest Common Superstring Problem, Lecture Notes In Computer Science 6129 2010, p. 299–309.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
