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/algorithmica40.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AngelopoulosB04,
author = {Spyros Angelopoulos and
Allan Borodin},
title = {The Power of Priority Algorithms for Facility Location and Set Cover},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {271--291},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1113-2},
doi = {10.1007/S00453-004-1113-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AngelopoulosB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AroraC04,
author = {Sanjeev Arora and
Kevin L. Chang},
title = {Approximation Schemes for Degree-Restricted {MST} and Red-Blue Separation
Problems},
journal = {Algorithmica},
volume = {40},
number = {3},
pages = {189--210},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1103-4},
doi = {10.1007/S00453-004-1103-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AroraC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanBM04,
author = {Yih{-}En Andrew Ban and
Sergey Bereg and
Nabil H. Mustafa},
title = {A Conjecture on Wiener Indices in Combinatorial Chemistry},
journal = {Algorithmica},
volume = {40},
number = {2},
pages = {99--117},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1097-y},
doi = {10.1007/S00453-004-1097-Y},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BanBM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BansalDKS04,
author = {Nikhil Bansal and
Kedar Dhamdhere and
Jochen K{\"{o}}nemann and
Amitabh Sinha},
title = {Non-Clairvoyant Scheduling for Minimizing Mean Slowdown},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {305--318},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1115-0},
doi = {10.1007/S00453-004-1115-0},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BansalDKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergerGV04,
author = {Franziska Berger and
Peter Gritzmann and
Sven de Vries},
title = {Minimum Cycle Bases for Network Graphs},
journal = {Algorithmica},
volume = {40},
number = {1},
pages = {51--62},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1098-x},
doi = {10.1007/S00453-004-1098-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BergerGV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenFJK04,
author = {Jianer Chen and
Donald K. Friesen and
Weijia Jia and
Iyad A. Kanj},
title = {Using Nondeterminism to Design Efficient Deterministic Algorithms},
journal = {Algorithmica},
volume = {40},
number = {2},
pages = {83--97},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1096-z},
doi = {10.1007/S00453-004-1096-Z},
timestamp = {Mon, 23 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenFJK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DamianP04,
author = {Mirela Damian and
Sriram V. Pemmaraju},
title = {Computing Optimal Diameter-Bounded Polygon Partitions},
journal = {Algorithmica},
volume = {40},
number = {1},
pages = {1--14},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1092-3},
doi = {10.1007/S00453-004-1092-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DamianP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DemaineH04,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi},
title = {Diameter and Treewidth in Minor-Closed Graph Families, Revisited},
journal = {Algorithmica},
volume = {40},
number = {3},
pages = {211--215},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1106-1},
doi = {10.1007/S00453-004-1106-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DemaineH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DujmovicW04,
author = {Vida Dujmovic and
Sue Whitesides},
title = {An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing
Minimization},
journal = {Algorithmica},
volume = {40},
number = {1},
pages = {15--31},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1093-2},
doi = {10.1007/S00453-004-1093-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DujmovicW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EfratIV04,
author = {Alon Efrat and
Piotr Indyk and
Suresh Venkatasubramanian},
title = {Pattern Matching for Sets of Segments},
journal = {Algorithmica},
volume = {40},
number = {3},
pages = {147--160},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1089-y},
doi = {10.1007/S00453-004-1089-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EfratIV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeLT04,
author = {Uriel Feige and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Prasad Tetali},
title = {Approximating Min Sum Set Cover},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {219--234},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1110-5},
doi = {10.1007/S00453-004-1110-5},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeigeLT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KohayakawaMRW04,
author = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa and
Prabhakar Raghavan and
Yoshiko Wakabayashi},
title = {Multidimensional Cube Packing},
journal = {Algorithmica},
volume = {40},
number = {3},
pages = {173--187},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1102-5},
doi = {10.1007/S00453-004-1102-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KohayakawaMRW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Leonardi04,
author = {Stefano Leonardi},
title = {Preface},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {217},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1109-y},
doi = {10.1007/S00453-004-1109-Y},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Leonardi04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Lewin-EytanNO04,
author = {Liane Lewin{-}Eytan and
Joseph Naor and
Ariel Orda},
title = {Admission Control in Networks with Advance Reservations},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {293--304},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1114-1},
doi = {10.1007/S00453-004-1114-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Lewin-EytanNO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LipmannLPSS04,
author = {Maarten Lipmann and
Xiwen Lu and
Willem de Paepe and
Ren{\'{e}} Sitters and
Leen Stougie},
title = {On-Line Dial-a-Ride Problems Under a Restricted Information Model},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {319--329},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1116-z},
doi = {10.1007/S00453-004-1116-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LipmannLPSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MalafiejskiGJK04,
author = {Michal Malafiejski and
Krzysztof Giaro and
Robert Janczewski and
Marek Kubale},
title = {Sum Coloring of Bipartite Graphs with Bounded Degree},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {235--244},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1111-4},
doi = {10.1007/S00453-004-1111-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MalafiejskiGJK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ManziniF04,
author = {Giovanni Manzini and
Paolo Ferragina},
title = {Engineering a Lightweight Suffix Array Construction Algorithm},
journal = {Algorithmica},
volume = {40},
number = {1},
pages = {33--50},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1094-1},
doi = {10.1007/S00453-004-1094-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ManziniF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NardelliPW04,
author = {Enrico Nardelli and
Guido Proietti and
Peter Widmayer},
title = {Nearly Linear Time Minimum Spanning Tree Maintenance for Transient
Node Failures},
journal = {Algorithmica},
volume = {40},
number = {2},
pages = {119--132},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1099-9},
doi = {10.1007/S00453-004-1099-9},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NardelliPW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Papadopoulou04,
author = {Evanthia Papadopoulou},
title = {The Hausdorff Voronoi Diagram of Point Clusters in the Plane},
journal = {Algorithmica},
volume = {40},
number = {2},
pages = {63--82},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1095-0},
doi = {10.1007/S00453-004-1095-0},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Papadopoulou04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Peczarski04,
author = {Marcin Peczarski},
title = {New Results in Minimum-Comparison Sorting},
journal = {Algorithmica},
volume = {40},
number = {2},
pages = {133--145},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1100-7},
doi = {10.1007/S00453-004-1100-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Peczarski04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/QianW04,
author = {Jianbo Qian and
Cao An Wang},
title = {A Linear-Time Approximation Scheme for Maximum Weight Triangulation
of Convex Polygons},
journal = {Algorithmica},
volume = {40},
number = {3},
pages = {161--172},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1101-6},
doi = {10.1007/S00453-004-1101-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/QianW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SwamyK04,
author = {Chaitanya Swamy and
Amit Kumar},
title = {Primal-Dual Algorithms for Connected Facility Location Problems},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {245--269},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1112-3},
doi = {10.1007/S00453-004-1112-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SwamyK04.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-10 14:04 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:
