Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Marek Cygan
2018
- Marek Adam Cygan, Artur Czumaj, Marcin Ireneusz Mucha i Piotr Sankowski, Online Facility Location with Deletions, w: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, r. 21, s. 1–15.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
- Marek Adam Cygan, Stefan Kratsch i Jesper Nederlof, Fast Hamiltonicity Checking Via Bases of Perfect Matchings, Journal Of The Acm 12 2018, s. 1:46.zobacz w PBN
- Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała i Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, Journal Of Artificial Intelligence Research 63 2018, s. 495–513.zobacz w PBN
2017
- Marek Adam Cygan, Łukasz Kowalik i Arkadiusz Aleksander Socała, Improving TSP Tours Using Dynamic Programming over Tree Decompositions, w: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, s. 30:1–30:14.zobacz w PBN
- Parinya Chalermsook, Marek Adam Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai i Luca Trevisan, From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More, w: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, 2017, s. 743–754.zobacz w PBN
- Marek Adam Cygan, Marcin Ireneusz Mucha, Karol Zbigniew Węgrzycki i Michał Włodarczyk, On Problems Equivalent to (min, +)-Convolution, 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. 22, s. 1–15.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
- Marek Adam Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki i Arkadiusz Aleksander Socała, Tight Lower Bounds on Graph Embedding Problems, Journal Of The Acm 64 (3) 2017, s. 18:1–18:22.zobacz w PBN
- Marek Adam Cygan, Fabrizio Grandoni i Danny Hermelin, Tight Kernel Bounds for Problems on Graphs with Small Degeneracy, Acm Transactions On Algorithms 13 (3) 2017, s. 43:1–43:22.zobacz w PBN
- Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała i Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, w: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., 2017, s. 459–465.zobacz w PBN
2016
- 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, Marcin Ireneusz Mucha, Piotr Sankowski i Qiang Zhang, Online Pricing with Impatient Bidders, 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. 190–201.zobacz w PBN
- Paweł Jarosław Brach, Marek Adam Cygan, Jakub Włodzimierz Łącki i Piotr Sankowski, Algorithmic Complexity of Power Law Networks, 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. 1306–1325.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, Lukasz Jez i Jiri Sgall, Online Knapsack Revisited, Theory Of Computing Systems 58 (1) 2016, s. 153–190.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
- Marek Adam Cygan, Holger Dell, Daniel Lokshtanov, D\'aniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh i Magnus Wahlstr\öm, On Problems as Hard as CNF-SAT, Acm Transactions On Algorithms 12 (3) 2016, s. 41:1–41:24.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, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki i Arkadiusz Aleksander Socała, Tight Bounds for Graph Homomorphism and Subgraph Isomorphism, 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. 1643–1649.zobacz w PBN
- Marek Adam Cygan, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Polynomial-time approximation algorithms for weighted LCS problem, Discrete Applied Mathematics 204 2016, s. 38–48.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
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 Cygan i Tomasz Kociumaka, Approximating Upper Degree-Constrained Partial Orientations, w: 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, s. 212–224.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
- Hans L. Bodlaender, Marek Adam Cygan, Stefan Kratsch i Jesper Nederlof, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information And Computation 243 2015, s. 86–111.zobacz w PBN
- Marek Adam Cygan, Harold N. Gabow i Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings, Journal Of The Acm 62 (4) 2015, s. 28.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
- Rajesh Hemant Chitnis, Marek Adam Cygan, Mohammad Taghi Hajiaghayi i D\'aniel Marx, Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Acm Transactions On Algorithms 11 (4) 2015, s. 28.zobacz w PBN
- Ivan Bliznets, Marek Adam Cygan, Paweł Komosa i Luk\'as Mach, Kernelization lower bound for Permutation Pattern Matching, Information Processing Letters 115 (5) 2015, s. 527–531.zobacz w PBN
2014
- 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
- Marek Cygan i Tomasz Kociumaka, Constant Factor Approximation for Capacitated k-Center with Outliers, Leibniz International Proceedings In Informatics 25 2014, s. 251–262.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
- Cristina Bazgan, Morgan Chopin, Marek Adam Cygan, Michael R. Fellows, Fedor V. Fomin i Erik Jan van Leeuwen, Parameterized complexity of firefighting, Journal Of Computer And System Sciences 80 (7) 2014, s. 1285–1297.zobacz w PBN
- Marek Adam Cygan i Pinar Heggernes (red.), 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), 2014.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
- 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
2013
- 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, Guy Kortsarz i Zeev Nutov, Steiner Forest Orientation Problems, Siam Journal On Discrete Mathematics 27 (3) 2013, s. 1503–1513.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
- 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
- Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski, Matthias Englert i Anupam Gupta, Catch them if you can: how to serve impatient users, w: Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, ACM, 2013.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
2012
- 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, Jian-Feng Hou, Łukasz Kowalik, Borut Luzar i Jian-Liang Wu, A Planar linear arboricity conjecture, Journal Of Graph Theory 69 (4) 2012, s. 403–425.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, Harold N. Gabow i Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings, w: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012.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, Deterministic Parameterized Connected Vertex Cover, w: Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Springer, 2012.zobacz w PBN
- Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi i Dániel Marx, Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable, w: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Part I, 2012.zobacz w PBN
- Marek Cygan i Marcin Pilipczuk, Even Faster Exact Bandwidth, Acm Transactions On Algorithms 8 (1) 2012.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 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
- Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Polynomial-Time Approximation Algorithms for Weighted LCS Problem, Lecture Notes In Computer Science 6661 2011, s. 455–466.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
- 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 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
- Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Algorithms for Three Versions of the Shortest Common Superstring Problem, Lecture Notes In Computer Science 6129 2010, s. 299–309.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ę
