Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/algorithmica/algorithmica82.bht:"
download as .bib file
@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}
}
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-31 15:48 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:
