Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:streams/journals/algorithmica:"
more than 1000 matches, exporting first 1000 hits only!
download as .bib file
@article{DBLP:journals/algorithmica/AichholzerMKPPPSV24,
author = {Oswin Aichholzer and
Ruy Fabila Monroy and
Philipp Kindermann and
Irene Parada and
Rosna Paul and
Daniel Perz and
Patrick Schnider and
Birgit Vogtenhuber},
title = {Perfect Matchings with Crossings},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {697--716},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01147-7},
doi = {10.1007/S00453-023-01147-7},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AichholzerMKPPPSV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Akimoto24,
author = {Youhei Akimoto},
title = {Analysis of Surrogate-Assisted Information-Geometric Optimization
Algorithms},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {33--63},
year = {2024},
url = {https://doi.org/10.1007/s00453-022-01087-8},
doi = {10.1007/S00453-022-01087-8},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Akimoto24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AkmalJ24,
author = {Shyan Akmal and
Ce Jin},
title = {An Efficient Algorithm for All-Pairs Bounded Edge Connectivity},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1623--1656},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01203-2},
doi = {10.1007/S00453-023-01203-2},
timestamp = {Sat, 04 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AkmalJ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlsethP24,
author = {Andrew Alseth and
Matthew J. Patitz},
title = {The Need for Seed (in the Abstract Tile Assembly Model)},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {218--280},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01160-w},
doi = {10.1007/S00453-023-01160-W},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlsethP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngeliniBLGMT24,
author = {Patrizio Angelini and
Michael A. Bekos and
Giordano Da Lozzo and
Martin Gronemann and
Fabrizio Montecchiani and
Alessandra Tappini},
title = {Recognizing Map Graphs of Bounded Treewidth},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {613--637},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01180-6},
doi = {10.1007/S00453-023-01180-6},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AngeliniBLGMT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntipovBD24,
author = {Denis Antipov and
Maxim Buzdalov and
Benjamin Doerr},
title = {Lazy Parameter Tuning and Control: Choosing All Parameters Randomly
from a Power-Law Distribution},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {442--484},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01098-z},
doi = {10.1007/S00453-023-01098-Z},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AntipovBD24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArtamonovB24,
author = {Stepan Artamonov and
Maxim A. Babenko},
title = {Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {717--734},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01148-6},
doi = {10.1007/S00453-023-01148-6},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ArtamonovB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BamburyBD24,
author = {Henry Bambury and
Antoine Bultel and
Benjamin Doerr},
title = {An Extended Jump Functions Benchmark for the Analysis of Randomized
Search Heuristics},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {1--32},
year = {2024},
url = {https://doi.org/10.1007/s00453-022-00977-1},
doi = {10.1007/S00453-022-00977-1},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BamburyBD24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BannaiIKKP24,
author = {Hideo Bannai and
Tomohiro I and
Tomasz Kociumaka and
Dominik K{\"{o}}ppl and
Simon J. Puglisi},
title = {Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {735--756},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01125-z},
doi = {10.1007/S00453-023-01125-Z},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BannaiIKKP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BartierBHMS24,
author = {Valentin Bartier and
Nicolas Bousquet and
Jihad Hanna and
Amer E. Mouawad and
Sebastian Siebertz},
title = {Token Sliding on Graphs of Girth Five},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {638--655},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01181-5},
doi = {10.1007/S00453-023-01181-5},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BartierBHMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BazganF24,
author = {Cristina Bazgan and
Henning Fernau},
title = {Preface of the Special Issue Dedicated to Selected Papers from {IWOCA}
2022},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {695--696},
year = {2024},
url = {https://doi.org/10.1007/s00453-024-01225-4},
doi = {10.1007/S00453-024-01225-4},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BazganF24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergeBFW24,
author = {Pierre Berg{\'{e}} and
Anthony Busson and
Carl Feghali and
R{\'{e}}mi Watrigant},
title = {1-Extendability of Independent Sets},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {757--781},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01138-8},
doi = {10.1007/S00453-023-01138-8},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergeBFW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleGS24,
author = {Philip Bille and
Inge Li G{\o}rtz and
Tord Stordalen},
title = {Predecessor on the Ultra-Wide Word {RAM}},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1578--1599},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01193-1},
doi = {10.1007/S00453-023-01193-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleGS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlumrosenD24,
author = {Liad Blumrosen and
Shahar Dobzinski},
title = {Combinatorial Reallocation Mechanisms},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1246--1262},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01191-3},
doi = {10.1007/S00453-023-01191-3},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BlumrosenD24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BokFJKR24,
author = {Jan Bok and
Jir{\'{\i}} Fiala and
Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Pawel Rzazewski},
title = {List Covering of Regular Multigraphs with Semi-edges},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {782--807},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01163-7},
doi = {10.1007/S00453-023-01163-7},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BokFJKR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CabelloG24,
author = {Sergio Cabello and
David Gajser},
title = {Connectivity with Uncertainty Regions Given as Line Segments},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1512--1544},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01200-5},
doi = {10.1007/S00453-023-01200-5},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CabelloG24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaiM24,
author = {Jin{-}Yi Cai and
Ashwin Maran},
title = {Counting Cycles on Planar Graphs in Subexponential Time},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {656--693},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01182-4},
doi = {10.1007/S00453-023-01182-4},
timestamp = {Thu, 01 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CaiM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanLSW24,
author = {T.{-}H. Hubert Chan and
Silvio Lattanzi and
Mauro Sozio and
Bo Wang},
title = {Fully Dynamic k-Center Clustering with Outliers},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {171--193},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01159-3},
doi = {10.1007/S00453-023-01159-3},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanLSW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CourtielDL24,
author = {Julien Courtiel and
Paul Dorbec and
Romain Lecoq},
title = {Theoretical Analysis of Git Bisect},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1365--1399},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01194-0},
doi = {10.1007/S00453-023-01194-0},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CourtielDL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DobrevNOP24,
author = {Stefan Dobrev and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov},
title = {Exploration of High-Dimensional Grids by Finite State Machines},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1700--1729},
year = {2024},
url = {https://doi.org/10.1007/s00453-024-01207-6},
doi = {10.1007/S00453-024-01207-6},
timestamp = {Sat, 04 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DobrevNOP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrGB24,
author = {Benjamin Doerr and
Yassine Ghannane and
Marouane Ibn Brahim},
title = {Runtime Analysis for Permutation-based Evolutionary Algorithms},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {90--129},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01146-8},
doi = {10.1007/S00453-023-01146-8},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrGB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrK24,
author = {Benjamin Doerr and
Timo K{\"{o}}tzing},
title = {Lower Bounds from Fitness Levels Made Easy},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {367--395},
year = {2024},
url = {https://doi.org/10.1007/s00453-022-00952-w},
doi = {10.1007/S00453-022-00952-W},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrRW24,
author = {Benjamin Doerr and
Amirhossein Rajabi and
Carsten Witt},
title = {Simulated Annealing is a Polynomial-Time Approximation Scheme for
the Minimum Spanning Tree Problem},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {64--89},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01135-x},
doi = {10.1007/S00453-023-01135-X},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EsmerKMSW24,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Philipp Schepper and
Karol Wegrzycki},
title = {Computing Generalized Convolutions Faster Than Brute Force},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {334--366},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01176-2},
doi = {10.1007/S00453-023-01176-2},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EsmerKMSW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FajardoS24,
author = {Mario Alejandro Hevia Fajardo and
Dirk Sudholt},
title = {Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms:
Why Success Rates Matter},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {526--565},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01153-9},
doi = {10.1007/S00453-023-01153-9},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FajardoS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeldmanFLMR24,
author = {Michal Feldman and
Federico Fusco and
Stefano Leonardi and
Simon Mauras and
Rebecca Reiffenh{\"{a}}user},
title = {Truthful Matching with Online Items and Offline Agents},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1600--1622},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01202-3},
doi = {10.1007/S00453-023-01202-3},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeldmanFLMR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeldmanS24,
author = {Moran Feldman and
Ariel Szarf},
title = {Maximum Matching Sans Maximal Matching: {A} New Approach for Finding
Maximum Matchings in the Data Stream Model},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1173--1209},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01190-4},
doi = {10.1007/S00453-023-01190-4},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeldmanS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FraigniaudMRT24,
author = {Pierre Fraigniaud and
Pedro Montealegre and
Ivan Rapaport and
Ioan Todinca},
title = {A Meta-Theorem for Distributed Certification},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {585--612},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01185-1},
doi = {10.1007/S00453-023-01185-1},
timestamp = {Thu, 01 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FraigniaudMRT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GaikwadM24,
author = {Ajinkya Gaikwad and
Soumen Maity},
title = {On Structural Parameterizations of the Harmless Set Problem},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1475--1511},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01199-9},
doi = {10.1007/S00453-023-01199-9},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GaikwadM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GalbyMSST24,
author = {Esther Galby and
D{\'{a}}niel Marx and
Philipp Schepper and
Roohani Sharma and
Prafullkumar Tale},
title = {Domination and Cut Problems on Chordal Graphs with Bounded Leafage},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1428--1474},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01196-y},
doi = {10.1007/S00453-023-01196-Y},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GalbyMSST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GhoshGR24,
author = {Sumanta Ghosh and
Rohit Gurjar and
Roshan Raj},
title = {A Deterministic Parallel Reduction from Weighted Matroid Intersection
Search to Decision},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1057--1079},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01184-2},
doi = {10.1007/S00453-023-01184-2},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GhoshGR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GimaO24,
author = {Tatsuya Gima and
Yota Otachi},
title = {Extended {MSO} Model Checking via Small Vertex Integrity},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {147--170},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01161-9},
doi = {10.1007/S00453-023-01161-9},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GimaO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GoldbergR24,
author = {Leslie Ann Goldberg and
Marc Roth},
title = {Parameterised and Fine-Grained Subgraph Counting, Modulo 2},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {944--1005},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01178-0},
doi = {10.1007/S00453-023-01178-0},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GoldbergR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GongCH24,
author = {Mingyang Gong and
Zhi{-}Zhong Chen and
Kuniteru Hayashi},
title = {Approximation Algorithms for Multiprocessor Scheduling with Testing
to Minimize the Total Job Completion Time},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1400--1427},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01198-w},
doi = {10.1007/S00453-023-01198-W},
timestamp = {Mon, 13 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GongCH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GowdaLPPS24,
author = {Kishen N. Gowda and
Aditya Lonkar and
Fahad Panolan and
Vraj Patel and
Saket Saurabh},
title = {Improved {FPT} Algorithms for Deletion to Forest-Like Structures},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1657--1699},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01206-z},
doi = {10.1007/S00453-023-01206-Z},
timestamp = {Sat, 04 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GowdaLPPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuoLLZ24,
author = {Xiangyu Guo and
Shi Li and
Kelin Luo and
Yuhao Zhang},
title = {Minimizing the Maximum Flow Time in the Online Food Delivery Problem},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {907--943},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01177-1},
doi = {10.1007/S00453-023-01177-1},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuoLLZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HanakaKOY24,
author = {Tesshu Hanaka and
Hironori Kiya and
Hirotaka Ono and
Kanae Yoshiwatari},
title = {Winner Determination Algorithms for Graph Games with Matching Structures},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {808--824},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01136-w},
doi = {10.1007/S00453-023-01136-W},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HanakaKOY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Haviv24,
author = {Ishay Haviv},
title = {On Finding Constrained Independent Sets in Cycles},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1006--1030},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01179-z},
doi = {10.1007/S00453-023-01179-Z},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Haviv24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HsiehLLP24,
author = {Sun{-}Yuan Hsieh and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Sheng{-}Lung Peng},
title = {On the d-Claw Vertex Deletion Problem},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {505--525},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01144-w},
doi = {10.1007/S00453-023-01144-W},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HsiehLLP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangYL24,
author = {Liting Huang and
Wei Yu and
Zhaohui Liu},
title = {Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover
Problem and Its Variants},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1135--1162},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01187-z},
doi = {10.1007/S00453-023-01187-Z},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangYL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HyattDenesikRS24,
author = {Dylan Hyatt{-}Denesik and
Mirmahdi Rahgoshay and
Mohammad R. Salavatipour},
title = {Approximations for Throughput Maximization},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1545--1577},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01201-4},
doi = {10.1007/S00453-023-01201-4},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HyattDenesikRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KawaseS24,
author = {Yasushi Kawase and
Hanna Sumita},
title = {Randomized Strategies for Robust Combinatorial Optimization with Approximate
Separation},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {566--584},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01175-3},
doi = {10.1007/S00453-023-01175-3},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KawaseS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KoCCHL24,
author = {Sheng{-}Yen Ko and
Ho{-}Lin Chen and
Siu{-}Wing Cheng and
Wing{-}Kai Hon and
Chung{-}Shou Liao},
title = {Polynomial-time Combinatorial Algorithm for General Max-Min Fair Allocation},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {485--504},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01105-3},
doi = {10.1007/S00453-023-01105-3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KoCCHL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KociumakaNO24,
author = {Tomasz Kociumaka and
Gonzalo Navarro and
Francisco Olivares},
title = {Near-Optimal Search Time in {\(\delta\)}-Optimal Space, and Vice Versa},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1031--1056},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01186-0},
doi = {10.1007/S00453-023-01186-0},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KociumakaNO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LehreQ24,
author = {Per Kristian Lehre and
Xiaoyu Qin},
title = {More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms
in Uncertain Environments},
journal = {Algorithmica},
volume = {86},
number = {2},
pages = {396--441},
year = {2024},
url = {https://doi.org/10.1007/s00453-022-01044-5},
doi = {10.1007/S00453-022-01044-5},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LehreQ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LianDWXZ24,
author = {Yuefang Lian and
Donglei Du and
Xiao Wang and
Dachuan Xu and
Yang Zhou},
title = {Stochastic Variance Reduction for DR-Submodular Maximization},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1335--1364},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01195-z},
doi = {10.1007/S00453-023-01195-Z},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LianDWXZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LuckeM24,
author = {Felicia Lucke and
Felix Mann},
title = {Reducing Graph Parameters by Contractions and Deletions},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {825--851},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01141-z},
doi = {10.1007/S00453-023-01141-Z},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LuckeM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MaackHP24,
author = {Marten Maack and
Friedhelm Meyer auf der Heide and
Simon Pukrop},
title = {Server Cloud Scheduling},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1210--1245},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01189-x},
doi = {10.1007/S00453-023-01189-X},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MaackHP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MaitiD24,
author = {Arnab Maiti and
Palash Dey},
title = {On Parameterized Complexity of Binary Networked Public Goods Game},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {307--333},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01174-4},
doi = {10.1007/S00453-023-01174-4},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MaitiD24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MienoF24,
author = {Takuya Mieno and
Mitsuru Funakoshi},
title = {Data Structures for Computing Unique Palindromes in Static and Non-Static
Strings},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {852--873},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01170-8},
doi = {10.1007/S00453-023-01170-8},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MienoF24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MunchRS24,
author = {Miriam M{\"{u}}nch and
Ignaz Rutter and
Peter Stumpf},
title = {Partial and Simultaneous Transitive Orientations via Modular Decompositions},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1263--1292},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01188-y},
doi = {10.1007/S00453-023-01188-Y},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MunchRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PapadopoulosT24,
author = {Charis Papadopoulos and
Spyridon Tzimas},
title = {Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized
by Leafage},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {874--906},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01149-5},
doi = {10.1007/S00453-023-01149-5},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PapadopoulosT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PapadopoulosZ24,
author = {Charis Papadopoulos and
Athanasios E. Zisis},
title = {Computing and Listing Avoidable Vertices and Paths},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {281--306},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01168-2},
doi = {10.1007/S00453-023-01168-2},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PapadopoulosZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PunziCGR24,
author = {Giulia Punzi and
Alessio Conte and
Roberto Grossi and
Romeo Rizzi},
title = {Refined Bounds on the Number of Eulerian Tours in Undirected Graphs},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {194--217},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01162-8},
doi = {10.1007/S00453-023-01162-8},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PunziCGR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Qi24,
author = {Benjamin Qi},
title = {On Maximizing Sums of Non-monotone Submodular and Linear Functions},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1080--1134},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01183-3},
doi = {10.1007/S00453-023-01183-3},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Qi24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Raczek24,
author = {Joanna Raczek},
title = {Complexity Issues on of Secondary Domination Number},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1163--1172},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01192-2},
doi = {10.1007/S00453-023-01192-2},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Raczek24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/XiaoHC24,
author = {Mingyu Xiao and
Sen Huang and
Xiaoyu Chen},
title = {Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms
on Sparse Graphs},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1293--1334},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01197-x},
doi = {10.1007/S00453-023-01197-X},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/XiaoHC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/XuCWZZZ24,
author = {Yicheng Xu and
Vincent Chau and
Chenchen Wu and
Yong Zhang and
Vassilis Zissimopoulos and
Yifei Zou},
title = {A Semi Brute-Force Search Approach for (Balanced) Clustering},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {130--146},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01158-4},
doi = {10.1007/S00453-023-01158-4},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/XuCWZZZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AboulkerBKS23,
author = {Pierre Aboulker and
{\'{E}}douard Bonnet and
Eun Jung Kim and
Florian Sikora},
title = {Grundy Coloring and Friends, Half-Graphs, Bicliques},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {1--28},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01001-2},
doi = {10.1007/S00453-022-01001-2},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AboulkerBKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AggarwalDDHMO23,
author = {Divesh Aggarwal and
Nico D{\"{o}}ttling and
Jesko Dujmovic and
Mohammad Hajiabadi and
Giulio Malavolta and
Maciej Obremski},
title = {Algebraic Restriction Codes and Their Applications},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3602--3648},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01150-y},
doi = {10.1007/S00453-023-01150-Y},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AggarwalDDHMO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgrawalCNNR23,
author = {Akanksha Agrawal and
Pratibha Choudhary and
N. S. Narayanaswamy and
K. K. Nisha and
Vijayaragunathan Ramamoorthi},
title = {Parameterized Complexity of Minimum Membership Dominating Set},
journal = {Algorithmica},
volume = {85},
number = {11},
pages = {3430--3452},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01139-7},
doi = {10.1007/S00453-023-01139-7},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgrawalCNNR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AhnEKO23,
author = {Jungho Ahn and
Eduard Eiben and
O{-}joung Kwon and
Sang{-}il Oum},
title = {A Polynomial Kernel for 3-Leaf Power Deletion},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3058--3087},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01129-9},
doi = {10.1007/S00453-023-01129-9},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AhnEKO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AkmalCJRW23,
author = {Shyan Akmal and
Lijie Chen and
Ce Jin and
Malvika Raj and
R. Ryan Williams},
title = {Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained
Complexity},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2395--2426},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01102-6},
doi = {10.1007/S00453-023-01102-6},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AkmalCJRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AkmalJ23,
author = {Shyan Akmal and
Ce Jin},
title = {Near-Optimal Quantum Algorithms for String Problems},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2260--2317},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01092-x},
doi = {10.1007/S00453-022-01092-X},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AkmalJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlamBGKP23,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {Lazy Queue Layouts of Posets},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1176--1201},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01067-y},
doi = {10.1007/S00453-022-01067-Y},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlamBGKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersGJ23,
author = {Susanne Albers and
Waldo G{\'{a}}lvez and
Maximilian Janke},
title = {Machine Covering in the Random-Order Model},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1560--1585},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01011-0},
doi = {10.1007/S00453-022-01011-0},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersGJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlecuALM23,
author = {Bogdan Alecu and
Aistis Atminas and
Vadim V. Lozin and
Dmitriy S. Malyshev},
title = {Combinatorics and Algorithms for Quasi-Chain Graphs},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {642--664},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01019-6},
doi = {10.1007/S00453-022-01019-6},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlecuALM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmirBLMS23,
author = {Amihood Amir and
Ayelet Butman and
Gad M. Landau and
Shoshana Marcus and
Dina Sokol},
title = {Double String Tandem Repeats},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {170--187},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01016-9},
doi = {10.1007/S00453-022-01016-9},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AmirBLMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AndresDHIN23,
author = {Stephan Dominique Andres and
Fran{\c{c}}ois Dross and
Melissa A. Huggan and
Fionn Mc Inerney and
Richard J. Nowakowski},
title = {The Complexity of Two Colouring Games},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {1067--1090},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01069-w},
doi = {10.1007/S00453-022-01069-W},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndresDHIN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngeliniBFG23,
author = {Patrizio Angelini and
Michael A. Bekos and
Henry F{\"{o}}rster and
Martin Gronemann},
title = {Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in
the Variable Embedding Scenario},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2667--2692},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01111-5},
doi = {10.1007/S00453-023-01111-5},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AngeliniBFG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngelopoulosDJ23,
author = {Spyros Angelopoulos and
Christoph D{\"{u}}rr and
Shendan Jin},
title = {Best-of-Both-Worlds Analysis of Online Search},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3766--3792},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01165-5},
doi = {10.1007/S00453-023-01165-5},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AngelopoulosDJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AniDDHL23,
author = {Joshua Ani and
Erik D. Demaine and
Yevhenii Diomidov and
Dylan H. Hendrickson and
Jayson Lynch},
title = {Traversability, Reconfiguration, and Reachability in the Gadget Framework},
journal = {Algorithmica},
volume = {85},
number = {11},
pages = {3453--3486},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01140-0},
doi = {10.1007/S00453-023-01140-0},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AniDDHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnriquezS23,
author = {Alberto Rojas Anr{\'{\i}}quez and
Maya Stein},
title = {3-Colouring P\({}_{\mbox{t}}\)-Free Graphs Without Short Odd Cycles},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {831--853},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01049-0},
doi = {10.1007/S00453-022-01049-0},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnriquezS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AraujoBCHMNS23,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Julien Bensmail and
Victor A. Campos and
Fr{\'{e}}d{\'{e}}ric Havet and
Ana Karolinna Maia and
Nicolas Nisse and
Ana Silva},
title = {On Finding the Best and Worst Orientations for the Metric Dimension},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {2962--3002},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01132-0},
doi = {10.1007/S00453-023-01132-0},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AraujoBCHMNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AraujoBCS23,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Marin Bougeret and
Victor A. Campos and
Ignasi Sau},
title = {Parameterized Complexity of Computing Maximum Minimal Blocking and
Hitting Sets},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {444--491},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01036-5},
doi = {10.1007/S00453-022-01036-5},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AraujoBCS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AsudehBDS23,
author = {Abolfazl Asudeh and
Tanya Y. Berger{-}Wolf and
Bhaskar DasGupta and
Anastasios Sidiropoulos},
title = {Maximizing Coverage While Ensuring Fairness: {A} Tale of Conflicting
Objectives},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1287--1331},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01072-1},
doi = {10.1007/S00453-022-01072-1},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AsudehBDS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarMPT23,
author = {Yossi Azar and
Chay Machluf and
Boaz Patt{-}Shamir and
Noam Touitou},
title = {Competitive Vertex Recoloring},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {2001--2027},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01076-x},
doi = {10.1007/S00453-022-01076-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AzarMPT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BacicMS23,
author = {Joyce Bacic and
Saeed Mehrabi and
Michiel Smid},
title = {Shortest Beer Path Queries in Outerplanar Graphs},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1679--1705},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01045-4},
doi = {10.1007/S00453-022-01045-4},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BacicMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaeY23,
author = {Sang Won Bae and
Sang Duk Yoon},
title = {Empty Squares in Arbitrary Orientation Among Points},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {29--74},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01002-1},
doi = {10.1007/S00453-022-01002-1},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BaeY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bandyapadhyay23,
author = {Sayan Bandyapadhyay},
title = {Improved Bounds for Metric Capacitated Covering Problems},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {1825--1849},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01084-x},
doi = {10.1007/S00453-022-01084-X},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Bandyapadhyay23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BandyapadhyayBB23,
author = {Sayan Bandyapadhyay and
Aritra Banik and
Sujoy Bhore},
title = {On Colorful Vertex and Edge Cover Problems},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3816--3827},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01164-6},
doi = {10.1007/S00453-023-01164-6},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BandyapadhyayBB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanerjeeCP23,
author = {Sumanta Banerjee and
Juhi Chaudhary and
Dinabandhu Pradhan},
title = {Unique Response Roman Domination: Complexity and Algorithms},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3889--3927},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01171-7},
doi = {10.1007/S00453-023-01171-7},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BanerjeeCP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarNoyPPR23,
author = {Amotz Bar{-}Noy and
David Peleg and
Mor Perry and
Dror Rawitz},
title = {Composed Degree-Distance Realizations of Graphs},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {665--687},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01055-2},
doi = {10.1007/S00453-022-01055-2},
timestamp = {Wed, 08 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BarNoyPPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarequetB23,
author = {Gill Barequet and
Gil Ben{-}Shachar},
title = {Algorithms for Counting Minimum-Perimeter Lattice Animals},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {75--99},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01008-9},
doi = {10.1007/S00453-022-01008-9},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BarequetB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeisegelKSS23,
author = {Jesse Beisegel and
Ekkehard K{\"{o}}hler and
Robert Scheffler and
Martin Strehler},
title = {Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity
of Threshold and Chain Graphs},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2454--2481},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01107-1},
doi = {10.1007/S00453-023-01107-1},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BeisegelKSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosGR23,
author = {Michael A. Bekos and
Martin Gronemann and
Chrysanthi N. Raftopoulou},
title = {An Improved Upper Bound on the Queue Number of Planar Graphs},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {544--562},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01037-4},
doi = {10.1007/S00453-022-01037-4},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosGR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BellittoLOPS23,
author = {Thomas Bellitto and
Shaohua Li and
Karolina Okrasa and
Marcin Pilipczuk and
Manuel Sorge},
title = {The Complexity of Routing Problems in Forbidden-Transition Graphs
and Edge-Colored Graphs},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1202--1250},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01064-1},
doi = {10.1007/S00453-022-01064-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BellittoLOPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BentertN23,
author = {Matthias Bentert and
Andr{\'{e}} Nichterlein},
title = {Parameterized Complexity of Diameter},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {325--351},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01032-9},
doi = {10.1007/S00453-022-01032-9},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BentertN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BerceaE23,
author = {Ioana O. Bercea and
Guy Even},
title = {Dynamic Dictionaries for Multisets and Counting Filters with Constant
Time Operations},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1786--1804},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01057-0},
doi = {10.1007/S00453-022-01057-0},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BerceaE23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bereg23,
author = {Sergey Bereg},
title = {Computing Balanced Convex Partitions of Lines},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2515--2528},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01082-z},
doi = {10.1007/S00453-022-01082-Z},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Bereg23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergKMT23,
author = {Mark de Berg and
S{\'{a}}ndor Kisfaludi{-}Bak and
Morteza Monemizadeh and
Leonidas Theocharous},
title = {Clique-Based Separators for Geometric Intersection Graphs},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1652--1678},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01041-8},
doi = {10.1007/S00453-022-01041-8},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BergKMT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergMU23,
author = {Mark de Berg and
Aleksandar Markovic and
Seeun William Umboh},
title = {The Online Broadcast Range-Assignment Problem},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3928--3956},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01166-4},
doi = {10.1007/S00453-023-01166-4},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergMU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BertheMPS23,
author = {Ga{\'{e}}tan Berthe and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {The Complexity of L(p, q)-Edge-Labelling},
journal = {Algorithmica},
volume = {85},
number = {11},
pages = {3406--3429},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01120-4},
doi = {10.1007/S00453-023-01120-4},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BertheMPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhangaleS23,
author = {Amey Bhangale and
Aleksa Stankovic},
title = {Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2693--2734},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01115-1},
doi = {10.1007/S00453-023-01115-1},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BhangaleS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhoreCKZ23,
author = {Sujoy Bhore and
Paz Carmi and
Sudeshna Kolay and
Meirav Zehavi},
title = {Parameterized Study of Steiner Tree on Unit Disk Graphs},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {133--152},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01020-z},
doi = {10.1007/S00453-022-01020-Z},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BhoreCKZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleGPS23,
author = {Philip Bille and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Teresa Anna Steiner},
title = {Gapped Indexing for Consecutive Occurrences},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {879--901},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01051-6},
doi = {10.1007/S00453-022-01051-6},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleGPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BinucciLGDMP23,
author = {Carla Binucci and
Giordano Da Lozzo and
Emilio Di Giacomo and
Walter Didimo and
Tamara Mchedlidze and
Maurizio Patrignani},
title = {Upward Book Embeddability of st-Graphs: Complexity and Algorithms},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3521--3571},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01142-y},
doi = {10.1007/S00453-023-01142-Y},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BinucciLGDMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BirxDS23,
author = {Alexander Birx and
Yann Disser and
Kevin Schewior},
title = {Improved Bounds for Open Online Dial-a-Ride on the Line},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1372--1414},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01061-4},
doi = {10.1007/S00453-022-01061-4},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BirxDS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlasiusFK23,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Maximilian Katzmann},
title = {Efficiently Approximating Vertex Cover on Scale-Free Networks with
Underlying Hyperbolic Geometry},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3487--3520},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01143-x},
doi = {10.1007/S00453-023-01143-X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BlasiusFK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BliznetsS23,
author = {Ivan Bliznets and
Danil Sagunov},
title = {Solving Target Set Selection with Bounded Thresholds Faster than 2\({}^{\mbox{n}}\)},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {384--405},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01031-w},
doi = {10.1007/S00453-022-01031-W},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BliznetsS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonatoGMP23,
author = {Anthony Bonato and
Konstantinos Georgiou and
Calum MacRury and
Pawel Pralat},
title = {Algorithms for p-Faulty Search on a Half-Line},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2485--2514},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01075-y},
doi = {10.1007/S00453-022-01075-Y},
timestamp = {Tue, 15 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonatoGMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BousquetIKMOSW23,
author = {Nicolas Bousquet and
Takehiro Ito and
Yusuke Kobayashi and
Haruka Mizuta and
Paul Ouvrard and
Akira Suzuki and
Kunihiro Wasa},
title = {Reconfiguration of Spanning Trees with Degree Constraints or Diameter
Constraints},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2779--2816},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01117-z},
doi = {10.1007/S00453-023-01117-Z},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BousquetIKMOSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BumpusM23,
author = {Benjamin Merlin Bumpus and
Kitty Meeks},
title = {Edge Exploration of Temporal Graphs},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {688--716},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01018-7},
doi = {10.1007/S00453-022-01018-7},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BumpusM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaballeroGSW23,
author = {David Caballero and
Timothy Gomez and
Robert T. Schweller and
Tim Wylie},
title = {Unique Assembly Verification in Two-Handed Self-Assembly},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2427--2453},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01103-5},
doi = {10.1007/S00453-023-01103-5},
timestamp = {Tue, 15 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CaballeroGSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CagiriciH23,
author = {Deniz Agaoglu {\c{C}}agirici and
Petr Hlinen{\'{y}}},
title = {Efficient Isomorphism for S\({}_{\mbox{d}}\)-Graphs and T-Graphs},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {352--383},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01033-8},
doi = {10.1007/S00453-022-01033-8},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CagiriciH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CalinescuW23,
author = {Gruia C{\u{a}}linescu and
Xiaolang Wang},
title = {Combination Algorithms for Steiner Tree Variants},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {153--169},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01009-8},
doi = {10.1007/S00453-022-01009-8},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CalinescuW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CameronSTW23,
author = {Ben Cameron and
Joe Sawada and
Wei Therese and
Aaron Williams},
title = {Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient
Generation, Ranking, and Optimality},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {717--744},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01022-x},
doi = {10.1007/S00453-022-01022-X},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CameronSTW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CastiglioniCG23,
author = {Matteo Castiglioni and
Andrea Celli and
Nicola Gatti},
title = {Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2885--2921},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01123-1},
doi = {10.1007/S00453-023-01123-1},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CastiglioniCG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CavalarL23,
author = {Bruno Pasqualotto Cavalar and
Zhenjian Lu},
title = {Algorithms and Lower Bounds for Comparator Circuits from Shrinkage},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {2131--2155},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01091-y},
doi = {10.1007/S00453-022-01091-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CavalarL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenG23,
author = {Di Chen and
Mordecai J. Golin},
title = {Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation
with Dynamic Confluent Flows},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {1948--2000},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01083-y},
doi = {10.1007/S00453-022-01083-Y},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChiarelliKMPPS23,
author = {Nina Chiarelli and
Matjaz Krnc and
Martin Milanic and
Ulrich Pferschy and
Nevena Pivac and
Joachim Schauer},
title = {Fair Allocation of Indivisible Items with Conflict Graphs},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1459--1489},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01079-8},
doi = {10.1007/S00453-022-01079-8},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChiarelliKMPPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CordascoGR23,
author = {Gennaro Cordasco and
Luisa Gargano and
Adele A. Rescigno},
title = {Immunization in the Threshold Model: {A} Parameterized Complexity
Study},
journal = {Algorithmica},
volume = {85},
number = {11},
pages = {3376--3405},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01118-y},
doi = {10.1007/S00453-023-01118-Y},
timestamp = {Fri, 10 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CordascoGR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DeppertJKRT23,
author = {Max A. Deppert and
Klaus Jansen and
Arindam Khan and
Malin Rau and
Malte Tutas},
title = {Peak Demand Minimization via Sliced Strip Packing},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3649--3679},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01152-w},
doi = {10.1007/S00453-023-01152-W},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DeppertJKRT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DeshpandeP23,
author = {Amit Deshpande and
Rameshwar Pratap},
title = {One-Pass Additive-Error Subset Selection for {\(\mathscr{l}\)} \({}_{\mbox{p}}\)
Subspace Approximation and (k, p)-Clustering},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3144--3167},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01124-0},
doi = {10.1007/S00453-023-01124-0},
timestamp = {Thu, 05 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DeshpandeP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DeyFNS23,
author = {Sanjana Dey and
Florent Foucaud and
Subhas C. Nandy and
Arunabha Sen},
title = {Complexity and Approximation for Discriminating and Identifying Code
Problems in Geometric Setups},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {1850--1882},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01073-0},
doi = {10.1007/S00453-022-01073-0},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DeyFNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DidimoKLO23,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
title = {Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel
Graphs in Linear Time},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2605--2666},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01110-6},
doi = {10.1007/S00453-023-01110-6},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DidimoKLO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DieudonnePP23,
author = {Yoann Dieudonn{\'{e}} and
Andrzej Pelc and
Franck Petit},
title = {Almost Universal Anonymous Rendezvous in the Plane},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3110--3143},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01122-2},
doi = {10.1007/S00453-023-01122-2},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DieudonnePP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DolevPS23,
author = {Shlomi Dolev and
Thomas Petig and
Elad Michael Schiller},
title = {Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly
Fair Message Passing Networks},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {216--276},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01023-w},
doi = {10.1007/S00453-022-01023-W},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DolevPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DondiL23,
author = {Riccardo Dondi and
Manuel Lafond},
title = {On the Tractability of Covering a Graph with 2-Clubs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {992--1028},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01062-3},
doi = {10.1007/S00453-022-01062-3},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DondiL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DumasPT23,
author = {Ma{\"{e}}l Dumas and
Anthony Perez and
Ioan Todinca},
title = {A Cubic Vertex-Kernel for Trivially Perfect Editing},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {1091--1110},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01070-3},
doi = {10.1007/S00453-022-01070-3},
timestamp = {Mon, 17 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DumasPT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DvorakFRR23,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Ashutosh Rai and
Pawel Rzazewski},
title = {Parameterized Inapproximability of Independent Set in H-Free Graphs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {902--928},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01052-5},
doi = {10.1007/S00453-022-01052-5},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DvorakFRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EdelsbrunnerO23,
author = {Herbert Edelsbrunner and
Georg Osang},
title = {A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {277--295},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01027-6},
doi = {10.1007/S00453-022-01027-6},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EdelsbrunnerO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Eppstein23,
author = {David Eppstein},
title = {A Stronger Lower Bound on Parametric Minimum Spanning Trees},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1738--1753},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01024-9},
doi = {10.1007/S00453-022-01024-9},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Eppstein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinM23,
author = {Leah Epstein and
Loay Mualem},
title = {Online Bin Packing of Squares and Cubes},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1415--1458},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01078-9},
doi = {10.1007/S00453-022-01078-9},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EquiNACTM23,
author = {Massimo Equi and
Tuukka Norri and
Jarno Alanko and
Bastien Cazaux and
Alexandru I. Tomescu and
Veli M{\"{a}}kinen},
title = {Algorithms and Complexity on Indexing Founder Graphs},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1586--1623},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01007-w},
doi = {10.1007/S00453-022-01007-W},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EquiNACTM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ErlebachHL23,
author = {Thomas Erlebach and
Michael Hoffmann and
Murilo Santos de Lima},
title = {Round-Competitive Algorithms for Uncertainty Problems with Parallel
Queries},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {406--443},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01035-6},
doi = {10.1007/S00453-022-01035-6},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ErlebachHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EtoIMST23,
author = {Hiroshi Eto and
Takehiro Ito and
Eiji Miyano and
Akira Suzuki and
Yuma Tamura},
title = {Happy Set Problem on Subclasses of Co-comparability Graphs},
journal = {Algorithmica},
volume = {85},
number = {11},
pages = {3327--3347},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01081-0},
doi = {10.1007/S00453-022-01081-0},
timestamp = {Wed, 08 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EtoIMST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeketeGKS23,
author = {S{\'{a}}ndor P. Fekete and
Jonas Grosse{-}Holz and
Phillip Keldenich and
Arne Schmidt},
title = {Parallel Online Algorithms for the Bin Packing Problem},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {296--323},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01030-x},
doi = {10.1007/S00453-022-01030-X},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FeketeGKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeldmanNS23,
author = {Moran Feldman and
Zeev Nutov and
Elad Shoham},
title = {Practical Budgeted Submodular Maximization},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1332--1371},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01071-2},
doi = {10.1007/S00453-022-01071-2},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeldmanNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FiltserFK23,
author = {Arnold Filtser and
Omrit Filtser and
Matthew J. Katz},
title = {Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1490--1519},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01080-1},
doi = {10.1007/S00453-022-01080-1},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FiltserFK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FlocchiniM23,
author = {Paola Flocchini and
Lucia Moura},
title = {Selected Papers of the 32nd International Workshop on Combinatorial
Algorithms, {IWOCA} 2021},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {639--641},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01054-3},
doi = {10.1007/S00453-022-01054-3},
timestamp = {Wed, 08 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FlocchiniM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FluschnikNSZ23,
author = {Till Fluschnik and
Rolf Niedermeier and
Carsten Schubert and
Philipp Zschoche},
title = {Multistage s-t Path: Confronting Similarity with Dissimilarity},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {2028--2064},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01077-w},
doi = {10.1007/S00453-022-01077-W},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FluschnikNSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ForsterV23,
author = {Sebastian Forster and
Tijn de Vos},
title = {Faster Cut Sparsification of Weighted Graphs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {929--964},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01053-4},
doi = {10.1007/S00453-022-01053-4},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ForsterV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FotakisKKS23,
author = {Dimitris Fotakis and
Anthimos Vardis Kandiros and
Vasilis Kontonis and
Stratis Skoulakis},
title = {Opinion Dynamics with Limited Information},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3855--3888},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01157-5},
doi = {10.1007/S00453-023-01157-5},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FotakisKKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FrancisHJ23,
author = {Mathew C. Francis and
Pavol Hell and
Dalu Jacob},
title = {On the Kernel and Related Problems in Interval Digraphs},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1522--1559},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01010-1},
doi = {10.1007/S00453-022-01010-1},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FrancisHJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FriedrichGLM23,
author = {Tobias Friedrich and
Hans Gawendowicz and
Pascal Lenzner and
Anna Melnichenko},
title = {Social Distancing Network Creation},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {2087--2130},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01089-6},
doi = {10.1007/S00453-022-01089-6},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FriedrichGLM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FroeseJRW23,
author = {Vincent Froese and
Brijnesh J. Jain and
Maciej Rymar and
Mathias Weller},
title = {Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {492--508},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01038-3},
doi = {10.1007/S00453-022-01038-3},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FroeseJRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Gabow23,
author = {Harold N. Gabow},
title = {Blocking Trails for f-factors of Multigraphs},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3168--3213},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01126-y},
doi = {10.1007/S00453-023-01126-Y},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Gabow23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Gabow23a,
author = {Harold N. Gabow},
title = {A Weight-Scaling Algorithm for f-Factors of Multigraphs},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3214--3289},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01127-x},
doi = {10.1007/S00453-023-01127-X},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Gabow23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GallS23,
author = {Fran{\c{c}}ois Le Gall and
Saeed Seddighin},
title = {Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms
for String Problems},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1251--1286},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01066-z},
doi = {10.1007/S00453-022-01066-Z},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GallS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GalvezGAJKR23,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Afrouz Jabal Ameli and
Klaus Jansen and
Arindam Khan and
Malin Rau},
title = {A Tight (3/2+{\(\epsilon\)} )-Approximation for Skewed Strip Packing},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3088--3109},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01130-2},
doi = {10.1007/S00453-023-01130-2},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GalvezGAJKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GanianOR23,
author = {Robert Ganian and
Sebastian Ordyniak and
C. S. Rahul},
title = {Group Activity Selection with Few Agent Types},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1111--1155},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01058-z},
doi = {10.1007/S00453-022-01058-Z},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GanianOR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GaoRV23,
author = {Yiqin Gao and
Yves Robert and
Fr{\'{e}}d{\'{e}}ric Vivien},
title = {Resource-Constrained Scheduling Algorithms for Stochastic Independent
Tasks With Unknown Probability Distribution},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2363--2394},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01100-8},
doi = {10.1007/S00453-023-01100-8},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GaoRV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GaspersL23,
author = {Serge Gaspers and
Edward J. Lee},
title = {Faster Graph Coloring in Polynomial Space},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {584--609},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01034-7},
doi = {10.1007/S00453-022-01034-7},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GaspersL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GawrychowskiU23,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
title = {Better Distance Labeling for Unweighted Planar Graphs},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1805--1823},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01133-z},
doi = {10.1007/S00453-023-01133-Z},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GawrychowskiU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GilbertRS23,
author = {Seth Gilbert and
Peter Robinson and
Suman Sourav},
title = {Leader Election in Well-Connected Graphs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {1029--1066},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01068-x},
doi = {10.1007/S00453-022-01068-X},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GilbertRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GomesGS23,
author = {Guilherme C. M. Gomes and
Matheus R. Guedes and
Vin{\'{\i}}cius Fernandes dos Santos},
title = {Structural Parameterizations for Equitable Coloring: Complexity, {FPT}
Algorithms, and Kernelization},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {1912--1947},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01085-w},
doi = {10.1007/S00453-022-01085-W},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GomesGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GualaLZ23,
author = {Luciano Gual{\`{a}} and
Stefano Leucci and
Isabella Ziccardi},
title = {Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries
in Dynamic Trees},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1624--1651},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01046-3},
doi = {10.1007/S00453-022-01046-3},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GualaLZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuptaJST23,
author = {Sushmita Gupta and
Pallavi Jain and
Saket Saurabh and
Nimrod Talmon},
title = {Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability
for Multiwinner Rules},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3717--3740},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01155-7},
doi = {10.1007/S00453-023-01155-7},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GuptaJST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HaakMPR23,
author = {Anselm Haak and
Arne Meier and
Om Prakash and
B. V. Raghavendra Rao},
title = {Parameterised Counting in Logspace},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {2923--2961},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01114-2},
doi = {10.1007/S00453-023-01114-2},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HaakMPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HarPeledJ23,
author = {Sariel Har{-}Peled and
Mitchell Jones},
title = {Few Cuts Meet Many Point Sets},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {965--975},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01059-y},
doi = {10.1007/S00453-022-01059-Y},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HarPeledJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HeLS23,
author = {Meng He and
Anna Lubiw and
Mohammad R. Salavatipour},
title = {Preface to the Special Issue on the 17th Algorithms and Data Structures
Symposium {(WADS} 2021)},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1736--1737},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01113-3},
doi = {10.1007/S00453-023-01113-3},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HeLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HenzingerJPW23,
author = {Monika Henzinger and
Billy Jin and
Richard Peng and
David P. Williamson},
title = {A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear
Systems},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3680--3716},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01154-8},
doi = {10.1007/S00453-023-01154-8},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HenzingerJPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HernandezV23,
author = {F{\'{e}}lix Hern{\'{a}}ndez and
Gerardo Vega},
title = {The Subfield and Extended Codes of a Subclass of Optimal Three-Weight
Cyclic Codes},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3973--3995},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01173-5},
doi = {10.1007/S00453-023-01173-5},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HernandezV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JahanjouKR23,
author = {Hamidreza Jahanjou and
Erez Kantor and
Rajmohan Rajaraman},
title = {Improved Algorithms for Scheduling Unsplittable Flows on Paths},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {563--583},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01043-6},
doi = {10.1007/S00453-022-01043-6},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JahanjouKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JiangNW23,
author = {Shunhua Jiang and
Bento Natura and
Omri Weinstein},
title = {A Faster Interior-Point Method for Sum-of-Squares Optimization},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2843--2884},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01112-4},
doi = {10.1007/S00453-023-01112-4},
timestamp = {Sun, 01 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JiangNW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JonssonL23,
author = {Peter Jonsson and
Victor Lagerkvist},
title = {General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {188--215},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01017-8},
doi = {10.1007/S00453-022-01017-8},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JonssonL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KashyopNNP23,
author = {Manas Jyoti Kashyop and
N. S. Narayanaswamy and
Meghana Nasre and
Sai Mohith Potluri},
title = {Trade-Offs in Dynamic Coloring for Bipartite and General Graphs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {854--878},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01050-7},
doi = {10.1007/S00453-022-01050-7},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KashyopNNP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhanS23,
author = {Arindam Khan and
Eklavya Sharma},
title = {Tight Approximation Algorithms for Geometric Bin Packing with Skewed
Items},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2735--2778},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01116-0},
doi = {10.1007/S00453-023-01116-0},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhanS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KimSA23,
author = {Kangsan Kim and
Yongho Shin and
Hyung{-}Chan An},
title = {Constant-Factor Approximation Algorithms for Parity-Constrained Facility
Location and k-Center},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {1883--1911},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01060-5},
doi = {10.1007/S00453-022-01060-5},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KimSA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KimSAA23,
author = {Mincheol Kim and
Chanyang Seo and
Taehoon Ahn and
Hee{-}Kap Ahn},
title = {Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2214--2237},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01094-9},
doi = {10.1007/S00453-022-01094-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KimSAA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kiss23,
author = {Peter Kiss},
title = {Deterministic Dynamic Matching in Worst-Case Update Time},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3741--3765},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01151-x},
doi = {10.1007/S00453-023-01151-X},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Kiss23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KleinMZ23,
author = {Philip N. Klein and
Claire Mathieu and
Hang Zhou},
title = {Correlation Clustering and Two-Edge-Connected Augmentation for Planar
Graphs},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3024--3057},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01128-w},
doi = {10.1007/S00453-023-01128-W},
timestamp = {Thu, 05 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KleinMZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlootwijkM23,
author = {Stefan Klootwijk and
Bodo Manthey},
title = {Probabilistic Analysis of Optimization Problems on Sparse Random Shortest
Path Metrics},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3793--3815},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01167-3},
doi = {10.1007/S00453-023-01167-3},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KlootwijkM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KoanaKS23,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
title = {Essentially Tight Kernels for (Weakly) Closed Graphs},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1706--1735},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01088-7},
doi = {10.1007/S00453-022-01088-7},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KoanaKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KoanaKS23a,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
title = {Computing Dense and Sparse Subgraphs of Weakly Closed Graphs},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {2156--2187},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01090-z},
doi = {10.1007/S00453-022-01090-Z},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KoanaKS23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KobayashiLMSSUY23,
author = {Kenya Kobayashi and
Guohui Lin and
Eiji Miyano and
Toshiki Saitoh and
Akira Suzuki and
Tadatoshi Utashima and
Tsuyoshi Yagita},
title = {Path Cover Problems with Length Cost},
journal = {Algorithmica},
volume = {85},
number = {11},
pages = {3348--3375},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01106-2},
doi = {10.1007/S00453-023-01106-2},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KobayashiLMSSUY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KociumakaRS23,
author = {Tomasz Kociumaka and
Jakub Radoszewski and
Tatiana Starikovskaya},
title = {Publisher Correction: Longest Common Substring with Approximately
k Mismatches},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3323},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01119-x},
doi = {10.1007/S00453-023-01119-X},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KociumakaRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KohayakawaM23,
author = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Guest Editorial: Special Issue on Theoretical Informatics},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2482--2484},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01101-7},
doi = {10.1007/S00453-023-01101-7},
timestamp = {Tue, 15 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KohayakawaM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KomarathPR23,
author = {Balagopal Komarath and
Anurag Pandey and
Chengot Sankaramenon Rahul},
title = {Monotone Arithmetic Complexity of Graph Homomorphism Polynomials},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2554--2579},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01108-0},
doi = {10.1007/S00453-023-01108-0},
timestamp = {Sun, 01 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KomarathPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KowalukL23,
author = {Miroslaw Kowaluk and
Andrzej Lingas},
title = {Rare Siblings Speed-Up Deterministic Detection and Counting of Small
Pattern Graphs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {976--991},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01063-2},
doi = {10.1007/S00453-022-01063-2},
timestamp = {Mon, 17 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KowalukL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KrauthgamerS23,
author = {Robert Krauthgamer and
Shay Sapir},
title = {Comparison of Matrix Norm Sparsification},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3957--3972},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01172-6},
doi = {10.1007/S00453-023-01172-6},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KrauthgamerS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KuceraS23,
author = {Martin Kucera and
Ondrej Such{\'{y}}},
title = {Minimum Eccentricity Shortest Path Problem with Respect to Structural
Parameters},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {762--782},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01006-x},
doi = {10.1007/S00453-022-01006-X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KuceraS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LendlWW23,
author = {Stefan Lendl and
Gerhard J. Woeginger and
Lasse Wulf},
title = {Non-Preemptive Tree Packing},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {783--804},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01026-7},
doi = {10.1007/S00453-022-01026-7},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LendlWW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LenhartLMN23,
author = {William J. Lenhart and
Giuseppe Liotta and
Debajyoti Mondal and
Rahnuma Islam Nishat},
title = {Drawing Partial 2-Trees with Few Slopes},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1156--1175},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01065-0},
doi = {10.1007/S00453-022-01065-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LenhartLMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Levin23,
author = {Asaf Levin},
title = {Online Minimization of the Maximum Starting Time: Migration Helps},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2238--2259},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01097-0},
doi = {10.1007/S00453-023-01097-0},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Levin23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LuckePR23,
author = {Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Finding Matching Cuts in H-Free Graphs},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3290--3322},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01137-9},
doi = {10.1007/S00453-023-01137-9},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LuckePR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MadireddyM23,
author = {Raghunath Reddy Madireddy and
Apurva Mudgal},
title = {A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with
Unit Disks},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {100--132},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01012-z},
doi = {10.1007/S00453-022-01012-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MadireddyM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MarcoFKPT23,
author = {Niccol{\`{o}} Di Marco and
Andrea Frosini and
William Lawrence Kocay and
Elisa Pergola and
Lama Tarsissi},
title = {Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {745--761},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-00990-4},
doi = {10.1007/S00453-022-00990-4},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MarcoFKPT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MarinoS23,
author = {Andrea Marino and
Ana Silva},
title = {Eulerian Walks in Temporal Graphs},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {805--830},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01021-y},
doi = {10.1007/S00453-022-01021-Y},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MarinoS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MartinPSL23,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2580--2604},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01109-z},
doi = {10.1007/S00453-023-01109-Z},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MartinPSL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Meiburg23,
author = {Alexander Meiburg},
title = {Inapproximability of Positive Semidefinite Permanents and Quantum
State Tomography},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3828--3854},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01169-1},
doi = {10.1007/S00453-023-01169-1},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Meiburg23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MisraSSZ23,
author = {Pranabendu Misra and
Saket Saurabh and
Roohani Sharma and
Meirav Zehavi},
title = {Sub-exponential Time Parameterized Algorithms for Graph Layout Problems
on Digraphs with Bounded Independence Number},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {2065--2086},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01093-w},
doi = {10.1007/S00453-022-01093-W},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MisraSSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NadeemISA23,
author = {Muhammad Faisal Nadeem and
Hamza Iqbal and
Hafiz Muhammad Afzal Siddiqui and
Muhammad Azeem},
title = {Intersecting Longest Cycles in Archimedean Tilings},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2348--2362},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01104-4},
doi = {10.1007/S00453-023-01104-4},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NadeemISA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NikoletseasRS23,
author = {Sotiris E. Nikoletseas and
Christoforos L. Raptopoulos and
Paul G. Spirakis},
title = {{MAX} {CUT} in Weighted Random Intersection Graphs and Discrepancy
of Sparse Random Set Systems},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2817--2842},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01121-3},
doi = {10.1007/S00453-023-01121-3},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/NikoletseasRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NussbaumSH23,
author = {Eyal Nussbaum and
Michael Segal and
Oles Holembovskyy},
title = {Finding Geometric Facilities with Location Privacy},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3572--3601},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01156-6},
doi = {10.1007/S00453-023-01156-6},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/NussbaumSH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PiaG23,
author = {Alberto Del Pia and
Silvia Di Gregorio},
title = {On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2189--2213},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01086-9},
doi = {10.1007/S00453-022-01086-9},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PiaG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RahmanMS23,
author = {Md. Saidur Rahman and
Petra Mutzel and
Slamin},
title = {Special Issue Dedicated to 16th International Conference and Workshops
on Algorithms and Computation, {WALCOM} 2022},
journal = {Algorithmica},
volume = {85},
number = {11},
pages = {3325--3326},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01145-9},
doi = {10.1007/S00453-023-01145-9},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/RahmanMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RavelomananaA23,
author = {Vlady Ravelomanana and
Ny Aina Andriambolamalala},
title = {Transmitting Once to Elect a Leader on Wireless Networks},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2529--2553},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01095-2},
doi = {10.1007/S00453-023-01095-2},
timestamp = {Sun, 01 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RavelomananaA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ReidlS23,
author = {Felix Reidl and
Blair D. Sullivan},
title = {A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion
Classes},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2318--2347},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01096-1},
doi = {10.1007/S00453-023-01096-1},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ReidlS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SawadaW23,
author = {Joe Sawada and
Aaron Williams},
title = {Constructing the first (and coolest) fixed-content universal cycle},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1754--1785},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01047-2},
doi = {10.1007/S00453-022-01047-2},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SawadaW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SubramaniW23,
author = {K. Subramani and
Piotr Wojciechowski},
title = {Integer Feasibility and Refutations in {UTVPI} Constraints Using Bit-Scaling},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {610--637},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01048-1},
doi = {10.1007/S00453-022-01048-1},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/SubramaniW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/TsakalidisWZ23,
author = {Konstantinos Tsakalidis and
Sebastian Wild and
Viktor Zamaraev},
title = {Succinct Permutation Graphs},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {509--543},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01039-2},
doi = {10.1007/S00453-022-01039-2},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/TsakalidisWZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WangMSS23,
author = {Yishu Wang and
Arnaud Mary and
Marie{-}France Sagot and
Blerina Sinaimeri},
title = {A General Framework for Enumerating Equivalence Classes of Solutions},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3003--3023},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01131-1},
doi = {10.1007/S00453-023-01131-1},
timestamp = {Wed, 06 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/WangMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X23,
title = {Special Issue on Algorithms and Computation {(ISAAC} 2021)},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1521},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01134-y},
doi = {10.1007/S00453-023-01134-Y},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/X23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AbamBFMS22,
author = {Mohammad Ali Abam and
Mark de Berg and
Sina Farahzad and
Mir Omid Haji Mirsadeghi and
Morteza Saghafian},
title = {Preclustering Algorithms for Imprecise Points},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1467--1489},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00929-9},
doi = {10.1007/S00453-022-00929-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AbamBFMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AbedinHGT22,
author = {Paniz Abedin and
Sahar Hooshmand and
Arnab Ganguly and
Sharma V. Thankachan},
title = {The Heaviest Induced Ancestors Problem: Better Data Structures and
Applications},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {2088--2105},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00955-7},
doi = {10.1007/S00453-022-00955-7},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AbedinHGT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgrawalKSST22,
author = {Akanksha Agrawal and
Madhumita Kundu and
Abhishek Sahu and
Saket Saurabh and
Prafullkumar Tale},
title = {Parameterized Complexity of Maximum Edge Colorable Subgraph},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {3075--3100},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01003-0},
doi = {10.1007/S00453-022-01003-0},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgrawalKSST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgrawalKZ22,
author = {Akanksha Agrawal and
Sudeshna Kolay and
Meirav Zehavi},
title = {Parameter Analysis for Guarding Terrains},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {961--981},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00913-9},
doi = {10.1007/S00453-021-00913-9},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgrawalKZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgrawalMPS22,
author = {Akanksha Agrawal and
Pranabendu Misra and
Fahad Panolan and
Saket Saurabh},
title = {Fast Exact Algorithms for Survivable Network Design with Uniform Requirements},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2622--2641},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00959-3},
doi = {10.1007/S00453-022-00959-3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgrawalMPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AhnKL22,
author = {Jungho Ahn and
Eun Jung Kim and
Euiwoong Lee},
title = {Towards Constant-Factor Approximation for Chordal/Distance-Hereditary
Vertex Deletion},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {2106--2133},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00963-7},
doi = {10.1007/S00453-022-00963-7},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AhnKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlistarhNS22,
author = {Dan Alistarh and
Giorgi Nadiradze and
Amirmojtaba Sabour},
title = {Dynamic Averaging Load Balancing on Cycles},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1007--1029},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00905-9},
doi = {10.1007/S00453-021-00905-9},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlistarhNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonH22,
author = {Tzvi Alon and
Nir Halman},
title = {Strongly Polynomial FPTASes for Monotone Dynamic Programs},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {2785--2819},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00954-8},
doi = {10.1007/S00453-022-00954-8},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlonH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonS22,
author = {Noga Alon and
Clara Shikhelman},
title = {Additive Approximation of Generalized Tur{\'{a}}n Questions},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {464--481},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00899-4},
doi = {10.1007/S00453-021-00899-4},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlonS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlzamelILP22,
author = {Mai Alzamel and
Costas S. Iliopoulos and
Dimitrios Letsios and
Nicola Prezza},
title = {Special Issue of Algorithmica for the 28th London Stringology Days
{\&} London Algorithmic Workshop {(LSD} {\&} {LAW)}},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {565},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00901-z},
doi = {10.1007/S00453-021-00901-Z},
timestamp = {Fri, 18 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlzamelILP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmirBKLS22,
author = {Amihood Amir and
Ayelet Butman and
Eitan Kondratovsky and
Avivit Levy and
Dina Sokol},
title = {Multidimensional Period Recovery},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1490--1510},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00926-y},
doi = {10.1007/S00453-022-00926-Y},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmirBKLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnGIJKN22,
author = {Haozhe An and
Mohit Gurumukhani and
Russell Impagliazzo and
Michael Jaber and
Marvin K{\"{u}}nnemann and
Maria Paula Parga Nina},
title = {The Fine-Grained Complexity of Multi-Dimensional Ordering Properties},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3156--3191},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01014-x},
doi = {10.1007/S00453-022-01014-X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnGIJKN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnO22,
author = {Shinwoo An and
Eunjin Oh},
title = {Reachability Problems for Transmission Graphs},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {2820--2841},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00985-1},
doi = {10.1007/S00453-022-00985-1},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntipovBD22,
author = {Denis Antipov and
Maxim Buzdalov and
Benjamin Doerr},
title = {Fast Mutation in Crossover-Based Algorithms},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1724--1761},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00957-5},
doi = {10.1007/S00453-022-00957-5},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AntipovBD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntipovDK22,
author = {Denis Antipov and
Benjamin Doerr and
Vitalii Karavaev},
title = {A Rigorous Runtime Analysis of the {(1} + ({\(\lambda\)} , {\(\lambda\)}
{))} {GA} on Jump Functions},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1573--1602},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00907-7},
doi = {10.1007/S00453-021-00907-7},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AntipovDK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntonyGPSSS22,
author = {Dhanyamol Antony and
Jay Garchar and
Sagartanu Pal and
R. B. Sandeep and
Sagnik Sen and
R. Subashini},
title = {On Subgraph Complementation to H-free Graphs},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {2842--2870},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00991-3},
doi = {10.1007/S00453-022-00991-3},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AntonyGPSSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AraujoBCS22,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Marin Bougeret and
Victor A. Campos and
Ignasi Sau},
title = {Introducing lop-Kernels: {A} Framework for Kernelization Lower Bounds},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3365--3406},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00979-z},
doi = {10.1007/S00453-022-00979-Z},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AraujoBCS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArroyueloR22,
author = {Diego Arroyuelo and
Rajeev Raman},
title = {Adaptive Succinctness},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {694--718},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00872-1},
doi = {10.1007/S00453-021-00872-1},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ArroyueloR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArvindCDM22,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Fast Exact Algorithms Using Hadamard Product of Polynomials},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {436--463},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00900-0},
doi = {10.1007/S00453-021-00900-0},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ArvindCDM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArvindG22,
author = {Vikraman Arvind and
Venkatesan Guruswami},
title = {{CNF} Satisfiability in a Subspace and Related Problems},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3276--3299},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00958-4},
doi = {10.1007/S00453-022-00958-4},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ArvindG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AshvinkumarGLNR22,
author = {Vikrant Ashvinkumar and
Joachim Gudmundsson and
Christos Levcopoulos and
Bengt J. Nilsson and
Andr{\'{e}} van Renssen},
title = {Local Routing in Sparse and Lightweight Geometric Graphs},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1316--1340},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00930-2},
doi = {10.1007/S00453-022-00930-2},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AshvinkumarGLNR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BajpaiKKLS22,
author = {Swapnam Bajpai and
Vaibhav Krishan and
Deepanshu Kush and
Nutan Limaye and
Srikanth Srinivasan},
title = {A {\#}SAT Algorithm for Small Constant-Depth Circuits with {PTF} gates},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1132--1162},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00915-7},
doi = {10.1007/S00453-021-00915-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BajpaiKKLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bandyapadhyay22,
author = {Sayan Bandyapadhyay},
title = {On Perturbation Resilience of Non-uniform k-Center},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {13--36},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00887-8},
doi = {10.1007/S00453-021-00887-8},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Bandyapadhyay22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bang-JensenEGWY22,
author = {J{\o}rgen Bang{-}Jensen and
Eduard Eiben and
Gregory Z. Gutin and
Magnus Wahlstr{\"{o}}m and
Anders Yeo},
title = {Component Order Connectivity in Directed Graphs},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2767--2784},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01004-z},
doi = {10.1007/S00453-022-01004-Z},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Bang-JensenEGWY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BannachHRT22,
author = {Max Bannach and
Zacharias Heinrich and
R{\"{u}}diger Reischuk and
Till Tantau},
title = {Dynamic Kernels for Hitting Sets and Set Packing},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3459--3488},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00986-0},
doi = {10.1007/S00453-022-00986-0},
timestamp = {Mon, 14 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BannachHRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarequetS22,
author = {Gill Barequet and
Mira Shalah},
title = {Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3559--3586},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00948-6},
doi = {10.1007/S00453-022-00948-6},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BarequetS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BasteT22,
author = {Julien Baste and
Dimitrios M. Thilikos},
title = {Contraction Bidimensionality of Geometric Intersection Graphs},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {510--531},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00912-w},
doi = {10.1007/S00453-021-00912-W},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BasteT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaGK22,
author = {Surender Baswana and
Shiv Kumar Gupta and
Till Knollmann},
title = {Mincut Sensitivity Data Structures for the Insertion of an Edge},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2702--2734},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00978-0},
doi = {10.1007/S00453-022-00978-0},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaGK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaGT22,
author = {Surender Baswana and
Shiv Kumar Gupta and
Ayush Tulsyan},
title = {Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet
Efficient},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {2028--2049},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00947-7},
doi = {10.1007/S00453-022-00947-7},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaGT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BathieBCKP22,
author = {Gabriel Bathie and
Nicolas Bousquet and
Yixin Cao and
Yuping Ke and
Th{\'{e}}o Pierron},
title = {(Sub)linear Kernels for Edge Modification Problems Toward Structured
Graph Classes},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3338--3364},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00969-1},
doi = {10.1007/S00453-022-00969-1},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BathieBCKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosGDLM22,
author = {Michael A. Bekos and
Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta and
Fabrizio Montecchiani},
title = {Universal Slope Sets for Upward Planar Drawings},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2556--2580},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00975-3},
doi = {10.1007/S00453-022-00975-3},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosGDLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteHKKKKLO22,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Masaaki Kanzaki and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of (A, {\(\mathscr{l}\)} )-Path Packing},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {871--895},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00875-y},
doi = {10.1007/S00453-021-00875-Y},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteHKKKKLO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BenknerW22,
author = {Louisa Seelbach Benkner and
Stephan G. Wagner},
title = {Distinct Fringe Subtrees in Random Trees},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3686--3728},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01013-y},
doi = {10.1007/S00453-022-01013-Y},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BenknerW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BensmailFIN22,
author = {Julien Bensmail and
Foivos Fioravantes and
Fionn Mc Inerney and
Nicolas Nisse},
title = {The Largest Connected Subgraph Game},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2533--2555},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00973-5},
doi = {10.1007/S00453-022-00973-5},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BensmailFIN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BensmailFN22,
author = {Julien Bensmail and
Foivos Fioravantes and
Nicolas Nisse},
title = {On Proper Labellings of Graphs with Minimum Label Sum},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1030--1063},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00903-x},
doi = {10.1007/S00453-021-00903-X},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BensmailFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergougnouxPT22,
author = {Benjamin Bergougnoux and
Charis Papadopoulos and
Jan Arne Telle},
title = {Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded
Mim-Width},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1385--1417},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00936-w},
doi = {10.1007/S00453-022-00936-W},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergougnouxPT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhyravarapuKM22,
author = {Sriram Bhyravarapu and
Subrahmanyam Kalyanasundaram and
Rogers Mathew},
title = {Conflict-Free Coloring Bounds on Open Neighborhoods},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2154--2185},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00956-6},
doi = {10.1007/S00453-022-00956-6},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BhyravarapuKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloGLP22,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {37--59},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00879-8},
doi = {10.1007/S00453-021-00879-8},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloGLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazBLM22,
author = {Ahmad Biniaz and
Prosenjit Bose and
Anna Lubiw and
Anil Maheshwari},
title = {Bounded-Angle Minimum Spanning Trees},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {150--175},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00889-6},
doi = {10.1007/S00453-021-00889-6},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazBLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlairHLL22,
author = {Jean R. S. Blair and
Pinar Heggernes and
Paloma T. Lima and
Daniel Lokshtanov},
title = {On the Maximum Number of Edges in Chordal Graphs of Bounded Degree
and Matching Number},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3587--3602},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00953-9},
doi = {10.1007/S00453-022-00953-9},
timestamp = {Fri, 09 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BlairHLL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetKRTW22,
author = {{\'{E}}douard Bonnet and
Eun Jung Kim and
Amadeus Reinald and
St{\'{e}}phan Thomass{\'{e}} and
R{\'{e}}mi Watrigant},
title = {Twin-width and Polynomial Kernels},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3300--3337},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00965-5},
doi = {10.1007/S00453-022-00965-5},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetKRTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BorstIJK22,
author = {Sander Borst and
Leo van Iersel and
Mark Jones and
Steven Kelk},
title = {New {FPT} Algorithms for Finding the Temporal Hybridization Number
for Sets of Phylogenetic Trees},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {2050--2087},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00946-8},
doi = {10.1007/S00453-022-00946-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BorstIJK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BosmanEJMRS22,
author = {Thomas Bosman and
Martijn van Ee and
Yang Jiao and
Alberto Marchetti{-}Spaccamela and
R. Ravi and
Leen Stougie},
title = {Approximation Algorithms for Replenishment Problems with Fixed Turnover
Times},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2597--2621},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00974-4},
doi = {10.1007/S00453-022-00974-4},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BosmanEJMRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarFKL22,
author = {Joan Boyar and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
title = {Relaxing the Irrevocability Requirement for Online Graph Algorithms},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {1916--1951},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00944-w},
doi = {10.1007/S00453-022-00944-W},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarFKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BozykDKNO22,
author = {Lukasz Bozyk and
Jan Derbisz and
Tomasz Krawczyk and
Jana Novotn{\'{a}} and
Karolina Okrasa},
title = {Vertex Deletion into Bipartite Permutation Graphs},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2271--2291},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00923-7},
doi = {10.1007/S00453-021-00923-7},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BozykDKNO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannFHSW22,
author = {Karl Bringmann and
Nick Fischer and
Danny Hermelin and
Dvir Shabtay and
Philip Wellnitz},
title = {Faster Minimization of Tardy Processing Time on a Single Machine},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1341--1356},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00928-w},
doi = {10.1007/S00453-022-00928-W},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannFHSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrucknerKM22,
author = {Guido Br{\"{u}}ckner and
Nadine Davina Krisam and
Tamara Mchedlidze},
title = {Level-Planar Drawings with Few Slopes},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {176--196},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00884-x},
doi = {10.1007/S00453-021-00884-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrucknerKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuzdalovDDV22,
author = {Maxim Buzdalov and
Benjamin Doerr and
Carola Doerr and
Dmitry Vinokurov},
title = {Fixed-Target Runtime Analysis},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1762--1793},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00881-0},
doi = {10.1007/S00453-021-00881-0},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuzdalovDDV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CairoKRST22,
author = {Massimo Cairo and
Shahbaz Khan and
Romeo Rizzi and
Sebastian S. Schmidt and
Alexandru I. Tomescu},
title = {Safety in s-t Paths, Trails and Walks},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {719--741},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00877-w},
doi = {10.1007/S00453-021-00877-W},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CairoKRST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaoP22,
author = {Yixin Cao and
Marcin Pilipczuk},
title = {Preface to the Special Issue on Parameterized and Exact Computation},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2240--2241},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00998-w},
doi = {10.1007/S00453-022-00998-W},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CaoP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaoRSY22,
author = {Yixin Cao and
Ashutosh Rai and
R. B. Sandeep and
Junjie Ye},
title = {A Polynomial Kernel for Diamond-Free Editing},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {197--215},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00891-y},
doi = {10.1007/S00453-021-00891-Y},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CaoRSY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaragiannisKV22,
author = {Ioannis Caragiannis and
Panagiotis Kanellopoulos and
Alexandros A. Voudouris},
title = {Bounding the Inefficiency of Compromise in Opinion Formation},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {234--271},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00892-x},
doi = {10.1007/S00453-021-00892-X},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CaragiannisKV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CastermansSSV22,
author = {Thom Castermans and
Bettina Speckmann and
Frank Staals and
Kevin Verbeek},
title = {Agglomerative Clustering of Growing Squares},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {216--233},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00873-0},
doi = {10.1007/S00453-021-00873-0},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CastermansSSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CavalarKR22,
author = {Bruno Pasqualotto Cavalar and
Mrinal Kumar and
Benjamin Rossman},
title = {Monotone Circuit Lower Bounds from Robust Sunflowers},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3655--3685},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01000-3},
doi = {10.1007/S00453-022-01000-3},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CavalarKR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChandrasekaranW22,
author = {Karthekeyan Chandrasekaran and
Weihang Wang},
title = {{\(\mathscr{l}\)} \({}_{\mbox{p}}\)-Norm Multiway Cut},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2667--2701},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00983-3},
doi = {10.1007/S00453-022-00983-3},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChandrasekaranW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Charalampopoulos22,
author = {Panagiotis Charalampopoulos and
Costas S. Iliopoulos and
Tomasz Kociumaka and
Solon P. Pissis and
Jakub Radoszewski and
Juliusz Straszynski},
title = {Efficient Computation of Sequence Mappability},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1418--1440},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00934-y},
doi = {10.1007/S00453-022-00934-Y},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Charalampopoulos22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenHHK22,
author = {Li{-}Hsuan Chen and
Sun{-}Yuan Hsieh and
Ling{-}Ju Hung and
Ralf Klasing},
title = {On the Approximability of the Single Allocation p-Hub Center Problem
with Parameterized Triangle Inequality},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {1993--2027},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00941-z},
doi = {10.1007/S00453-022-00941-Z},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenHHK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChengM22,
author = {Siu{-}Wing Cheng and
Yuchen Mao},
title = {Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {1835--1874},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00942-y},
doi = {10.1007/S00453-022-00942-Y},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChengM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChimaniTW22,
author = {Markus Chimani and
Niklas Troost and
Tilo Wiedera},
title = {Approximating Multistage Matching Problems},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2135--2153},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00951-x},
doi = {10.1007/S00453-022-00951-X},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChimaniTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Choudhary22,
author = {Pratibha Choudhary},
title = {Polynomial Time Algorithms for Tracking Path Problems},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1548--1570},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00931-1},
doi = {10.1007/S00453-022-00931-1},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Choudhary22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ConteGPU22,
author = {Alessio Conte and
Roberto Grossi and
Giulia Punzi and
Takeaki Uno},
title = {Enumeration of Maximal Common Subsequences Between Two Strings},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {757--783},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00898-5},
doi = {10.1007/S00453-021-00898-5},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ConteGPU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DerbiszKMSSV22,
author = {Jan Derbisz and
Lawqueen Kanesh and
Jayakrishnan Madathil and
Abhishek Sahu and
Saket Saurabh and
Shaily Verma},
title = {A Polynomial Kernel for Bipartite Permutation Vertex Deletion},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3246--3275},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01040-9},
doi = {10.1007/S00453-022-01040-9},
timestamp = {Mon, 31 Oct 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DerbiszKMSSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DevismesIJ22,
author = {St{\'{e}}phane Devismes and
David Ilcinkas and
Colette Johnen},
title = {Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {85--123},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00878-9},
doi = {10.1007/S00453-021-00878-9},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DevismesIJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Doerr22,
author = {Benjamin Doerr},
title = {Does Comma Selection Help to Cope with Local Optima?},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1659--1693},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00896-7},
doi = {10.1007/S00453-021-00896-7},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Doerr22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DonkersJW22,
author = {Huib Donkers and
Bart M. P. Jansen and
Michal Wlodarczyk},
title = {Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel
of Quartic Size},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3407--3458},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00984-2},
doi = {10.1007/S00453-022-00984-2},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DonkersJW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DorflerRSW22,
author = {Julian D{\"{o}}rfler and
Marc Roth and
Johannes Schmitt and
Philip Wellnitz},
title = {Counting Induced Subgraphs: An Algebraic Approach to {\#}W[1]-Hardness},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {379--404},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00894-9},
doi = {10.1007/S00453-021-00894-9},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DorflerRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ducoffe22,
author = {Guillaume Ducoffe},
title = {Optimal Centrality Computations Within Bounded Clique-Width Graphs},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3192--3222},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01015-w},
doi = {10.1007/S00453-022-01015-W},
timestamp = {Mon, 31 Oct 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Ducoffe22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ducoffe22a,
author = {Guillaume Ducoffe},
title = {Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3489--3520},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00999-9},
doi = {10.1007/S00453-022-00999-9},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ducoffe22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DumitrescuT22,
author = {Adrian Dumitrescu and
Csaba D. T{\'{o}}th},
title = {Online Unit Clustering and Unit Covering in Higher Dimensions},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1213--1231},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00916-6},
doi = {10.1007/S00453-021-00916-6},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DumitrescuT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EgidiLM22,
author = {Lavinia Egidi and
Felipe A. Louza and
Giovanni Manzini},
title = {Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {639--669},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00855-2},
doi = {10.1007/S00453-021-00855-2},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EgidiLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Elbassioni22,
author = {Khaled M. Elbassioni},
title = {Approximation Algorithms for Cost-robust Discrete Minimization Problems
Based on their LP-Relaxations},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3622--3654},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00987-z},
doi = {10.1007/S00453-022-00987-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Elbassioni22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FanRB22,
author = {Chenglin Fan and
Benjamin Raichel and
Gregory Van Buskirk},
title = {Metric Violation Distance: Hardness and Approximation},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1441--1465},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00940-0},
doi = {10.1007/S00453-022-00940-0},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FanRB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeketeNSS22,
author = {S{\'{a}}ndor P. Fekete and
Eike Niehs and
Christian Scheffer and
Arne Schmidt},
title = {Connected Reconfiguration of Lattice-Based Cellular Structures by
Finite-Memory Robots},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {2954--2986},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00995-z},
doi = {10.1007/S00453-022-00995-Z},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeketeNSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Feldman22,
author = {Moran Feldman},
title = {Correction to: Guess Free Maximization of Submodular and Linear Sums},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {3101--3102},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01028-5},
doi = {10.1007/S00453-022-01028-5},
timestamp = {Sun, 09 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Feldman22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FiltserN22,
author = {Arnold Filtser and
Ofer Neiman},
title = {Light Spanners for High Dimensional Norms via Stochastic Decompositions},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {2987--3007},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00994-0},
doi = {10.1007/S00453-022-00994-0},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FiltserN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominGLMSS22,
author = {Fedor V. Fomin and
Petr A. Golovach and
William Lochet and
Pranabendu Misra and
Saket Saurabh and
Roohani Sharma},
title = {Parameterized Complexity of Directed Spanner Problems},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2292--2308},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00911-x},
doi = {10.1007/S00453-021-00911-X},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FominGLMSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FotakisKT22,
author = {Dimitris Fotakis and
Alkis Kalavasis and
Christos Tzamos},
title = {Efficient Parameter Estimation of Truncated Boolean Product Distributions},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2186--2221},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00961-9},
doi = {10.1007/S00453-022-00961-9},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FotakisKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FoucaudHLMP22,
author = {Florent Foucaud and
Herv{\'{e}} Hocquard and
Dimitri Lajou and
Valia Mitsou and
Th{\'{e}}o Pierron},
title = {Graph Modification for Edge-Coloured and Signed Graph Homomorphism
Problems: Parameterized and Classical Complexity},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1183--1212},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00918-4},
doi = {10.1007/S00453-021-00918-4},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FoucaudHLMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FoxL22,
author = {Kyle Fox and
Xinyi Li},
title = {Approximating the Geometric Edit Distance},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2395--2413},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00966-4},
doi = {10.1007/S00453-022-00966-4},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FoxL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FunkMN22,
author = {Daryl Funk and
Dillon Mayhew and
Mike Newman},
title = {Tree Automata and Pigeonhole Classes of Matroids: {I}},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {1795--1834},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00939-7},
doi = {10.1007/S00453-022-00939-7},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FunkMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GasieniecKR22,
author = {Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik},
title = {Selected Papers of the 31st International Workshop on Combinatorial
Algorithms, {IWOCA} 2020},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {3103--3106},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01029-4},
doi = {10.1007/S00453-022-01029-4},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GasieniecKR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GawrychowskiMS22,
author = {Pawel Gawrychowski and
Florin Manea and
Radoslaw Serafin},
title = {Fast and Longest Rollercoasters},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1081--1106},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00908-6},
doi = {10.1007/S00453-021-00908-6},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GawrychowskiMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GawrychowskiS22,
author = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Streaming Dictionary Matching with Mismatches},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {896--916},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00876-x},
doi = {10.1007/S00453-021-00876-X},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GawrychowskiS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GibneyT22,
author = {Daniel Gibney and
Sharma V. Thankachan},
title = {On the Complexity of Recognizing Wheeler Graphs},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {784--814},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00917-5},
doi = {10.1007/S00453-021-00917-5},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GibneyT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GilS22,
author = {Jos{\'{e}} Arturo Gil and
Simone Santini},
title = {Matching Regular Expressions on uncertain data},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {532--564},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00906-8},
doi = {10.1007/S00453-021-00906-8},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GilS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachZ22,
author = {Petr A. Golovach and
Meirav Zehavi},
title = {Special Issue Dedicated to the 16th International Symposium on Parameterized
and Exact Computation},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3107--3109},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01042-7},
doi = {10.1007/S00453-022-01042-7},
timestamp = {Mon, 31 Oct 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GottschauL22,
author = {Marinus Gottschau and
Marilena Leichter},
title = {Minimum Hitting Set of Interval Bundles Problem: Computational Complexity
and Approximability},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2222--2239},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00964-6},
doi = {10.1007/S00453-022-00964-6},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GottschauL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GrammelHKL22,
author = {Nathaniel Grammel and
Lisa Hellerstein and
Devorah Kletenik and
Naifeng Liu},
title = {Algorithms for the Unit-Cost Stochastic Score Classification Problem},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {3054--3074},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00982-4},
doi = {10.1007/S00453-022-00982-4},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GrammelHKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GrezMPPR22,
author = {Alejandro Grez and
Filip Mazowiecki and
Michal Pilipczuk and
Gabriele Puppis and
Cristian Riveros},
title = {Dynamic Data Structures for Timed Automata Acceptance},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3223--3245},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01025-8},
doi = {10.1007/S00453-022-01025-8},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GrezMPPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuoKLLVX22,
author = {Xiangyu Guo and
Guy Kortsarz and
Bundit Laekhanukit and
Shi Li and
Daniel Vaz and
Jiayi Xian},
title = {On Approximating Degree-Bounded Network Design Problems},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1252--1278},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00924-0},
doi = {10.1007/S00453-022-00924-0},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuoKLLVX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HalldorssonIMT22,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Toshimasa Ishii and
Kazuhisa Makino and
Kenjiro Takazawa},
title = {Posimodular Function Optimization},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1107--1131},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00910-y},
doi = {10.1007/S00453-021-00910-Y},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HalldorssonIMT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HaraguchiN22,
author = {Kazuya Haraguchi and
Hiroshi Nagamochi},
title = {Enumeration of Support-Closed Subsets in Confluent Systems},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1279--1315},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00927-x},
doi = {10.1007/S00453-022-00927-X},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HaraguchiN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HeubergerKL22,
author = {Clemens Heuberger and
Daniel Krenn and
Gabriel F. Lipnik},
title = {Asymptotic Analysis of q-Recursive Sequences},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2480--2532},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00950-y},
doi = {10.1007/S00453-022-00950-Y},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HeubergerKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HiraiI22,
author = {Hiroshi Hirai and
Yuni Iwamasa},
title = {Reconstructing Phylogenetic Trees from Multipartite Quartet Systems},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {1875--1896},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00945-9},
doi = {10.1007/S00453-022-00945-9},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HiraiI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangFWX22,
author = {Ziyun Huang and
Qilong Feng and
Jianxin Wang and
Jinhui Xu},
title = {Small Candidate Set for Translational Pattern Search},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {3034--3053},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00997-x},
doi = {10.1007/S00453-022-00997-X},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangFWX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangP22,
author = {Dawei Huang and
Seth Pettie},
title = {Approximate Generalized Matching: f-Matchings and f-Edge Covers},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {1952--1992},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00949-5},
doi = {10.1007/S00453-022-00949-5},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HungK22,
author = {Eunpyeong Hung and
Mong{-}Jen Kao},
title = {Approximation Algorithm for Vertex Cover with Multiple Covering Constraints},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {1--12},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00885-w},
doi = {10.1007/S00453-021-00885-W},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HungK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IerselJJMZ22,
author = {Leo van Iersel and
Remie Janssen and
Mark Jones and
Yukihiro Murakami and
Norbert Zeh},
title = {A Practical Fixed-Parameter Algorithm for Constructing Tree-Child
Networks from Multiple Binary Trees},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {917--960},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00914-8},
doi = {10.1007/S00453-021-00914-8},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/IerselJJMZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JacobPRS22,
author = {Ashwin Jacob and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot},
title = {Structural Parameterizations with Modulator Oblivion},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2335--2357},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00971-7},
doi = {10.1007/S00453-022-00971-7},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JacobPRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JaffkeLP22,
author = {Lars Jaffke and
Paloma T. Lima and
Geevarghese Philip},
title = {Structural Parameterizations of Clique Coloring},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {273--303},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00890-z},
doi = {10.1007/S00453-021-00890-Z},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JaffkeLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JelinekKMNP22,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Tereza Klimosov{\'{a}} and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Aneta Pokorn{\'{a}}},
title = {On 3-Coloring of (2P\({}_{\mbox{4, C\({}_{\mbox{5}}\)}}\))-Free Graphs},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1526--1547},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00937-9},
doi = {10.1007/S00453-022-00937-9},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JelinekKMNP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KammerMS22,
author = {Frank Kammer and
Johannes Meintrup and
Andrej Sajenko},
title = {Space-Efficient Vertex Separators for Treewidth},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2414--2461},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00967-3},
doi = {10.1007/S00453-022-00967-3},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KammerMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KedzierskiR22,
author = {Aleksander Kedzierski and
Jakub Radoszewski},
title = {k-Approximate Quasiperiodicity Under Hamming and Edit Distance},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {566--589},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00842-7},
doi = {10.1007/S00453-021-00842-7},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KedzierskiR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KeijzerW22,
author = {Bart de Keijzer and
Dominik Wojtczak},
title = {Facility Reallocation on the Line},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {2898--2925},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00993-1},
doi = {10.1007/S00453-022-00993-1},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KeijzerW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KellerRSS22,
author = {Jakob Keller and
Christian Rieck and
Christian Scheffer and
Arne Schmidt},
title = {Particle-Based Assembly Using Precise Global Control},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {2871--2897},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00992-2},
doi = {10.1007/S00453-022-00992-2},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KellerRSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KleinbergO22,
author = {Jon M. Kleinberg and
Sigal Oren},
title = {Mechanisms for (Mis)allocating Scientific Credit},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {344--378},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00902-y},
doi = {10.1007/S00453-021-00902-Y},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KleinbergO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlemzR22,
author = {Boris Klemz and
G{\"{u}}nter Rote},
title = {Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum
Chain Covers in Convex Bipartite Graphs},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1064--1080},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00904-w},
doi = {10.1007/S00453-021-00904-W},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KlemzR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KobayashiO22,
author = {Yasuaki Kobayashi and
Yota Otachi},
title = {Parameterized Complexity of Graph Burning},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2379--2393},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00962-8},
doi = {10.1007/S00453-022-00962-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KobayashiO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KobayashiOOU22,
author = {Yusuke Kobayashi and
Yoshio Okamoto and
Yota Otachi and
Yushi Uno},
title = {Linear-Time Recognition of Double-Threshold Graphs},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1163--1181},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00921-9},
doi = {10.1007/S00453-021-00921-9},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KobayashiOOU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KommKKM22,
author = {Dennis Komm and
Rastislav Kr{\'{a}}lovic and
Richard Kr{\'{a}}lovic and
Tobias M{\"{o}}mke},
title = {Randomized Online Computation with High Probability Guarantees},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1357--1384},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00925-z},
doi = {10.1007/S00453-022-00925-Z},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KommKKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KontogiannisWZ22,
author = {Spyros C. Kontogiannis and
Dorothea Wagner and
Christos D. Zaroliagis},
title = {An Axiomatic Approach to Time-Dependent Shortest Path Oracles},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {815--870},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00922-8},
doi = {10.1007/S00453-021-00922-8},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KontogiannisWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KopplPR22,
author = {Dominik K{\"{o}}ppl and
Simon J. Puglisi and
Rajeev Raman},
title = {Fast and Simple Compact Hashing via Bucketing},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2735--2766},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00996-y},
doi = {10.1007/S00453-022-00996-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KopplPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Korhonen22,
author = {Tuukka Korhonen},
title = {Finding Optimal Triangulations Parameterized by Edge Clique Cover},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2242--2270},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00932-0},
doi = {10.1007/S00453-022-00932-0},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Korhonen22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KrauthgamerR22,
author = {Robert Krauthgamer and
David Reitblat},
title = {Almost-Smooth Histograms and Sliding-Window Graph Algorithms},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {2926--2953},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00988-y},
doi = {10.1007/S00453-022-00988-Y},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KrauthgamerR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LenglerN22,
author = {Johannes Lengler and
Frank Neumann},
title = {Editorial},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1571--1572},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00980-6},
doi = {10.1007/S00453-022-00980-6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LenglerN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LeucciL22,
author = {Stefano Leucci and
Chih{-}Hung Liu},
title = {Approximate Minimum Selection with Unreliable Comparisons},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {60--84},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00880-1},
doi = {10.1007/S00453-021-00880-1},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LeucciL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Levin22,
author = {Asaf Levin},
title = {Approximation Schemes for the Generalized Extensible Bin Packing Problem},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {325--343},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00895-8},
doi = {10.1007/S00453-021-00895-8},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Levin22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LevyS22,
author = {Avivit Levy and
B. Riva Shalom},
title = {A Comparative Study of Dictionary Matching with Gaps: Limitations,
Techniques and Challenges},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {590--638},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00851-6},
doi = {10.1007/S00453-021-00851-6},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LevyS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiNP22,
author = {Yaqiao Li and
Vishnu V. Narayan and
Denis Pankratov},
title = {Online Coloring and a New Type of Adversary for Online Graph Problems},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1232--1251},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00920-w},
doi = {10.1007/S00453-021-00920-W},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiNP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiP22,
author = {Shaohua Li and
Marcin Pilipczuk},
title = {Hardness of Metric Dimension in Graphs of Constant Treewidth},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3110--3155},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01005-y},
doi = {10.1007/S00453-022-01005-Y},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LiP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiXYCW22,
author = {Wenjun Li and
Chao Xu and
Yongjie Yang and
Jianer Chen and
Jianxin Wang},
title = {A Refined Branching Algorithm for the Maximum Satisfiability Problem},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {982--1006},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00938-8},
doi = {10.1007/S00453-022-00938-8},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiXYCW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LokshtanovMPS22,
author = {Daniel Lokshtanov and
Amer E. Mouawad and
Fahad Panolan and
Sebastian Siebertz},
title = {On the Parameterized Complexity of Reconfiguration of Connected Dominating
Sets},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {482--509},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00909-5},
doi = {10.1007/S00453-021-00909-5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LokshtanovMPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MerkurevS22,
author = {Oleg Merkurev and
Arseny M. Shur},
title = {Computing The Maximum Exponent in a Stream},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {742--756},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00883-y},
doi = {10.1007/S00453-021-00883-Y},
timestamp = {Fri, 18 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MerkurevS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MienoFNIBT22,
author = {Takuya Mieno and
Yuta Fujishige and
Yuto Nakashima and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
title = {Computing Minimal Unique Substrings for a Sliding Window},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {670--693},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00864-1},
doi = {10.1007/S00453-021-00864-1},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MienoFNIBT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Milani22,
author = {Marcelo Garlet Milani},
title = {A Polynomial Kernel for Funnel Arc Deletion Set},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2358--2378},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00960-w},
doi = {10.1007/S00453-022-00960-W},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Milani22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NaorUW22,
author = {Joseph (Seffi) Naor and
Seeun William Umboh and
David P. Williamson},
title = {Tight Bounds for Online Weighted Tree Augmentation},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {304--324},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00888-7},
doi = {10.1007/S00453-021-00888-7},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/NaorUW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NederlofS22,
author = {Jesper Nederlof and
C{\'{e}}line M. F. Swennenhuis},
title = {On the Fine-grained Parameterized Complexity of Partial Scheduling
to Minimize the Makespan},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2309--2334},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00970-8},
doi = {10.1007/S00453-022-00970-8},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NederlofS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Nutov22,
author = {Zeev Nutov},
title = {Approximating k-Connected m-Dominating Sets},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1511--1525},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00935-x},
doi = {10.1007/S00453-022-00935-X},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Nutov22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/OlivetoSW22,
author = {Pietro S. Oliveto and
Dirk Sudholt and
Carsten Witt},
title = {Tight Bounds on the Expected Runtime of a Standard Steady State Genetic
Algorithm},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1603--1658},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00893-w},
doi = {10.1007/S00453-021-00893-W},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/OlivetoSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PedrosaR22,
author = {Lehilton Lelis Chaves Pedrosa and
Hugo Kooki Kasuya Rosado},
title = {A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3522--3558},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00919-3},
doi = {10.1007/S00453-021-00919-3},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PedrosaR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RahgoshayS22,
author = {Mirmahdi Rahgoshay and
Mohammad R. Salavatipour},
title = {Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource
Minimization for Fire Containment},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2462--2479},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00972-6},
doi = {10.1007/S00453-022-00972-6},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RahgoshayS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RajabiW22,
author = {Amirhossein Rajabi and
Carsten Witt},
title = {Self-Adjusting Evolutionary Algorithms for Multimodal Optimization},
journal = {Algorithmica},
volume = {84},
number = {6},
pages = {1694--1723},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00933-z},
doi = {10.1007/S00453-022-00933-Z},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RajabiW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RizzoTP22,
author = {Nicola Rizzo and
Alexandru I. Tomescu and
Alberto Policriti},
title = {Solving String Problems on Graphs Using the Labeled Direct Product},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {3008--3033},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00989-x},
doi = {10.1007/S00453-022-00989-X},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RizzoTP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RongCWW22,
author = {Guozhen Rong and
Yixin Cao and
Jian{-}xin Wang and
Zhifeng Wang},
title = {Graph Searches and Their End Vertices},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2642--2666},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00981-5},
doi = {10.1007/S00453-022-00981-5},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RongCWW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SakaiI22,
author = {Yoshifumi Sakai and
Shunsuke Inenaga},
title = {A Faster Reduction of the Dynamic Time Warping Distance to the Longest
Increasing Subsequence Length},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2581--2596},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00968-2},
doi = {10.1007/S00453-022-00968-2},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SakaiI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SaurabhT22,
author = {Saket Saurabh and
Prafullkumar Tale},
title = {On the Parameterized Complexity of Maximum Degree Contraction Problem},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {405--435},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00897-6},
doi = {10.1007/S00453-021-00897-6},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SaurabhT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShimizuM22,
author = {Kazuya Shimizu and
Ryuhei Mori},
title = {Exponential-Time Quantum Algorithms for Graph Coloring Problems},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3603--3621},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00976-2},
doi = {10.1007/S00453-022-00976-2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ShimizuM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/UllrichV22,
author = {Mario Ullrich and
Jan Vyb{\'{\i}}ral},
title = {Deterministic Constructions of High-Dimensional Sets with Small Dispersion},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {1897--1915},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00943-x},
doi = {10.1007/S00453-022-00943-X},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/UllrichV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WeiHHLS22,
author = {Hao{-}Ting Wei and
Wing{-}Kai Hon and
Paul Horn and
Chung{-}Shou Liao and
Kunihiko Sadakane},
title = {Approximating Dynamic Weighted Vertex Cover with Soft Capacities},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {124--149},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00886-9},
doi = {10.1007/S00453-021-00886-9},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/WeiHHLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X22,
title = {Editor's Note: Special Issue Dedicated to the 14th Latin American
Theoretical Informatics Symposium},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3521},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01056-1},
doi = {10.1007/S00453-022-01056-1},
timestamp = {Fri, 09 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/X22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AbamB21,
author = {Mohammad Ali Abam and
Mohammad Sadegh Borouny},
title = {Local Geometric Spanners},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3629--3648},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00860-5},
doi = {10.1007/S00453-021-00860-5},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AbamB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AcanCJS21,
author = {H{\"{u}}seyin Acan and
Sankardeep Chakraborty and
Seungbum Jo and
Srinivasa Rao Satti},
title = {Succinct Encodings for Families of Interval Graphs},
journal = {Algorithmica},
volume = {83},
number = {3},
pages = {776--794},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00710-w},
doi = {10.1007/S00453-020-00710-W},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AcanCJS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgrawalPSZ21,
author = {Akanksha Agrawal and
Fahad Panolan and
Saket Saurabh and
Meirav Zehavi},
title = {Simultaneous Feedback Edge Set: {A} Parameterized Perspective},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {753--774},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00773-9},
doi = {10.1007/S00453-020-00773-9},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgrawalPSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AhnCGMW21,
author = {Kook Jin Ahn and
Graham Cormode and
Sudipto Guha and
Andrew McGregor and
Anthony Wirth},
title = {Correlation Clustering in Data Streams},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {1980--2017},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00816-9},
doi = {10.1007/S00453-021-00816-9},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AhnCGMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AichholzerCHKMS21,
author = {Oswin Aichholzer and
Jean Cardinal and
Tony Huynh and
Kolja Knauer and
Torsten M{\"{u}}tze and
Raphael Steiner and
Birgit Vogtenhuber},
title = {Flip Distances Between Graph Orientations},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {116--143},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00751-1},
doi = {10.1007/S00453-020-00751-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AichholzerCHKMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AkitayaADDDFKPP21,
author = {Hugo A. Akitaya and
Esther M. Arkin and
Mirela Damian and
Erik D. Demaine and
Vida Dujmovic and
Robin Y. Flatland and
Matias Korman and
Bel{\'{e}}n Palop and
Irene Parada and
Andr{\'{e}} van Renssen and
Vera Sacrist{\'{a}}n},
title = {Universal Reconfiguration of Facet-Connected Modular Robots by Pivots:
The {O(1)} Musketeers},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1316--1351},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00784-6},
doi = {10.1007/S00453-020-00784-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AkitayaADDDFKPP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AkridaDMS21,
author = {Eleni C. Akrida and
Argyrios Deligkas and
Themistoklis Melissourgos and
Paul G. Spirakis},
title = {Connected Subgraph Defense Games},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3403--3431},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00858-z},
doi = {10.1007/S00453-021-00858-Z},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AkridaDMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersJ21,
author = {Susanne Albers and
Maximilian Janke},
title = {Scheduling in the Random-Order Model},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2803--2832},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00841-8},
doi = {10.1007/S00453-021-00841-8},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersKL21,
author = {Susanne Albers and
Arindam Khan and
Leon Ladewig},
title = {Improved Online Algorithms for Knapsack and {GAP} in the Random Order
Model},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1750--1785},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00801-2},
doi = {10.1007/S00453-021-00801-2},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersKL21a,
author = {Susanne Albers and
Arindam Khan and
Leon Ladewig},
title = {Best Fit Bin Packing with Random Order Revisited},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2833--2858},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00844-5},
doi = {10.1007/S00453-021-00844-5},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersKL21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersS21,
author = {Susanne Albers and
Sebastian Schraink},
title = {Tight Bounds for Online Coloring of Basic Graph Classes},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {337--360},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00759-7},
doi = {10.1007/S00453-020-00759-7},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntipovD21,
author = {Denis Antipov and
Benjamin Doerr},
title = {A Tight Runtime Analysis for the ({\(\mu\)} + {\(\lambda\)} {)} {EA}},
journal = {Algorithmica},
volume = {83},
number = {4},
pages = {1054--1095},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00731-5},
doi = {10.1007/S00453-020-00731-5},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AntipovD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArvindKKT21,
author = {Vikraman Arvind and
Johannes K{\"{o}}bler and
Sebastian Kuhnert and
Jacobo Tor{\'{a}}n},
title = {Parameterized Complexity of Small Weight Automorphisms and Isomorphisms},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3567--3601},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00867-y},
doi = {10.1007/S00453-021-00867-Y},
timestamp = {Tue, 23 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ArvindKKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AuerBBGHNR21,
author = {Christopher Auer and
Christian Bachmaier and
Franz J. Brandenburg and
Andreas Glei{\ss}ner and
Kathrin Hanauer and
Daniel Neuwirth and
Josef Reislhuber},
title = {Correction to: Outer 1-Planar Graphs},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3534--3535},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00874-z},
doi = {10.1007/S00453-021-00874-Z},
timestamp = {Sun, 31 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AuerBBGHNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AugerL21,
author = {Anne Auger and
Per Kristian Lehre},
title = {Preface to the Special Issue on Theory of Genetic and Evolutionary
Computation},
journal = {Algorithmica},
volume = {83},
number = {4},
pages = {903--905},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00803-0},
doi = {10.1007/S00453-021-00803-0},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AugerL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaloghBDEL21,
author = {J{\'{a}}nos Balogh and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein and
Asaf Levin},
title = {A New Lower Bound for Classic Online Bin Packing},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2047--2062},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00818-7},
doi = {10.1007/S00453-021-00818-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaloghBDEL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BampisEST21,
author = {Evripidis Bampis and
Bruno Escoffier and
Kevin Schewior and
Alexandre Teiller},
title = {Online Multistage Subset Maximization Problems},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2374--2399},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00834-7},
doi = {10.1007/S00453-021-00834-7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BampisEST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarequetDG21,
author = {Gill Barequet and
Minati De and
Michael T. Goodrich},
title = {Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex
Polygons},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2245--2272},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00824-9},
doi = {10.1007/S00453-021-00824-9},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BarequetDG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BartierBDLM21,
author = {Valentin Bartier and
Nicolas Bousquet and
Cl{\'{e}}ment Dallard and
Kyle Lomer and
Amer E. Mouawad},
title = {On Girth and the Parameterized Complexity of Token Sliding and Token
Jumping},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2914--2951},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00848-1},
doi = {10.1007/S00453-021-00848-1},
timestamp = {Fri, 13 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BartierBDLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeimelNS21,
author = {Amos Beimel and
Kobbi Nissim and
Uri Stemmer},
title = {Learning Privately with Labeled and Unlabeled Examples},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {177--215},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00753-z},
doi = {10.1007/S00453-020-00753-Z},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BeimelNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelazzouguiGMNN21,
author = {Djamal Belazzougui and
Travis Gagie and
J. Ian Munro and
Gonzalo Navarro and
Yakov Nekrich},
title = {Range Majorities and Minorities in Arrays},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1707--1733},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00799-7},
doi = {10.1007/S00453-021-00799-7},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BelazzouguiGMNN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteS21,
author = {R{\'{e}}my Belmonte and
Ignasi Sau},
title = {On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2351--2373},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00830-x},
doi = {10.1007/S00453-021-00830-X},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BerendsohnKM21,
author = {Benjamin Aram Berendsohn and
L{\'{a}}szl{\'{o}} Kozma and
D{\'{a}}niel Marx},
title = {Finding and Counting Permutations via CSPs},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2552--2577},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00812-z},
doi = {10.1007/S00453-021-00812-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BerendsohnKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergougnouxEGOR21,
author = {Benjamin Bergougnoux and
Eduard Eiben and
Robert Ganian and
Sebastian Ordyniak and
M. S. Ramanujan},
title = {Towards a Polynomial Kernel for Directed Feedback Vertex Set},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1201--1221},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00777-5},
doi = {10.1007/S00453-020-00777-5},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BergougnouxEGOR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BessyBKSSTZ21,
author = {St{\'{e}}phane Bessy and
Marin Bougeret and
R. Krithika and
Abhishek Sahu and
Saket Saurabh and
Jocelyn Thiebaut and
Meirav Zehavi},
title = {Packing Arc-Disjoint Cycles in Tournaments},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1393--1420},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00788-2},
doi = {10.1007/S00453-020-00788-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BessyBKSSTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhowmickIV21,
author = {Santanu Bhowmick and
Tanmay Inamdar and
Kasturi R. Varadarajan},
title = {Fault-Tolerant Covering Problems in Metric Spaces},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {413--446},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00762-y},
doi = {10.1007/S00453-020-00762-Y},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BhowmickIV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiedlM21,
author = {Therese Biedl and
Saeed Mehrabi},
title = {On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {641--666},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00769-5},
doi = {10.1007/S00453-020-00769-5},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiedlM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleGGLW21,
author = {Philip Bille and
Pawel Gawrychowski and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
title = {Top Tree Compression of Tries},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3602--3628},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00869-w},
doi = {10.1007/S00453-021-00869-W},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleGGLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloM21,
author = {Vittorio Bil{\`{o}} and
Marios Mavronicolas},
title = {The Complexity of Computational Problems About Nash Equilibria in
Symmetric Win-Lose Games},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {447--530},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00763-x},
doi = {10.1007/S00453-020-00763-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazCCCMMS21,
author = {Ahmad Biniaz and
Sergio Cabello and
Paz Carmi and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Saeed Mehrabi and
Michiel Smid},
title = {On the Minimum Consistent Subset Problem},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2273--2302},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00825-8},
doi = {10.1007/S00453-021-00825-8},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazCCCMMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiswasRS21,
author = {Arindam Biswas and
Venkatesh Raman and
Saket Saurabh},
title = {Approximation in (Poly-) Logarithmic Space},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2303--2331},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00826-7},
doi = {10.1007/S00453-021-00826-7},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiswasRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonamyBDJPP21,
author = {Marthe Bonamy and
Nicolas Bousquet and
Konrad K. Dabrowski and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Th{\'{e}}o Pierron},
title = {Graph Isomorphism for (H\({}_{\mbox{1, H\({}_{\mbox{2)}}\)}}\)-Free
Graphs: An Almost Complete Dichotomy},
journal = {Algorithmica},
volume = {83},
number = {3},
pages = {822--852},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00747-x},
doi = {10.1007/S00453-020-00747-X},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonamyBDJPP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetCMP21,
author = {{\'{E}}douard Bonnet and
Sergio Cabello and
Bojan Mohar and
Hebert P{\'{e}}rez{-}Ros{\'{e}}s},
title = {The Inverse Voronoi Problem in Graphs {II:} Trees},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1165--1200},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00774-8},
doi = {10.1007/S00453-020-00774-8},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetCMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetP21,
author = {{\'{E}}douard Bonnet and
Nidhi Purohit},
title = {Metric Dimension Parameterized By Treewidth},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2606--2633},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00808-9},
doi = {10.1007/S00453-021-00808-9},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BossekNPS21,
author = {Jakob Bossek and
Frank Neumann and
Pan Peng and
Dirk Sudholt},
title = {Time Complexity Analysis of Randomized Search Heuristics for the Dynamic
Graph Coloring Problem},
journal = {Algorithmica},
volume = {83},
number = {10},
pages = {3148--3179},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00838-3},
doi = {10.1007/S00453-021-00838-3},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BossekNPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarFKL21,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
title = {Online Bin Covering with Advice},
journal = {Algorithmica},
volume = {83},
number = {3},
pages = {795--821},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00728-0},
doi = {10.1007/S00453-020-00728-0},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarFKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bressan21,
author = {Marco Bressan},
title = {Faster algorithms for counting subgraphs in sparse graphs},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2578--2605},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00811-0},
doi = {10.1007/S00453-021-00811-0},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Bressan21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuhrmanCKLPV21,
author = {Harry Buhrman and
Matthias Christandl and
Michal Kouck{\'{y}} and
Zvi Lotker and
Boaz Patt{-}Shamir and
Nikolai K. Vereshchagin},
title = {High Entropy Random Selection Protocols},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {667--694},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00770-y},
doi = {10.1007/S00453-020-00770-Y},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BuhrmanCKLPV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuryGSS21,
author = {Marc Bury and
Michele Gentili and
Chris Schwiegelshohn and
Mara Sorella},
title = {Polynomial Time Approximation Schemes for All 1-Center Problems on
Metric Rational Set Similarities},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1371--1392},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00787-3},
doi = {10.1007/S00453-020-00787-3},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuryGSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CantuLSW21,
author = {Angel A. Cantu and
Austin Luchsinger and
Robert T. Schweller and
Tim Wylie},
title = {Covert Computation in Self-Assembled Circuits},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {531--552},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00764-w},
doi = {10.1007/S00453-020-00764-W},
timestamp = {Fri, 26 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CantuLSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaraballoPSV21,
author = {Luis Evaristo Caraballo and
Pablo P{\'{e}}rez{-}Lantero and
Carlos Seara and
Inmaculada Ventura},
title = {Maximum Box Problem on Stochastic Points},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3741--3765},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00882-z},
doi = {10.1007/S00453-021-00882-Z},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CaraballoPSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CasteigtsHMZ21,
author = {Arnaud Casteigts and
Anne{-}Sophie Himmel and
Hendrik Molter and
Philipp Zschoche},
title = {Finding Temporal Paths Under Waiting Time Constraints},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2754--2802},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00831-w},
doi = {10.1007/S00453-021-00831-W},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CasteigtsHMZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChandrasekaranG21,
author = {Karthekeyan Chandrasekaran and
Elena Grigorescu and
Gabriel Istrate and
Shubhang Kulkarni and
Young{-}San Lin and
Minshen Zhu},
title = {The Maximum Binary Tree Problem},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2427--2468},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00836-5},
doi = {10.1007/S00453-021-00836-5},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChandrasekaranG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChaplickTVZ21,
author = {Steven Chaplick and
Martin T{\"{o}}pfer and
Jan Voborn{\'{\i}}k and
Peter Zeman},
title = {On H-Topological Intersection Graphs},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3281--3318},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00846-3},
doi = {10.1007/S00453-021-00846-3},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChaplickTVZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Charalampopoulos21,
author = {Panagiotis Charalampopoulos and
Tomasz Kociumaka and
Manal Mohamed and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
title = {Internal Dictionary Matching},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2142--2169},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00821-y},
doi = {10.1007/S00453-021-00821-Y},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Charalampopoulos21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenCLXZ21,
author = {Yong Chen and
Zhi{-}Zhong Chen and
Guohui Lin and
Yao Xu and
An Zhang},
title = {Approximation Algorithms for Maximally Balanced Connected Graph Partition},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3715--3740},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00870-3},
doi = {10.1007/S00453-021-00870-3},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenCLXZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenHLLP21,
author = {Chi{-}Yeh Chen and
Sun{-}Yuan Hsieh and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Sheng{-}Lung Peng},
title = {Matching Cut in Graphs with Large Minimum Degree},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1238--1255},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00782-8},
doi = {10.1007/S00453-020-00782-8},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenHLLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenHLR21,
author = {Li{-}Hsuan Chen and
Ling{-}Ju Hung and
Henri Lotze and
Peter Rossmanith},
title = {Online Node- and Edge-Deletion Problems with Advice},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2719--2753},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00840-9},
doi = {10.1007/S00453-021-00840-9},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenHLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChepoiLR21,
author = {Victor Chepoi and
Arnaud Labourel and
S{\'{e}}bastien Ratel},
title = {Distance and Routing Labeling Schemes for Cube-Free Median Graphs},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {252--296},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00756-w},
doi = {10.1007/S00453-020-00756-W},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChepoiLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChevalierLV21,
author = {C{\'{e}}line Chevalier and
Fabien Laguillaumie and
Damien Vergnaud},
title = {Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis
and Optimal Constructions},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {72--115},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00750-2},
doi = {10.1007/S00453-020-00750-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChevalierLV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChoiCA21,
author = {Jongmin Choi and
Sergio Cabello and
Hee{-}Kap Ahn},
title = {Maximizing Dominance in the Plane and its Applications},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3491--3513},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00863-2},
doi = {10.1007/S00453-021-00863-2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChoiCA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChudnovskyHSZ21,
author = {Maria Chudnovsky and
Shenwei Huang and
Sophie Spirkl and
Mingxian Zhong},
title = {List 3-Coloring Graphs with No Induced P\({}_{\mbox{6+rP\({}_{\mbox{3}}\)}}\)},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {216--251},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00754-y},
doi = {10.1007/S00453-020-00754-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChudnovskyHSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CsehK21,
author = {{\'{A}}gnes Cseh and
Telikepalli Kavitha},
title = {Popular Matchings in Complete Graphs},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1493--1523},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00791-7},
doi = {10.1007/S00453-020-00791-7},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CsehK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CzyzowiczDP21,
author = {Jurek Czyzowicz and
Dariusz Dereniowski and
Andrzej Pelc},
title = {Building a Nest by an Automaton},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {144--176},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00752-0},
doi = {10.1007/S00453-020-00752-0},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CzyzowiczDP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DavotCGWT21,
author = {Tom Davot and
Annie Chateau and
Rodolphe Giroudeau and
Mathias Weller and
Dorine Tabary},
title = {Producing Genomic Sequences after Genome Scaffolding with Ambiguous
Paths: Complexity, Approximation and Lower Bounds},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2063--2095},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00819-6},
doi = {10.1007/S00453-021-00819-6},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DavotCGWT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DemaineHLS21,
author = {Erik D. Demaine and
Yamming Huang and
Chung{-}Shou Liao and
Kunihiko Sadakane},
title = {Approximating the Canadian Traveller Problem with Online Randomization},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1524--1543},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00792-6},
doi = {10.1007/S00453-020-00792-6},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DemaineHLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DisserFKK21,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Jochen K{\"{o}}nemann},
title = {Travelling on Graphs with Small Highway Dimension},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1352--1370},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00785-5},
doi = {10.1007/S00453-020-00785-5},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DisserFKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Doerr21,
author = {Benjamin Doerr},
title = {The Runtime of the Compact Genetic Algorithm on Jump Functions},
journal = {Algorithmica},
volume = {83},
number = {10},
pages = {3059--3107},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00780-w},
doi = {10.1007/S00453-020-00780-W},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Doerr21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrDL21,
author = {Benjamin Doerr and
Carola Doerr and
Johannes Lengler},
title = {Self-Adjusting Mutation Rates with Provably Optimal Success Rules},
journal = {Algorithmica},
volume = {83},
number = {10},
pages = {3108--3147},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00854-3},
doi = {10.1007/S00453-021-00854-3},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrDL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrK21,
author = {Benjamin Doerr and
Timo K{\"{o}}tzing},
title = {Multiplicative Up-Drift},
journal = {Algorithmica},
volume = {83},
number = {10},
pages = {3017--3058},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00775-7},
doi = {10.1007/S00453-020-00775-7},
timestamp = {Wed, 06 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrWY21,
author = {Benjamin Doerr and
Carsten Witt and
Jing Yang},
title = {Runtime Analysis for Self-adaptive Mutation Rates},
journal = {Algorithmica},
volume = {83},
number = {4},
pages = {1012--1053},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00726-2},
doi = {10.1007/S00453-020-00726-2},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrWY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DornHS21,
author = {Britta Dorn and
Ronald de Haan and
Ildik{\'{o}} Schlotter},
title = {Obtaining a Proportional Allocation by Deleting Items},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1559--1603},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00794-4},
doi = {10.1007/S00453-020-00794-4},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DornHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DuarteEHKKLPSS21,
author = {Gabriel L. Duarte and
Hiroshi Eto and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Daniel Lokshtanov and
Lehilton L. C. Pedrosa and
Rafael C. S. Schouery and
U{\'{e}}verton S. Souza},
title = {Computing the Largest Bond and the Maximum Connected Cut of a Graph},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1421--1458},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00789-1},
doi = {10.1007/S00453-020-00789-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DuarteEHKKLPSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ElkinN21,
author = {Michael Elkin and
Ofer Neiman},
title = {Near Isometric Terminal Embeddings for Doubling Metrics},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3319--3337},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00843-6},
doi = {10.1007/S00453-021-00843-6},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ElkinN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EnglertMW21,
author = {Matthias Englert and
David Mezlaf and
Matthias Westermann},
title = {Online Makespan Scheduling with Job Migration on Uniform Machines},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3537--3566},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00852-5},
doi = {10.1007/S00453-021-00852-5},
timestamp = {Tue, 23 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EnglertMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinK21,
author = {Leah Epstein and
Elena Kleiman},
title = {Selfish Vector Packing},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2952--2988},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00849-0},
doi = {10.1007/S00453-021-00849-0},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeketeGHKSS21,
author = {S{\'{a}}ndor P. Fekete and
Robert Gmyr and
Sabrina Hugo and
Phillip Keldenich and
Christian Scheffer and
Arne Schmidt},
title = {CADbots: Algorithmic Aspects of Manipulating Programmable Matter with
Finite Automata},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {387--412},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00761-z},
doi = {10.1007/S00453-020-00761-Z},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeketeGHKSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Feldman21,
author = {Moran Feldman},
title = {Guess Free Maximization of Submodular and Linear Sums},
journal = {Algorithmica},
volume = {83},
number = {3},
pages = {853--878},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00757-9},
doi = {10.1007/S00453-020-00757-9},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Feldman21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FerraioliV21,
author = {Diodato Ferraioli and
Carmine Ventre},
title = {Approximation Guarantee of {OSP} Mechanisms: The Case of Machine Scheduling
and Facility Location},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {695--725},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00771-x},
doi = {10.1007/S00453-020-00771-X},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FerraioliV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeuilloleyFMRRT21,
author = {Laurent Feuilloley and
Pierre Fraigniaud and
Pedro Montealegre and
Ivan Rapaport and
{\'{E}}ric R{\'{e}}mila and
Ioan Todinca},
title = {Compact Distributed Certification of Planar Graphs},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2215--2244},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00823-w},
doi = {10.1007/S00453-021-00823-W},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeuilloleyFMRRT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominG21,
author = {Fedor V. Fomin and
Petr A. Golovach},
title = {Subexponential Parameterized Algorithms and Kernelization on Almost
Chordal Graphs},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2170--2214},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00822-x},
doi = {10.1007/S00453-021-00822-X},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FominG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FoucaudGPS21,
author = {Florent Foucaud and
Benjamin Gras and
Anthony Perez and
Florian Sikora},
title = {On the Complexity of Broadcast Domination and Multipacking in Digraphs},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2651--2677},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00828-5},
doi = {10.1007/S00453-021-00828-5},
timestamp = {Mon, 09 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FoucaudGPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FrancisNR21,
author = {Mathew C. Francis and
Rian Neogi and
Venkatesh Raman},
title = {Recognizing k-Clique Extendible Orderings},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3338--3362},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00857-0},
doi = {10.1007/S00453-021-00857-0},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FrancisNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FriggstadSS21,
author = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Special Issue on Algorithms and Data Structures {(WADS} 2019)},
journal = {Algorithmica},
volume = {83},
number = {3},
pages = {775},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00804-z},
doi = {10.1007/S00453-021-00804-Z},
timestamp = {Thu, 18 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FriggstadSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fuentes-Sepulveda21,
author = {Jos{\'{e}} Fuentes{-}Sep{\'{u}}lveda and
Diego Seco and
Raquel Via{\~{n}}a},
title = {Succinct Encoding of Binary Strings Representing Triangulations},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3432--3468},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00861-4},
doi = {10.1007/S00453-021-00861-4},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Fuentes-Sepulveda21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ganesan21,
author = {Ghurumuruhan Ganesan},
title = {Constrained Minimum Passage Time in Random Geometric Graphs},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {576--588},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00766-8},
doi = {10.1007/S00453-020-00766-8},
timestamp = {Fri, 26 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Ganesan21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GanianKO21,
author = {Robert Ganian and
Fabian Klute and
Sebastian Ordyniak},
title = {On Structural Parameterizations of the Bounded-Degree Vertex Deletion
Problem},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {297--336},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00758-8},
doi = {10.1007/S00453-020-00758-8},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GanianKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GanianO21,
author = {Robert Ganian and
Sebastian Ordyniak},
title = {The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {726--752},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00772-w},
doi = {10.1007/S00453-020-00772-W},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GanianO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GanianOR21,
author = {Robert Ganian and
Sebastian Ordyniak and
M. S. Ramanujan},
title = {On Structural Parameterizations of the Edge Disjoint Paths Problem},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1605--1637},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00795-3},
doi = {10.1007/S00453-020-00795-3},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GanianOR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiannakopoulosH21,
author = {Yiannis Giannakopoulos and
Alexander Hammerl and
Diogo Po{\c{c}}as},
title = {A New Lower Bound for Deterministic Truthful Scheduling},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2895--2913},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00847-2},
doi = {10.1007/S00453-021-00847-2},
timestamp = {Fri, 13 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GiannakopoulosH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GillaniB21,
author = {Iqra Altaf Gillani and
Amitabha Bagchi},
title = {A Queueing Network-Based Distributed Laplacian Solver},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2859--2894},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00845-4},
doi = {10.1007/S00453-021-00845-4},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GillaniB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GomesS21,
author = {Guilherme de C. M. Gomes and
Ignasi Sau},
title = {Finding Cuts of Bounded Degree: Complexity, {FPT} and Exact Algorithms,
and Kernelization},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1677--1706},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00798-8},
doi = {10.1007/S00453-021-00798-8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GomesS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GoncalvesLLS21,
author = {Douglas Soares Gon{\c{c}}alves and
Carlile Lavor and
Leo Liberti and
Michael Souza},
title = {A New Algorithm for the \({}^{\mbox{K}}\)DMDGP Subclass of Distance
Geometry Problems with Exact Distances},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2400--2426},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00835-6},
doi = {10.1007/S00453-021-00835-6},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GoncalvesLLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GrigorievHLW21,
author = {Alexander Grigoriev and
Tim A. Hartmann and
Stefan Lendl and
Gerhard J. Woeginger},
title = {Dispersing Obnoxious Facilities on a Graph},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1734--1749},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00800-3},
doi = {10.1007/S00453-021-00800-3},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GrigorievHLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GudmundssonRSW21,
author = {Joachim Gudmundsson and
Andr{\'{e}} van Renssen and
Zeinab Saeidi and
Sampson Wong},
title = {Translation Invariant Fr{\'{e}}chet Distance Queries},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3514--3533},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00865-0},
doi = {10.1007/S00453-021-00865-0},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GudmundssonRSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HalldorssonKMT21,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Pradipta Mitra and
Tigran Tonoyan},
title = {Network Design under General Wireless Interference},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3469--3490},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00866-z},
doi = {10.1007/S00453-021-00866-Z},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HalldorssonKMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HamadaMO21,
author = {Koki Hamada and
Shuichi Miyazaki and
Kazuya Okamoto},
title = {Strongly Stable and Maximum Weakly Stable Noncrossing Matchings},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2678--2696},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00832-9},
doi = {10.1007/S00453-021-00832-9},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HamadaMO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Har-PeledJR21,
author = {Sariel Har{-}Peled and
Mitchell Jones and
Saladi Rahul},
title = {Active-Learning a Convex Body in Low Dimensions},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1885--1917},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00807-w},
doi = {10.1007/S00453-021-00807-W},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Har-PeledJR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Hasunuma21,
author = {Toru Hasunuma},
title = {Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2697--2718},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00833-8},
doi = {10.1007/S00453-021-00833-8},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Hasunuma21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HorschS21,
author = {Florian H{\"{o}}rsch and
Zolt{\'{a}}n Szigeti},
title = {The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2333--2350},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00829-4},
doi = {10.1007/S00453-021-00829-4},
timestamp = {Tue, 27 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HorschS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangK21,
author = {Chien{-}Chung Huang and
Naonori Kakimura},
title = {Improved Streaming Algorithms for Maximizing Monotone Submodular Functions
under a Knapsack Constraint},
journal = {Algorithmica},
volume = {83},
number = {3},
pages = {879--902},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00786-4},
doi = {10.1007/S00453-020-00786-4},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/InerneyNP21,
author = {Fionn Mc Inerney and
Nicolas Nisse and
St{\'{e}}phane P{\'{e}}rennes},
title = {Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything
in Between},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1459--1492},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00790-8},
doi = {10.1007/S00453-020-00790-8},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/InerneyNP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IwataK21,
author = {Yoichi Iwata and
Yusuke Kobayashi},
title = {Improved Analysis of Highest-Degree Branching for Feedback Vertex
Set},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2503--2520},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00815-w},
doi = {10.1007/S00453-021-00815-W},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/IwataK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenT21,
author = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Special Issue Dedicated to the 14th International Symposium on Parameterized
and Exact Computation},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2469--2470},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00853-4},
doi = {10.1007/S00453-021-00853-4},
timestamp = {Tue, 27 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JanssonMRS21,
author = {Jesper Jansson and
Konstantinos Mampentzidis and
Ramesh Rajaby and
Wing{-}Kin Sung},
title = {Computing the Rooted Triplet Distance Between Phylogenetic Networks},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1786--1828},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00802-1},
doi = {10.1007/S00453-021-00802-1},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JanssonMRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JoLS21,
author = {Seungbum Jo and
Rahul Lingala and
Srinivasa Rao Satti},
title = {Encoding Two-Dimensional Range Top-k Queries},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3379--3402},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00856-1},
doi = {10.1007/S00453-021-00856-1},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JoLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kao21,
author = {Mong{-}Jen Kao},
title = {Iterative Partial Rounding for Vertex Cover with Hard Capacities},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {45--71},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00749-9},
doi = {10.1007/S00453-020-00749-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Kao21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KawaseKMS21,
author = {Yasushi Kawase and
Kei Kimura and
Kazuhisa Makino and
Hanna Sumita},
title = {Optimal Matroid Partitioning Problems},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1653--1676},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00797-9},
doi = {10.1007/S00453-021-00797-9},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KawaseKMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KimK21,
author = {Eun Jung Kim and
O{-}joung Kwon},
title = {A Polynomial Kernel for Distance-Hereditary Vertex Deletion},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2096--2141},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00820-z},
doi = {10.1007/S00453-021-00820-Z},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KimK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KonstantinidisP21,
author = {Athanasios L. Konstantinidis and
Charis Papadopoulos},
title = {Cluster Deletion on Interval Graphs and Split Related Graphs},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2018--2046},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00817-8},
doi = {10.1007/S00453-021-00817-8},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KonstantinidisP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KratochvilMN21,
author = {Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}}},
title = {\emph{U}-Bubble Model for Mixed Unit Interval Graphs and Its Applications:
The MaxCut Problem Revisited},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3649--3680},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00837-4},
doi = {10.1007/S00453-021-00837-4},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KratochvilMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KunOPS21,
author = {Jeremy Kun and
Michael P. O'Brien and
Marcin Pilipczuk and
Blair D. Sullivan},
title = {Polynomial Treedepth Bounds in Linear Colorings},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {361--386},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00760-0},
doi = {10.1007/S00453-020-00760-0},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KunOPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LehreN21,
author = {Per Kristian Lehre and
Phan Trung Hai Nguyen},
title = {Runtime Analyses of the Population-Based Univariate Estimation of
Distribution Algorithms on LeadingOnes},
journal = {Algorithmica},
volume = {83},
number = {10},
pages = {3238--3280},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00862-3},
doi = {10.1007/S00453-021-00862-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LehreN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LenglerSW21,
author = {Johannes Lengler and
Dirk Sudholt and
Carsten Witt},
title = {The Complex Parameter Landscape of the Compact Genetic Algorithm},
journal = {Algorithmica},
volume = {83},
number = {4},
pages = {1096--1137},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00778-4},
doi = {10.1007/S00453-020-00778-4},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LenglerSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LeonardiMSZ21,
author = {Stefano Leonardi and
Gianpiero Monaco and
Piotr Sankowski and
Qiang Zhang},
title = {Budget Feasible Mechanisms on Matroids},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1222--1237},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00781-9},
doi = {10.1007/S00453-020-00781-9},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LeonardiMSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LozzoEGG21,
author = {Giordano Da Lozzo and
David Eppstein and
Michael T. Goodrich and
Siddharth Gupta},
title = {C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual
Carving-Width},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2471--2502},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00839-2},
doi = {10.1007/S00453-021-00839-2},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LozzoEGG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LuoMNN21,
author = {Junjie Luo and
Hendrik Molter and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Parameterized Dynamic Cluster Editing},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {1--44},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00746-y},
doi = {10.1007/S00453-020-00746-Y},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LuoMNN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MadathilSZ21,
author = {Jayakrishnan Madathil and
Roohani Sharma and
Meirav Zehavi},
title = {A Sub-exponential {FPT} Algorithm and a Polynomial Kernel for Minimum
Directed Bisection on Semicomplete Digraphs},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1861--1884},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00806-x},
doi = {10.1007/S00453-021-00806-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MadathilSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MasumuraOY21,
author = {Yuya Masumura and
Taihei Oki and
Yutaro Yamaguchi},
title = {Dynamic Programming Approach to the Generalized Minimum Manhattan
Network Problem},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3681--3714},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00868-x},
doi = {10.1007/S00453-021-00868-X},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MasumuraOY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Matsubayashi21,
author = {Akira Matsubayashi},
title = {Non-Greedy Online Steiner Trees on Outerplanar Graphs},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {613--640},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00768-6},
doi = {10.1007/S00453-020-00768-6},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Matsubayashi21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MavronicolasMLP21,
author = {Marios Mavronicolas and
Loizos Michael and
Vicky Papadopoulou Lesta and
Giuseppe Persiano and
Anna Philippou and
Paul G. Spirakis},
title = {The Price of Defense},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1256--1315},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00783-7},
doi = {10.1007/S00453-020-00783-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MavronicolasMLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Morin21,
author = {Pat Morin},
title = {A Fast Algorithm for the Product Structure of Planar Graphs},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1544--1558},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00793-5},
doi = {10.1007/S00453-020-00793-5},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Morin21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NeumannPW21,
author = {Frank Neumann and
Mojgan Pourhassan and
Carsten Witt},
title = {Improved Runtime Results for Simple Randomised Search Heuristics on
Linear Functions with a Uniform Constraint},
journal = {Algorithmica},
volume = {83},
number = {10},
pages = {3209--3237},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00779-3},
doi = {10.1007/S00453-020-00779-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NeumannPW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NovotnaOPRLW21,
author = {Jana Novotn{\'{a}} and
Karolina Okrasa and
Michal Pilipczuk and
Pawel Rzazewski and
Erik Jan van Leeuwen and
Bartosz Walczak},
title = {Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2634--2650},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00745-z},
doi = {10.1007/S00453-020-00745-Z},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NovotnaOPRLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Nutov21,
author = {Zeev Nutov},
title = {On the Tree Augmentation Problem},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {553--575},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00765-9},
doi = {10.1007/S00453-020-00765-9},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Nutov21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PreissmannRT21,
author = {Myriam Preissmann and
Cl{\'{e}}oph{\'{e}}e Robin and
Nicolas Trotignon},
title = {On the Complexity of Colouring Antiprismatic Graphs},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {589--612},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00767-7},
doi = {10.1007/S00453-020-00767-7},
timestamp = {Fri, 26 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PreissmannRT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/QianBYTY21,
author = {Chao Qian and
Chao Bian and
Yang Yu and
Ke Tang and
Xin Yao},
title = {Analysis of Noisy Evolutionary Optimization When Sampling Fails},
journal = {Algorithmica},
volume = {83},
number = {4},
pages = {940--975},
year = {2021},
url = {https://doi.org/10.1007/s00453-019-00666-6},
doi = {10.1007/S00453-019-00666-6},
timestamp = {Fri, 30 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/QianBYTY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RawitzR21,
author = {Dror Rawitz and
Adi Ros{\'{e}}n},
title = {Online Budgeted Maximum Coverage},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2989--3014},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00850-7},
doi = {10.1007/S00453-021-00850-7},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RawitzR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Rosenthal21,
author = {Gregory Rosenthal},
title = {Beating Treewidth for Average-Case Subgraph Isomorphism},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2521--2551},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00813-y},
doi = {10.1007/S00453-021-00813-Y},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Rosenthal21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Roth21,
author = {Marc Roth},
title = {Parameterized Counting of Partially Injective Homomorphisms},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1829--1860},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00805-y},
doi = {10.1007/S00453-021-00805-Y},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Roth21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Saunders21,
author = {Arnold T. Saunders},
title = {A Class of Random Recursive Tree Algorithms with Deletion},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3363--3378},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00859-y},
doi = {10.1007/S00453-021-00859-Y},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Saunders21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShiNW21,
author = {Feng Shi and
Frank Neumann and
Jianxin Wang},
title = {Runtime Performances of Randomized Search Heuristics for the Dynamic
Weighted Vertex Cover Problem},
journal = {Algorithmica},
volume = {83},
number = {4},
pages = {906--939},
year = {2021},
url = {https://doi.org/10.1007/s00453-019-00662-w},
doi = {10.1007/S00453-019-00662-W},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ShiNW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SotoT21,
author = {Jos{\'{e}} A. Soto and
Claudio Telha},
title = {Independent Sets and Hitting Sets of Bicolored Rectangular Families},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1918--1952},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00810-1},
doi = {10.1007/S00453-021-00810-1},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SotoT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Sudholt21,
author = {Dirk Sudholt},
title = {Analysing the Robustness of Evolutionary Algorithms to Noise: Refined
Runtime Bounds and an Example Where Noise is Beneficial},
journal = {Algorithmica},
volume = {83},
number = {4},
pages = {976--1011},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00671-0},
doi = {10.1007/S00453-020-00671-0},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Sudholt21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Sutton21,
author = {Andrew M. Sutton},
title = {Fixed-Parameter Tractability of Crossover: Steady-State GAs on the
Closest String Problem},
journal = {Algorithmica},
volume = {83},
number = {4},
pages = {1138--1163},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00809-8},
doi = {10.1007/S00453-021-00809-8},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Sutton21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SuttonW21,
author = {Andrew M. Sutton and
Carsten Witt},
title = {Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling
and Family Graphs},
journal = {Algorithmica},
volume = {83},
number = {10},
pages = {3180--3208},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00776-6},
doi = {10.1007/S00453-020-00776-6},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/SuttonW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X21,
title = {Editor's Note: Special Issue on Genetic and Evolutionary Computation},
journal = {Algorithmica},
volume = {83},
number = {10},
pages = {3015--3016},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00871-2},
doi = {10.1007/S00453-021-00871-2},
timestamp = {Wed, 06 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Zhang21,
author = {Jie Zhang},
title = {Average-Case Approximation Ratio of Scheduling without Payments},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1638--1652},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00796-2},
doi = {10.1007/S00453-020-00796-2},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Zhang21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ZhangZJGFL21,
author = {Shu Zhang and
Daming Zhu and
Haitao Jiang and
Jiong Guo and
Haodi Feng and
Xiaowen Liu},
title = {Sorting a Permutation by Best Short Swaps},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {1953--1979},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00814-x},
doi = {10.1007/S00453-021-00814-X},
timestamp = {Thu, 10 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ZhangZJGFL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AcunaGILRSSS20,
author = {Vicente Acu{\~{n}}a and
Roberto Grossi and
Giuseppe Francesco Italiano and
Leandro Lima and
Romeo Rizzi and
Gustavo Sacomoto and
Marie{-}France Sagot and
Blerina Sinaimeri},
title = {On Bubble Generators in Directed Graphs},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {898--914},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00619-z},
doi = {10.1007/S00453-019-00619-Z},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AcunaGILRSSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgrawalJKS20,
author = {Akanksha Agrawal and
Pallavi Jain and
Lawqueen Kanesh and
Saket Saurabh},
title = {Parameterized Complexity of Conflict-Free Matchings and Paths},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1939--1965},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00681-y},
doi = {10.1007/S00453-020-00681-Y},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgrawalJKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AhmadiKPY20,
author = {Saba Ahmadi and
Samir Khuller and
Manish Purohit and
Sheng Yang},
title = {On Scheduling Coflows},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3604--3629},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00741-3},
doi = {10.1007/S00453-020-00741-3},
timestamp = {Tue, 16 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AhmadiKPY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlamBGKP20,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {Queue Layouts of Planar 3-Trees},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2564--2585},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00697-4},
doi = {10.1007/S00453-020-00697-4},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlamBGKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbertHJS20,
author = {Michael Albert and
Cecilia Holmgren and
Tony Johansson and
Fiona Skerman},
title = {Embedding Small Digraphs and Permutations in Binary Trees and Split
Trees},
journal = {Algorithmica},
volume = {82},
number = {3},
pages = {589--615},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00667-5},
doi = {10.1007/S00453-019-00667-5},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbertHJS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmirCPR20,
author = {Amihood Amir and
Panagiotis Charalampopoulos and
Solon P. Pissis and
Jakub Radoszewski},
title = {Dynamic and Internal Longest Common Substring},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3707--3743},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00744-0},
doi = {10.1007/S00453-020-00744-0},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmirCPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmiriFS20,
author = {Saeed Akhoondian Amiri and
Klaus{-}Tycho Foerster and
Stefan Schmid},
title = {Walking Through Waypoints},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1784--1812},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00672-z},
doi = {10.1007/S00453-020-00672-Z},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmiriFS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnFKX20,
author = {Zhao An and
Qilong Feng and
Iyad Kanj and
Ge Xia},
title = {The Complexity of Tree Partitioning},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2606--2643},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00701-x},
doi = {10.1007/S00453-020-00701-X},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnFKX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngelopoulosRS20,
author = {Spyros Angelopoulos and
Marc P. Renault and
Pascal Schweitzer},
title = {Stochastic Dominance and the Bijective Ratio of Online Algorithms},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1101--1135},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00638-w},
doi = {10.1007/S00453-019-00638-W},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AngelopoulosRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AraujoCLSSS20,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Victor A. Campos and
Carlos Vin{\'{\i}}cius G. C. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
Ana Silva},
title = {Dual Parameterization of Weighted Coloring},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2316--2336},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00686-7},
doi = {10.1007/S00453-020-00686-7},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AraujoCLSSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AraujoCMSS20,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Victor A. Campos and
Ana Karolinna Maia and
Ignasi Sau and
Ana Silva},
title = {On the Complexity of Finding Internally Vertex-Disjoint Long Directed
Paths},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1616--1639},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00659-5},
doi = {10.1007/S00453-019-00659-5},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AraujoCMSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AronovBMW20,
author = {Boris Aronov and
Mark de Berg and
Aleksandar Markovic and
Gerhard J. Woeginger},
title = {Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar
Network Spaces},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1081--1100},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00639-9},
doi = {10.1007/S00453-019-00639-9},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AronovBMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AsinowskiBBG20,
author = {Andrei Asinowski and
Axel Bacher and
Cyril Banderier and
Bernhard Gittenberger},
title = {Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the
Vectorial Kernel Method, and Generating Functions for Pushdown Automata},
journal = {Algorithmica},
volume = {82},
number = {3},
pages = {386--428},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00623-3},
doi = {10.1007/S00453-019-00623-3},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AsinowskiBBG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AvarikiotiEKP20,
author = {Zeta Avarikioti and
Ioannis Z. Emiris and
Loukas Kavouras and
Ioannis Psarros},
title = {High-Dimensional Approximate r-Nets},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1675--1702},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00664-8},
doi = {10.1007/S00453-019-00664-8},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AvarikiotiEKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AvisD20,
author = {David Avis and
Luc Devroye},
title = {An Analysis of Budgeted Parallel Search on Conditional Galton-Watson
Trees},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1329--1345},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00645-x},
doi = {10.1007/S00453-019-00645-X},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AvisD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzizBGHMR20,
author = {Haris Aziz and
P{\'{e}}ter Bir{\'{o}} and
Serge Gaspers and
Ronald de Haan and
Nicholas Mattei and
Baharak Rastegari},
title = {Stable Matching with Uncertain Linear Preferences},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1410--1433},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00650-0},
doi = {10.1007/S00453-019-00650-0},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AzizBGHMR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanikCLRS20,
author = {Aritra Banik and
Pratibha Choudhary and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
title = {A Polynomial Sized Kernel for Tracking Paths Problem},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {41--63},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00602-8},
doi = {10.1007/S00453-019-00602-8},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BanikCLRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanikPRSS20,
author = {Aritra Banik and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot and
Saket Saurabh},
title = {Parameterized Complexity of Geometric Covering Problems Having Conflicts},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {1--19},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00600-w},
doi = {10.1007/S00453-019-00600-W},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BanikPRSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BansalBEKU20,
author = {Nikhil Bansal and
Martin B{\"{o}}hm and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos and
Seeun William Umboh},
title = {Nested Convex Bodies are Chaseable},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1640--1653},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00661-x},
doi = {10.1007/S00453-019-00661-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BansalBEKU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarberoIT20,
author = {Florian Barbero and
Lucas Isenmann and
Jocelyn Thiebaut},
title = {On the Distance Identifying Set Meta-problem and Applications to the
Complexity of Identifying Problems on Graphs},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2243--2266},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00674-x},
doi = {10.1007/S00453-020-00674-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BarberoIT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaumDPSWZ20,
author = {Moritz Baum and
Julian Dibbelt and
Thomas Pajor and
Jonas Sauer and
Dorothea Wagner and
Tobias Z{\"{u}}ndorf},
title = {Energy-Optimal Routes for Battery Electric Vehicles},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1490--1546},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00655-9},
doi = {10.1007/S00453-019-00655-9},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaumDPSWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeckerFKKRSS20,
author = {Aaron T. Becker and
S{\'{a}}ndor P. Fekete and
Phillip Keldenich and
Dominik Krupke and
Christian Rieck and
Christian Scheffer and
Arne Schmidt},
title = {Tilt Assembly: Algorithms for Micro-factories That Build Objects with
Uniform External Forces},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {165--187},
year = {2020},
url = {https://doi.org/10.1007/s00453-018-0483-9},
doi = {10.1007/S00453-018-0483-9},
timestamp = {Thu, 30 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BeckerFKKRSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteHLOO20,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Independent Set Reconfiguration Parameterized by Modular-Width},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2586--2605},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00700-y},
doi = {10.1007/S00453-020-00700-Y},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteHLOO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BensmailMINP20,
author = {Julien Bensmail and
Dorian Mazauric and
Fionn Mc Inerney and
Nicolas Nisse and
St{\'{e}}phane P{\'{e}}rennes},
title = {Sequential Metric Dimension},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2867--2901},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00707-5},
doi = {10.1007/S00453-020-00707-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BensmailMINP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BerbegliaJ20,
author = {Gerardo Berbeglia and
Gwena{\"{e}}l Joret},
title = {Assortment Optimisation Under a General Discrete Choice Model: {A}
Tight Analysis of Revenue-Ordered Assortments},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {681--720},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00610-8},
doi = {10.1007/S00453-019-00610-8},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BerbegliaJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BerglinB20,
author = {Edvin Berglin and
Gerth St{\o}lting Brodal},
title = {A Simple Greedy Algorithm for Dynamic Graph Orientation},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {245--259},
year = {2020},
url = {https://doi.org/10.1007/s00453-018-0528-0},
doi = {10.1007/S00453-018-0528-0},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BerglinB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergougnouxKK20,
author = {Benjamin Bergougnoux and
Mamadou Moustapha Kant{\'{e}} and
O{-}joung Kwon},
title = {An Optimal {XP} Algorithm for Hamiltonian Cycle on Graphs of Bounded
Clique-Width},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1654--1674},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00663-9},
doi = {10.1007/S00453-019-00663-9},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BergougnouxKK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhattacharyaCH20,
author = {Sayan Bhattacharya and
Deeparnab Chakrabarty and
Monika Henzinger},
title = {Deterministic Dynamic Matching in {O(1)} Update Time},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {1057--1080},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00630-4},
doi = {10.1007/S00453-019-00630-4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BhattacharyaCH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiedlCDM20,
author = {Therese Biedl and
Markus Chimani and
Martin Derka and
Petra Mutzel},
title = {Crossing Number for Graphs with Bounded Pathwidth},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {355--384},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00653-x},
doi = {10.1007/S00453-019-00653-X},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiedlCDM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloCGLP20,
author = {Davide Bil{\`{o}} and
Feliciano Colella and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {An Improved Algorithm for Computing All the Best Swap Edges of a Tree
Spanner},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {279--299},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00549-w},
doi = {10.1007/S00453-019-00549-W},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloCGLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlindKV20,
author = {Sarah Blind and
Kolja Knauer and
Petru Valicov},
title = {Enumerating k-Arc-Connected Orientations},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3588--3603},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00738-y},
doi = {10.1007/S00453-020-00738-Y},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BlindKV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderHKKOO20,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Yoshio Okamoto and
Yota Otachi and
Tom C. van der Zanden},
title = {Subgraph Isomorphism on Graph Classes that Exclude a Substructure},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3566--3587},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00737-z},
doi = {10.1007/S00453-020-00737-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderHKKOO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bonifaci20,
author = {Vincenzo Bonifaci},
title = {On the Convergence Time of a Natural Dynamics for Linear Programming},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {300--315},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00615-3},
doi = {10.1007/S00453-019-00615-3},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Bonifaci20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetBCTW20,
author = {{\'{E}}douard Bonnet and
Nicolas Bousquet and
Pierre Charbit and
St{\'{e}}phan Thomass{\'{e}} and
R{\'{e}}mi Watrigant},
title = {Parameterized Complexity of Independent Set in H-Free Graphs},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2360--2394},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00730-6},
doi = {10.1007/S00453-020-00730-6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetBCTW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetCMP20,
author = {{\'{E}}douard Bonnet and
Sergio Cabello and
Bojan Mohar and
Hebert P{\'{e}}rez{-}Ros{\'{e}}s},
title = {The Inverse Voronoi Problem in Graphs {I:} Hardness},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {3018--3040},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00716-4},
doi = {10.1007/S00453-020-00716-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetCMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BouchardDPP20,
author = {S{\'{e}}bastien Bouchard and
Yoann Dieudonn{\'{e}} and
Andrzej Pelc and
Franck Petit},
title = {Deterministic Treasure Hunt in the Plane with Angular Hints},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3250--3281},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00724-4},
doi = {10.1007/S00453-020-00724-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BouchardDPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannHM20,
author = {Karl Bringmann and
Thore Husfeldt and
M{\aa}ns Magnusson},
title = {Multivariate Analysis of Orthogonal Range Searching and Graph Distances},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2292--2315},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00680-z},
doi = {10.1007/S00453-020-00680-Z},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannHM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrubachSSX20,
author = {Brian Brubach and
Karthik Abinav Sankararaman and
Aravind Srinivasan and
Pan Xu},
title = {Attenuate Locally, Win Globally: Attenuation-Based Frameworks for
Online Stochastic Matching with Timeouts},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {64--87},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00603-7},
doi = {10.1007/S00453-019-00603-7},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BrubachSSX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrubachSSX20a,
author = {Brian Brubach and
Karthik Abinav Sankararaman and
Aravind Srinivasan and
Pan Xu},
title = {Online Stochastic Matching: New Algorithms and Bounds},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2737--2783},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00698-3},
doi = {10.1007/S00453-020-00698-3},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrubachSSX20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BulteauS20,
author = {Laurent Bulteau and
Markus L. Schmid},
title = {Consensus Strings with Small Maximum Distance and Small Distance Sum},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1378--1409},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00647-9},
doi = {10.1007/S00453-019-00647-9},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BulteauS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CardinalNW20,
author = {Jean Cardinal and
Jerri Nummenpalo and
Emo Welzl},
title = {Solving and Sampling with Many Solutions},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1474--1489},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00654-w},
doi = {10.1007/S00453-019-00654-W},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CardinalNW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaretteLM20,
author = {Titouan Carette and
Mathieu Lauri{\`{e}}re and
Fr{\'{e}}d{\'{e}}ric Magniez},
title = {Extended Learning Graphs for Triangle Finding},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {980--1005},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00627-z},
doi = {10.1007/S00453-019-00627-Z},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CaretteLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanCYP20,
author = {Huang{-}Ting Chan and
Hsuan{-}Tsung Chiu and
Chang{-}Biau Yang and
Yung{-}Hsing Peng},
title = {The Generalized Definitions of the Two-Dimensional Largest Common
Substructure Problems},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {2039--2062},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00685-8},
doi = {10.1007/S00453-020-00685-8},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanCYP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChauhanFR20,
author = {Ankit Chauhan and
Tobias Friedrich and
Ralf Rothenberger},
title = {Greed is Good for Deterministic Scale-Free Networks},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3338--3389},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00729-z},
doi = {10.1007/S00453-020-00729-Z},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChauhanFR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenJP20,
author = {Hubie Chen and
Bart M. P. Jansen and
Astrid Pieterse},
title = {Best-Case and Worst-Case Sparsifiability of Boolean CSPs},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2200--2242},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00660-y},
doi = {10.1007/S00453-019-00660-Y},
timestamp = {Wed, 26 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenJP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChengJY20,
author = {Siu{-}Wing Cheng and
Kai Jin and
Lie Yan},
title = {Extensions of Self-Improving Sorters},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {88--106},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00604-6},
doi = {10.1007/S00453-019-00604-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChengJY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChiangP20,
author = {Robert Chiang and
Kanstantsin Pashkovich},
title = {On the Approximability of the Stable Matching Problem with Ties of
Size Two},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2668--2686},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00703-9},
doi = {10.1007/S00453-020-00703-9},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChiangP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChrobakDFN20,
author = {Marek Chrobak and
Christoph D{\"{u}}rr and
Aleksander Fabijan and
Bengt J. Nilsson},
title = {Online Clique Clustering},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {938--965},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00625-1},
doi = {10.1007/S00453-019-00625-1},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChrobakDFN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CohenINP20,
author = {Nathann Cohen and
Fionn Mc Inerney and
Nicolas Nisse and
St{\'{e}}phane P{\'{e}}rennes},
title = {Study of a Combinatorial Game in Graphs Through Linear Programming},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {212--244},
year = {2020},
url = {https://doi.org/10.1007/s00453-018-0503-9},
doi = {10.1007/S00453-018-0503-9},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CohenINP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ConiglioGM20,
author = {Stefano Coniglio and
Nicola Gatti and
Alberto Marchesi},
title = {Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers:
The Mixed-Pure Case},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1189--1238},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00648-8},
doi = {10.1007/S00453-019-00648-8},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ConiglioGM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ConteGMV20,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Luca Versari},
title = {Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration
in Graphs},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1547--1573},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00656-8},
doi = {10.1007/S00453-019-00656-8},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ConteGMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CorusO20,
author = {Dogan Corus and
Pietro S. Oliveto},
title = {On the Benefits of Populations for the Exploitation Speed of Standard
Steady-State Genetic Algorithms},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3676--3706},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00743-1},
doi = {10.1007/S00453-020-00743-1},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CorusO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DabrowskiFJPPR20,
author = {Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
title = {On Cycle Transversals and Their Connected Variants in the Absence
of a Small Linear Forest},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2841--2866},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00706-6},
doi = {10.1007/S00453-020-00706-6},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DabrowskiFJPPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Damaschke20,
author = {Peter Damaschke},
title = {Dividing Splittable Goods Evenly and With Limited Fragmentation},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1298--1328},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00643-z},
doi = {10.1007/S00453-019-00643-Z},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Damaschke20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DasGuptaJY20,
author = {Bhaskar DasGupta and
Mano Vikash Janardhanan and
Farzane Yahyanejad},
title = {Why Did the Shape of Your Network Change? (On Detecting Network Anomalies
via Non-local Curvatures)},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1741--1783},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00665-7},
doi = {10.1007/S00453-019-00665-7},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DasGuptaJY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DeligkasFS20,
author = {Argyrios Deligkas and
John Fearnley and
Paul G. Spirakis},
title = {Lipschitz Continuity and Approximate Equilibria},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2927--2954},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00709-3},
doi = {10.1007/S00453-020-00709-3},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DeligkasFS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DingX20,
author = {Hu Ding and
Jinhui Xu},
title = {A Unified Framework for Clustering Constrained Data Without Locality
Property},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {808--852},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00616-2},
doi = {10.1007/S00453-019-00616-2},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DingX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DobrevKKLMNOS20,
author = {Stefan Dobrev and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
J{\'{a}}n Manuch and
Lata Narayanan and
Jaroslav Opatrny and
Ladislav Stacho},
title = {Weak Coverage of a Rectangular Barrier},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {721--746},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00611-7},
doi = {10.1007/S00453-019-00611-7},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DobrevKKLMNOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DucoffeLN20,
author = {Guillaume Ducoffe and
Sylvain Legay and
Nicolas Nisse},
title = {On the Complexity of Computing Treebreadth},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1574--1600},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00657-7},
doi = {10.1007/S00453-019-00657-7},
timestamp = {Fri, 24 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DucoffeLN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DurrEMM20,
author = {Christoph D{\"{u}}rr and
Thomas Erlebach and
Nicole Megow and
Julie Mei{\ss}ner},
title = {An Adversarial Model for Scheduling with Testing},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3630--3675},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00742-2},
doi = {10.1007/S00453-020-00742-2},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DurrEMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EdelkampWW20,
author = {Stefan Edelkamp and
Armin Wei{\ss} and
Sebastian Wild},
title = {QuickXsort: {A} Fast Sorting Scheme in Theory and Practice},
journal = {Algorithmica},
volume = {82},
number = {3},
pages = {509--588},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00634-0},
doi = {10.1007/S00453-019-00634-0},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EdelkampWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EppsteinH20,
author = {David Eppstein and
Elham Havvaei},
title = {Parameterized Leaf Power Recognition via Embedding into Graph Products},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2337--2359},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00720-8},
doi = {10.1007/S00453-020-00720-8},
timestamp = {Wed, 26 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EppsteinH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FaroMP20,
author = {Simone Faro and
Francesco Pio Marino and
Arianna Pavone},
title = {Efficient Online String Matching Based on Characters Distance Text
Sampling},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3390--3412},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00732-4},
doi = {10.1007/S00453-020-00732-4},
timestamp = {Sat, 14 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FaroMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeldmannM20,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
title = {The Parameterized Hardness of the k-Center Problem in Transportation
Networks},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1989--2005},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00683-w},
doi = {10.1007/S00453-020-00683-W},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeldmannM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FillW20,
author = {James Allen Fill and
Mark Daniel Ward},
title = {Special Issue on Analysis of Algorithms},
journal = {Algorithmica},
volume = {82},
number = {3},
pages = {385},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00668-4},
doi = {10.1007/S00453-019-00668-4},
timestamp = {Wed, 05 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FillW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominGR20,
author = {Fedor V. Fomin and
Petr A. Golovach and
Jean{-}Florent Raymond},
title = {On the Tractability of Optimization Problems on H-Graphs},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2432--2473},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00692-9},
doi = {10.1007/S00453-020-00692-9},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominGR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominGST20,
author = {Fedor V. Fomin and
Petr A. Golovach and
Torstein J. F. Str{\o}mme and
Dimitrios M. Thilikos},
title = {Subgraph Complementation},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1859--1880},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00677-8},
doi = {10.1007/S00453-020-00677-8},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominGST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FreksenL20,
author = {Casper Benjamin Freksen and
Kasper Green Larsen},
title = {On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss
Transforms},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {338--354},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00644-y},
doi = {10.1007/S00453-019-00644-Y},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FreksenL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fulek20,
author = {Radoslav Fulek},
title = {Embedding Graphs into Embedded Graphs},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3282--3305},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00725-3},
doi = {10.1007/S00453-020-00725-3},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Fulek20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GagieHN20,
author = {Travis Gagie and
Meng He and
Gonzalo Navarro},
title = {Compressed Dynamic Range Majority and Minority Data Structures},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {2063--2086},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00687-6},
doi = {10.1007/S00453-020-00687-6},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GagieHN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GangulyST20,
author = {Arnab Ganguly and
Rahul Shah and
Sharma V. Thankachan},
title = {Succinct Non-overlapping Indexing},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {107--117},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00605-5},
doi = {10.1007/S00453-019-00605-5},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GangulyST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GemsaNN20,
author = {Andreas Gemsa and
Benjamin Niedermann and
Martin N{\"{o}}llenburg},
title = {Placing Labels in Road Maps: Algorithms and Complexity},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1881--1908},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00678-7},
doi = {10.1007/S00453-020-00678-7},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GemsaNN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GemsaNN20a,
author = {Andreas Gemsa and
Benjamin Niedermann and
Martin N{\"{o}}llenburg},
title = {A Unified Model and Algorithms for Temporal Map Labeling},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2709--2736},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00694-7},
doi = {10.1007/S00453-020-00694-7},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GemsaNN20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GluckK20,
author = {Roland Gl{\"{u}}ck and
Dominik K{\"{o}}ppl},
title = {Computational Aspects of Ordered Integer Partitions with Bounds},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2955--2984},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00713-7},
doi = {10.1007/S00453-020-00713-7},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GluckK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHKLP20,
author = {Petr A. Golovach and
Pinar Heggernes and
Athanasios L. Konstantinidis and
Paloma T. Lima and
Charis Papadopoulos},
title = {Parameterized Aspects of Strong Subgraph Closure},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {2006--2038},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00684-9},
doi = {10.1007/S00453-020-00684-9},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GoyalM20,
author = {Keshav Goyal and
Tobias M{\"{o}}mke},
title = {Robust Reoptimization of Steiner Trees},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1966--1988},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00682-x},
doi = {10.1007/S00453-020-00682-X},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GoyalM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GruttemeierK20,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz},
title = {On the Relation of Strong Triadic Closure and Cluster Deletion},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {853--880},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00617-1},
doi = {10.1007/S00453-019-00617-1},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GruttemeierK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GrzegorekJZ20,
author = {Paulina Grzegorek and
Janusz Januszewski and
Lukasz Zielonka},
title = {Efficient 1-Space Bounded Hypercube Packing Algorithm},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3216--3249},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00723-5},
doi = {10.1007/S00453-020-00723-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GrzegorekJZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuptaRSZ20,
author = {Sushmita Gupta and
Sanjukta Roy and
Saket Saurabh and
Meirav Zehavi},
title = {Quadratic Vertex Kernel for Rainbow Matching},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {881--897},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00618-0},
doi = {10.1007/S00453-019-00618-0},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GuptaRSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HabibM20,
author = {Michel Habib and
Lalla Mouatadid},
title = {Maximum Induced Matching Algorithms via Vertex Ordering Characterizations},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {260--278},
year = {2020},
url = {https://doi.org/10.1007/s00453-018-00538-5},
doi = {10.1007/S00453-018-00538-5},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HabibM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Hagerup20,
author = {Torben Hagerup},
title = {Space-Efficient {DFS} and Applications to Connectivity Problems: Simpler,
Leaner, Faster},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {1033--1056},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00629-x},
doi = {10.1007/S00453-019-00629-X},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Hagerup20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Han20,
author = {Yijie Han},
title = {Sorting Real Numbers in {\textdollar}O{\textbackslash}big (n{\textbackslash}sqrt\{{\textbackslash}log
n\}{\textbackslash}big ){\textdollar} Time and Linear Space},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {966--978},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00626-0},
doi = {10.1007/S00453-019-00626-0},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Han20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Han20a,
author = {Yijie Han},
title = {Correction to: Sorting Real Numbers in {\textdollar}O(n{\textbackslash}sqrt\{{\textbackslash}log
n\}){\textdollar} Time and Linear Space},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {979},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00652-y},
doi = {10.1007/S00453-019-00652-Y},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Han20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HanakaKLOS20,
author = {Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Yota Otachi and
Florian Sikora},
title = {Parameterized Orientable Deletion},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1909--1938},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00679-6},
doi = {10.1007/S00453-020-00679-6},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HanakaKLOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HassinRSS20,
author = {Refael Hassin and
R. Ravi and
F. Sibel Salman and
Danny Segev},
title = {The Approximability of Multiple Facility Location on Directed Networks
with Random Arc Failures},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2474--2501},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00693-8},
doi = {10.1007/S00453-020-00693-8},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HassinRSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HayashiY20,
author = {Kohei Hayashi and
Yuichi Yoshida},
title = {Testing Proximity to Subspaces: Approximate {\(\mathscr{l}\)} \({}_{\mbox{{\(\infty\)}}}\)
Minimization in Constant Time},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1277--1297},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00642-0},
doi = {10.1007/S00453-019-00642-0},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HayashiY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HenzingerLM20,
author = {Monika Henzinger and
Dariusz Leniowski and
Claire Mathieu},
title = {Dynamic Clustering to Minimize the Sum of Radii},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3183--3194},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00721-7},
doi = {10.1007/S00453-020-00721-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HenzingerLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinMPSY20,
author = {Danny Hermelin and
George Manoussakis and
Michael L. Pinedo and
Dvir Shabtay and
Liron Yedidsion},
title = {Parameterized Multi-Scenario Single-Machine Scheduling Problems},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2644--2667},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00702-w},
doi = {10.1007/S00453-020-00702-W},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinMPSY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HershbergerKS20,
author = {John Hershberger and
Neeraj Kumar and
Subhash Suri},
title = {Shortest Paths in the Plane with Obstacle Violations},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1813--1832},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00673-y},
doi = {10.1007/S00453-020-00673-Y},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HershbergerKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HeubergerK20,
author = {Clemens Heuberger and
Daniel Krenn},
title = {Asymptotic Analysis of Regular Sequences},
journal = {Algorithmica},
volume = {82},
number = {3},
pages = {429--508},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00631-3},
doi = {10.1007/S00453-019-00631-3},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HeubergerK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangKY20,
author = {Chien{-}Chung Huang and
Naonori Kakimura and
Yuichi Yoshida},
title = {Streaming Algorithms for Maximizing Monotone Submodular Functions
Under a Knapsack Constraint},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {1006--1032},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00628-y},
doi = {10.1007/S00453-019-00628-Y},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangKY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangX20,
author = {Ziyun Huang and
Jinhui Xu},
title = {An Efficient Sum Query Algorithm for Distance-Based Locally Dominating
Functions},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2415--2431},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00691-w},
doi = {10.1007/S00453-020-00691-W},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangYZ20,
author = {Zengfeng Huang and
Ke Yi and
Qin Zhang},
title = {Correction to: Randomized Algorithms for Tracking Distributed Count,
Frequencies, and Ranks},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3413},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00755-x},
doi = {10.1007/S00453-020-00755-X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangYZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JaffkeKT20,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
title = {Mim-Width {II.} The Feedback Vertex Set Problem},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {118--145},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00607-3},
doi = {10.1007/S00453-019-00607-3},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JaffkeKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Janson20,
author = {Svante Janson},
title = {Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns},
journal = {Algorithmica},
volume = {82},
number = {3},
pages = {616--641},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00586-5},
doi = {10.1007/S00453-019-00586-5},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Janson20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JohnsonPP20,
author = {Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
title = {Connected Vertex Cover for (sP\({}_{\mbox{1+P\({}_{\mbox{5)}}\)}}\)-Free
Graphs},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {20--40},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00601-9},
doi = {10.1007/S00453-019-00601-9},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JohnsonPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kamiyama20,
author = {Naoyuki Kamiyama},
title = {The Distance-Constrained Matroid Median Problem},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {2087--2106},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00688-5},
doi = {10.1007/S00453-020-00688-5},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kamiyama20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KangasKS20,
author = {Kustaa Kangas and
Mikko Koivisto and
Sami Salonen},
title = {A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2156--2173},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00633-1},
doi = {10.1007/S00453-019-00633-1},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KangasKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaplanMRS20,
author = {Haim Kaplan and
Wolfgang Mulzer and
Liam Roditty and
Paul Seiferth},
title = {Reachability Oracles for Directed Transmission Graphs},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1259--1276},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00641-1},
doi = {10.1007/S00453-019-00641-1},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KaplanMRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarppaKKC20,
author = {Matti Karppa and
Petteri Kaski and
Jukka Kohonen and
Padraig {\'{O}} Cath{\'{a}}in},
title = {Explicit Correlation Amplifiers for Finding Outlier Correlations in
Deterministic Subquadratic Time},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3306--3337},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00727-1},
doi = {10.1007/S00453-020-00727-1},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KarppaKKC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlimosovaMMNPS20,
author = {Tereza Klimosov{\'{a}} and
Josef Mal{\'{\i}}k and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Dani{\"{e}}l Paulusma and
Veronika Sl{\'{i}}vov{\'{a}}},
title = {Colouring (P\({}_{\mbox{r}}\) + P\({}_{\mbox{s}}\))-Free Graphs},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1833--1858},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00675-w},
doi = {10.1007/S00453-020-00675-W},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KlimosovaMMNPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KosolobovVNP20,
author = {Dmitry Kosolobov and
Daniel Valenzuela and
Gonzalo Navarro and
Simon J. Puglisi},
title = {Lempel-Ziv-Like Parsing in Small Space},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3195--3215},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00722-6},
doi = {10.1007/S00453-020-00722-6},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KosolobovVNP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KratschLMPW20,
author = {Stefan Kratsch and
Shaohua Li and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Multi-budgeted Directed Cuts},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2135--2155},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00609-1},
doi = {10.1007/S00453-019-00609-1},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KratschLMPW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KutielR20,
author = {Gilad Kutiel and
Dror Rawitz},
title = {Local Search Algorithms for the Maximum Carpool Matching Problem},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3165--3182},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00719-1},
doi = {10.1007/S00453-020-00719-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KutielR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LeviRR20,
author = {Reut Levi and
Dana Ron and
Ronitt Rubinfeld},
title = {Local Algorithms for Sparse Spanning Graphs},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {747--786},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00612-6},
doi = {10.1007/S00453-019-00612-6},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LeviRR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiSZ20,
author = {Qian Li and
Xiaoming Sun and
Jialin Zhang},
title = {On the Optimality of Tape Merge of Two Lists with Similar Size},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {2107--2132},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00690-x},
doi = {10.1007/S00453-020-00690-X},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiXY20,
author = {Shi Li and
Jinhui Xu and
Minwei Ye},
title = {Approximating Global Optimum for Probabilistic Truth Discovery},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {3091--3116},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00715-5},
doi = {10.1007/S00453-020-00715-5},
timestamp = {Wed, 28 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiXY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LinKH20,
author = {Ching{-}Chi Lin and
Keng{-}Chu Ku and
Chan{-}Hung Hsu},
title = {Paired-Domination Problem on Distance-Hereditary Graphs},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2809--2840},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00705-7},
doi = {10.1007/S00453-020-00705-7},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LinKH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Liu20,
author = {Chih{-}Hung Liu},
title = {A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points
in a Simple Polygon},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {915--937},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00624-2},
doi = {10.1007/S00453-019-00624-2},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Liu20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiuLW20,
author = {Fu{-}Hong Liu and
Hsiang{-}Hsuan Liu and
Prudence W. H. Wong},
title = {Non-preemptive Scheduling in a Smart Grid Model and Its Implications
on Machine Minimization},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3415--3457},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00733-3},
doi = {10.1007/S00453-020-00733-3},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LiuLW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LozzoBFPR20,
author = {Giordano Da Lozzo and
Giuseppe Di Battista and
Fabrizio Frati and
Maurizio Patrignani and
Vincenzo Roselli},
title = {Upward Planar Morphs},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2985--3017},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00714-6},
doi = {10.1007/S00453-020-00714-6},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LozzoBFPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MajumdarRS20,
author = {Diptapriyo Majumdar and
M. S. Ramanujan and
Saket Saurabh},
title = {On the Approximate Compressibility of Connected Vertex Cover},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2902--2926},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00708-4},
doi = {10.1007/S00453-020-00708-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MajumdarRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MaskeCD20,
author = {Charles Maske and
Jaime Cohen and
Elias P. Duarte Jr.},
title = {Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient
Graph Contractions},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1601--1615},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00658-6},
doi = {10.1007/S00453-019-00658-6},
timestamp = {Mon, 24 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MaskeCD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MatlZ20,
author = {Gregor Matl and
Stanislav Zivn{\'{y}}},
title = {Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3492--3520},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00735-1},
doi = {10.1007/S00453-020-00735-1},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MatlZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Matsubayashi20,
author = {Akira Matsubayashi},
title = {A {\textdollar}3+{\textbackslash}varOmega (1){\textdollar} Lower Bound
for Page Migration},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2535--2563},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00696-5},
doi = {10.1007/S00453-020-00696-5},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Matsubayashi20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MatsuokaS20,
author = {Tatsuya Matsuoka and
Shun Sato},
title = {Making Bidirected Graphs Strongly Connected},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {787--807},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00613-5},
doi = {10.1007/S00453-019-00613-5},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MatsuokaS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MeeksS20,
author = {Kitty Meeks and
Fiona Skerman},
title = {The Parameterised Complexity of Computing the Maximum Modularity of
a Graph},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2174--2199},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00649-7},
doi = {10.1007/S00453-019-00649-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MeeksS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MertziosNN20,
author = {George B. Mertzios and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {The Power of Linear-Time Data Reduction for Maximum Matching},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3521--3565},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00736-0},
doi = {10.1007/S00453-020-00736-0},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MertziosNN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MnichS20,
author = {Matthias Mnich and
Ildik{\'{o}} Schlotter},
title = {Stable Matchings with Covering Constraints: {A} Complete Computational
Trichotomy},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1136--1188},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00636-y},
doi = {10.1007/S00453-019-00636-Y},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MnichS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MunroNN20,
author = {J. Ian Munro and
Gonzalo Navarro and
Yakov Nekrich},
title = {Fast Compressed Self-indexes with Deterministic Linear-Time Construction},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {316--337},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00637-x},
doi = {10.1007/S00453-019-00637-X},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MunroNN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MutzeN20,
author = {Torsten M{\"{u}}tze and
Jerri Nummenpalo},
title = {A Constant-Time Algorithm for Middle Levels Gray Codes},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1239--1258},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00640-2},
doi = {10.1007/S00453-019-00640-2},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MutzeN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NagataI20,
author = {Yuichi Nagata and
Shinji Imahori},
title = {An Efficient Exhaustive Search Algorithm for the Escherization Problem},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2502--2534},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00695-6},
doi = {10.1007/S00453-020-00695-6},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NagataI20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/OhBA20,
author = {Eunjin Oh and
Luis Barba and
Hee{-}Kap Ahn},
title = {The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1434--1473},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00651-z},
doi = {10.1007/S00453-019-00651-Z},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/OhBA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Okamoto20,
author = {Yoshio Okamoto},
title = {Guest Editorial: Selected Papers from {ISAAC} 2017},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {163--164},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00669-3},
doi = {10.1007/S00453-019-00669-3},
timestamp = {Thu, 30 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Okamoto20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ParterP20,
author = {Merav Parter and
David Peleg},
title = {Fault Tolerant Approximate {BFS} Structures with Additive Stretch},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3458--3491},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00734-2},
doi = {10.1007/S00453-020-00734-2},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ParterP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PaulP20,
author = {Christophe Paul and
Michal Pilipczuk},
title = {Special Issue Dedicated to the 13th International Symposium on Parameterized
and Exact Computation},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2133--2134},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00748-w},
doi = {10.1007/S00453-020-00748-W},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PaulP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PilipczukLW20,
author = {Michal Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese},
title = {Quasi-Polynomial Time Approximation Schemes for Packing and Covering
Problems in Planar Graphs},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1703--1739},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00670-w},
doi = {10.1007/S00453-019-00670-W},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PilipczukLW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PreisserS20,
author = {Johanna E. Prei{\ss}er and
Jens M. Schmidt},
title = {Computing Vertex-Disjoint Paths in Large Graphs Using MAOs},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {146--162},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00608-2},
doi = {10.1007/S00453-019-00608-2},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PreisserS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RalaivaosaonaSW20,
author = {Dimbinaina Ralaivaosaona and
Matas Sileikis and
Stephan G. Wagner},
title = {A Central Limit Theorem for Almost Local Additive Tree Functionals},
journal = {Algorithmica},
volume = {82},
number = {3},
pages = {642--679},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00622-4},
doi = {10.1007/S00453-019-00622-4},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RalaivaosaonaSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RothS20,
author = {Marc Roth and
Johannes Schmitt},
title = {Counting Induced Subgraphs: {A} Topological Approach to {\#}W[1]-hardness},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2267--2291},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00676-9},
doi = {10.1007/S00453-020-00676-9},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RothS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShiSFKN20,
author = {Feng Shi and
Martin Schirneck and
Tobias Friedrich and
Timo K{\"{o}}tzing and
Frank Neumann},
title = {Correction to: Reoptimization Time Analysis of Evolutionary Algorithms
on Linear Functions Under Dynamic Uniform Constraints},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {3117--3123},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00739-x},
doi = {10.1007/S00453-020-00739-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ShiSFKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/TakagiIABH20,
author = {Takuya Takagi and
Shunsuke Inenaga and
Hiroki Arimura and
Dany Breslauer and
Diptarama Hendrian},
title = {Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction
for Multiple Texts},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1346--1377},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00646-w},
doi = {10.1007/S00453-019-00646-W},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/TakagiIABH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/TurowskiMS20,
author = {Krzysztof Turowski and
Abram Magner and
Wojciech Szpankowski},
title = {Compression of Dynamic Graphs Generated by a Duplication Model},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2687--2707},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00699-2},
doi = {10.1007/S00453-020-00699-2},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/TurowskiMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X20,
title = {Special Issue on Computing and Combinatorics},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {3065},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00740-4},
doi = {10.1007/S00453-020-00740-4},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/X20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/XiaoN20,
author = {Mingyu Xiao and
Hiroshi Nagamochi},
title = {Characterizing Star-PCGs},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {3066--3090},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00712-8},
doi = {10.1007/S00453-020-00712-8},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/XiaoN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/YedidsionABCKS20,
author = {Harel Yedidsion and
Stav Ashur and
Aritra Banik and
Paz Carmi and
Matthew J. Katz and
Michael Segal},
title = {Sensor Network Topology Design and Analysis for Efficient Data Gathering
by a Mobile Mule},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2784--2808},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00704-8},
doi = {10.1007/S00453-020-00704-8},
timestamp = {Fri, 25 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/YedidsionABCKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Yokoi20,
author = {Yu Yokoi},
title = {Envy-Free Matchings with Lower Quotas},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {188--211},
year = {2020},
url = {https://doi.org/10.1007/s00453-018-0493-7},
doi = {10.1007/S00453-018-0493-7},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Yokoi20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Zaker20,
author = {Manouchehr Zaker},
title = {A New Vertex Coloring Heuristic and Corresponding Chromatic Number},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2395--2414},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00689-4},
doi = {10.1007/S00453-020-00689-4},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Zaker20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ZhangCCL20,
author = {An Zhang and
Yong Chen and
Zhi{-}Zhong Chen and
Guohui Lin},
title = {Improved Approximation Algorithms for Path Vertex Covers in Regular
Graphs},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {3041--3064},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00717-3},
doi = {10.1007/S00453-020-00717-3},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ZhangCCL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ZurS20,
author = {Yoad Zur and
Michael Segal},
title = {Improved Solution to Data Gathering with Mobile Mule},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3125--3164},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00718-2},
doi = {10.1007/S00453-020-00718-2},
timestamp = {Sat, 14 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ZurS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersP19,
author = {Susanne Albers and
Achim Passen},
title = {New Online Algorithms for Story Scheduling in Web Advertising},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {1--25},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0428-3},
doi = {10.1007/S00453-018-0428-3},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmirKLPPS19,
author = {Amihood Amir and
Tsvi Kopelowitz and
Avivit Levy and
Seth Pettie and
Ely Porat and
B. Riva Shalom},
title = {Mind the Gap! - Online Dictionary Matching with One Gap},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2123--2157},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0526-2},
doi = {10.1007/S00453-018-0526-2},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmirKLPPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmirLLLP19,
author = {Amihood Amir and
Avivit Levy and
Moshe Lewenstein and
Ronit Lubin and
Benny Porat},
title = {Can We Recover the Cover?},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2857--2875},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00559-8},
doi = {10.1007/S00453-019-00559-8},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmirLLLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnastasiadisDKL19,
author = {Eleftherios Anastasiadis and
Xiaotie Deng and
Piotr Krysta and
Minming Li and
Han Qiao and
Jinshan Zhang},
title = {Network Pollution Games},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {124--166},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0435-4},
doi = {10.1007/S00453-018-0435-4},
timestamp = {Wed, 05 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnastasiadisDKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngeliniB19,
author = {Patrizio Angelini and
Michael A. Bekos},
title = {Hierarchical Partial Planarity},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2196--2221},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0530-6},
doi = {10.1007/S00453-018-0530-6},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AngeliniB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngeliniBLM19,
author = {Patrizio Angelini and
Michael A. Bekos and
Giuseppe Liotta and
Fabrizio Montecchiani},
title = {Universal Slope Sets for 1-Bend Planar Drawings},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2527--2556},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00542-9},
doi = {10.1007/S00453-018-00542-9},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AngeliniBLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngeliniL19,
author = {Patrizio Angelini and
Giordano Da Lozzo},
title = {Clustered Planarity with Pipes},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2484--2526},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00541-w},
doi = {10.1007/S00453-018-00541-W},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AngeliniL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngelopoulosDL19,
author = {Spyros Angelopoulos and
Reza Dorrigiv and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {On the Separation and Equivalence of Paging Strategies and Other Online
Algorithms},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1152--1179},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0461-2},
doi = {10.1007/S00453-018-0461-2},
timestamp = {Sat, 02 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AngelopoulosDL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngelopoulosLT19,
author = {Spyros Angelopoulos and
Giorgio Lucarelli and
Kim Thang Nguyen},
title = {Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms
for Generalized Flow-Time Problems},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3391--3421},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00583-8},
doi = {10.1007/S00453-019-00583-8},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AngelopoulosLT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntoniadisBNPS19,
author = {Antonios Antoniadis and
Neal Barcelo and
Michael Nugent and
Kirk Pruhs and
Michele Scquizzato},
title = {A o(n)-Competitive Deterministic Algorithm for Online Matching on
a Line},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2917--2933},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00565-w},
doi = {10.1007/S00453-019-00565-W},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AntoniadisBNPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntoniadisHO19,
author = {Antonios Antoniadis and
Chien{-}Chung Huang and
Sebastian Ott},
title = {A Fully Polynomial-Time Approximation Scheme for Speed Scaling with
a Sleep State},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3725--3745},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00596-3},
doi = {10.1007/S00453-019-00596-3},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AntoniadisHO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArumugamAGS19,
author = {Guru Prakash Arumugam and
John Augustine and
Mordecai J. Golin and
Prashanth Srikanthan},
title = {Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform
Capacities},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3534--3585},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00589-2},
doi = {10.1007/S00453-019-00589-2},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ArumugamAGS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BabichenkoEFPPS19,
author = {Yakov Babichenko and
Yuval Emek and
Michal Feldman and
Boaz Patt{-}Shamir and
Ron Peretz and
Rann Smorodinsky},
title = {Stable Secretaries},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3136--3161},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00569-6},
doi = {10.1007/S00453-019-00569-6},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BabichenkoEFPPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BacsoLMPTL19,
author = {G{\'{a}}bor Bacs{\'{o}} and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Zsolt Tuza and
Erik Jan van Leeuwen},
title = {Subexponential-Time Algorithms for Maximum Independent Set in {\textdollar}{\textdollar}P{\_}t{\textdollar}{\textdollar}
{P} t -Free and Broom-Free Graphs},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {421--438},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0479-5},
doi = {10.1007/S00453-018-0479-5},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BacsoLMPTL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BadanidiyuruDO19,
author = {Ashwinkumar Badanidiyuru and
Shahar Dobzinski and
Sigal Oren},
title = {Optimization with Demand Oracles},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2244--2269},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00532-x},
doi = {10.1007/S00453-018-00532-X},
timestamp = {Fri, 26 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BadanidiyuruDO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaiouB19,
author = {Mourad Ba{\"{\i}}ou and
Francisco Barahona},
title = {Faster Algorithms for Security Games on Matroids},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1232--1246},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0466-x},
doi = {10.1007/S00453-018-0466-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaiouB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaiouB19a,
author = {Mourad Ba{\"{\i}}ou and
Francisco Barahona},
title = {An Algorithm to Compute the Nucleolus of Shortest Path Games},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3099--3113},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00574-9},
doi = {10.1007/S00453-019-00574-9},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaiouB19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BampasCGIKKP19,
author = {Evangelos Bampas and
Jurek Czyzowicz and
Leszek Gasieniec and
David Ilcinkas and
Ralf Klasing and
Tomasz Kociumaka and
Dominik Pajak},
title = {Linear Search by a Pair of Distinct-Speed Robots},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {317--342},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0447-0},
doi = {10.1007/S00453-018-0447-0},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BampasCGIKKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BannisterDDEW19,
author = {Michael J. Bannister and
William E. Devanny and
Vida Dujmovic and
David Eppstein and
David R. Wood},
title = {Track Layouts, Layered Path Decompositions, and Leveled Planarity},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1561--1583},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0487-5},
doi = {10.1007/S00453-018-0487-5},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BannisterDDEW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BansalCLNN19,
author = {Nikhil Bansal and
Parinya Chalermsook and
Bundit Laekhanukit and
Danupon Nanongkai and
Jesper Nederlof},
title = {New Tools and Connections for Exponential-Time Approximation},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3993--4009},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0512-8},
doi = {10.1007/S00453-018-0512-8},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BansalCLNN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarbaCKLRRV19,
author = {Luis Barba and
Jean Cardinal and
Matias Korman and
Stefan Langerman and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
Sander Verdonschot},
title = {Dynamic Graph Coloring},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1319--1341},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0473-y},
doi = {10.1007/S00453-018-0473-Y},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BarbaCKLRRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarbaMNSTZZ19,
author = {Luis Barba and
Malte Milatz and
Jerri Nummenpalo and
Xiaoming Sun and
Antonis Thomas and
Jialin Zhang and
Zhijie Zhang},
title = {The Complexity of Optimization on Grids},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3494--3518},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00587-4},
doi = {10.1007/S00453-019-00587-4},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BarbaMNSTZZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaCR19,
author = {Surender Baswana and
Keerti Choudhary and
Liam Roditty},
title = {An Efficient Strongly Connected Components Algorithm in the Fault
Tolerant Model},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {967--985},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0452-3},
doi = {10.1007/S00453-018-0452-3},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaCR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BehsazFSS19,
author = {Babak Behsaz and
Zachary Friggstad and
Mohammad R. Salavatipour and
Rohit Sivakumar},
title = {Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1006--1030},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0454-1},
doi = {10.1007/S00453-018-0454-1},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BehsazFSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosFK19,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Michael Kaufmann},
title = {On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity
and Kandinsky Drawings},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {2046--2071},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0523-5},
doi = {10.1007/S00453-018-0523-5},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosFK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-BasatEFK19,
author = {Ran Ben{-}Basat and
Gil Einziger and
Roy Friedman and
Yaron Kassner},
title = {Succinct Summing over Sliding Windows},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {2072--2091},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0524-4},
doi = {10.1007/S00453-018-0524-4},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ben-BasatEFK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BentoBMSS19,
author = {Lucila M. S. Bento and
Davidson R. Boccardo and
Raphael C. S. Machado and
Vin{\'{\i}}cius Gusm{\~{a}}o Pereira de S{\'{a}} and
Jayme Luiz Szwarcfiter},
title = {Full Characterization of a Class of Graphs Tailored for Software Watermarking},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2899--2916},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00557-w},
doi = {10.1007/S00453-019-00557-W},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BentoBMSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bentz19,
author = {C{\'{e}}dric Bentz},
title = {An {FPT} Algorithm for Planar Multicuts with Sources and Sinks on
the Outer Face},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {224--237},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0443-4},
doi = {10.1007/S00453-018-0443-4},
timestamp = {Tue, 15 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Bentz19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergBK19,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak},
title = {The Homogeneous Broadcast Problem in Narrow and Wide Strips {I:} Algorithms},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2934--2962},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00567-8},
doi = {10.1007/S00453-019-00567-8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergBK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergBK19a,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak},
title = {The Homogeneous Broadcast Problem in Narrow and Wide Strips {II:}
Lower Bounds},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2963--2990},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00561-0},
doi = {10.1007/S00453-019-00561-0},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergBK19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BermanMR19,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova},
title = {The Power and Limitations of Uniform Samples in Testing Properties
of Figures},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1247--1266},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0467-9},
doi = {10.1007/S00453-018-0467-9},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BermanMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiedlCLMMVY19,
author = {Therese Biedl and
Timothy M. Chan and
Stephanie Lee and
Saeed Mehrabi and
Fabrizio Montecchiani and
Hamideh Vosoughpour and
Ziting Yu},
title = {Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness
and Approximation},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {69--97},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0433-6},
doi = {10.1007/S00453-018-0433-6},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiedlCLMMVY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazBCCEMS19,
author = {Ahmad Biniaz and
Prosenjit Bose and
Kimberly Crosbie and
Jean{-}Lou De Carufel and
David Eppstein and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Maximum Plane Trees in Multipartite Geometric Graphs},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1512--1534},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0482-x},
doi = {10.1007/S00453-018-0482-X},
timestamp = {Wed, 10 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazBCCEMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BjorklundKW19,
author = {Andreas Bj{\"{o}}rklund and
Petteri Kaski and
Ryan Williams},
title = {Generalized Kakeya sets for polynomial evaluation and faster computation
of fermionants},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4010--4028},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0513-7},
doi = {10.1007/S00453-018-0513-7},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BjorklundKW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BohlerKL19,
author = {Cecilia Bohler and
Rolf Klein and
Chih{-}Hung Liu},
title = {An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi
Diagrams},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2317--2345},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00536-7},
doi = {10.1007/S00453-018-00536-7},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BohlerKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonamyDFJP19,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Independent Feedback Vertex Set for P\({}_{\mbox{5}}\)-Free Graphs},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1342--1369},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0474-x},
doi = {10.1007/S00453-018-0474-X},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonamyDFJP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetBKM19,
author = {{\'{E}}douard Bonnet and
Nick Brettell and
O{-}joung Kwon and
D{\'{a}}niel Marx},
title = {Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs:
Chordality is the Key to Single-Exponential Parameterized Algorithms},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3890--3935},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00579-4},
doi = {10.1007/S00453-019-00579-4},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetBKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetR19,
author = {{\'{E}}douard Bonnet and
Pawel Rzazewski},
title = {Optimality Program in Segment and String Graphs},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {3047--3073},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00568-7},
doi = {10.1007/S00453-019-00568-7},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseFRV19,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {On Plane Constrained Bounded-Degree Spanners},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1392--1415},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0476-8},
doi = {10.1007/S00453-018-0476-8},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoseFRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BougeretS19,
author = {Marin Bougeret and
Ignasi Sau},
title = {How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels
Beyond Sparse Graphs?},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4043--4068},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0468-8},
doi = {10.1007/S00453-018-0468-8},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BougeretS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarEFKL19,
author = {Joan Boyar and
Stephan J. Eidenbenz and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
title = {Online Dominating Set},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1938--1964},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0519-1},
doi = {10.1007/S00453-018-0519-1},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarEFKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandDR19,
author = {Cornelius Brand and
Holger Dell and
Marc Roth},
title = {Fine-Grained Dichotomies for the Tutte Plane and Boolean {\#}CSP},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {541--556},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0472-z},
doi = {10.1007/S00453-018-0472-Z},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandDR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Brandenburg19,
author = {Franz J. Brandenburg},
title = {Characterizing and Recognizing 4-Map Graphs},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1818--1843},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0510-x},
doi = {10.1007/S00453-018-0510-X},
timestamp = {Wed, 17 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Brandenburg19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandlK19,
author = {Florian Brandl and
Telikepalli Kavitha},
title = {Two Problems in Max-Size Popular Matchings},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2738--2764},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00553-0},
doi = {10.1007/S00453-019-00553-0},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandlK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandtW19,
author = {Sebastian Brandt and
Roger Wattenhofer},
title = {Approximating Small Balanced Vertex Separators in Almost Linear Time},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4070--4097},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0490-x},
doi = {10.1007/S00453-018-0490-X},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandtW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BredereckFKMNN19,
author = {Robert Bredereck and
Vincent Froese and
Marcel Koseler and
Marcelo Garlet Millani and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {A Parameterized Algorithmics Framework for Degree Sequence Completion
Problems in Directed Graphs},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1584--1614},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0494-6},
doi = {10.1007/S00453-018-0494-6},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BredereckFKMNN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BryantS19,
author = {David Bryant and
C{\'{e}}line Scornavacca},
title = {An O(n log n) Time Algorithm for Computing the Path-Length Distance
Between Trees},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3692--3706},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00594-5},
doi = {10.1007/S00453-019-00594-5},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BryantS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuchbinderST19,
author = {Niv Buchbinder and
Danny Segev and
Yevgeny Tkach},
title = {Online Algorithms for Maximum Cardinality Matching with Edge Arrivals},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1781--1799},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0505-7},
doi = {10.1007/S00453-018-0505-7},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuchbinderST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuchinKLS19,
author = {Kevin Buchin and
Irina Kostitsyna and
Maarten L{\"{o}}ffler and
Rodrigo I. Silveira},
title = {Region-Based Approximation of Probability Distributions (for Visibility
Between Imprecise Points Among Obstacles)},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2682--2715},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00551-2},
doi = {10.1007/S00453-019-00551-2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BuchinKLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuhrmanTUV19,
author = {Harry Buhrman and
Leen Torenvliet and
Falk Unger and
Nikolai K. Vereshchagin},
title = {Sparse Selfreducible Sets and Nonuniform Lower Bounds},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {179--200},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0439-0},
doi = {10.1007/S00453-018-0439-0},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BuhrmanTUV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BurjonsKS19,
author = {Elisabet Burjons and
Dennis Komm and
Marcel Sch{\"{o}}ngens},
title = {The k-Server Problem with Advice in d Dimensions and on the Sphere},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1859--1880},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0514-6},
doi = {10.1007/S00453-018-0514-6},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BurjonsKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuryGMMSVZ19,
author = {Marc Bury and
Elena Grigorescu and
Andrew McGregor and
Morteza Monemizadeh and
Chris Schwiegelshohn and
Sofya Vorotnikova and
Samson Zhou},
title = {Structural Results on Matching Estimation with Applications to Streaming},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {367--392},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0449-y},
doi = {10.1007/S00453-018-0449-Y},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BuryGMMSVZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaoC19,
author = {Yixin Cao and
Jianer Chen},
title = {Preface to the Special Issue on Computing and Combinatorics},
journal = {Algorithmica},
volume = {81},
number = {11-12},
pages = {4165--4166},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00632-2},
doi = {10.1007/S00453-019-00632-2},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CaoC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CarbonnelCCZ19,
author = {Cl{\'{e}}ment Carbonnel and
David A. Cohen and
Martin C. Cooper and
Stanislav Zivn{\'{y}}},
title = {On Singleton Arc Consistency for CSPs Defined by Monotone Patterns},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1699--1727},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0498-2},
doi = {10.1007/S00453-018-0498-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CarbonnelCCZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CarmelTZ19,
author = {Amir Carmel and
Dekel Tsur and
Michal Ziv{-}Ukelson},
title = {On Almost Monge All Scores Matrices},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {47--68},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0432-7},
doi = {10.1007/S00453-018-0432-7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CarmelTZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CasteigtsMRZ19,
author = {Arnaud Casteigts and
Yves M{\'{e}}tivier and
J. M. Robson and
Akka Zemmari},
title = {Deterministic Leader Election Takes {\(\Theta\)}(D+log n) Bit Rounds},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1901--1920},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0517-3},
doi = {10.1007/S00453-018-0517-3},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CasteigtsMRZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CenciarelliGS19,
author = {Pietro Cenciarelli and
Daniele Gorla and
Ivano Salvo},
title = {A Polynomial-Time Algorithm for Detecting the Possibility of Braess
Paradox in Directed Graphs},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1535--1560},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0486-6},
doi = {10.1007/S00453-018-0486-6},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CenciarelliGS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanHP19,
author = {Timothy M. Chan and
John Hershberger and
Simon Pratt},
title = {Two Approaches to Building Time-Windowed Geometric Data Structures},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3519--3533},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00588-3},
doi = {10.1007/S00453-019-00588-3},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanHP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanS19,
author = {Timothy M. Chan and
Dimitrios Skrepetos},
title = {Faster Approximate Diameter and Distance Oracles in Planar Graphs},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3075--3098},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00570-z},
doi = {10.1007/S00453-019-00570-Z},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenLWCW19,
author = {Zhi{-}Zhong Chen and
Guohui Lin and
Lusheng Wang and
Yong Chen and
Dan Wang},
title = {Approximation Algorithms for the Maximum Weight Internal Spanning
Tree Problem},
journal = {Algorithmica},
volume = {81},
number = {11-12},
pages = {4167--4199},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00533-w},
doi = {10.1007/S00453-018-00533-W},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenLWCW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenW19,
author = {Danny Z. Chen and
Haitao Wang},
title = {Computing L\({}_{\mbox{1}}\) Shortest Paths Among Polygonal Obstacles
in the Plane},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2430--2483},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00540-x},
doi = {10.1007/S00453-018-00540-X},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChitnisFS19,
author = {Rajesh Chitnis and
Andreas Emil Feldmann and
Ondrej Such{\'{y}}},
title = {A Tight Lower Bound for Planar Steiner Orientation},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3200--3216},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00580-x},
doi = {10.1007/S00453-019-00580-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChitnisFS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChudnovskySSSZ19,
author = {Maria Chudnovsky and
Oliver Schaudt and
Sophie Spirkl and
Maya Stein and
Mingxian Zhong},
title = {Approximately Coloring Graphs Without Long Induced Paths},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3186--3199},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00577-6},
doi = {10.1007/S00453-019-00577-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChudnovskySSSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CsehM19,
author = {{\'{A}}gnes Cseh and
Jannik Matuschke},
title = {New and Simple Algorithms for Stable Flow Problems},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2557--2591},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00544-7},
doi = {10.1007/S00453-018-00544-7},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CsehM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CurticapeanDFGL19,
author = {Radu Curticapean and
Holger Dell and
Fedor V. Fomin and
Leslie Ann Goldberg and
John Lapinskas},
title = {A Fixed-Parameter Perspective on {\#}BIS},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3844--3864},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00606-4},
doi = {10.1007/S00453-019-00606-4},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CurticapeanDFGL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CzumajDFFJS19,
author = {Artur Czumaj and
Argyrios Deligkas and
Michail Fasoulakis and
John Fearnley and
Marcin Jurdzinski and
Rahul Savani},
title = {Distributed Methods for Computing Approximate Equilibria},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1205--1231},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0465-y},
doi = {10.1007/S00453-018-0465-Y},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CzumajDFFJS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DangLN19,
author = {Duc{-}Cuong Dang and
Per Kristian Lehre and
Phan Trung Hai Nguyen},
title = {Level-Based Analysis of the Univariate Marginal Distribution Algorithm},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {668--702},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0507-5},
doi = {10.1007/S00453-018-0507-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DangLN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DaslerM19,
author = {Philip Dasler and
David M. Mount},
title = {Modular Circulation and Applications to Traffic Management},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4098--4117},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0491-9},
doi = {10.1007/S00453-018-0491-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DaslerM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DattaDM19,
author = {Pratish Datta and
Ratna Dutta and
Sourav Mukhopadhyay},
title = {Constrained Pseudorandom Functions for Turing Machines Revisited:
How to Achieve Verifiability and Key Delegation},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3245--3390},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00576-7},
doi = {10.1007/S00453-019-00576-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DattaDM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DeligkasMS19,
author = {Argyrios Deligkas and
George B. Mertzios and
Paul G. Spirakis},
title = {Binary Search in Graphs Revisited},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1757--1780},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0501-y},
doi = {10.1007/S00453-018-0501-Y},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DeligkasMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DieudonneP19,
author = {Yoann Dieudonn{\'{e}} and
Andrzej Pelc},
title = {Impact of Knowledge on Election Time in Anonymous Networks},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {238--288},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0444-3},
doi = {10.1007/S00453-018-0444-3},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DieudonneP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DisserKS19,
author = {Yann Disser and
Stefan Kratsch and
Manuel Sorge},
title = {The Minimum Feasible Tileset Problem},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1126--1151},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0460-3},
doi = {10.1007/S00453-018-0460-3},
timestamp = {Sat, 02 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DisserKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrDK19,
author = {Benjamin Doerr and
Carola Doerr and
Timo K{\"{o}}tzing},
title = {Solving Problems with Unknown Solution Length at Almost No Extra Cost},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {703--748},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0477-7},
doi = {10.1007/S00453-018-0477-7},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrDK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrFFFKS19,
author = {Benjamin Doerr and
Philipp Fischbeck and
Clemens Frahnow and
Tobias Friedrich and
Timo K{\"{o}}tzing and
Martin Schirneck},
title = {Island Models Meet Rumor Spreading},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {886--915},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0445-2},
doi = {10.1007/S00453-018-0445-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrFFFKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrGWY19,
author = {Benjamin Doerr and
Christian Gie{\ss}en and
Carsten Witt and
Jing Yang},
title = {The (1+{\(\lambda\)}) Evolutionary Algorithm with Self-Adjusting Mutation
Rate},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {593--631},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0502-x},
doi = {10.1007/S00453-018-0502-X},
timestamp = {Tue, 08 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrGWY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrS19,
author = {Carola Doerr and
Dirk Sudholt},
title = {Preface to the Special Issue on Theory of Genetic and Evolutionary
Computation},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {589--592},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00543-8},
doi = {10.1007/S00453-018-00543-8},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DurajKP19,
author = {Lech Duraj and
Marvin K{\"{u}}nnemann and
Adam Polak},
title = {Tight Conditional Lower Bounds for Longest Common Increasing Subsequence},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3968--3992},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0485-7},
doi = {10.1007/S00453-018-0485-7},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DurajKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EibenGKO19,
author = {Eduard Eiben and
Robert Ganian and
Kustaa Kangas and
Sebastian Ordyniak},
title = {Counting Linear Extensions: Parameterizations by Treewidth},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1657--1683},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0496-4},
doi = {10.1007/S00453-018-0496-4},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EibenGKO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ElbassioniMN19,
author = {Khaled M. Elbassioni and
Kazuhisa Makino and
Waleed Najy},
title = {A Multiplicative Weight Updates Algorithm for Packing and Covering
Semi-infinite Linear Programs},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2377--2429},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00539-4},
doi = {10.1007/S00453-018-00539-4},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ElbassioniMN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Feldmann19,
author = {Andreas Emil Feldmann},
title = {Fixed-Parameter Approximations for k-Center Problems in Low Highway
Dimension Graphs},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1031--1052},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0455-0},
doi = {10.1007/S00453-018-0455-0},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Feldmann19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FilmusHLY19,
author = {Yuval Filmus and
Hamed Hatami and
Yaqiao Li and
Suzin You},
title = {Information Complexity of the {AND} Function in the Two-Party and
Multi-party Settings},
journal = {Algorithmica},
volume = {81},
number = {11-12},
pages = {4200--4237},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0484-8},
doi = {10.1007/S00453-018-0484-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FilmusHLY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FischerLV19,
author = {Eldar Fischer and
Oded Lachish and
Yadu Vasudev},
title = {Improving and Extending the Testing of Distributions for Shape-Restricted
Properties},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3765--3802},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00598-1},
doi = {10.1007/S00453-019-00598-1},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FischerLV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FluschnikKMNNT19,
author = {Till Fluschnik and
Christian Komusiewicz and
George B. Mertzios and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Nimrod Talmon},
title = {When Can Graph Hyperbolicity be Computed in Linear Time?},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {2016--2045},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0522-6},
doi = {10.1007/S00453-018-0522-6},
timestamp = {Wed, 17 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FluschnikKMNNT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FoxIKM19,
author = {Kyle Fox and
Sungjin Im and
Janardhan Kulkarni and
Benjamin Moseley},
title = {Non-clairvoyantly Scheduling to Minimize Convex Functions},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3746--3764},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00597-2},
doi = {10.1007/S00453-019-00597-2},
timestamp = {Thu, 22 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FoxIKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FriggstadRSS19,
author = {Zachary Friggstad and
Mohsen Rezapour and
Mohammad R. Salavatipour and
Jos{\'{e}} A. Soto},
title = {LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk
Network Design},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1075--1095},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0458-x},
doi = {10.1007/S00453-018-0458-X},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FriggstadRSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fung19,
author = {Stanley P. Y. Fung},
title = {Optimal Online Two-Way Trading with Bounded Number of Transactions},
journal = {Algorithmica},
volume = {81},
number = {11-12},
pages = {4238--4257},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00534-9},
doi = {10.1007/S00453-018-00534-9},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Fung19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GanianKPP19,
author = {Robert Ganian and
Martin Kronegger and
Andreas Pfandler and
Alexandru Popa},
title = {Parameterized Complexity of Asynchronous Border Minimization},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {201--223},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0442-5},
doi = {10.1007/S00453-018-0442-5},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GanianKPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GanianNORR19,
author = {Robert Ganian and
N. S. Narayanaswamy and
Sebastian Ordyniak and
C. S. Rahul and
M. S. Ramanujan},
title = {On the Complexity Landscape of Connected f-Factor Problems},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2606--2632},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00546-z},
doi = {10.1007/S00453-019-00546-Z},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GanianNORR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GarneroPST19,
author = {Valentin Garnero and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Explicit Linear Kernels for Packing Problems},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1615--1656},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0495-5},
doi = {10.1007/S00453-018-0495-5},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GarneroPST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GaspersGJMR19,
author = {Serge Gaspers and
Joachim Gudmundsson and
Mitchell Jones and
Juli{\'{a}}n Mestre and
Stefan R{\"{u}}mmele},
title = {Turbocharging Treewidth Heuristics},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {439--475},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0499-1},
doi = {10.1007/S00453-018-0499-1},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GaspersGJMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GavenciakGL19,
author = {Tomas Gavenciak and
Barbara Geissmann and
Johannes Lengler},
title = {Sorting by Swaps with Noisy Comparisons},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {796--827},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0429-2},
doi = {10.1007/S00453-018-0429-2},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GavenciakGL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GawrychowskiMSU19,
author = {Pawel Gawrychowski and
Oleg Merkurev and
Arseny M. Shur and
Przemyslaw Uznanski},
title = {Tight Tradeoffs for Real-Time Approximation of Longest Palindromes
in Streams},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3630--3654},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00591-8},
doi = {10.1007/S00453-019-00591-8},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GawrychowskiMSU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiacomoLPRT19,
author = {Emilio Di Giacomo and
Giuseppe Liotta and
Maurizio Patrignani and
Ignaz Rutter and
Alessandra Tappini},
title = {NodeTrix Planarity Testing with Small Clusters},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3464--3493},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00585-6},
doi = {10.1007/S00453-019-00585-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GiacomoLPRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiannopoulouPRT19,
author = {Archontia C. Giannopoulou and
Michal Pilipczuk and
Jean{-}Florent Raymond and
Dimitrios M. Thilikos and
Marcin Wrochna},
title = {Cutwidth: Obstructions and Algorithmic Aspects},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {557--588},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0424-7},
doi = {10.1007/S00453-018-0424-7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GiannopoulouPRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GilbertS19,
author = {Hugo Gilbert and
Olivier Spanjaard},
title = {Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness,
Approximation and a Polynomial Time Special Case},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2653--2681},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00550-3},
doi = {10.1007/S00453-019-00550-3},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GilbertS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiscardKW19,
author = {Pierre{-}Louis Giscard and
Nils M. Kriege and
Richard C. Wilson},
title = {A General Purpose Algorithm for Counting Simple Cycles and Simple
Paths of Any Length},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2716--2737},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00552-1},
doi = {10.1007/S00453-019-00552-1},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GiscardKW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GogKKPP19,
author = {Simon Gog and
Juha K{\"{a}}rkk{\"{a}}inen and
Dominik Kempa and
Matthias Petri and
Simon J. Puglisi},
title = {Fixed Block Compression Boosting in FM-Indexes: Theory and Practice},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1370--1391},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0475-9},
doi = {10.1007/S00453-018-0475-9},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GogKKPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolanKP19,
author = {Shay Golan and
Tsvi Kopelowitz and
Ely Porat},
title = {Streaming Pattern Matching with d Wildcards},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1988--2015},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0521-7},
doi = {10.1007/S00453-018-0521-7},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolanKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHKLP19,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Paloma T. Lima and
Dani{\"{e}}l Paulusma},
title = {Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth
at Most 2},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2795--2828},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00555-y},
doi = {10.1007/S00453-019-00555-Y},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuoH19,
author = {Jiong Guo and
Danny Hermelin},
title = {Foreword: Special Issue on Parameterized and Exact Computation},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {419--420},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0529-z},
doi = {10.1007/S00453-018-0529-Z},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuoH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuptaRSZ19,
author = {Sushmita Gupta and
Sanjukta Roy and
Saket Saurabh and
Meirav Zehavi},
title = {Parameterized Algorithms and Kernels for Rainbow Matching},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1684--1698},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0497-3},
doi = {10.1007/S00453-018-0497-3},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuptaRSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HalperMRW19,
author = {Austin Halper and
Miguel A. Mosteiro and
Yulia Rossikova and
Prudence W. H. Wong},
title = {Station Assignment with Reallocation},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1096--1125},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0459-9},
doi = {10.1007/S00453-018-0459-9},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HalperMRW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Harris19,
author = {David G. Harris},
title = {Deterministic Parallel Algorithms for Bilinear Objective Functions},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1288--1318},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0471-0},
doi = {10.1007/S00453-018-0471-0},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Harris19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HayashiI19,
author = {Koyo Hayashi and
Satoru Iwata},
title = {Correction to: Counting Minimum Weight Arborescences},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {418},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0509-3},
doi = {10.1007/S00453-018-0509-3},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HayashiI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuST19,
author = {Xiaocheng Hu and
Cheng Sheng and
Yufei Tao},
title = {Building an Optimal Point-Location Structure in {O(} sort (n)) I/Os},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1921--1937},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0518-2},
doi = {10.1007/S00453-018-0518-2},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangDX19,
author = {Ziyun Huang and
Hu Ding and
Jinhui Xu},
title = {A Faster Algorithm for Truth Discovery via Range Cover},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4118--4133},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00562-z},
doi = {10.1007/S00453-019-00562-Z},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangDX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangP19,
author = {Zengfeng Huang and
Pan Peng},
title = {Dynamic Graph Stream Algorithms in o(n) Space},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1965--1987},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0520-8},
doi = {10.1007/S00453-018-0520-8},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangYZ19,
author = {Zengfeng Huang and
Ke Yi and
Qin Zhang},
title = {Randomized Algorithms for Tracking Distributed Count, Frequencies,
and Ranks},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2222--2243},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00531-y},
doi = {10.1007/S00453-018-00531-Y},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangYZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ItoJ19,
author = {Tsuyoshi Ito and
Stacey Jeffery},
title = {Approximate Span Programs},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2158--2195},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0527-1},
doi = {10.1007/S00453-018-0527-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ItoJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ItoKKKO19,
author = {Takehiro Ito and
Naonori Kakimura and
Naoyuki Kamiyama and
Yusuke Kobayashi and
Yoshio Okamoto},
title = {Minimum-Cost b-Edge Dominating Sets on Trees},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {343--366},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0448-z},
doi = {10.1007/S00453-018-0448-Z},
timestamp = {Tue, 15 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ItoKKKO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenM19,
author = {Klaus Jansen and
Marten Maack},
title = {An {EPTAS} for Scheduling on Unrelated Machines of Few Different Types},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4134--4164},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00581-w},
doi = {10.1007/S00453-019-00581-W},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenP19,
author = {Bart M. P. Jansen and
Astrid Pieterse},
title = {Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3865--3889},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00578-5},
doi = {10.1007/S00453-019-00578-5},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenPW19,
author = {Bart M. P. Jansen and
Marcin Pilipczuk and
Marcin Wrochna},
title = {Turing Kernelization for Finding Long Paths in Graph Classes Excluding
a Topological Minor},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3936--3967},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00614-4},
doi = {10.1007/S00453-019-00614-4},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KammerKL19,
author = {Frank Kammer and
Dieter Kratsch and
Moritz Laudahn},
title = {Space-Efficient Biconnected Components and Recognition of Outerplanar
Graphs},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1180--1204},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0464-z},
doi = {10.1007/S00453-018-0464-Z},
timestamp = {Sat, 02 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KammerKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaoTL19,
author = {Mong{-}Jen Kao and
Hai{-}Lun Tu and
D. T. Lee},
title = {O(f) Bi-criteria Approximation for Capacitated Covering with Hard
Capacities},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1800--1817},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0506-6},
doi = {10.1007/S00453-018-0506-6},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KaoTL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarpovPZ19,
author = {Nikolai Karpov and
Marcin Pilipczuk and
Anna Zych{-}Pawlewicz},
title = {An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4029--4042},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0504-8},
doi = {10.1007/S00453-018-0504-8},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KarpovPZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarthickMP19,
author = {T. Karthick and
Fr{\'{e}}d{\'{e}}ric Maffray and
Lucas Pastor},
title = {Polynomial Cases for the Vertex Coloring Problem},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1053--1074},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0457-y},
doi = {10.1007/S00453-018-0457-Y},
timestamp = {Tue, 22 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KarthickMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KatzSS19,
author = {Dmitriy Katz and
Baruch Schieber and
Hadas Shachnai},
title = {Flexible Resource Allocation to Interval Jobs},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3217--3244},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00582-9},
doi = {10.1007/S00453-019-00582-9},
timestamp = {Thu, 27 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KatzSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KayaR19,
author = {Oguz Kaya and
Yves Robert},
title = {Computing Dense Tensor Decompositions with Optimal Dimension Trees},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {2092--2121},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0525-3},
doi = {10.1007/S00453-018-0525-3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KayaR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhoslaA19,
author = {Megha Khosla and
Avishek Anand},
title = {A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in
Large Graphs},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3707--3724},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00595-4},
doi = {10.1007/S00453-019-00595-4},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhoslaA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhullerY19,
author = {Samir Khuller and
Sheng Yang},
title = {Revisiting Connected Dominating Sets: An Almost Optimal Local Information
Algorithm},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2592--2605},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00545-0},
doi = {10.1007/S00453-019-00545-0},
timestamp = {Tue, 16 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhullerY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KitaharaS19,
author = {Tomonari Kitahara and
Noriyoshi Sukegawa},
title = {A Simple Projection Algorithm for Linear Programming Problems},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {167--178},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0436-3},
doi = {10.1007/S00453-018-0436-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KitaharaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlavikOS19,
author = {Pavel Klav{\'{\i}}k and
Yota Otachi and
Jir{\'{\i}} Sejnoha},
title = {On the Classes of Interval Graphs of Limited Nesting and Count of
Lengths},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1490--1511},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0481-y},
doi = {10.1007/S00453-018-0481-Y},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KlavikOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KociumakaP19,
author = {Tomasz Kociumaka and
Marcin Pilipczuk},
title = {Deleting Vertices to Graphs of Bounded Genus},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3655--3691},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00592-7},
doi = {10.1007/S00453-019-00592-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KociumakaP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KociumakaRS19,
author = {Tomasz Kociumaka and
Jakub Radoszewski and
Tatiana Starikovskaya},
title = {Longest Common Substring with Approximately k Mismatches},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2633--2652},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00548-x},
doi = {10.1007/S00453-019-00548-X},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KociumakaRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KociumakaRS19a,
author = {Tomasz Kociumaka and
Jakub Radoszewski and
Tatiana Starikovskaya},
title = {Correction to: Longest Common Substring with Approximately k Mismatches},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {3074},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00560-1},
doi = {10.1007/S00453-019-00560-1},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KociumakaRS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KonesL19,
author = {Ishai Kones and
Asaf Levin},
title = {A Unified Framework for Designing {EPTAS} for Load Balancing on Parallel
Machines},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {3025--3046},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00566-9},
doi = {10.1007/S00453-019-00566-9},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KonesL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KrithikaSSZ19,
author = {R. Krithika and
Abhishek Sahu and
Saket Saurabh and
Meirav Zehavi},
title = {The Parameterized Complexity of Cycle Packing: Indifference is Not
an Issue},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3803--3841},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00599-0},
doi = {10.1007/S00453-019-00599-0},
timestamp = {Thu, 22 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KrithikaSSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KrystaMRZ19,
author = {Piotr Krysta and
David F. Manlove and
Baharak Rastegari and
Jinshan Zhang},
title = {Size Versus Truthfulness in the House Allocation Problem},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3422--3463},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00584-7},
doi = {10.1007/S00453-019-00584-7},
timestamp = {Wed, 05 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KrystaMRZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KunnemannMPS19,
author = {Marvin K{\"{u}}nnemann and
Daniel Moeller and
Ramamohan Paturi and
Stefan Schneider},
title = {Subquadratic Algorithms for Succinct Stable Matching},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2991--3024},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00564-x},
doi = {10.1007/S00453-019-00564-X},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KunnemannMPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LeL19,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Hardness and Structural Results for Half-Squares of Restricted Tree
Convex Bipartite Graphs},
journal = {Algorithmica},
volume = {81},
number = {11-12},
pages = {4258--4274},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0440-7},
doi = {10.1007/S00453-018-0440-7},
timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LeL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LescaMP19,
author = {Julien Lesca and
Michel Minoux and
Patrice Perny},
title = {The Fair {OWA} One-to-One Assignment Problem: NP-Hardness and Polynomial
Time Special Cases},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {98--123},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0434-5},
doi = {10.1007/S00453-018-0434-5},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LescaMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiedloffMT19,
author = {Mathieu Liedloff and
Pedro Montealegre and
Ioan Todinca},
title = {Beyond Classes of Graphs with "Few" Minimal Separators: {FPT} Results
Through Potential Maximal Cliques},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {986--1005},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0453-2},
doi = {10.1007/S00453-018-0453-2},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiedloffMT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Maier0W19,
author = {Tobias Maier and
Peter Sanders and
Stefan Walzer},
title = {Dynamic Space Efficient Hashing},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3162--3185},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00572-x},
doi = {10.1007/S00453-019-00572-X},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Maier0W19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Meeks19,
author = {Kitty Meeks},
title = {Randomised Enumeration of Small Witnesses Using a Decision Oracle},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {519--540},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0404-y},
doi = {10.1007/S00453-018-0404-Y},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Meeks19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MeierORS19,
author = {Arne Meier and
Sebastian Ordyniak and
M. S. Ramanujan and
Irena Schindler},
title = {Backdoors for Linear Temporal Logic},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {476--496},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0515-5},
doi = {10.1007/S00453-018-0515-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MeierORS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MertziosMS19,
author = {George B. Mertzios and
Othon Michail and
Paul G. Spirakis},
title = {Temporal Network Optimization Subject to Connectivity Constraints},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1416--1449},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0478-6},
doi = {10.1007/S00453-018-0478-6},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MertziosMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MisraPRRS19,
author = {Neeldhara Misra and
Fahad Panolan and
Ashutosh Rai and
Venkatesh Raman and
Saket Saurabh},
title = {Parameterized Algorithms for Max Colorable Induced Subgraph Problem
on Perfect Graphs},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {26--46},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0431-8},
doi = {10.1007/S00453-018-0431-8},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MisraPRRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MitchellPSW19,
author = {Joseph S. B. Mitchell and
Valentin Polishchuk and
Mikko Sysikaski and
Haitao Wang},
title = {An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated
Rectilinear Domains},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {289--316},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0446-1},
doi = {10.1007/S00453-018-0446-1},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MitchellPSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NallaperumaOHS19,
author = {Samadhi Nallaperuma and
Pietro S. Oliveto and
Jorge P{\'{e}}rez Heredia and
Dirk Sudholt},
title = {On the Analysis of Trajectory-Based Search Algorithms: When is it
Beneficial to Reject Improvements?},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {858--885},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0462-1},
doi = {10.1007/S00453-018-0462-1},
timestamp = {Wed, 03 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NallaperumaOHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/OhA19,
author = {Eunjin Oh and
Hee{-}Kap Ahn},
title = {A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off
Algorithms},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2829--2856},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00558-9},
doi = {10.1007/S00453-019-00558-9},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/OhA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PanolanSZ19,
author = {Fahad Panolan and
Saket Saurabh and
Meirav Zehavi},
title = {Parameterized Algorithms for List K-Cycle},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1267--1287},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0469-7},
doi = {10.1007/S00453-018-0469-7},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PanolanSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PatelR19,
author = {Viresh Patel and
Guus Regts},
title = {Computing the Number of Induced Copies of a Fixed Graph in a Bounded
Degree Graph},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1844--1858},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0511-9},
doi = {10.1007/S00453-018-0511-9},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PatelR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PhilipRST19,
author = {Geevarghese Philip and
Varun Rajan and
Saket Saurabh and
Prafullkumar Tale},
title = {Subset Feedback Vertex Set in Chordal and Split Graphs},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3586--3629},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00590-9},
doi = {10.1007/S00453-019-00590-9},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PhilipRST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PilipczukPW19,
author = {Marcin Pilipczuk and
Michal Pilipczuk and
Marcin Wrochna},
title = {Edge Bipartization Faster than {\textdollar}{\textdollar}2k{\textdollar}{\textdollar}
2 k},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {917--966},
year = {2019},
url = {https://doi.org/10.1007/s00453-017-0319-z},
doi = {10.1007/S00453-017-0319-Z},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PilipczukPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PinterSZ19,
author = {Ron Y. Pinter and
Hadas Shachnai and
Meirav Zehavi},
title = {Improved Parameterized Algorithms for Network Query Problems},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2270--2316},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00535-8},
doi = {10.1007/S00453-018-00535-8},
timestamp = {Fri, 26 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PinterSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/QianBJT19,
author = {Chao Qian and
Chao Bian and
Wu Jiang and
Ke Tang},
title = {Running Time Analysis of the {(} {\textdollar}{\textdollar}1+1{\textdollar}{\textdollar}
1 + 1 {)-EA} for OneMax and LeadingOnes Under Bit-Wise Noise},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {749--795},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0488-4},
doi = {10.1007/S00453-018-0488-4},
timestamp = {Fri, 30 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/QianBJT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SchlipfS19,
author = {Lena Schlipf and
Jens M. Schmidt},
title = {Edge-Orders},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1881--1900},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0516-4},
doi = {10.1007/S00453-018-0516-4},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SchlipfS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SchwellerWW19,
author = {Robert T. Schweller and
Andrew Winslow and
Tim Wylie},
title = {Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3114--3135},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00573-w},
doi = {10.1007/S00453-019-00573-W},
timestamp = {Thu, 27 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SchwellerWW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SeddighinFGAT19,
author = {Masoud Seddighin and
Majid Farhadi and
Mohammad Ghodsi and
Reza Alijani and
Ahmad S. Tajik},
title = {Expand the Shares Together: Envy-Free Mechanisms with a Small Number
of Cuts},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1728--1755},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0500-z},
doi = {10.1007/S00453-018-0500-Z},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SeddighinFGAT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Segev19,
author = {Danny Segev},
title = {Assortment Planning with Nested Preferences: Dynamic Programming with
Distributions as States?},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {393--417},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0450-5},
doi = {10.1007/S00453-018-0450-5},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Segev19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShiSFKN19,
author = {Feng Shi and
Martin Schirneck and
Tobias Friedrich and
Timo K{\"{o}}tzing and
Frank Neumann},
title = {Reoptimization Time Analysis of Evolutionary Algorithms on Linear
Functions Under Dynamic Uniform Constraints},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {828--857},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0451-4},
doi = {10.1007/S00453-018-0451-4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ShiSFKN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SubramaniW19,
author = {K. Subramani and
Piotr Wojciechowski},
title = {A Polynomial Time Algorithm for Read-Once Certification of Linear
Infeasibility in {UTVPI} Constraints},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2765--2794},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00554-z},
doi = {10.1007/S00453-019-00554-Z},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/SubramaniW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SudholtW19,
author = {Dirk Sudholt and
Carsten Witt},
title = {On the Choice of the Update Strength in Estimation-of-Distribution
Algorithms and Ant Colony Optimization},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1450--1489},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0480-z},
doi = {10.1007/S00453-018-0480-Z},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SudholtW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/TirodkarV19,
author = {Sumedh Tirodkar and
Sundar Vishwanathan},
title = {Maximum Matching on Trees in the Online Preemptive and the Incremental
Graph Models},
journal = {Algorithmica},
volume = {81},
number = {11-12},
pages = {4275--4292},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00593-6},
doi = {10.1007/S00453-019-00593-6},
timestamp = {Thu, 17 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/TirodkarV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WangHPX19,
author = {Shaojiang Wang and
Kun He and
Yicheng Pan and
Mingji Xia},
title = {Rectangle Transformation Problem},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2876--2898},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00563-y},
doi = {10.1007/S00453-019-00563-Y},
timestamp = {Wed, 06 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WangHPX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WangZ19,
author = {Haitao Wang and
Jingru Zhang},
title = {Covering Uncertain Points in a Tree},
journal = {Algorithmica},
volume = {81},
number = {6},
pages = {2346--2376},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-00537-6},
doi = {10.1007/S00453-018-00537-6},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WangZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Witt19,
author = {Carsten Witt},
title = {Upper Bounds on the Running Time of the Univariate Marginal Distribution
Algorithm on OneMax},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {632--667},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0463-0},
doi = {10.1007/S00453-018-0463-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Witt19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Wlodarczyk19,
author = {Michal Wlodarczyk},
title = {Clifford Algebras Meet Tree Decompositions},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {497--518},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0489-3},
doi = {10.1007/S00453-018-0489-3},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Wlodarczyk19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X19,
title = {Editor's Note: Special Issue on Parameterized and Exact Computation},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3843},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00621-5},
doi = {10.1007/S00453-019-00621-5},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/X19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X19a,
title = {Preface: Special Issue on {WADS} 2017},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4069},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00620-6},
doi = {10.1007/S00453-019-00620-6},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/X19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Abam18,
author = {Mohammad Ali Abam},
title = {Spanners for Geodesic Graphs and Visibility Graphs},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {515--529},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0268-y},
doi = {10.1007/S00453-016-0268-Y},
timestamp = {Thu, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Abam18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AbedCV18,
author = {Fidaa Abed and
Ioannis Caragiannis and
Alexandros A. Voudouris},
title = {Near-Optimal Asymmetric Binary Matrix Partitions},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {48--72},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0238-4},
doi = {10.1007/S00453-016-0238-4},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AbedCV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AbouEishaHLMRZ18,
author = {Hassan AbouEisha and
Shahid Hussain and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot and
Bernard Ries and
Viktor Zamaraev},
title = {Upper Domination: Towards a Dichotomy Through Boundary Properties},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2799--2817},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0346-9},
doi = {10.1007/S00453-017-0346-9},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AbouEishaHLMRZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Abu-KhzamBCF18,
author = {Faisal N. Abu{-}Khzam and
Cristina Bazgan and
Katrin Casel and
Henning Fernau},
title = {Clustering with Lower-Bounded Sizes - {A} General Graph-Theoretic
Framework},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2517--2550},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0374-5},
doi = {10.1007/S00453-017-0374-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Abu-KhzamBCF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AfshaniT18,
author = {Peyman Afshani and
Konstantinos Tsakalidis},
title = {Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3192--3206},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0376-3},
doi = {10.1007/S00453-017-0376-3},
timestamp = {Tue, 07 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AfshaniT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Al-BawaniEW18,
author = {Kamal Al{-}Bawani and
Matthias Englert and
Matthias Westermann},
title = {Comparison-Based Buffer Management in QoS Switches},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {1073--1092},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0393-2},
doi = {10.1007/S00453-017-0393-2},
timestamp = {Thu, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Al-BawaniEW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Al-BawaniEW18a,
author = {Kamal Al{-}Bawani and
Matthias Englert and
Matthias Westermann},
title = {Online Packet Scheduling for {CIOQ} and Buffered Crossbar Switches},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3861--3888},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0421-x},
doi = {10.1007/S00453-018-0421-X},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Al-BawaniEW18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersF18,
author = {Susanne Albers and
Dario Frascaria},
title = {Quantifying Competitiveness in Paging with Locality of Reference},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3563--3596},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0406-9},
doi = {10.1007/S00453-018-0406-9},
timestamp = {Sun, 23 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlewijnseBBSW18,
author = {Sander P. A. Alewijnse and
Kevin Buchin and
Maike Buchin and
Stef Sijben and
Michel A. Westenberg},
title = {Model-Based Segmentation and Classification of Trajectories},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2422--2452},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0329-x},
doi = {10.1007/S00453-017-0329-X},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlewijnseBBSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AliakbarpourBGP18,
author = {Maryam Aliakbarpour and
Amartya Shankha Biswas and
Themis Gouleakis and
John Peebles and
Ronitt Rubinfeld and
Anak Yodpinyanee},
title = {Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {668--697},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0287-3},
doi = {10.1007/S00453-017-0287-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AliakbarpourBGP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AronovBDGILS18,
author = {Boris Aronov and
Prosenjit Bose and
Erik D. Demaine and
Joachim Gudmundsson and
John Iacono and
Stefan Langerman and
Michiel H. M. Smid},
title = {Data Structures for Halfplane Proximity Queries and Incremental Voronoi
Diagrams},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3316--3334},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0389-y},
doi = {10.1007/S00453-017-0389-Y},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AronovBDGILS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArulselvanCGMM18,
author = {Ashwin Arulselvan and
{\'{A}}gnes Cseh and
Martin Gro{\ss} and
David F. Manlove and
Jannik Matuschke},
title = {Matchings with Lower Quotas: Algorithms and Complexity},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {185--208},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0252-6},
doi = {10.1007/S00453-016-0252-6},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ArulselvanCGMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArzF18,
author = {Julian Arz and
Johannes Fischer},
title = {Lempel-Ziv-78 Compressed String Dictionaries},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2012--2047},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0348-7},
doi = {10.1007/S00453-017-0348-7},
timestamp = {Thu, 26 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ArzF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AsahiroDMSS18,
author = {Yuichi Asahiro and
Yuya Doi and
Eiji Miyano and
Kazuaki Samizo and
Hirotaka Shimizu},
title = {Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph
Problems},
journal = {Algorithmica},
volume = {80},
number = {6},
pages = {1834--1856},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0344-y},
doi = {10.1007/S00453-017-0344-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AsahiroDMSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AulettaFPP18,
author = {Vincenzo Auletta and
Diodato Ferraioli and
Francesco Pasquale and
Giuseppe Persiano},
title = {Metastability of Logit Dynamics for Coordination Games},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3078--3131},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0371-8},
doi = {10.1007/S00453-017-0371-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AulettaFPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AvrahamHJKRST18,
author = {Rinat Ben Avraham and
Matthias Henze and
Rafel Jaume and
Bal{\'{a}}zs Keszegh and
Orit E. Raz and
Micha Sharir and
Igor Tubis},
title = {Partial-Matching {RMS} Distance Under Translation: Combinatorics and
Algorithms},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2400--2421},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0326-0},
doi = {10.1007/S00453-017-0326-0},
timestamp = {Tue, 15 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AvrahamHJKRST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanikPRS18,
author = {Aritra Banik and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot},
title = {Fr{\'{e}}chet Distance Between a Line and Avatar Point Set},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2616--2636},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0352-y},
doi = {10.1007/S00453-017-0352-Y},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BanikPRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BartonP18,
author = {Carl Barton and
Solon P. Pissis},
title = {Crochemore's Partitioning on Weighted Strings and Applications},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {496--514},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0266-0},
doi = {10.1007/S00453-016-0266-0},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BartonP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BavejaCNSX18,
author = {Alok Baveja and
Amit Chavan and
Andrei Nikiforov and
Aravind Srinivasan and
Pan Xu},
title = {Improved Bounds in Stochastic Matching and Optimization},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3225--3252},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0383-4},
doi = {10.1007/S00453-017-0383-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BavejaCNSX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BazganCP18,
author = {Cristina Bazgan and
Janka Chleb{\'{\i}}kov{\'{a}} and
Thomas Pontoizeau},
title = {Structural and Algorithmic Properties of 2-Community Structures},
journal = {Algorithmica},
volume = {80},
number = {6},
pages = {1890--1908},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0283-7},
doi = {10.1007/S00453-017-0283-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BazganCP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteOS18,
author = {R{\'{e}}my Belmonte and
Yota Otachi and
Pascal Schweitzer},
title = {Induced Minor Free Graphs: Isomorphism and Clique-Width},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {29--47},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0234-8},
doi = {10.1007/S00453-016-0234-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BerenbrinkFKMNW18,
author = {Petra Berenbrink and
Tom Friedetzky and
Peter Kling and
Frederik Mallmann{-}Trenn and
Lars Nagel and
Chris Wastell},
title = {Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3673--3703},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0411-z},
doi = {10.1007/S00453-018-0411-Z},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BerenbrinkFKMNW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergGM18,
author = {Mark de Berg and
Joachim Gudmundsson and
Ali D. Mehrabi},
title = {Finding Pairwise Intersections Inside a Query Range},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3253--3269},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0384-3},
doi = {10.1007/S00453-017-0384-3},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergGM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BesserP18,
author = {Bert Besser and
Matthias Poloczek},
title = {Erratum to: Greedy Matching: Guarantees and Limitations},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {410--413},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0281-9},
doi = {10.1007/S00453-017-0281-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BesserP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhattacharyaIJK18,
author = {Anup Bhattacharya and
Davis Issac and
Ragesh Jaiswal and
Amit Kumar},
title = {Sampling in Space Restricted Settings},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1439--1458},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0335-z},
doi = {10.1007/S00453-017-0335-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BhattacharyaIJK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleCCGSVV18,
author = {Philip Bille and
Anders Roy Christiansen and
Patrick Hagge Cording and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
title = {Dynamic Relative Compression, Dynamic Partial Sums, and Substring
Concatenation},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3207--3224},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0380-7},
doi = {10.1007/S00453-017-0380-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleCCGSVV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloGLP18,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Fault-Tolerant Approximate Shortest-Path Trees},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3437--3460},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0396-z},
doi = {10.1007/S00453-017-0396-Z},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloGLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazBEMMS18,
author = {Ahmad Biniaz and
Prosenjit Bose and
David Eppstein and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Spanning Trees in Multipartite Geometric Graphs},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3177--3191},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0375-4},
doi = {10.1007/S00453-017-0375-4},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazBEMMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Blasius0K18,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Anton Krohmer},
title = {Cliques in Hyperbolic Random Graphs},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2324--2344},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0323-3},
doi = {10.1007/S00453-017-0323-3},
timestamp = {Tue, 15 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Blasius0K18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlasiusKR18,
author = {Thomas Bl{\"{a}}sius and
Annette Karrer and
Ignaz Rutter},
title = {Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1214--1277},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0301-9},
doi = {10.1007/S00453-017-0301-9},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BlasiusKR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BliemW18,
author = {Bernhard Bliem and
Stefan Woltran},
title = {Complexity of Secure Sets},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2909--2940},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0358-5},
doi = {10.1007/S00453-017-0358-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BliemW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderOO18,
author = {Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi},
title = {Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes
and Parameterized Complexity},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2160--2180},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0399-9},
doi = {10.1007/S00453-017-0399-9},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderOO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BohmDESV18,
author = {Martin B{\"{o}}hm and
Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {Colored Bin Packing: Online Algorithms and Lower Bounds},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {155--184},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0248-2},
doi = {10.1007/S00453-016-0248-2},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BohmDESV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetMR18,
author = {{\'{E}}douard Bonnet and
Tillmann Miltzow and
Pawel Rzazewski},
title = {Complexity of Token Swapping and Its Variants},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2656--2682},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0387-0},
doi = {10.1007/S00453-017-0387-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetMR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BordewichST18,
author = {Magnus Bordewich and
Charles Semple and
Nihan Tokac},
title = {Constructing Tree-Child Networks from Distance Matrices},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2240--2259},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0320-6},
doi = {10.1007/S00453-017-0320-6},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BordewichST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BorosEFGMM18,
author = {Endre Boros and
Khaled M. Elbassioni and
Mahmoud Fouz and
Vladimir Gurvich and
Kazuhisa Makino and
Bodo Manthey},
title = {Approximation Schemes for Stochastic Mean Payoff Games with Perfect
Information and Few Random Positions},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3132--3157},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0372-7},
doi = {10.1007/S00453-017-0372-7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BorosEFGMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseHS18,
author = {Prosenjit Bose and
Darryl Hill and
Michiel H. M. Smid},
title = {Improved Spanning Ratio for Low Degree Plane Spanners},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {935--976},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0305-5},
doi = {10.1007/S00453-017-0305-5},
timestamp = {Thu, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BoseHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarEFLL18,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
title = {Batch Coloring of Graphs},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3293--3315},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0386-1},
doi = {10.1007/S00453-017-0386-1},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarEFLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Brandenburg18,
author = {Franz J. Brandenburg},
title = {Recognizing Optimal 1-Planar Graphs in Linear Time},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {1--28},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0226-8},
doi = {10.1007/S00453-016-0226-8},
timestamp = {Tue, 09 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Brandenburg18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BravermanLSVY18,
author = {Vladimir Braverman and
Zaoxing Liu and
Tejasvam Singh and
N. V. Vinodchandran and
Lin F. Yang},
title = {New Bounds for the {CLIQUE-GAP} Problem Using Graph Decomposition
Theory},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {652--667},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0277-5},
doi = {10.1007/S00453-017-0277-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BravermanLSVY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannFK18,
author = {Karl Bringmann and
Tobias Friedrich and
Anton Krohmer},
title = {De-anonymization of Heterogeneous Random Graphs in Quasilinear Time},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3397--3427},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0395-0},
doi = {10.1007/S00453-017-0395-0},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannFK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BruckdorferF018,
author = {Till Bruckdorfer and
Stefan Felsner and
Michael Kaufmann},
title = {Planar Bus Graphs},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2260--2285},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0321-5},
doi = {10.1007/S00453-017-0321-5},
timestamp = {Fri, 11 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BruckdorferF018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ByrkaPRSST18,
author = {Jaroslaw Byrka and
Thomas W. Pensyl and
Bartosz Rybicki and
Joachim Spoerhase and
Aravind Srinivasan and
Khoa Trinh},
title = {An Improved Approximation Algorithm for Knapsack Median Using Sparsification},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1093--1114},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0294-4},
doi = {10.1007/S00453-017-0294-4},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ByrkaPRSST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CamposS18,
author = {Victor A. Campos and
Ana Silva},
title = {Edge-b-Coloring Trees},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {104--115},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0240-x},
doi = {10.1007/S00453-016-0240-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CamposS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CarmiCT18,
author = {Paz Carmi and
Lilach Chaitman{-}Yerushalmi and
Ohad Trabelsi},
title = {Bounded-Hop Communication Networks},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3050--3077},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0370-9},
doi = {10.1007/S00453-017-0370-9},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CarmiCT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChakrabortyMM18,
author = {Maitri Chakraborty and
Alessia Milani and
Miguel A. Mosteiro},
title = {A Faster Exact-Counting Protocol for Anonymous Dynamic Networks},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3023--3049},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0367-4},
doi = {10.1007/S00453-017-0367-4},
timestamp = {Tue, 07 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChakrabortyMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChalkMSVWW18,
author = {Cameron T. Chalk and
Eric Martinez and
Robert T. Schweller and
Luis Vega and
Andrew Winslow and
Tim Wylie},
title = {Optimal Staged Self-Assembly of General Shapes},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1383--1409},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0318-0},
doi = {10.1007/S00453-017-0318-0},
timestamp = {Fri, 02 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChalkMSVWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanTW18,
author = {T.{-}H. Hubert Chan and
Zhihao Gavin Tang and
Xiaowei Wu},
title = {On (1,{\unicode{1013}})-Restricted Max-Min Fair Allocation Problem},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2181--2200},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0407-8},
doi = {10.1007/S00453-018-0407-8},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanTW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Chandoo18,
author = {Maurice Chandoo},
title = {Canonical Representations for Circular-Arc Graphs Using Flip Sets},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3646--3672},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0410-0},
doi = {10.1007/S00453-018-0410-0},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Chandoo18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChaplickGGKL18,
author = {Steven Chaplick and
Grzegorz Guspiel and
Grzegorz Gutowski and
Tomasz Krawczyk and
Giuseppe Liotta},
title = {The Partial Visibility Representation Extension Problem},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2286--2323},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0322-4},
doi = {10.1007/S00453-017-0322-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChaplickGGKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Chatzidimitriou18,
author = {Dimitris Chatzidimitriou and
Jean{-}Florent Raymond and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {An O(log OPT)-Approximation for Covering and Packing Minor Models
of {\texttheta}\({}_{\mbox{r}}\)},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1330--1356},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0313-5},
doi = {10.1007/S00453-017-0313-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Chatzidimitriou18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CheriyanG18,
author = {Joseph Cheriyan and
Zhihan Gao},
title = {Approximating (Unweighted) Tree Augmentation via Lift-and-Project,
Part {I:} Stemless {TAP}},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {530--559},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0270-4},
doi = {10.1007/S00453-016-0270-4},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CheriyanG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CheriyanG18a,
author = {Joseph Cheriyan and
Zhihan Gao},
title = {Approximating (Unweighted) Tree Augmentation via Lift-and-Project,
Part {II}},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {608--651},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0275-7},
doi = {10.1007/S00453-017-0275-7},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CheriyanG18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChlamtacFG18,
author = {Eden Chlamt{\'{a}}c and
Zachary Friggstad and
Konstantinos Georgiou},
title = {Lift-and-Project Methods for Set Cover and Knapsack},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3920--3942},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0427-4},
doi = {10.1007/S00453-018-0427-4},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChlamtacFG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChristodoulouST18,
author = {George Christodoulou and
Alkmini Sgouritsa and
Bo Tang},
title = {On the Efficiency of All-Pay Mechanisms},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1115--1145},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0296-2},
doi = {10.1007/S00453-017-0296-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChristodoulouST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChrobakC18,
author = {Marek Chrobak and
Kevin P. Costello},
title = {Faster Information Gathering in Ad-Hoc Radio Tree Networks},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {1013--1040},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0336-y},
doi = {10.1007/S00453-017-0336-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChrobakC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChudnovskyFS18,
author = {Maria Chudnovsky and
Celina M. H. de Figueiredo and
Sophie Spirkl},
title = {The Sandwich Problem for Decompositions and Almost Monotone Properties},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3618--3645},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0409-6},
doi = {10.1007/S00453-018-0409-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChudnovskyFS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ClaverolKPSS18,
author = {Merc{\`{e}} Claverol and
Elena Khramtcova and
Evanthia Papadopoulou and
Maria Saumell and
Carlos Seara},
title = {Stabbing Circles for Sets of Segments in the Plane},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {849--884},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0299-z},
doi = {10.1007/S00453-017-0299-Z},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ClaverolKPSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CominR18,
author = {Carlo Comin and
Romeo Rizzi},
title = {An Improved Upper Bound on Maximal Clique Listing via Rectangular
Fast Matrix Multiplication},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3525--3562},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0402-5},
doi = {10.1007/S00453-017-0402-5},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CominR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CordascoGMRV18,
author = {Gennaro Cordasco and
Luisa Gargano and
Marco Mecchia and
Adele A. Rescigno and
Ugo Vaccaro},
title = {Discovering Small Target Sets in Social Networks: {A} Fast and Effective
Algorithm},
journal = {Algorithmica},
volume = {80},
number = {6},
pages = {1804--1833},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0390-5},
doi = {10.1007/S00453-017-0390-5},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CordascoGMRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DasFKSVW18,
author = {Aparna Das and
Krzysztof Fleszar and
Stephen G. Kobourov and
Joachim Spoerhase and
Sankar Veeramoni and
Alexander Wolff},
title = {Approximating the Generalized Minimum Manhattan Network Problem},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1170--1190},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0298-0},
doi = {10.1007/S00453-017-0298-0},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DasFKSVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DasGuptaKMY18,
author = {Bhaskar DasGupta and
Marek Karpinski and
Nasim Mobasheri and
Farzane Yahyanejad},
title = {Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in
Graphs and Some Algorithmic Implications},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {772--800},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0291-7},
doi = {10.1007/S00453-017-0291-7},
timestamp = {Wed, 29 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DasGuptaKMY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DehghanSA18,
author = {Ali Dehghan and
Mohammad{-}Reza (Rafsanjani) Sadeghi and
Arash Ahadi},
title = {Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity
and Applications},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3704--3727},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0412-y},
doi = {10.1007/S00453-018-0412-Y},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DehghanSA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DengF18,
author = {Yun Deng and
David Fern{\'{a}}ndez{-}Baca},
title = {Fast Compatibility Testing for Rooted Phylogenetic Trees},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2453--2477},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0330-4},
doi = {10.1007/S00453-017-0330-4},
timestamp = {Fri, 11 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DengF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrD18,
author = {Benjamin Doerr and
Carola Doerr},
title = {Optimal Static and Self-Adjusting Parameter Choices for the (1+({\(\lambda\)},
{\(\lambda\)})) Genetic Algorithm},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1658--1709},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0354-9},
doi = {10.1007/S00453-017-0354-9},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrDK18,
author = {Benjamin Doerr and
Carola Doerr and
Timo K{\"{o}}tzing},
title = {Static and Self-Adjusting Mutation Strengths for Multi-valued Decision
Variables},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1732--1768},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0341-1},
doi = {10.1007/S00453-017-0341-1},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrDK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrL18,
author = {Carola Doerr and
Johannes Lengler},
title = {The {(1+1)} Elitist Black-Box Complexity of LeadingOnes},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1579--1603},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0304-6},
doi = {10.1007/S00453-017-0304-6},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DrangeP18,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Michal Pilipczuk},
title = {A Polynomial Kernel for Trivially Perfect Editing},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3481--3524},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0401-6},
doi = {10.1007/S00453-017-0401-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DrangeP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DuX18,
author = {Donglei Du and
Dachuan Xu},
title = {Editorial: Special Issue on Computing and Combinatorics},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1411},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0422-9},
doi = {10.1007/S00453-018-0422-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DuX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DvorakK18,
author = {Pavel Dvor{\'{a}}k and
Dusan Knop},
title = {Parameterized Complexity of Length-bounded Cuts and Multicuts},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3597--3617},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0408-7},
doi = {10.1007/S00453-018-0408-7},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DvorakK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EdwardsKS18,
author = {Katherine Edwards and
W. Sean Kennedy and
Iraj Saniee},
title = {Fast Approximation Algorithms for p-Centers in Large {\textdollar}{\textdollar}{\textbackslash}delta
{\textdollar}{\textdollar} {\(\delta\)} -Hyperbolic Graphs},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3889--3907},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0425-6},
doi = {10.1007/S00453-018-0425-6},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EdwardsKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EeS18,
author = {Martijn van Ee and
Ren{\'{e}} Sitters},
title = {The {A} Priori Traveling Repairman Problem},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2818--2833},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0351-z},
doi = {10.1007/S00453-017-0351-Z},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EeS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EibenGS18,
author = {Eduard Eiben and
Robert Ganian and
Stefan Szeider},
title = {Solving Problems on Graphs of High Rank-Width},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {742--771},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0290-8},
doi = {10.1007/S00453-017-0290-8},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EibenGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EnrightM18,
author = {Jessica A. Enright and
Kitty Meeks},
title = {Deleting Edges to Restrict the Size of an Epidemic: {A} New Application
for Treewidth},
journal = {Algorithmica},
volume = {80},
number = {6},
pages = {1857--1889},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0311-7},
doi = {10.1007/S00453-017-0311-7},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EnrightM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EppsteinH18,
author = {David Eppstein and
Daniel S. Hirschberg},
title = {From Discrepancy to Majority},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1278--1297},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0303-7},
doi = {10.1007/S00453-017-0303-7},
timestamp = {Fri, 02 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EppsteinH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EppsteinKKLLMMV18,
author = {David Eppstein and
Philipp Kindermann and
Stephen G. Kobourov and
Giuseppe Liotta and
Anna Lubiw and
Aude Maignan and
Debajyoti Mondal and
Hamideh Vosoughpour and
Sue Whitesides and
Stephen K. Wismath},
title = {On the Planar Split Thickness of Graphs},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {977--994},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0328-y},
doi = {10.1007/S00453-017-0328-Y},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EppsteinKKLLMMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EtscheidM18,
author = {Michael Etscheid and
Matthias Mnich},
title = {Linear Kernels and Linear-Time Algorithms for Finding Large Cuts},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2574--2615},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0388-z},
doi = {10.1007/S00453-017-0388-Z},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EtscheidM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FaigleKP18,
author = {Ulrich Faigle and
Walter Kern and
Britta Peis},
title = {Greedy Oriented Flows},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1298--1314},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0306-4},
doi = {10.1007/S00453-017-0306-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FaigleKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FarbsteinL18,
author = {Boaz Farbstein and
Asaf Levin},
title = {Discounted Reward {TSP}},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {472--495},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0264-2},
doi = {10.1007/S00453-016-0264-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FarbsteinL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeH18,
author = {Uriel Feige and
Yael Hitron},
title = {The Ordered Covering Problem},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2874--2908},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0357-6},
doi = {10.1007/S00453-017-0357-6},
timestamp = {Sat, 02 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeigeH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FelsnerP18,
author = {Stefan Felsner and
Alexander Pilz},
title = {Ham-Sandwich Cuts for Abstract Order Types},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {234--257},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0246-4},
doi = {10.1007/S00453-016-0246-4},
timestamp = {Fri, 12 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FelsnerP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FernandesPP18,
author = {Cristina G. Fernandes and
Samuel P. de Paula and
Lehilton L. C. Pedrosa},
title = {Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {1041--1072},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0398-x},
doi = {10.1007/S00453-017-0398-X},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FernandesPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FernandesS18,
author = {Cristina G. Fernandes and
Rafael Crivellari Saliba Schouery},
title = {Approximation Algorithms for the Max-Buying Problem with Limited Supply},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {2973--2992},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0364-7},
doi = {10.1007/S00453-017-0364-7},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FernandesS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fiorini0N018,
author = {Samuel Fiorini and
R. Krithika and
N. S. Narayanaswamy and
Venkatesh Raman},
title = {Approximability of Clique Transversal in Perfect Graphs},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2221--2239},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0315-3},
doi = {10.1007/S00453-017-0315-3},
timestamp = {Fri, 11 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Fiorini0N018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FischerIKS18,
author = {Johannes Fischer and
Tomohiro I and
Dominik K{\"{o}}ppl and
Kunihiko Sadakane},
title = {Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2048--2081},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0333-1},
doi = {10.1007/S00453-017-0333-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FischerIKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FloderusJLLS18,
author = {Peter Floderus and
Jesper Jansson and
Christos Levcopoulos and
Andrzej Lingas and
Dzmitry Sledneu},
title = {3D Rectangulations and Geometric Matrix Multiplication},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {136--154},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0247-3},
doi = {10.1007/S00453-016-0247-3},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FloderusJLLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominLMT18,
author = {Fedor V. Fomin and
Mathieu Liedloff and
Pedro Montealegre and
Ioan Todinca},
title = {Algorithms Parameterized by Vertex Cover and Modular Width, Through
Potential Maximal Cliques},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1146--1169},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0297-1},
doi = {10.1007/S00453-017-0297-1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FominLMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominS18,
author = {Fedor V. Fomin and
Saket Saurabh},
title = {Preface to Special Issue Dedicated to the 60th Birthday of Gregory
Gutin},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2513--2515},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0416-7},
doi = {10.1007/S00453-018-0416-7},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fukunaga18,
author = {Takuro Fukunaga},
title = {Approximation Algorithms for Highly Connected Multi-dominating Sets
in Unit Disk Graphs},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3270--3292},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0385-2},
doi = {10.1007/S00453-017-0385-2},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Fukunaga18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FurcyS18,
author = {David Furcy and
Scott M. Summers},
title = {Optimal Self-Assembly of Finite Shapes at Temperature 1 in 3D},
journal = {Algorithmica},
volume = {80},
number = {6},
pages = {1909--1963},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0260-6},
doi = {10.1007/S00453-016-0260-6},
timestamp = {Wed, 04 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FurcyS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GagieN18,
author = {Travis Gagie and
Gonzalo Navarro},
title = {Guest Editorial: Special Issue on Compact Data Structures},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {1983--1985},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0381-6},
doi = {10.1007/S00453-017-0381-6},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GagieN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GanardiHLN18,
author = {Moses Ganardi and
Danny Hucke and
Markus Lohrey and
Eric Noeth},
title = {Tree Compression Using String Grammars},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {885--917},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0279-3},
doi = {10.1007/S00453-017-0279-3},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GanardiHLN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ganesan18,
author = {Ghurumuruhan Ganesan},
title = {Stretch and Diameter in Random Geometric Graphs},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {300--330},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0253-5},
doi = {10.1007/S00453-016-0253-5},
timestamp = {Tue, 09 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Ganesan18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ghandeharizadeh18,
author = {Shahram Ghandeharizadeh and
Sandy Irani and
Jenny Lam},
title = {The Subset Assignment Problem for Data Placement in Caches},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2201--2220},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0403-4},
doi = {10.1007/S00453-017-0403-4},
timestamp = {Sat, 05 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ghandeharizadeh18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GheibiMSS18,
author = {Amin Gheibi and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Christian Scheffer},
title = {Path Refinement in Weighted Regions},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3766--3802},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0414-9},
doi = {10.1007/S00453-018-0414-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GheibiMSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiacomoDELMMW18,
author = {Emilio Di Giacomo and
Walter Didimo and
William S. Evans and
Giuseppe Liotta and
Henk Meijer and
Fabrizio Montecchiani and
Stephen K. Wismath},
title = {Ortho-polygon Visibility Representations of Embedded Graphs},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2345--2383},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0324-2},
doi = {10.1007/S00453-017-0324-2},
timestamp = {Tue, 15 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GiacomoDELMMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiessenW18,
author = {Christian Gie{\ss}en and
Carsten Witt},
title = {Optimal Mutation Rates for the (1+{\(\lambda\)}) {EA} on OneMax Through
Asymptotically Tight Drift Analysis},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1710--1731},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0360-y},
doi = {10.1007/S00453-017-0360-Y},
timestamp = {Tue, 08 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GiessenW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiroireHM18,
author = {Fr{\'{e}}d{\'{e}}ric Giroire and
Fr{\'{e}}d{\'{e}}ric Havet and
Joanna Moulierac},
title = {On the Complexity of Compressing Two Dimensional Routing Tables with
Order},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {209--233},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0243-7},
doi = {10.1007/S00453-016-0243-7},
timestamp = {Fri, 12 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GiroireHM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHKKSV18,
author = {Petr A. Golovach and
Pinar Heggernes and
Mamadou Moustapha Kant{\'{e}} and
Dieter Kratsch and
Sigve Hortemo S{\ae}ther and
Yngve Villanger},
title = {Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear
MIM-Width},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {714--741},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0289-1},
doi = {10.1007/S00453-017-0289-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKKSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Grimmer18,
author = {Benjamin Grimmer},
title = {Dual-Based Approximation Algorithms for Cut-Based Network Connectivity
Problems},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2849--2873},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0356-7},
doi = {10.1007/S00453-017-0356-7},
timestamp = {Sat, 02 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Grimmer18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuptaR18,
author = {Sushmita Gupta and
Sanjukta Roy},
title = {Stable Matching Games: Manipulation via Subgraph Isomorphism},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2551--2573},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0382-5},
doi = {10.1007/S00453-017-0382-5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuptaR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Har-PeledK18,
author = {Sariel Har{-}Peled and
Nirman Kumar},
title = {Robust Proximity Search for Balls Using Sublinear Space},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {279--299},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0254-4},
doi = {10.1007/S00453-016-0254-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Har-PeledK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HayashiI18,
author = {Koyo Hayashi and
Satoru Iwata},
title = {Counting Minimum Weight Arborescences},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3908--3919},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0426-5},
doi = {10.1007/S00453-018-0426-5},
timestamp = {Wed, 17 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HayashiI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HeMZ18,
author = {Meng He and
J. Ian Munro and
Gelin Zhou},
title = {Dynamic Path Queries in Linear Space},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3728--3765},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0413-x},
doi = {10.1007/S00453-018-0413-X},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HeMZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HiraiN18,
author = {Hiroshi Hirai and
Hiroyuki Namba},
title = {Shortest (A+B)-Path Packing Via Hafnian},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2478--2491},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0334-0},
doi = {10.1007/S00453-017-0334-0},
timestamp = {Fri, 01 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HiraiN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HohnMW18,
author = {Wiebke H{\"{o}}hn and
Juli{\'{a}}n Mestre and
Andreas Wiese},
title = {How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent
Cost Functions},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1191--1213},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0300-x},
doi = {10.1007/S00453-017-0300-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HohnMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HonLSTTY18,
author = {Wing{-}Kai Hon and
Tak Wah Lam and
Rahul Shah and
Sharma V. Thankachan and
Hing{-}Fung Ting and
Yilin Yang},
title = {Dictionary Matching with a Bounded Gap in Pattern or in Text},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {698--713},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0288-2},
doi = {10.1007/S00453-017-0288-2},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HonLSTTY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Hong18,
author = {Seok{-}Hee Hong},
title = {Editorial: Special Issue on Algorithms and Computation},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2132--2133},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0438-1},
doi = {10.1007/S00453-018-0438-1},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Hong18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuTYZ18,
author = {Xiaocheng Hu and
Yufei Tao and
Yi Yang and
Shuigeng Zhou},
title = {Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1315--1329},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0307-3},
doi = {10.1007/S00453-017-0307-3},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuTYZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuberS18,
author = {Katharina T. Huber and
Guillaume E. Scholz},
title = {Beyond Representing Orthology Relations by Trees},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {73--103},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0241-9},
doi = {10.1007/S00453-016-0241-9},
timestamp = {Fri, 13 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuberS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IerselKSSB18,
author = {Leo van Iersel and
Steven Kelk and
Georgios Stamoulis and
Leen Stougie and
Olivier Boes},
title = {On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic
Network Problems},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {2993--3022},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0366-5},
doi = {10.1007/S00453-017-0366-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/IerselKSSB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IvanyosKSSS18,
author = {G{\'{a}}bor Ivanyos and
Marek Karpinski and
Miklos Santha and
Nitin Saxena and
Igor E. Shparlinski},
title = {Polynomial Interpolation and Identity Testing from High Powers Over
Finite Fields},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {560--575},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0273-1},
doi = {10.1007/S00453-016-0273-1},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/IvanyosKSSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenLM18,
author = {Klaus Jansen and
Kati Land and
Marten Maack},
title = {Estimating the Makespan of the Two-Valued Restricted Assignment Problem},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1357--1382},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0314-4},
doi = {10.1007/S00453-017-0314-4},
timestamp = {Tue, 06 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Jiang18,
author = {Minghui Jiang},
title = {Trees, Paths, Stars, Caterpillars and Spiders},
journal = {Algorithmica},
volume = {80},
number = {6},
pages = {1964--1982},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0237-5},
doi = {10.1007/S00453-016-0237-5},
timestamp = {Fri, 06 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Jiang18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KacemK18,
author = {Imed Kacem and
Hans Kellerer},
title = {Approximation Schemes for Minimizing the Maximum Lateness on a Single
Machine with Release Times Under Non-availability or Deadline Constraints},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3825--3843},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0417-6},
doi = {10.1007/S00453-018-0417-6},
timestamp = {Sun, 23 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KacemK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kamali18,
author = {Shahin Kamali},
title = {Compact Representation of Graphs of Small Clique-Width},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2106--2131},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0365-6},
doi = {10.1007/S00453-017-0365-6},
timestamp = {Thu, 26 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kamali18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kamiyama18,
author = {Naoyuki Kamiyama},
title = {A Note on Submodular Function Minimization with Covering Type Linear
Constraints},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2957--2971},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0363-8},
doi = {10.1007/S00453-017-0363-8},
timestamp = {Fri, 01 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kamiyama18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaplanMRS18,
author = {Haim Kaplan and
Wolfgang Mulzer and
Liam Roditty and
Paul Seiferth},
title = {Routing in Unit Disk Graphs},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {830--848},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0308-2},
doi = {10.1007/S00453-017-0308-2},
timestamp = {Thu, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KaplanMRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KawaseM18,
author = {Yasushi Kawase and
Atsushi Miyauchi},
title = {The Densest Subgraph Problem with a Convex/Concave Size Function},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3461--3480},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0400-7},
doi = {10.1007/S00453-017-0400-7},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KawaseM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KawaseMS18,
author = {Yasushi Kawase and
Kazuhisa Makino and
Kento Seimi},
title = {Optimal Composition Ordering Problems for Piecewise Linear Functions},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2134--2159},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0397-y},
doi = {10.1007/S00453-017-0397-Y},
timestamp = {Sat, 05 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KawaseMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KimOPST18,
author = {Eun Jung Kim and
Sang{-}il Oum and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {An {FPT} 2-Approximation for Tree-Cut Decomposition},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {116--135},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0245-5},
doi = {10.1007/S00453-016-0245-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KimOPST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KonigL18,
author = {Daniel K{\"{o}}nig and
Markus Lohrey},
title = {Evaluation of Circuits Over Nilpotent and Polycyclic Groups},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1459--1492},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0343-z},
doi = {10.1007/S00453-017-0343-Z},
timestamp = {Thu, 29 Mar 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KonigL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KotzingS18,
author = {Timo K{\"{o}}tzing and
Dirk Sudholt},
title = {Preface to the Special Issue on Theory of Genetic and Evolutionary
Computation},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1575--1578},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0379-0},
doi = {10.1007/S00453-017-0379-0},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KotzingS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KranakisN18,
author = {Evangelos Kranakis and
Gonzalo Navarro},
title = {Guest Editorial: Special Issue on Theoretical Informatics},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {827--829},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0394-1},
doi = {10.1007/S00453-017-0394-1},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KranakisN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KrithikaST18,
author = {R. Krithika and
Abhishek Sahu and
Prafullkumar Tale},
title = {Dynamic Parameterized Problems},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2637--2655},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0349-6},
doi = {10.1007/S00453-017-0349-6},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KrithikaST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LevitT18,
author = {Vadim E. Levit and
David Tankus},
title = {Complexity Results for Generating Subgraphs},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2384--2399},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0325-1},
doi = {10.1007/S00453-017-0325-1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LevitT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiMH18,
author = {Shouwei Li and
Christine Markarian and
Friedhelm Meyer auf der Heide},
title = {Towards Flexible Demands in Online Leasing Problems},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1556--1574},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0420-y},
doi = {10.1007/S00453-018-0420-Y},
timestamp = {Fri, 06 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiMH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LingasP18,
author = {Andrzej Lingas and
Mia Persson},
title = {Extreme Witnesses and Their Applications},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3943--3957},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0492-8},
doi = {10.1007/S00453-018-0492-8},
timestamp = {Sun, 23 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LingasP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LissovoiW18,
author = {Andrei Lissovoi and
Carsten Witt},
title = {The Impact of a Sparse Migration Topology on the Runtime of Island
Models in Dynamic Optimization},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1634--1657},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0377-2},
doi = {10.1007/S00453-017-0377-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LissovoiW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiuM18,
author = {Chih{-}Hung Liu and
Sandro Montanari},
title = {Minimizing the Diameter of a Spanning Tree for Imprecise Points},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {801--826},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0292-6},
doi = {10.1007/S00453-017-0292-6},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiuM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LohreyMR18,
author = {Markus Lohrey and
Sebastian Maneth and
Carl Philipp Reh},
title = {Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed
Trees},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2082--2105},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0331-3},
doi = {10.1007/S00453-017-0331-3},
timestamp = {Thu, 26 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LohreyMR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LuK18,
author = {Zaixin Lu and
Donghyun Kim},
title = {Guest Editorial: Special Issue on Combinatorial Optimization and Applications},
journal = {Algorithmica},
volume = {80},
number = {6},
pages = {1769--1770},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0430-9},
doi = {10.1007/S00453-018-0430-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LuK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LuoXGTGL18,
author = {Wenchang Luo and
Yao Xu and
Boyuan Gu and
Weitian Tong and
Randy Goebel and
Guohui Lin},
title = {Algorithms for Communication Scheduling in Data Gathering Network
with Data Compression},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3158--3176},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0373-6},
doi = {10.1007/S00453-017-0373-6},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LuoXGTGL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MagnerS18,
author = {Abram Magner and
Wojciech Szpankowski},
title = {Profiles of {PATRICIA} Tries},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {331--397},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0261-5},
doi = {10.1007/S00453-016-0261-5},
timestamp = {Tue, 09 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MagnerS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MaheshwariNPRS18,
author = {Anil Maheshwari and
Subhas C. Nandy and
Drimit Pattanayak and
Sasanka Roy and
Michiel H. M. Smid},
title = {Geometric Path Problems with Violations},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {448--471},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0263-3},
doi = {10.1007/S00453-016-0263-3},
timestamp = {Thu, 08 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MaheshwariNPRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MajumdarR18,
author = {Diptapriyo Majumdar and
Venkatesh Raman},
title = {Structural Parameterizations of Undirected Feedback Vertex Set: {FPT}
Algorithms and Kernelization},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2683--2724},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0419-4},
doi = {10.1007/S00453-018-0419-4},
timestamp = {Fri, 01 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MajumdarR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MartinS18,
author = {Christopher S. Martin and
Mohammad R. Salavatipour},
title = {Minimizing Latency of Capacitated k-Tours},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2492--2511},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0337-x},
doi = {10.1007/S00453-017-0337-X},
timestamp = {Fri, 25 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MartinS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MeesumS18,
author = {Syed Mohammad Meesum and
Saket Saurabh},
title = {Rank Reduction of Oriented Graphs by Vertex and Edge Deletions},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2757--2776},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0340-2},
doi = {10.1007/S00453-017-0340-2},
timestamp = {Fri, 01 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MeesumS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MemoliSS18,
author = {Facundo M{\'{e}}moli and
Anastasios Sidiropoulos and
Vijay Sridhar},
title = {Quasimetric Embeddings and Their Applications},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3803--3824},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0415-8},
doi = {10.1007/S00453-018-0415-8},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MemoliSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MilanicPT18,
author = {Martin Milanic and
Irena Penev and
Nicolas Trotignon},
title = {Stable Sets in \{ISK4, wheel\}-Free Graphs},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {415--447},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0255-3},
doi = {10.1007/S00453-016-0255-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MilanicPT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MurrayKC18,
author = {Riley Murray and
Samir Khuller and
Megan Chao},
title = {Scheduling Distributed Clusters of Parallel Machines : Primal-Dual
and LP-based Approximation Algorithms},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2777--2798},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0345-x},
doi = {10.1007/S00453-017-0345-X},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MurrayKC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NagaoST18,
author = {Atsuki Nagao and
Kazuhisa Seto and
Junichi Teruyama},
title = {A Moderately Exponential Time Algorithm for k-IBDD Satisfiability},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2725--2741},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0332-2},
doi = {10.1007/S00453-017-0332-2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NagaoST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NiedermannH18,
author = {Benjamin Niedermann and
Jan{-}Henrik Haunert},
title = {An Algorithmic Framework for Labeling Network Maps},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1493--1533},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0350-0},
doi = {10.1007/S00453-017-0350-0},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/NiedermannH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Nonner18,
author = {Tim Nonner},
title = {Clique Clustering Yields a {PTAS} for Max-Coloring Interval Graphs},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2941--2956},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0362-9},
doi = {10.1007/S00453-017-0362-9},
timestamp = {Fri, 01 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Nonner18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/OlivetoPHST18,
author = {Pietro S. Oliveto and
Tiago Paix{\~{a}}o and
Jorge P{\'{e}}rez Heredia and
Dirk Sudholt and
Barbora Trubenov{\'{a}}},
title = {How to Escape Local Optima in Black Box Optimisation: When Non-elitism
Outperforms Elitism},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1604--1633},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0369-2},
doi = {10.1007/S00453-017-0369-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/OlivetoPHST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PaulPW18,
author = {Alice Paul and
Matthias Poloczek and
David P. Williamson},
title = {Simple Approximation Algorithms for Balanced {MAX} 2SAT},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {995--1012},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0312-6},
doi = {10.1007/S00453-017-0312-6},
timestamp = {Thu, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PaulPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PolicritiP18,
author = {Alberto Policriti and
Nicola Prezza},
title = {{LZ77} Computation Based on the Run-Length Encoded {BWT}},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {1986--2011},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0327-z},
doi = {10.1007/S00453-017-0327-Z},
timestamp = {Sat, 05 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PolicritiP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/QianUW18,
author = {Jiawei Qian and
Seeun William Umboh and
David P. Williamson},
title = {Online Constrained Forest and Prize-Collecting Network Design},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3335--3364},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0391-4},
doi = {10.1007/S00453-017-0391-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/QianUW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RahmatiC18,
author = {Zahed Rahmati and
Timothy M. Chan},
title = {A Clustering-Based Approach to Kinetic Closest Pair},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2742--2756},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0338-9},
doi = {10.1007/S00453-017-0338-9},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RahmatiC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ReitzigW18,
author = {Raphael Reitzig and
Sebastian Wild},
title = {Building Fences Straight and High: An Optimal Algorithm for Finding
the Maximum Length You Can Cut k Times from Given Sticks},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3365--3396},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0392-3},
doi = {10.1007/S00453-017-0392-3},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ReitzigW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SaettlerLC18,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Ferdinando Cicalese},
title = {Correction to: Trading Off Worst and Expected Cost in Decision Tree
Problems},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3431--3436},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0423-8},
doi = {10.1007/S00453-018-0423-8},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SaettlerLC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SaurabhZ18,
author = {Saket Saurabh and
Meirav Zehavi},
title = {{\textdollar}{\textdollar}(k, n-k){\textdollar}{\textdollar} {(} k
, n - k {)} -Max-Cut: An {\textdollar}{\textdollar}{\textbackslash}mathcal\{O\}*(2p){\textdollar}{\textdollar}
{O} {\({_\ast}\)} {(} 2 p {)} -Time Algorithm and a Polynomial Kernel},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3844--3860},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0418-5},
doi = {10.1007/S00453-018-0418-5},
timestamp = {Wed, 17 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SaurabhZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SchieberSTT18,
author = {Baruch Schieber and
Hadas Shachnai and
Gal Tamir and
Tami Tamir},
title = {A Theory and Algorithms for Combinatorial Reoptimization},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {576--607},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0274-8},
doi = {10.1007/S00453-017-0274-8},
timestamp = {Wed, 07 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/SchieberSTT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SchlotterC18,
author = {Ildik{\'{o}} Schlotter and
Katar{\'{\i}}na Cechl{\'{a}}rov{\'{a}}},
title = {A Connection Between Sports and Matroids: How Many Teams Can We Beat?},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {258--278},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0256-2},
doi = {10.1007/S00453-016-0256-2},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SchlotterC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SchlotterC18a,
author = {Ildik{\'{o}} Schlotter and
Katar{\'{\i}}na Cechl{\'{a}}rov{\'{a}}},
title = {Correction to: {A} Connection Between Sports and Matroids: How Many
Teams Can We Beat?},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3428--3430},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0378-1},
doi = {10.1007/S00453-017-0378-1},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SchlotterC18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WangHDT18,
author = {Zhenbo Wang and
Xin Han and
Gy{\"{o}}rgy D{\'{o}}sa and
Zsolt Tuza},
title = {A General Bin Packing Game: Interest Taken into Account},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1534--1555},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0361-x},
doi = {10.1007/S00453-017-0361-X},
timestamp = {Thu, 29 Mar 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WangHDT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WellerCDG18,
author = {Mathias Weller and
Annie Chateau and
Cl{\'{e}}ment Dallard and
Rodolphe Giroudeau},
title = {Scaffolding Problems Revisited: Complexity, Approximation and Fixed
Parameter Tractable Algorithms, and Some Special Cases},
journal = {Algorithmica},
volume = {80},
number = {6},
pages = {1771--1803},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0405-x},
doi = {10.1007/S00453-018-0405-X},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WellerCDG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Wiese18,
author = {Andreas Wiese},
title = {Independent Set of Convex Polygons: From {\textdollar}{\textdollar}n\{{\textbackslash}epsilon
\}{\textdollar}{\textdollar} n {\unicode{1013}} to {\textdollar}{\textdollar}1+{\textbackslash}epsilon
{\textdollar}{\textdollar} 1 + {\unicode{1013}} via Shrinking},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {918--934},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0347-8},
doi = {10.1007/S00453-017-0347-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Wiese18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X18,
title = {Editor's Note: Special Issue Dedicated to the 60th Birthday of Gregory
Gutin},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2516},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0437-2},
doi = {10.1007/S00453-018-0437-2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/X18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X18a,
title = {Editor's Note},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3958},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0508-4},
doi = {10.1007/S00453-018-0508-4},
timestamp = {Sun, 23 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/X18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/XueYZZ18,
author = {Yuan Xue and
Boting Yang and
Farong Zhong and
Sandra Zilles},
title = {The Fast Search Number of a Complete k-Partite Graph},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3959--3981},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0456-z},
doi = {10.1007/S00453-018-0456-Z},
timestamp = {Wed, 17 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/XueYZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ZhangFT18,
author = {Peng Zhang and
Bin Fu and
Linqing Tang},
title = {Simpler and Better Approximation Algorithms for the Unweighted Minimum
Label s-t Cut Problem},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {398--409},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0265-1},
doi = {10.1007/S00453-016-0265-1},
timestamp = {Tue, 09 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ZhangFT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ZhangXJLLM18,
author = {Peng Zhang and
Yao Xu and
Tao Jiang and
Angsheng Li and
Guohui Lin and
Eiji Miyano},
title = {Improved Approximation Algorithms for the Maximum Happy Vertices and
Edges Problems},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1412--1438},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0302-8},
doi = {10.1007/S00453-017-0302-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ZhangXJLLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ZiedanRMGD18,
author = {Emile Ziedan and
Deepak Rajendraprasad and
Rogers Mathew and
Martin Charles Golumbic and
J{\'{e}}r{\'{e}}mie Dusart},
title = {The Induced Separation Dimension of a Graph},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2834--2848},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0353-x},
doi = {10.1007/S00453-017-0353-X},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ZiedanRMGD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/0002B0G017,
author = {S. Anand and
Karl Bringmann and
Tobias Friedrich and
Naveen Garg and
Amit Kumar},
title = {Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines},
journal = {Algorithmica},
volume = {77},
number = {2},
pages = {515--536},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0082-y},
doi = {10.1007/S00453-015-0082-Y},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/0002B0G017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AdlerKK17,
author = {Isolde Adler and
Mamadou Moustapha Kant{\'{e}} and
O{-}joung Kwon},
title = {Linear Rank-Width of Distance-Hereditary Graphs I. {A} Polynomial-Time
Algorithm},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {342--377},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0164-5},
doi = {10.1007/S00453-016-0164-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AdlerKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgarwalHSYZ17,
author = {Pankaj K. Agarwal and
Sariel Har{-}Peled and
Subhash Suri and
Hakan Yildiz and
Wuzhou Zhang},
title = {Convex Hulls Under Uncertainty},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {340--367},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0195-y},
doi = {10.1007/S00453-016-0195-Y},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalHSYZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersH17,
author = {Susanne Albers and
Matthias Hellwig},
title = {Online Makespan Minimization with Parallel Schedules},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {492--520},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0172-5},
doi = {10.1007/S00453-016-0172-5},
timestamp = {Thu, 04 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersH17a,
author = {Susanne Albers and
Matthias Hellwig},
title = {On the Value of Job Migration in Online Makespan Minimization},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {598--623},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0209-9},
doi = {10.1007/S00453-016-0209-9},
timestamp = {Tue, 01 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersH17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlewijnseBBB17,
author = {Sander P. A. Alewijnse and
Quirijn W. Bouts and
Alex P. ten Brink and
Kevin Buchin},
title = {Distribution-Sensitive Construction of the Greedy Spanner},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {209--231},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0160-9},
doi = {10.1007/S00453-016-0160-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlewijnseBBB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AllenHKU17,
author = {Sarah R. Allen and
Lisa Hellerstein and
Devorah Kletenik and
Tongu{\c{c}} {\"{U}}nl{\"{u}}yurt},
title = {Evaluation of Monotone {DNF} Formulas},
journal = {Algorithmica},
volume = {77},
number = {3},
pages = {661--685},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0092-9},
doi = {10.1007/S00453-015-0092-9},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AllenHKU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonFT17,
author = {Noga Alon and
Moran Feldman and
Moshe Tennenholtz},
title = {Revenue and Reserve Prices in a Probabilistic Single Item Auction},
journal = {Algorithmica},
volume = {77},
number = {1},
pages = {1--15},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0055-1},
doi = {10.1007/S00453-015-0055-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlonFT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AndrewsW17,
author = {Aaron M. Andrews and
Haitao Wang},
title = {Minimizing the Aggregate Movements for Interval Coverage},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {47--85},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0153-8},
doi = {10.1007/S00453-016-0153-8},
timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndrewsW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngeliniLBF17,
author = {Patrizio Angelini and
Giordano Da Lozzo and
Giuseppe Di Battista and
Fabrizio Frati},
title = {Strip Planarity Testing for Embedded Planar Graphs},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1022--1059},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0128-9},
doi = {10.1007/S00453-016-0128-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AngeliniLBF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnshelevichBH17,
author = {Elliot Anshelevich and
Onkar Bhardwaj and
Martin Hoefer},
title = {Stable Matching with Network Externalities},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {1067--1106},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0197-9},
doi = {10.1007/S00453-016-0197-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnshelevichBH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntoniadisBCKNP17,
author = {Antonios Antoniadis and
Neal Barcelo and
Mario E. Consuegra and
Peter Kling and
Michael Nugent and
Kirk Pruhs and
Michele Scquizzato},
title = {Efficient Computation of Optimal Energy and Fractional Weighted Flow
Trade-Off Schedules},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {568--597},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0208-x},
doi = {10.1007/S00453-016-0208-X},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AntoniadisBCKNP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AravindSS17,
author = {N. R. Aravind and
R. B. Sandeep and
Naveen Sivadasan},
title = {On Polynomial Kernelization of H-free Edge Deletion},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {654--666},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0215-y},
doi = {10.1007/S00453-016-0215-Y},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AravindSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AschnerK17,
author = {Rom Aschner and
Matthew J. Katz},
title = {Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints},
journal = {Algorithmica},
volume = {77},
number = {2},
pages = {349--373},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0076-9},
doi = {10.1007/S00453-015-0076-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AschnerK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AshokKS17,
author = {Pradeesha Ashok and
Sudeshna Kolay and
Saket Saurabh},
title = {Multivariate Complexity Analysis of Geometric Red Blue Set Cover},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {667--697},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0216-x},
doi = {10.1007/S00453-016-0216-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AshokKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AustrinCMPS17,
author = {Per Austrin and
Kai{-}Min Chung and
Mohammad Mahmoody and
Rafael Pass and
Karn Seth},
title = {On the Impossibility of Cryptography with Tamperable Randomness},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1052--1101},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0219-7},
doi = {10.1007/S00453-016-0219-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AustrinCMPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarG17,
author = {Yossi Azar and
Oren Gilon},
title = {Scheduling with Deadlines and Buffer Management with Processing Requirements},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1246--1262},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0257-1},
doi = {10.1007/S00453-016-0257-1},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AzarG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BampasGHIKKR17,
author = {Evangelos Bampas and
Leszek Gasieniec and
Nicolas Hanusse and
David Ilcinkas and
Ralf Klasing and
Adrian Kosowski and
Tomasz Radzik},
title = {Robustness of the Rotor-Router Mechanism},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {869--895},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0179-y},
doi = {10.1007/S00453-016-0179-Y},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BampasGHIKKR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BansalF17,
author = {Nikhil Bansal and
Irene Finocchi},
title = {Guest Editors' Foreword},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1107--1108},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0309-1},
doi = {10.1007/S00453-017-0309-1},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BansalF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bar-NoyBR17,
author = {Amotz Bar{-}Noy and
Ben Baumer and
Dror Rawitz},
title = {Set It and Forget It: Approximating the Set Once Strip Cover Problem},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {368--386},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0198-8},
doi = {10.1007/S00453-016-0198-8},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Bar-NoyBR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bar-YehudaBR17,
author = {Reuven Bar{-}Yehuda and
Michael Beder and
Dror Rawitz},
title = {A Constant Factor Approximation Algorithm for the Storage Allocation
Problem},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1105--1127},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0137-8},
doi = {10.1007/S00453-016-0137-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Bar-YehudaBR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarberoGJS17,
author = {Florian Barbero and
Gregory Z. Gutin and
Mark Jones and
Bin Sheng},
title = {Parameterized and Approximation Algorithms for the Load Coloring Problem},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {211--229},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0259-z},
doi = {10.1007/S00453-016-0259-Z},
timestamp = {Wed, 22 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BarberoGJS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaK17,
author = {Surender Baswana and
Shahbaz Khan},
title = {Incremental Algorithm for Maintaining a {DFS} Tree for Undirected
Graphs},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {466--483},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0204-1},
doi = {10.1007/S00453-016-0204-1},
timestamp = {Thu, 21 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosBKR17,
author = {Michael A. Bekos and
Till Bruckdorfer and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
title = {The Book Thickness of 1-Planar Graphs is Constant},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {444--465},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0203-2},
doi = {10.1007/S00453-016-0203-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosBKR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosCGHK17,
author = {Michael A. Bekos and
Sabine Cornelsen and
Luca Grilli and
Seok{-}Hee Hong and
Michael Kaufmann},
title = {On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {401--427},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0200-5},
doi = {10.1007/S00453-016-0200-5},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosCGHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosDFKKPSW17,
author = {Michael A. Bekos and
Thomas C. van Dijk and
Martin Fink and
Philipp Kindermann and
Stephen G. Kobourov and
Sergey Pupyrev and
Joachim Spoerhase and
Alexander Wolff},
title = {Improved Approximation Algorithms for Box Contact Representations},
journal = {Algorithmica},
volume = {77},
number = {3},
pages = {902--920},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0121-3},
doi = {10.1007/S00453-016-0121-3},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosDFKKPSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelazzouguiC17,
author = {Djamal Belazzougui and
Fabio Cunial},
title = {A Framework for Space-Efficient String Kernels},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {857--883},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0286-4},
doi = {10.1007/S00453-017-0286-4},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BelazzouguiC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-SassonCTV17,
author = {Eli Ben{-}Sasson and
Alessandro Chiesa and
Eran Tromer and
Madars Virza},
title = {Scalable Zero Knowledge Via Cycles of Elliptic Curves},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1102--1160},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0221-0},
doi = {10.1007/S00453-016-0221-0},
timestamp = {Wed, 11 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ben-SassonCTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BesserP17,
author = {Bert Besser and
Matthias Poloczek},
title = {Greedy Matching: Guarantees and Limitations},
journal = {Algorithmica},
volume = {77},
number = {1},
pages = {201--234},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0062-2},
doi = {10.1007/S00453-015-0062-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BesserP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleCG17,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
title = {Compressed Subsequence Matching and Packed Tree Coloring},
journal = {Algorithmica},
volume = {77},
number = {2},
pages = {336--348},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0068-9},
doi = {10.1007/S00453-015-0068-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleCG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BingmannES17,
author = {Timo Bingmann and
Andreas Eberle and
Peter Sanders},
title = {Engineering Parallel String Sorting},
journal = {Algorithmica},
volume = {77},
number = {1},
pages = {235--286},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0071-1},
doi = {10.1007/S00453-015-0071-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BingmannES17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BitanskyCKP17,
author = {Nir Bitansky and
Ran Canetti and
Yael Tauman Kalai and
Omer Paneth},
title = {On Virtual Grey Box Obfuscation for General Circuits},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1014--1051},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0218-8},
doi = {10.1007/S00453-016-0218-8},
timestamp = {Mon, 09 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BitanskyCKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlasiokK17,
author = {Jaroslaw Blasiok and
Marcin Jakub Kaminski},
title = {Chain Minors are {FPT}},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {698--707},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0220-1},
doi = {10.1007/S00453-016-0220-1},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BlasiokK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlinBN17,
author = {L{\'{e}}lia Blin and
Janna Burman and
Nicolas Nisse},
title = {Exclusive Graph Searching},
journal = {Algorithmica},
volume = {77},
number = {3},
pages = {942--969},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0124-0},
doi = {10.1007/S00453-016-0124-0},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BlinBN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BliznetsFGKKS17,
author = {Ivan Bliznets and
Fedor V. Fomin and
Petr A. Golovach and
Nikolay Karpov and
Alexander S. Kulikov and
Saket Saurabh},
title = {Parameterized Complexity of Superstring Problems},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {798--813},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0193-0},
doi = {10.1007/S00453-016-0193-0},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BliznetsFGKKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoissonnatST17,
author = {Jean{-}Daniel Boissonnat and
{Karthik {C. S.}} and
S{\'{e}}bastien Tavenas},
title = {Building Efficient and Compact Data Structures for Simplicial Complexes},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {530--567},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0207-y},
doi = {10.1007/S00453-016-0207-Y},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoissonnatST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonacinaT17,
author = {Ilario Bonacina and
Navid Talebanfard},
title = {Strong {ETH} and Resolution via Games and the Multiplicity of Strategies},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {29--41},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0228-6},
doi = {10.1007/S00453-016-0228-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BonacinaT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonamyKPS17,
author = {Marthe Bonamy and
Lukasz Kowalik and
Michal Pilipczuk and
Arkadiusz Socala},
title = {Linear Kernels for Outbranching Problems in Sparse Digraphs},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {159--188},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0244-6},
doi = {10.1007/S00453-016-0244-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonamyKPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonehZ17,
author = {Dan Boneh and
Mark Zhandry},
title = {Multiparty Key Exchange, Efficient Traitor Tracing, and More from
Indistinguishability Obfuscation},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1233--1285},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0242-8},
doi = {10.1007/S00453-016-0242-8},
timestamp = {Mon, 09 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonehZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonizzoniVPPR17,
author = {Paola Bonizzoni and
Gianluca Della Vedova and
Yuri Pirola and
Marco Previtali and
Raffaella Rizzi},
title = {An External-Memory Algorithm for String Graph Construction},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {394--424},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0165-4},
doi = {10.1007/S00453-016-0165-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BonizzoniVPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BorodinBLO17,
author = {Allan Borodin and
Mark Braverman and
Brendan Lucier and
Joel Oren},
title = {Strategyproof Mechanisms for Competitive Influence in Networks},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {425--452},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0169-0},
doi = {10.1007/S00453-016-0169-0},
timestamp = {Thu, 04 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BorodinBLO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandstadtM17,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding Dominating Induced Matchings in P\({}_{\mbox{8}}\) -Free Graphs
in Polynomial Time},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1283--1302},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0150-y},
doi = {10.1007/S00453-016-0150-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandstadtM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannP17,
author = {Karl Bringmann and
Konstantinos Panagiotou},
title = {Efficient Sampling Methods for Discrete Distributions},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {484--508},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0205-0},
doi = {10.1007/S00453-016-0205-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BulianD17,
author = {Jannis Bulian and
Anuj Dawar},
title = {Fixed-Parameter Tractable Distances to Sparse Graph Classes},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {139--158},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0235-7},
doi = {10.1007/S00453-016-0235-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BulianD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaminitiFFS17,
author = {Saverio Caminiti and
Irene Finocchi and
Emanuele G. Fusco and
Francesco Silvestri},
title = {Resilient Dynamic Programming},
journal = {Algorithmica},
volume = {77},
number = {2},
pages = {389--425},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0073-z},
doi = {10.1007/S00453-015-0073-Z},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CaminitiFFS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Caragiannis0G17,
author = {Ioannis Caragiannis and
Angelo Fanelli and
Nick Gravin},
title = {Short Sequences of Improvement Moves Lead to Approximate Equilibria
in Constraint Satisfaction Games},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1143--1158},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0143-x},
doi = {10.1007/S00453-016-0143-X},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Caragiannis0G17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChambersEFLSVSS17,
author = {Erin W. Chambers and
Alejandro Erickson and
S{\'{a}}ndor P. Fekete and
Jonathan Lenchner and
Jeff Sember and
S. Venkatesh and
Ulrike Stege and
Svetlana Stolpner and
Christophe Weibel and
Sue Whitesides},
title = {Connectivity Graphs of Uncertainty Regions},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {990--1019},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0191-2},
doi = {10.1007/S00453-016-0191-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChambersEFLSVSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanHMZ17,
author = {Timothy M. Chan and
Meng He and
J. Ian Munro and
Gelin Zhou},
title = {Succinct Indices for Path Minimum, with Applications},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {453--491},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0170-7},
doi = {10.1007/S00453-016-0170-7},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanHMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChechikJPP17,
author = {Shiri Chechik and
Matthew P. Johnson and
Merav Parter and
David Peleg},
title = {Secluded Connectivity Problems},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {708--741},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0222-z},
doi = {10.1007/S00453-016-0222-Z},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChechikJPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenW17,
author = {Danny Z. Chen and
Haitao Wang},
title = {Computing the Visibility Polygon of an Island in a Polygonal Domain},
journal = {Algorithmica},
volume = {77},
number = {1},
pages = {40--64},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0058-y},
doi = {10.1007/S00453-015-0058-Y},
timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenZ17,
author = {Jiecao Chen and
Qin Zhang},
title = {Improved Algorithms for Distributed Entropy Monitoring},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {1041--1066},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0194-z},
doi = {10.1007/S00453-016-0194-Z},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChitnisEHKKS17,
author = {Rajesh Chitnis and
Hossein Esfandiari and
Mohammad Taghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Saeed Seddighin},
title = {A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals
with Demands},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1216--1239},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0145-8},
doi = {10.1007/S00453-016-0145-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChitnisEHKKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChitnisEM17,
author = {Rajesh Chitnis and
L{\'{a}}szl{\'{o}} Egri and
D{\'{a}}niel Marx},
title = {List H-Coloring a Graph by Removing Few Vertices},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {110--146},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0139-6},
doi = {10.1007/S00453-016-0139-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChitnisEM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CicaleseLS17,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Aline Medeiros Saettler},
title = {Decision Trees for Function Evaluation: Simultaneous Optimization
of Worst and Expected Cost},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {763--796},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0225-9},
doi = {10.1007/S00453-016-0225-9},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CicaleseLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CominR17,
author = {Carlo Comin and
Romeo Rizzi},
title = {Improved Pseudo-polynomial Bound for the Value Problem and Optimal
Strategy Synthesis in Mean Payoff Games},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {995--1021},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0123-1},
doi = {10.1007/S00453-016-0123-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CominR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CorusHJOSZ17,
author = {Dogan Corus and
Jun He and
Thomas Jansen and
Pietro S. Oliveto and
Dirk Sudholt and
Christine Zarges},
title = {On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {714--740},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0201-4},
doi = {10.1007/S00453-016-0201-4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CorusHJOSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CouetouxNV17,
author = {Basile Cou{\"{e}}toux and
Elie Nakache and
Yann Vax{\`{e}}s},
title = {The Maximum Labeled Path Problem},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {298--318},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0155-6},
doi = {10.1007/S00453-016-0155-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CouetouxNV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CzyzowiczGKKKT17,
author = {Jurek Czyzowicz and
Leszek Gasieniec and
Adrian Kosowski and
Evangelos Kranakis and
Danny Krizanc and
Najmeh Taleb},
title = {When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile
Robots},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {925--940},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0233-9},
doi = {10.1007/S00453-016-0233-9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CzyzowiczGKKKT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DangJL17,
author = {Duc{-}Cuong Dang and
Thomas Jansen and
Per Kristian Lehre},
title = {Populations Can Be Essential in Tracking Dynamic Optima},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {660--680},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0187-y},
doi = {10.1007/S00453-016-0187-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DangJL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DeligkasFSS17,
author = {Argyrios Deligkas and
John Fearnley and
Rahul Savani and
Paul G. Spirakis},
title = {Computing Approximate Nash Equilibria in Polymatrix Games},
journal = {Algorithmica},
volume = {77},
number = {2},
pages = {487--514},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0078-7},
doi = {10.1007/S00453-015-0078-7},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DeligkasFSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DellKLMM17,
author = {Holger Dell and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Tobias M{\"{o}}mke},
title = {Complexity and Approximability of Parameterized MAX-CSPs},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {230--250},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0310-8},
doi = {10.1007/S00453-017-0310-8},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DellKLMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Desalvo17,
author = {Stephen Desalvo},
title = {Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via
Probabilistic Divide-and-Conquer},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {742--762},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0223-y},
doi = {10.1007/S00453-016-0223-Y},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Desalvo17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DillabaughHMZ17,
author = {Craig Dillabaugh and
Meng He and
Anil Maheshwari and
Norbert Zeh},
title = {I/O-Efficient Path Traversal in Succinct Planar Graphs},
journal = {Algorithmica},
volume = {77},
number = {3},
pages = {714--755},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0086-7},
doi = {10.1007/S00453-015-0086-7},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DillabaughHMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DingX17,
author = {Hu Ding and
Jinhui Xu},
title = {{FPTAS} for Minimizing the Earth Mover's Distance Under Rigid Transformations
and Related Problems},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {741--770},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0173-4},
doi = {10.1007/S00453-016-0173-4},
timestamp = {Mon, 17 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DingX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DinitzSV17,
author = {Michael Dinitz and
Michael Schapira and
Asaf Valadarsky},
title = {Explicit Expanding Expanders},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1225--1245},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0269-x},
doi = {10.1007/S00453-016-0269-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DinitzSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DinurL17,
author = {Itai Dinur and
Ga{\"{e}}tan Leurent},
title = {Improved Generic Attacks Against Hash-Based MACs and {HAIFA}},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1161--1195},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0236-6},
doi = {10.1007/S00453-016-0236-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DinurL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DodisSSW17,
author = {Yevgeniy Dodis and
Adi Shamir and
Noah Stephens{-}Davidowitz and
Daniel Wichs},
title = {How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies
for Compromised RNGs},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1196--1232},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0239-3},
doi = {10.1007/S00453-016-0239-3},
timestamp = {Mon, 09 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DodisSSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrC17,
author = {Carola Doerr and
Francisco Chicano},
title = {Preface to the Special Issue on Theory of Genetic and Evolutionary
Computation},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {558--560},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0280-x},
doi = {10.1007/S00453-017-0280-X},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrL17,
author = {Carola Doerr and
Johannes Lengler},
title = {OneMax in Black-Box Models with Several Restrictions},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {610--640},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0168-1},
doi = {10.1007/S00453-016-0168-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrNS17,
author = {Benjamin Doerr and
Frank Neumann and
Andrew M. Sutton},
title = {Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable
k-CNF Formulas},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {561--586},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0190-3},
doi = {10.1007/S00453-016-0190-3},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DraganKL17,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler and
Arne Leitert},
title = {Line-Distortion, Bandwidth and Path-Length of a Graph},
journal = {Algorithmica},
volume = {77},
number = {3},
pages = {686--713},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0094-7},
doi = {10.1007/S00453-015-0094-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DraganKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-21 03:06 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
