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/algorithmica68.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AlbersMS14,
author = {Susanne Albers and
Fabian M{\"{u}}ller and
Swen Schmelzer},
title = {Speed Scaling on Parallel Processors},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {404--425},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9678-7},
doi = {10.1007/S00453-012-9678-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BansalBGN14,
author = {Nikhil Bansal and
Niv Buchbinder and
Anupam Gupta and
Joseph Naor},
title = {A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite
Matching},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {390--403},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9676-9},
doi = {10.1007/S00453-012-9676-9},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BansalBGN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BartschiS14,
author = {Andreas B{\"{a}}rtschi and
Subhash Suri},
title = {Conflict-Free Chromatic Art Gallery Coverage},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {265--283},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9732-5},
doi = {10.1007/S00453-012-9732-5},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BartschiS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BartschiS14a,
author = {Andreas B{\"{a}}rtschi and
Subhash Suri},
title = {Erratum to: Conflict-Free Chromatic Art Gallery Coverage},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {284--285},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9852-6},
doi = {10.1007/S00453-013-9852-6},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BartschiS14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BetzlerBBNU14,
author = {Nadja Betzler and
Hans L. Bodlaender and
Robert Bredereck and
Rolf Niedermeier and
Johannes Uhlmann},
title = {On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {715--738},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9695-6},
doi = {10.1007/S00453-012-9695-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BetzlerBBNU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bienkowski14,
author = {Marcin Bienkowski},
title = {An Optimal Lower Bound for Buffer Management in Multi-Queue Switches},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {426--447},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9677-8},
doi = {10.1007/S00453-012-9677-8},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Bienkowski14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloGP14,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Finding Best Swap Edges Minimizing the Routing Cost of a Spanning
Tree},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {337--357},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9674-y},
doi = {10.1007/S00453-012-9674-Y},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloGP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlasiusKRW14,
author = {Thomas Bl{\"{a}}sius and
Marcus Krug and
Ignaz Rutter and
Dorothea Wagner},
title = {Orthogonal Graph Drawing with Flexibility Constraints},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {859--885},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9705-8},
doi = {10.1007/S00453-012-9705-8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BlasiusKRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BorradaileDT14,
author = {Glencora Borradaile and
Erik D. Demaine and
Siamak Tazari},
title = {Polynomial-Time Approximation Schemes for Subset-Connectivity Problems
in Bounded-Genus Graphs},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {287--311},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9662-2},
doi = {10.1007/S00453-012-9662-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BorradaileDT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandstadtM14,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Dominating Induced Matchings for {P} 7-Free Graphs in Linear Time},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {998--1018},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9709-4},
doi = {10.1007/S00453-012-9709-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandstadtM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenR14,
author = {Sixia Chen and
Alexander Russell},
title = {Online Metric Tracking and Smoothing},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {133--151},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9669-8},
doi = {10.1007/S00453-012-9669-8},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChinCY14,
author = {Francis Y. L. Chin and
Marek Chrobak and
Li Yan},
title = {Algorithms for Placing Monitors in a Flow Network},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {1--15},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9665-z},
doi = {10.1007/S00453-012-9665-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChinCY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CicaleseJLM14,
author = {Ferdinando Cicalese and
Tobias Jacobs and
Eduardo Sany Laber and
Marco Molinaro},
title = {Improved Approximation Algorithms for the Average-Case Tree Searching
Problem},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {1045--1074},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9715-6},
doi = {10.1007/S00453-012-9715-6},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CicaleseJLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CrowstonGJRSY14,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones and
Venkatesh Raman and
Saket Saurabh and
Anders Yeo},
title = {Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {739--757},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9697-4},
doi = {10.1007/S00453-012-9697-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CrowstonGJRSY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganLPPS14,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {On Cutwidth Parameterized by Vertex Cover},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {940--953},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9707-6},
doi = {10.1007/S00453-012-9707-6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganLPPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganMPPS14,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Ildik{\'{o}} Schlotter},
title = {Parameterized Complexity of Eulerian Deletion Problems},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {41--61},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9667-x},
doi = {10.1007/S00453-012-9667-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganMPPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganPPW14,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Scheduling Partially Ordered Jobs Faster than 2 n},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {692--714},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9694-7},
doi = {10.1007/S00453-012-9694-7},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganPPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DemaineLW14,
author = {Erik D. Demaine and
Gad M. Landau and
Oren Weimann},
title = {On Cartesian Trees and Range Minimum Queries},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {610--625},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9683-x},
doi = {10.1007/S00453-012-9683-X},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DemaineLW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrW14,
author = {Benjamin Doerr and
Carola Winzen},
title = {Ranking-Based Black-Box Complexity},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {571--609},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9684-9},
doi = {10.1007/S00453-012-9684-9},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EbenlendrKS14,
author = {Tom{\'{a}}s Ebenlendr and
Marek Krc{\'{a}}l and
Jir{\'{\i}} Sgall},
title = {Graph Balancing: {A} Special Case of Scheduling Unrelated Parallel
Machines},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {62--80},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9668-9},
doi = {10.1007/S00453-012-9668-9},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EbenlendrKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EnglertRV14,
author = {Matthias Englert and
Heiko R{\"{o}}glin and
Berthold V{\"{o}}cking},
title = {Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the
{TSP}},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {190--264},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9801-4},
doi = {10.1007/S00453-013-9801-4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EnglertRV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FarzanM14,
author = {Arash Farzan and
J. Ian Munro},
title = {A Uniform Paradigm to Succinctly Encode Various Families of Trees},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {16--40},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9664-0},
doi = {10.1007/S00453-012-9664-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FarzanM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeketeKS14,
author = {S{\'{a}}ndor P. Fekete and
Tom Kamphans and
Nils Schweer},
title = {Online Square Packing with Gravity},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {1019--1044},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9713-8},
doi = {10.1007/S00453-012-9713-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeketeKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FlamminiMMSZ14,
author = {Michele Flammini and
Gianpiero Monaco and
Luca Moscardelli and
Mordechai Shalom and
Shmuel Zaks},
title = {On the Complexity of the Regenerator Cost Problem in General Networks
with Traffic Grooming},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {671--691},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9693-8},
doi = {10.1007/S00453-012-9693-8},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FlamminiMMSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FoschiniHS14,
author = {Luca Foschini and
John Hershberger and
Subhash Suri},
title = {On the Complexity of Time-Dependent Shortest Paths},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {1075--1097},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9714-7},
doi = {10.1007/S00453-012-9714-7},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FoschiniHS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Furer14,
author = {Martin F{\"{u}}rer},
title = {Efficient Computation of the Characteristic Polynomial of a Tree and
Related Tasks},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {626--642},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9688-5},
doi = {10.1007/S00453-012-9688-5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Furer14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GehweilerLS14,
author = {Joachim Gehweiler and
Christiane Lammersen and
Christian Sohler},
title = {A Distributed O(1)-Approximation Algorithm for the Uniform Facility
Location Problem},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {643--670},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9690-y},
doi = {10.1007/S00453-012-9690-Y},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GehweilerLS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiacomoDEL14,
author = {Emilio Di Giacomo and
Walter Didimo and
Peter Eades and
Giuseppe Liotta},
title = {2-Layer Right Angle Crossing Drawings},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {954--997},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9706-7},
doi = {10.1007/S00453-012-9706-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GiacomoDEL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Goodrich14,
author = {Michael T. Goodrich},
title = {Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin
Random Comparisons},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {835--858},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9696-5},
doi = {10.1007/S00453-012-9696-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Goodrich14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HarrisSB14,
author = {David G. Harris and
Francis Sullivan and
Isabel Beichl},
title = {Fast Sequential Importance Sampling to Estimate the Graph Reliability
Polynomial},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {916--939},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9703-x},
doi = {10.1007/S00453-012-9703-X},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HarrisSB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HeZ14,
author = {Xin He and
Huaming Zhang},
title = {On Succinct Greedy Drawings of Plane Triangulations and 3-Connected
Plane Graphs},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {531--544},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9682-y},
doi = {10.1007/S00453-012-9682-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HeZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HeggernesHLLP14,
author = {Pinar Heggernes and
Pim van 't Hof and
Benjamin L{\'{e}}v{\^{e}}que and
Daniel Lokshtanov and
Christophe Paul},
title = {Contracting Graphs to Paths and Trees},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {109--132},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9670-2},
doi = {10.1007/S00453-012-9670-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HeggernesHLLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IshaqueT14,
author = {Mashhood Ishaque and
Csaba D. T{\'{o}}th},
title = {Relative Convex Hulls in Semi-Dynamic Arrangements},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {448--482},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9679-6},
doi = {10.1007/S00453-012-9679-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/IshaqueT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IwamaMY14,
author = {Kazuo Iwama and
Shuichi Miyazaki and
Hiroki Yanagisawa},
title = {A 25/17-Approximation Algorithm for the Stable Marriage Problem with
One-Sided Ties},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {758--775},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9699-2},
doi = {10.1007/S00453-012-9699-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/IwamaMY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JohannsenKL14,
author = {Daniel Johannsen and
Piyush P. Kurur and
Johannes Lengler},
title = {Evolutionary Algorithms for Quantum Computers},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {152--189},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9784-1},
doi = {10.1007/S00453-013-9784-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JohannsenKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KammerT14,
author = {Frank Kammer and
Torsten Tholey},
title = {Approximation Algorithms for Intersection Graphs},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {312--336},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9671-1},
doi = {10.1007/S00453-012-9671-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KammerT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarakostasM14,
author = {George Karakostas and
Euripides Markou},
title = {Emergency Connectivity in Ad-hoc Networks with Selfish Nodes},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {358--389},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9675-x},
doi = {10.1007/S00453-012-9675-X},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KarakostasM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KelkS14,
author = {Steven Kelk and
C{\'{e}}line Scornavacca},
title = {Constructing Minimal Phylogenetic Networks from Softwired Clusters
is Fixed Parameter Tractable},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {886--915},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9708-5},
doi = {10.1007/S00453-012-9708-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KelkS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KomusiewiczU14,
author = {Christian Komusiewicz and
Johannes Uhlmann},
title = {A Cubic-Vertex Kernel for Flip Consensus Tree},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {81--108},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9663-1},
doi = {10.1007/S00453-012-9663-1},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KomusiewiczU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KonemannPP14,
author = {Jochen K{\"{o}}nemann and
Ojas Parekh and
David Pritchard},
title = {Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {776--804},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9701-z},
doi = {10.1007/S00453-012-9701-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KonemannPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/McDermidI14,
author = {Eric McDermid and
Robert W. Irving},
title = {Sex-Equal Stable Matchings: Complexity and Exact Algorithms},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {545--570},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9672-0},
doi = {10.1007/S00453-012-9672-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/McDermidI14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/McGraeZ14,
author = {Andrew R. A. McGrae and
Michele Zito},
title = {The Complexity of the Empire Colouring Problem},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {483--503},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9680-0},
doi = {10.1007/S00453-012-9680-0},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/McGraeZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MisraPRS14,
author = {Neeldhara Misra and
Geevarghese Philip and
Venkatesh Raman and
Saket Saurabh},
title = {The Kernelization Complexity of Connected Domination in Graphs with
(no) Small Cycles},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {504--530},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9681-z},
doi = {10.1007/S00453-012-9681-Z},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MisraPRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Xu0P14,
author = {Jinhui Xu and
Lei Xu and
Evanthia Papadopoulou},
title = {Computing the Map of Geometric Minimal Cuts},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {805--834},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9704-9},
doi = {10.1007/S00453-012-9704-9},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Xu0P14.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-06-04 11:24 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:
