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/algorithmica78.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AdlerKK17,
author = {Isolde Adler and
Mamadou Moustapha Kant{\'{e}} and
O{-}joung Kwon},
title = {Linear Rank-Width of Distance-Hereditary Graphs I. {A} Polynomial-Time
Algorithm},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {342--377},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0164-5},
doi = {10.1007/S00453-016-0164-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AdlerKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersH17,
author = {Susanne Albers and
Matthias Hellwig},
title = {Online Makespan Minimization with Parallel Schedules},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {492--520},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0172-5},
doi = {10.1007/S00453-016-0172-5},
timestamp = {Thu, 04 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlewijnseBBB17,
author = {Sander P. A. Alewijnse and
Quirijn W. Bouts and
Alex P. ten Brink and
Kevin Buchin},
title = {Distribution-Sensitive Construction of the Greedy Spanner},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {209--231},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0160-9},
doi = {10.1007/S00453-016-0160-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlewijnseBBB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AndrewsW17,
author = {Aaron M. Andrews and
Haitao Wang},
title = {Minimizing the Aggregate Movements for Interval Coverage},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {47--85},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0153-8},
doi = {10.1007/S00453-016-0153-8},
timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndrewsW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnshelevichBH17,
author = {Elliot Anshelevich and
Onkar Bhardwaj and
Martin Hoefer},
title = {Stable Matching with Network Externalities},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {1067--1106},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0197-9},
doi = {10.1007/S00453-016-0197-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnshelevichBH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarG17,
author = {Yossi Azar and
Oren Gilon},
title = {Scheduling with Deadlines and Buffer Management with Processing Requirements},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1246--1262},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0257-1},
doi = {10.1007/S00453-016-0257-1},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AzarG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BampasGHIKKR17,
author = {Evangelos Bampas and
Leszek Gasieniec and
Nicolas Hanusse and
David Ilcinkas and
Ralf Klasing and
Adrian Kosowski and
Tomasz Radzik},
title = {Robustness of the Rotor-Router Mechanism},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {869--895},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0179-y},
doi = {10.1007/S00453-016-0179-Y},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BampasGHIKKR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BansalF17,
author = {Nikhil Bansal and
Irene Finocchi},
title = {Guest Editors' Foreword},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1107--1108},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0309-1},
doi = {10.1007/S00453-017-0309-1},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BansalF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonizzoniVPPR17,
author = {Paola Bonizzoni and
Gianluca Della Vedova and
Yuri Pirola and
Marco Previtali and
Raffaella Rizzi},
title = {An External-Memory Algorithm for String Graph Construction},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {394--424},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0165-4},
doi = {10.1007/S00453-016-0165-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BonizzoniVPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BorodinBLO17,
author = {Allan Borodin and
Mark Braverman and
Brendan Lucier and
Joel Oren},
title = {Strategyproof Mechanisms for Competitive Influence in Networks},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {425--452},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0169-0},
doi = {10.1007/S00453-016-0169-0},
timestamp = {Thu, 04 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BorodinBLO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChambersEFLSVSS17,
author = {Erin W. Chambers and
Alejandro Erickson and
S{\'{a}}ndor P. Fekete and
Jonathan Lenchner and
Jeff Sember and
S. Venkatesh and
Ulrike Stege and
Svetlana Stolpner and
Christophe Weibel and
Sue Whitesides},
title = {Connectivity Graphs of Uncertainty Regions},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {990--1019},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0191-2},
doi = {10.1007/S00453-016-0191-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChambersEFLSVSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanHMZ17,
author = {Timothy M. Chan and
Meng He and
J. Ian Munro and
Gelin Zhou},
title = {Succinct Indices for Path Minimum, with Applications},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {453--491},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0170-7},
doi = {10.1007/S00453-016-0170-7},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanHMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenZ17,
author = {Jiecao Chen and
Qin Zhang},
title = {Improved Algorithms for Distributed Entropy Monitoring},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {1041--1066},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0194-z},
doi = {10.1007/S00453-016-0194-Z},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChitnisEM17,
author = {Rajesh Chitnis and
L{\'{a}}szl{\'{o}} Egri and
D{\'{a}}niel Marx},
title = {List H-Coloring a Graph by Removing Few Vertices},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {110--146},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0139-6},
doi = {10.1007/S00453-016-0139-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChitnisEM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CorusHJOSZ17,
author = {Dogan Corus and
Jun He and
Thomas Jansen and
Pietro S. Oliveto and
Dirk Sudholt and
Christine Zarges},
title = {On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {714--740},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0201-4},
doi = {10.1007/S00453-016-0201-4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CorusHJOSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CouetouxNV17,
author = {Basile Cou{\"{e}}toux and
Elie Nakache and
Yann Vax{\`{e}}s},
title = {The Maximum Labeled Path Problem},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {298--318},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0155-6},
doi = {10.1007/S00453-016-0155-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CouetouxNV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DangJL17,
author = {Duc{-}Cuong Dang and
Thomas Jansen and
Per Kristian Lehre},
title = {Populations Can Be Essential in Tracking Dynamic Optima},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {660--680},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0187-y},
doi = {10.1007/S00453-016-0187-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DangJL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DingX17,
author = {Hu Ding and
Jinhui Xu},
title = {{FPTAS} for Minimizing the Earth Mover's Distance Under Rigid Transformations
and Related Problems},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {741--770},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0173-4},
doi = {10.1007/S00453-016-0173-4},
timestamp = {Mon, 17 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DingX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DinitzSV17,
author = {Michael Dinitz and
Michael Schapira and
Asaf Valadarsky},
title = {Explicit Expanding Expanders},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1225--1245},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0269-x},
doi = {10.1007/S00453-016-0269-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DinitzSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrC17,
author = {Carola Doerr and
Francisco Chicano},
title = {Preface to the Special Issue on Theory of Genetic and Evolutionary
Computation},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {558--560},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0280-x},
doi = {10.1007/S00453-017-0280-X},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrL17,
author = {Carola Doerr and
Johannes Lengler},
title = {OneMax in Black-Box Models with Several Restrictions},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {610--640},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0168-1},
doi = {10.1007/S00453-016-0168-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrNS17,
author = {Benjamin Doerr and
Frank Neumann and
Andrew M. Sutton},
title = {Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable
k-CNF Formulas},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {561--586},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0190-3},
doi = {10.1007/S00453-016-0190-3},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/El-ZeinLMRC17,
author = {Hicham El{-}Zein and
Moshe Lewenstein and
J. Ian Munro and
Venkatesh Raman and
Timothy M. Chan},
title = {On the Succinct Representation of Equivalence Classes},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {1020--1040},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0192-1},
doi = {10.1007/S00453-016-0192-1},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/El-ZeinLMRC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EvenM17,
author = {Guy Even and
Moti Medina},
title = {Online Packet-Routing in Grids with Bounded Buffers},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {819--868},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0177-0},
doi = {10.1007/S00453-016-0177-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EvenM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeT17,
author = {Uriel Feige and
Moshe Tennenholtz},
title = {Optimization with Uniform Size Queries},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {255--273},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0162-7},
doi = {10.1007/S00453-016-0162-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeigeT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FotakisKLS17,
author = {Dimitris Fotakis and
Alexis C. Kaporis and
Thanasis Lianeas and
Paul G. Spirakis},
title = {Resolving Braess's Paradox in Random Networks},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {788--818},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0175-2},
doi = {10.1007/S00453-016-0175-2},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FotakisKLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FoucaudMNPV17,
author = {Florent Foucaud and
George B. Mertzios and
Reza Naserasr and
Aline Parreau and
Petru Valicov},
title = {Identification, Location-Domination and Metric Dimension on Interval
and Permutation Graphs. {II.} Algorithms and Complexity},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {914--944},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0184-1},
doi = {10.1007/S00453-016-0184-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FoucaudMNPV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GalcikKS17,
author = {Frantisek Galc{\'{\i}}k and
J{\'{a}}n Katrenic and
Gabriel Semanisin},
title = {On Computing an Optimal Semi-matching},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {896--913},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0182-3},
doi = {10.1007/S00453-016-0182-3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GalcikKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GenovaW17,
author = {Kyle Genova and
David P. Williamson},
title = {An Experimental Evaluation of the Best-of-Many Christofides' Algorithm
for the Traveling Salesman Problem},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1109--1130},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0293-5},
doi = {10.1007/S00453-017-0293-5},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GenovaW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiessenW17,
author = {Christian Gie{\ss}en and
Carsten Witt},
title = {The Interplay of Population Size and Mutation Probability in the (1+{\(\lambda\)})
{EA} on OneMax},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {587--609},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0214-z},
doi = {10.1007/S00453-016-0214-Z},
timestamp = {Tue, 08 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GiessenW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Graf17,
author = {Daniel Graf},
title = {How to Sort by Walking and Swapping on Paths and Trees},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1151--1181},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0282-8},
doi = {10.1007/S00453-017-0282-8},
timestamp = {Fri, 03 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Graf17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GrosswendtR17,
author = {Anna Gro{\ss}wendt and
Heiko R{\"{o}}glin},
title = {Improved Analysis of Complete-Linkage Clustering},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1131--1150},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0284-6},
doi = {10.1007/S00453-017-0284-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GrosswendtR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Har-PeledR17,
author = {Sariel Har{-}Peled and
Subhro Roy},
title = {Approximating the Maximum Overlap of Polygons under Translation},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {147--165},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0152-9},
doi = {10.1007/S00453-016-0152-9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Har-PeledR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KariKMPS17,
author = {Lila Kari and
Steffen Kopecki and
Pierre{-}{\'{E}}tienne Meunier and
Matthew J. Patitz and
Shinnosuke Seki},
title = {Binary Pattern Tile Set Synthesis Is NP-Hard},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {1--46},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0154-7},
doi = {10.1007/S00453-016-0154-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KariKMPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KenkrePPS17,
author = {Sreyash Kenkre and
Vinayaka Pandit and
Manish Purohit and
Rishi Saket},
title = {On the Approximability of Digraph Ordering},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1182--1205},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0227-7},
doi = {10.1007/S00453-016-0227-7},
timestamp = {Mon, 17 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KenkrePPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlavikKOSV17,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh and
Tom{\'{a}}s Vyskocil},
title = {Extending Partial Representations of Interval Graphs},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {945--967},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0186-z},
doi = {10.1007/S00453-016-0186-Z},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KlavikKOSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LissovoiW17,
author = {Andrei Lissovoi and
Carsten Witt},
title = {A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic
Optimization},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {641--659},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0262-4},
doi = {10.1007/S00453-016-0262-4},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LissovoiW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MarasevicSZ17,
author = {Jelena Marasevic and
Clifford Stein and
Gil Zussman},
title = {Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks:
Algorithmic Analysis},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {521--557},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0171-6},
doi = {10.1007/S00453-016-0171-6},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MarasevicSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/McCormickPVW17,
author = {S. Thomas McCormick and
Britta Peis and
Jos{\'{e}} Verschae and
Andreas Wierz},
title = {Primal-Dual Algorithms for Precedence Constrained Covering Problems},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {771--787},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0174-3},
doi = {10.1007/S00453-016-0174-3},
timestamp = {Mon, 17 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/McCormickPVW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MouawadN0SS17,
author = {Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman and
Narges Simjour and
Akira Suzuki},
title = {On the Parameterized Complexity of Reconfiguration Problems},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {274--297},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0159-2},
doi = {10.1007/S00453-016-0159-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MouawadN0SS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MunroNNST17,
author = {J. Ian Munro and
Gonzalo Navarro and
Jesper Sindahl Nielsen and
Rahul Shah and
Sharma V. Thankachan},
title = {Top-k Term-Proximity in Succinct Space},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {379--393},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0167-2},
doi = {10.1007/S00453-016-0167-2},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MunroNNST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PaghPSS17,
author = {Rasmus Pagh and
Ninh Pham and
Francesco Silvestri and
Morten St{\"{o}}ckel},
title = {I/O-Efficient Similarity Join},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1263--1283},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0285-5},
doi = {10.1007/S00453-017-0285-5},
timestamp = {Fri, 12 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PaghPSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PaixaoHST17,
author = {Tiago Paix{\~{a}}o and
Jorge P{\'{e}}rez Heredia and
Dirk Sudholt and
Barbora Trubenov{\'{a}}},
title = {Towards a Runtime Comparison of Natural and Artificial Evolution},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {681--713},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0212-1},
doi = {10.1007/S00453-016-0212-1},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PaixaoHST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PanagiotouS17,
author = {Konstantinos Panagiotou and
Leo Speidel},
title = {Asynchronous Rumor Spreading on Random Graphs},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {968--989},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0188-x},
doi = {10.1007/S00453-016-0188-X},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PanagiotouS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Scheifele17,
author = {Rudolf Scheifele},
title = {Steiner Trees with Bounded RC-Delay},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {86--109},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0149-4},
doi = {10.1007/S00453-016-0149-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Scheifele17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SubramaniW17,
author = {K. Subramani and
Piotr Wojciechowski},
title = {A Combinatorial Certifying Algorithm for Linear Feasibility in {UTVPI}
Constraints},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {166--208},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0131-1},
doi = {10.1007/S00453-016-0131-1},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/SubramaniW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Verdiere17,
author = {{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of
Terminals},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1206--1224},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0258-0},
doi = {10.1007/S00453-016-0258-0},
timestamp = {Mon, 17 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Verdiere17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WangZ17,
author = {Haitao Wang and
Jingru Zhang},
title = {Computing the Center of Uncertain Points on Tree Networks},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {232--254},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0158-3},
doi = {10.1007/S00453-016-0158-3},
timestamp = {Thu, 29 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WangZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Zehavi17,
author = {Meirav Zehavi},
title = {Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree
Graphs},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {319--341},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0166-3},
doi = {10.1007/S00453-016-0166-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Zehavi17.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-26 10:02 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:
