Algorithmica

Keyphrases

Publications

volume 86, number 5, 2024

Sergio Cabello, David Gajser
Connectivity with Uncertainty Regions Given as Line Segments. Algorithmica 86 (5) (2024)

volume 86, number 8, 2024

Robert Ganian, Viktoriia Korchemna
Slim Tree-Cut Width. Algorithmica 86 (8) (2024)
Robert Ganian, Viktoriia Korchemna
Slim Tree-Cut Width. Algorithmica 86 (8) (2024)

2023

Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko
Social Distancing Network Creation. Algorithmica (2023)
Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko
Social Distancing Network Creation. Algorithmica (2023)

volume 86, number 1, 2023

Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Węgrzycki
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86 (1) (2023)
Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Węgrzycki
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86 (1) (2023)

volume 86, number 3, 2023

Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber
Perfect Matchings with Crossings. Algorithmica 86 (3) (2023)

volume 85, number 7, 2023

Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica 85 (7) (2023)

2022

Paola Flocchini, Lucia Moura
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021. Algorithmica (2022)

volume 85, number 1, 2022

volume 85, number 3, 2022

Stefan Lendl, Gerhard Woeginger, Lasse Wulf
Non-Preemptive Tree Packing. Algorithmica 85 (3) (2022)

volume 85, number 4, 2022

Sebastian Forster, Tijn de Vos
Faster Cut Sparsification of Weighted Graphs. Algorithmica 85 (4) (2022)
Stephan Dominique Andres, François Dross, Melissa A Huggan, Fionn Mc Inerney, Richard J Nowakowski
The Complexity of Two Colouring Games. Algorithmica 85 (4) (2022)

volume 84, number 10, 2022

Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. Algorithmica 84 (10) (2022)

volume 84, number 11, 2022

Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk, Gabriele Puppis, Cristian Riveros
Dynamic Data Structures for Timed Automata Acceptance. Algorithmica 84 (11) (2022)
Petr A Golovach, Meirav Zehavi
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. Algorithmica 84 (11) (2022)

volume 84, number 12, 2022

Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
Monotone Circuit Lower Bounds from Robust Sunflowers. Algorithmica 84 (12) (2022)

volume 84, number 5, 2022

Dennis Komm, Rastislav Královič, Richard Královič, Tobias Mömke
Randomized Online Computation with High Probability Guarantees. Algorithmica 84 (5) (2022)

volume 84, number 6, 2022

Vít Jelínek, Tereza Klimošová, Tomáš Masařík, Jana Novotná, Aneta Pokorná
On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. Algorithmica 84 (6) (2022)

volume 84, number 8, 2022

Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs. Algorithmica 84 (8) (2022)
Jesper Nederlof, Céline M F Swennenhuis
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. Algorithmica 84 (8) (2022)

volume 84, number 9, 2022

Clemens Heuberger, Daniel Krenn, Gabriel F Lipnik
Asymptotic Analysis of q -Recursive Sequences. Algorithmica 84 (9) (2022)

volume 84, number 1, 2021

Stefano Leucci, Chih-Hung Liu
Approximate Minimum Selection with Unreliable Comparisons. Algorithmica 84 (1) (2021)
Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A Voudouris
Bounding the Inefficiency of Compromise in Opinion Formation. Algorithmica 84 (1) (2021)
Sayan Bandyapadhyay
On Perturbation Resilience of Non-uniform k -Center. Algorithmica 84 (1) (2021)

volume 84, number 4, 2021

Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour
Dynamic Averaging Load Balancing on Cycles. Algorithmica 84 (4) (2021)

volume 84, number 8, 2021

Fedor V Fomin, Petr A Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84 (8) (2021)

volume 83, number 5, 2021

Britta Dorn, Ronald de Haan, Ildikó Schlotter
Obtaining a Proportional Allocation by Deleting Items. Algorithmica 83 (5) (2021)

volume 83, number 6, 2021

Susanne Albers, Arindam Khan, Leon Ladewig
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. Algorithmica 83 (6) (2021)

volume 83, number 8, 2021

Marco Bressan
Faster algorithms for counting subgraphs in sparse graphs. Algorithmica 83 (8) (2021)

volume 83, number 9, 2021

Susanne Albers, Arindam Khan, Leon Ladewig
Best Fit Bin Packing with Random Order Revisited. Algorithmica 83 (9) (2021)
Susanne Albers, Maximilian Janke
Scheduling in the Random-Order Model. Algorithmica 83 (9) (2021)

volume 83, number 1, 2020

Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. Algorithmica 83 (1) (2020)
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
Building a Nest by an Automaton. Algorithmica 83 (1) (2020)

volume 83, number 2, 2020

Robert Ganian, Sebastian Ordyniak
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. Algorithmica 83 (2) (2020)

volume 83, number 8, 2020

Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83 (8) (2020)

volume 82, number 11, 2020

Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time. Algorithmica 82 (11) (2020)

volume 82, number 5, 2020

Matthias Mnich, Ildikó Schlotter
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Algorithmica 82 (5) (2020)

volume 82, number 8, 2020

Marc Roth, Johannes Schmitt
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. Algorithmica 82 (8) (2020)

volume 82, number 3, 2019

Clemens Heuberger, Daniel Krenn
Asymptotic Analysis of Regular Sequences. Algorithmica 82 (3) (2019)

volume 82, number 5, 2019

Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
Stable Matching with Uncertain Linear Preferences. Algorithmica 82 (5) (2019)

volume 81, number 1, 2018

Evangelos Bampas, Jurek Czyzowicz, Leszek Gąsieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pająk
Linear Search by a Pair of Distinct-Speed Robots. Algorithmica 81 (1) (2018)

volume 81, number 10, 2018

Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81 (10) (2018)

volume 81, number 2, 2018

Michał Włodarczyk
Clifford Algebras Meet Tree Decompositions. Algorithmica 81 (2) (2018)
Arne Meier, Sebastian Ordyniak, M S Ramanujan, Irena Schindler
Backdoors for Linear Temporal Logic. Algorithmica 81 (2) (2018)

volume 81, number 4, 2018

E Eiben, R Ganian, K Kangas, S Ordyniak
Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica 81 (4) (2018)
Clément Carbonnel, David A Cohen, Martin C Cooper, Stanislav Živný
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. Algorithmica 81 (4) (2018)

volume 81, number 5, 2018

Zengfeng Huang, Pan Peng
Dynamic Graph Stream Algorithms in o(n) Space. Algorithmica 81 (5) (2018)