Czasopismo: Algorithmica

Liczba publikacji: 56

2024

Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski , Pattern Masking for Dictionary Matching: Theory and Practice, Algorithmica, 86 (6) 2024, s. 1948-1978. Zobacz w PBN

2023

Pavel Dvořák, Andreas Emil Feldmann, Ashutosh Rai, Paweł Rzążewski , Parameterized Inapproximability of Independent Set in H-Free Graphs, Algorithmica, 85 2023, s. 902–928. Zobacz w PBN

2022

Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk , Gabriele Puppis, Cristian Riveros, Dynamic Data Structures for Timed Automata Acceptance, Algorithmica, 84 (11) 2022, s. 3223-3245. Zobacz w PBN
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Juliusz Straszyński , Efficient Computation of Sequence Mappability, Algorithmica, 84 (5) 2022, s. 1418-1440. Zobacz w PBN
Shaohua Li, Marcin Pilipczuk , Hardness of Metric Dimension in Graphs of Constant Treewidth, Algorithmica, 84 2022, s. 3110--3155. Zobacz w PBN
Andrzej Kędzierski, Jakub Radoszewski , k-Approximate Quasiperiodicity Under Hamming and Edit Distance, Algorithmica, 84 (3) 2022, s. 566-589. Zobacz w PBN
Vít Jelínek, Tereza Klimošová, Tomáš Masařík , Jana Masaříková , Aneta Pokorná, On 3-Coloring of ($$2P_4,C_5$$)-Free Graphs, Algorithmica, 84 (6) 2022, s. 1526-1547. Zobacz w PBN
Huib Donkers, Bart M. P. Jansen, Michał Włodarczyk , Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size, Algorithmica, 84 (11) 2022, s. 3407-3458. Zobacz w PBN
Mirosław Kowaluk , Andrzej Lingas, Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs, Algorithmica, 85 (4) 2022, s. 976-991. Zobacz w PBN

2021

Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Internal Dictionary Matching, Algorithmica, 83 (7) 2021, s. 2142-2169. Zobacz w PBN
Karolina Okrasa, Paweł Rzążewski , Jana Novotná, Michał Pilipczuk, Erik Jan van Leeuwen, Bartosz Walczak, Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs, Algorithmica, 83 2021, s. 2634–2650. Zobacz w PBN
Jan Kratochvíl, Jana Masaříková , Tomáš Masařík , U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited, Algorithmica, 2021. Zobacz w PBN

2020

Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski , Qiang Zhang, Budget Feasible Mechanisms on Matroids, Algorithmica, 83 (5) 2020, s. 1222-1237. Zobacz w PBN
Tereza Klimošová, Josef Malík, Daniël Paulusma, Veronika Slívová, Tomáš Masařík , Jana Masaříková , Colouring (Pr + Ps)-Free Graphs, Algorithmica, 82 (7) 2020, s. 1833-1858. Zobacz w PBN
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski , Dynamic and Internal Longest Common Substring, Algorithmica, 82 (12) 2020, s. 3707-3743. Zobacz w PBN
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Paweł Rzążewski , On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest, Algorithmica, 82 2020, s. 2841-2866. Zobacz w PBN
Jeremy Kun, Michael P. O’Brien, Marcin Pilipczuk , Blair D. Sullivan, Polynomial Treedepth Bounds in Linear Colorings, Algorithmica, 83 (1) 2020, s. 361-386. Zobacz w PBN
Michał Pilipczuk , Erik Jan van Leeuwen, Andreas Wiese, Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs, Algorithmica, 82 (6) 2020, s. 1703-1739. Zobacz w PBN

2019

