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/algorithmica80.bht:"
download as .bib file
@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}
}
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-09 21:26 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:
