Publikacje

Czasopismo: Algorithmica

Liczba publikacji: 30

2019

• Evangelos Bampas, Jurek Czyżowicz, Leszek Gąsieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka i Dominik Pająk, Linear Search by a Pair of Distinct-Speed Robots, Algorithmica 81 (1) 2019, s. 317–342.zobacz w PBN

2018

• Pål Grønås Drange i Michał Pilipczuk, A Polynomial Kernel for Trivially Perfect Editing, Algorithmica 80 (12) 2018, s. 3481–3524.zobacz w PBN

2017

• Tomasz Kociumaka, Jakub Radoszewski i Wojciech Rytter, Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet, Algorithmica 77 (4) 2017, s. 1194–1215.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, String Powers in Trees, Algorithmica 79 (3) 2017, s. 814–834.zobacz w PBN
• Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk i Arkadiusz Aleksander Socała, Linear Kernels for Outbranching Problems in Sparse Digraphs, Algorithmica 79 (1) 2017, s. 159–188.zobacz w PBN
• Marcin Pilipczuk, Michał Pilipczuk i Marcin Wrochna, Edge Bipartization Faster than 2^k, Algorithmica 2017.zobacz w PBN

2016

• Łukasz Kowalik i Arkadiusz Aleksander Socała, Assigning Channels Via the Meet-in-the-Middle Approach, Algorithmica 74 (4) 2016, s. 1435–1452.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
• Andreas Bjorklund, Petteri Kaski i Łukasz Kowalik, Constrained Multilinear Detection and Generalized Graph Motifs, Algorithmica 74 (2) 2016, s. 947–967.zobacz w PBN
• Ivan Bliznets, Fedor V. Fomin, Michał Pilipczuk i Yngve Villanger, Largest Chordal and Interval Subgraphs Faster than 2^n, Algorithmica 76 (2) 2016, s. 569–594.zobacz w PBN
• Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi i Piotr Sankowski, Online Network Design with Outliers, Algorithmica 76 (1) 2016, s. 88–109.zobacz w PBN

2015

• Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Algorithmica 73 (1) 2015, s. 217–233.zobacz w PBN
• Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma i Michał Pilipczuk, Modifying a Graph Using Vertex Elimination, Algorithmica 72 (1) 2015, s. 99–125.zobacz w PBN
• Fedor V. Fomin, Archontia C. Giannopoulou i Michał Pilipczuk, Computing Tree-Depth Faster Than 2^n, Algorithmica 73 (1) 2015, s. 202–216.zobacz w PBN

2014

• 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, 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
• Remy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kamiński i Dani\"el Paulusma, Detecting Fixed Patterns in Chordal Graphs in Polynomial Time, Algorithmica 69 (3) 2014, s. 501–521.zobacz w PBN

2012

• 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

2011

• Łukasz Kowalik i Marcin Mucha, 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality, Algorithmica 59 (2) 2011, s. 240–255.zobacz w PBN
• Robert Dąbrowski i Wojciech Plandowski, On Word Equations in One Variable, Algorithmica 60 (4) 2011, s. 819–828.zobacz w PBN

2010

• Piotr Sankowski i Marcin Mucha, Fast Dynamic Transitive Closure with Lookahead, Algorithmica 56 (2) 2010, s. 180–197.zobacz w PBN
• Łukasz Kowalik, Fast 3-coloring Triangle-Free Planar Graphs, Algorithmica 58 (3) 2010, s. 770–789.zobacz w PBN

2009

• Jakub Pawlewicz i Mihai Patrascu, Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons, Algorithmica 55 (2) 2009, s. 271–282.zobacz w PBN
• Robert Dąbrowski i Wojciech Plandowski, On Word Equations in One Variable, Algorithmica 9375-3 2009, s. 3.zobacz w PBN

2008

• Richard Cole i Łukasz Kowalik, New Linear-Time Algortihms for Edge-Coloring Planar Graphs, Algorithmica 50 (3) 2008, s. 351–368.zobacz w PBN

2006

• Marcin Mucha i Piotr Sankowski, Maximum Matchings in Planar Graphs via Gaussian Elimination, Algorithmica 45 (1) 2006, s. 3–20.zobacz w PBN

2004

• Marcin Peczarski, New Results in Minimum-Comparison Sorting, Algorithmica 40 2004, s. 133–145.zobacz w PBN

2000

• Krzysztof Diks i Andrzej Pelc, Optimal adaptive broadcasting with a bounded fraction of faulty nodes,, Algorithmica 28 (1) 2000, s. 37–50.zobacz w PBN