Nikolai Karpov, Marcin Pilipczuk , Anna Zych-Pawlewicz , An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs, Algorithmica, 81 (10) 2019, s. 4029-4042. Zobacz w PBN
Michał Włodarczyk , Clifford Algebras Meet Tree Decompositions, Algorithmica, 81 (2) 2019, s. 497-518. Zobacz w PBN
Archontia C. Giannopoulou, Michał Pilipczuk , Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Cutwidth: Obstructions and Algorithmic Aspects, Algorithmica, 81 (2) 2019, s. 557-588. Zobacz w PBN
Tomasz Kociumaka, Marcin Pilipczuk , Deleting Vertices to Graphs of Bounded Genus, Algorithmica, 81 (9) 2019, s. 3655-3691. Zobacz w PBN
Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Edge Bipartization Faster than 2^k, Algorithmica, 81 (3) 2019, s. 917–966. Zobacz w PBN
Tomasz Kociumaka, Jakub Radoszewski , Tatiana Starikovskaya, Longest Common Substring with Approximately k Mismatches, Algorithmica, 81 (6) 2019, s. 2633-2652. Zobacz w PBN
Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk , Magnus Wahlström, Multi-budgeted Directed Cuts, Algorithmica, 82 (8) 2019, s. 2135-2155. Zobacz w PBN
Édouard Bonnet, Paweł Rzążewski , Optimality Program in Segment and String Graphs, Algorithmica, 81 (7) 2019, s. 3047-3073. Zobacz w PBN
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk , Zsolt Tuza, Erik Jan van Leeuwen, Subexponential-Time Algorithms for Maximum Independent Set in Pt -Free and Broom-Free Graphs, Algorithmica, 81 (2) 2019, s. 421-438. Zobacz w PBN
Bart M. P. Jansen, Marcin Pilipczuk , Marcin Wrochna , Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor, Algorithmica, 81 (10) 2019, s. 3936-3967. Zobacz w PBN

2018

Pål Grønås Drange, Michał Pilipczuk , A Polynomial Kernel for Trivially Perfect Editing, Algorithmica, 80 2018, s. 3481–3524. Zobacz w PBN
Aparna Das, Krzysztof Fleszar , Stephen Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff, Approximating the Generalized Minimum Manhattan Network Problem, Algorithmica, 80 (4) 2018, s. 1170-1190. Zobacz w PBN
Édouard Bonnet, Tillmann Miltzow, Paweł Rzążewski , Complexity of Token Swapping and its Variants, Algorithmica, 80 (9) 2018, s. 2656-2682. Zobacz w PBN

2017

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

2016

Łukasz Kowalik , Arkadiusz Socała, Assigning Channels Via the Meet-in-the-Middle Approach, Algorithmica, 2016. Zobacz w PBN
Łukasz Kowalik , Andreas Bjorklund, Petteri Kaski, Constrained Multilinear Detection and Generalized Graph Motifs, Algorithmica, 74 (2) 2016, s. 947-967. Zobacz w PBN
Ivan Bliznets, Fedor V. Fomin, Michał Pilipczuk , Yngve Villanger, Largest Chordal and Interval Subgraphs Faster than 2^n, Algorithmica, 2016. Zobacz w PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , On Group Feedback Vertex Set Parameterized by the Size of the Cutset, Algorithmica, 2016. Zobacz w PBN
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski , Online Network Design with Outliers, Algorithmica, 2016. Zobacz w PBN

2015

Fedor V. Fomin, Archontia C. Giannopoulou, Michał Pilipczuk , Computing Tree-Depth Faster Than 2^n, Algorithmica, 2015. Zobacz w PBN
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Fast Algorithm for Partial Covers in Words, Algorithmica, 2015. Zobacz w PBN
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michał Pilipczuk , Modifying a Graph Using Vertex Elimination, Algorithmica, 2015. Zobacz w PBN

2014

Marek Cygan , Marcin Pilipczuk , Daniel Lokshtanov, Michał Pilipczuk , Saket Saurabh, On Cutwidth Parameterized by Vertex Cover, Algorithmica, 68 (4) 2014, s. 940-953. Zobacz w PBN
Marek Cygan , Marcin Pilipczuk , Dániel Marx, Michał Pilipczuk , Ildikó Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Algorithmica, 68 (1) 2014, s. 41-61. Zobacz w PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Scheduling Partially Ordered Jobs Faster than 2^n, Algorithmica, 68 (3) 2014, s. 692-714. Zobacz w PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n, Algorithmica, 2014. Zobacz w PBN

2012

Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion, Algorithmica, 2012. Zobacz w PBN

2011

Łukasz Kowalik , Marcin Mucha , 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality, Algorithmica, 2011. Zobacz w PBN
Robert Dąbrowski, Wojciech Plandowski , On Word Equations in One Variable, Algorithmica, 2011. Zobacz w PBN

2010

Łukasz Kowalik , Fast 3-coloring Triangle-Free Planar Graphs, Algorithmica, 2010. Zobacz w PBN
Marcin Mucha , Piotr Sankowski , Fast Dynamic Transitive Closure with Lookahead, Algorithmica, 2010. Zobacz w PBN

2009

Robert Dąbrowski, Wojciech Plandowski , On Word Equations in One Variable, Algorithmica, 2009. Zobacz w PBN
Mihai Patrascu, Jakub Pawlewicz , Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons, Algorithmica, 2009. Zobacz w PBN