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/algorithmica66.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/BaswanaK13,
author = {Surender Baswana and
Neelesh Khanna},
title = {Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal
Data Structures for Undirected Unweighted Graphs},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {18--50},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9621-y},
doi = {10.1007/S00453-012-9621-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlaserMR13,
author = {Markus Bl{\"{a}}ser and
Bodo Manthey and
B. V. Raghavendra Rao},
title = {Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {397--418},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9643-5},
doi = {10.1007/S00453-012-9643-5},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BlaserMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuchinBKLSWW13,
author = {Kevin Buchin and
Maike Buchin and
Marc J. van Kreveld and
Maarten L{\"{o}}ffler and
Rodrigo I. Silveira and
Carola Wenk and
Lionov Wiratma},
title = {Median Trajectories},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {595--614},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9654-2},
doi = {10.1007/S00453-012-9654-2},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BuchinBKLSWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Caragiannis13,
author = {Ioannis Caragiannis},
title = {Efficient Coordination Mechanisms for Unrelated Machine Scheduling},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {512--540},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9650-6},
doi = {10.1007/S00453-012-9650-6},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Caragiannis13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChandranGR13,
author = {Harish Chandran and
Nikhil Gopalkrishnan and
John H. Reif},
title = {Tile Complexity of Approximate Squares},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {1--17},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9620-z},
doi = {10.1007/S00453-012-9620-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChandranGR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChangYQ13,
author = {Lijun Chang and
Jeffrey Xu Yu and
Lu Qin},
title = {Fast Maximal Cliques Enumeration in Sparse Graphs},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {173--186},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9632-8},
doi = {10.1007/S00453-012-9632-8},
timestamp = {Tue, 04 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChangYQ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenW13,
author = {Danny Z. Chen and
Haitao Wang},
title = {Approximating Points by a Piecewise Linear Function},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {682--713},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9658-y},
doi = {10.1007/S00453-012-9658-Y},
timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CiceroneDSFM13,
author = {Serafino Cicerone and
Gianlorenzo D'Angelo and
Gabriele Di Stefano and
Daniele Frigioni and
Vinicio Maurizio},
title = {Engineering a New Algorithm for Distributed Shortest Paths on Dynamic
Networks},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {51--86},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9623-9},
doi = {10.1007/S00453-012-9623-9},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CiceroneDSFM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DotyKM13,
author = {David Doty and
Lila Kari and
Beno{\^{\i}}t Masson},
title = {Negative Interactions in Irreversible Self-assembly},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {153--172},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9631-9},
doi = {10.1007/S00453-012-9631-9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DotyKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DraganX13,
author = {Feodor F. Dragan and
Yang Xiang},
title = {How to Use Spanning Trees to Navigate in Graphs},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {479--511},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9647-1},
doi = {10.1007/S00453-012-9647-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DraganX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DrmotaP13,
author = {Michael Drmota and
Konstantinos Panagiotou},
title = {A Central Limit Theorem for the Number of Degree-k Vertices in Random
Maps},
journal = {Algorithmica},
volume = {66},
number = {4},
pages = {741--761},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9751-x},
doi = {10.1007/S00453-013-9751-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DrmotaP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DumitrescuJ13,
author = {Adrian Dumitrescu and
Minghui Jiang},
title = {On the Largest Empty Axis-Parallel Box Amidst \emph{n} Points},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {225--248},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9635-5},
doi = {10.1007/S00453-012-9635-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DumitrescuJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EhmsenKL13,
author = {Martin R. Ehmsen and
Jens S. Kohrt and
Kim S. Larsen},
title = {List Factoring and Relative Worst Order Analysis},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {287--309},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9637-3},
doi = {10.1007/S00453-012-9637-3},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EhmsenKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeIMN13,
author = {Uriel Feige and
Nicole Immorlica and
Vahab S. Mirrokni and
Hamid Nazerzadeh},
title = {{PASS} Approximation: {A} Framework for Analyzing and Designing Heuristics},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {450--478},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9646-2},
doi = {10.1007/S00453-012-9646-2},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FeigeIMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuoS13,
author = {Longkun Guo and
Hong Shen},
title = {On Finding Min-Min Disjoint Paths},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {641--653},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9656-0},
doi = {10.1007/S00453-012-9656-0},
timestamp = {Wed, 20 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuoS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HasunumaIOU13,
author = {Toru Hasunuma and
Toshimasa Ishii and
Hirotaka Ono and
Yushi Uno},
title = {A Linear Time Algorithm for L(2, 1)-Labeling of Trees},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {654--681},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9657-z},
doi = {10.1007/S00453-012-9657-Z},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HasunumaIOU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HelmiP13,
author = {Ahmed Helmi and
Alois Panholzer},
title = {Analysis of the "Hiring Above the Median" Selection Strategy for the
Hiring Problem},
journal = {Algorithmica},
volume = {66},
number = {4},
pages = {762--803},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9727-2},
doi = {10.1007/S00453-012-9727-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HelmiP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangS13,
author = {Chien{-}Chung Huang and
Zoya Svitkina},
title = {Donation Center Location Problem},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {187--210},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9633-7},
doi = {10.1007/S00453-012-9633-7},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuberM13,
author = {Katharina T. Huber and
Vincent Moulton},
title = {Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {714--738},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9659-x},
doi = {10.1007/S00453-012-9659-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuberM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HwangMS13,
author = {Hsien{-}Kuei Hwang and
Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Guest Editorial},
journal = {Algorithmica},
volume = {66},
number = {4},
pages = {739--740},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9786-z},
doi = {10.1007/S00453-013-9786-Z},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HwangMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IwataT13,
author = {Satoru Iwata and
Mizuyo Takamatsu},
title = {Computing the Maximum Degree of Minors in Mixed Polynomial Matrices
via Combinatorial Relaxation},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {346--368},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9640-8},
doi = {10.1007/S00453-012-9640-8},
timestamp = {Wed, 16 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/IwataT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JanssonS13,
author = {Jesper Jansson and
Wing{-}Kin Sung},
title = {Constructing the R* Consensus Tree of Two Trees in Subcubic Time},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {329--345},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9639-1},
doi = {10.1007/S00453-012-9639-1},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JanssonS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Jiang13,
author = {Minghui Jiang},
title = {Recognizing d-Interval Graphs and d-Track Interval Graphs},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {541--563},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9651-5},
doi = {10.1007/S00453-012-9651-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Jiang13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaporisMSTTZ13,
author = {Alexis C. Kaporis and
Christos Makris and
Spyros Sioutas and
Athanasios K. Tsakalidis and
Kostas Tsichlas and
Christos D. Zaroliagis},
title = {Improved Bounds for Finger Search on a {RAM}},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {249--286},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9636-4},
doi = {10.1007/S00453-012-9636-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KaporisMSTTZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KoufogiannakisY13,
author = {Christos Koufogiannakis and
Neal E. Young},
title = {Greedy \emph{{\(\Delta\)}}-Approximation Algorithm for Covering with
Arbitrary Constraints and Submodular Cost},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {113--152},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9629-3},
doi = {10.1007/S00453-012-9629-3},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KoufogiannakisY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KoutsoupiasV13,
author = {Elias Koutsoupias and
Angelina Vidali},
title = {A Lower Bound of 1+\emph{{\(\varphi\)}} for Truthful Scheduling Mechanisms},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {211--223},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9634-6},
doi = {10.1007/S00453-012-9634-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KoutsoupiasV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KrohnN13,
author = {Erik Krohn and
Bengt J. Nilsson},
title = {Approximate Guarding of Monotone and Rectilinear Polygons},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {564--594},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9653-3},
doi = {10.1007/S00453-012-9653-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KrohnN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LazarT13,
author = {Avivit Lazar and
Arie Tamir},
title = {Improved Algorithms for Some Competitive Location Centroid Problems
on Paths, Trees and Graphs},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {615--640},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9655-1},
doi = {10.1007/S00453-012-9655-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LazarT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LinCC13,
author = {Ching{-}Chi Lin and
Gen{-}Huey Chen and
Gerard J. Chang},
title = {A Linear-Time Algorithm for Finding Locally Connected Spanning Trees
on Circular-Arc Graphs},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {369--396},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9641-7},
doi = {10.1007/S00453-012-9641-7},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LinCC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MihaescuHR13,
author = {Radu Mihaescu and
Cameron Hill and
Satish Rao},
title = {Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {419--449},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9644-4},
doi = {10.1007/S00453-012-9644-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MihaescuHR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Pestov13,
author = {Vladimir Pestov},
title = {Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact
Similarity Search in High Dimensions},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {310--328},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9638-2},
doi = {10.1007/S00453-012-9638-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Pestov13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Stout13,
author = {Quentin F. Stout},
title = {Isotonic Regression via Partitioning},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {93--112},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9628-4},
doi = {10.1007/S00453-012-9628-4},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Stout13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/TaubigWKHM13,
author = {Hanjo T{\"{a}}ubig and
Jeremias Weihmann and
Sven Kosub and
Raymond Hemmecke and
Ernst W. Mayr},
title = {Inequalities for the Number of Walks in Graphs},
journal = {Algorithmica},
volume = {66},
number = {4},
pages = {804--828},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9766-3},
doi = {10.1007/S00453-013-9766-3},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/TaubigWKHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Wagner13,
author = {Stephan G. Wagner},
title = {Asymptotic Enumeration of Extensional Acyclic Digraphs},
journal = {Algorithmica},
volume = {66},
number = {4},
pages = {829--847},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9725-4},
doi = {10.1007/S00453-012-9725-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Wagner13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Watanabe13,
author = {Osamu Watanabe},
title = {Message Passing Algorithms for {MLS-3LIN} Problem},
journal = {Algorithmica},
volume = {66},
number = {4},
pages = {848--868},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9762-7},
doi = {10.1007/S00453-013-9762-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Watanabe13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Yuster13,
author = {Raphael Yuster},
title = {Maximum Matching in Regular and Almost Regular Graphs},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {87--92},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9625-7},
doi = {10.1007/S00453-012-9625-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Yuster13.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-04-19 03:53 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:
