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/algorithmica36.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AdlerKR03,
author = {Micah Adler and
Sanjeev Khanna and
Rajmohan Rajaraman and
Adi Ros{\'{e}}n},
title = {Time-Constrained Scheduling of Weighted Packets on Trees and Meshes},
journal = {Algorithmica},
volume = {36},
number = {2},
pages = {123--152},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1019-9},
doi = {10.1007/S00453-002-1019-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AdlerKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArmonAE03,
author = {Amitai Armon and
Yossi Azar and
Leah Epstein},
title = {Temporary Tasks Assignment Resolved},
journal = {Algorithmica},
volume = {36},
number = {3},
pages = {295--314},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1017-6},
doi = {10.1007/S00453-003-1017-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ArmonAE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bar-NoyFL03,
author = {Amotz Bar{-}Noy and
Ari Freund and
Shimon Landa and
Joseph Naor},
title = {Competitive On-Line Switching Policies},
journal = {Algorithmica},
volume = {36},
number = {3},
pages = {225--247},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1014-9},
doi = {10.1007/S00453-003-1014-9},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Bar-NoyFL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BastMS03,
author = {Hannah Bast and
Kurt Mehlhorn and
Guido Sch{\"{a}}fer},
title = {A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use
in Weighted Matching Algorithms},
journal = {Algorithmica},
volume = {36},
number = {1},
pages = {75--88},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1008-z},
doi = {10.1007/S00453-002-1008-Z},
timestamp = {Mon, 14 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BastMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BazziM03,
author = {Louay Bazzi and
Sanjoy K. Mitter},
title = {The Solution of Linear Probabilistic Recurrence Relations},
journal = {Algorithmica},
volume = {36},
number = {1},
pages = {41--57},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1003-4},
doi = {10.1007/S00453-002-1003-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BazziM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlumCK03,
author = {Avrim Blum and
Shuchi Chawla and
Adam Kalai},
title = {Static Optimality and Dynamic Search-Optimality in Lists and Trees},
journal = {Algorithmica},
volume = {36},
number = {3},
pages = {249--260},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1015-8},
doi = {10.1007/S00453-003-1015-8},
timestamp = {Sun, 17 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BlumCK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderR03,
author = {Hans L. Bodlaender and
Udi Rotics},
title = {Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition},
journal = {Algorithmica},
volume = {36},
number = {4},
pages = {375--408},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1026-5},
doi = {10.1007/S00453-003-1026-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CalinescuFKZ03,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Howard J. Karloff and
Alexander Zelikovsky},
title = {A New Approximation Algorithm for Finding Heavy Planar Subgraphs},
journal = {Algorithmica},
volume = {36},
number = {2},
pages = {179--205},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1020-3},
doi = {10.1007/S00453-002-1020-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CalinescuFKZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanCT03,
author = {Wun{-}Tat Chan and
Francis Y. L. Chin and
Hing{-}Fung Ting},
title = {Escaping a Grid by Edge-Disjoint Paths},
journal = {Algorithmica},
volume = {36},
number = {4},
pages = {343--359},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1023-8},
doi = {10.1007/S00453-003-1023-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanCT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DehneDH03,
author = {Frank K. H. A. Dehne and
Wolfgang Dittrich and
David A. Hutchinson},
title = {Efficient External Memory Algorithms by Simulating Coarse-Grained
Parallel Algorithms},
journal = {Algorithmica},
volume = {36},
number = {2},
pages = {97--122},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1009-y},
doi = {10.1007/S00453-002-1009-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DehneDH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EdmondsP03,
author = {Jeff Edmonds and
Kirk Pruhs},
title = {Multicast Pull Scheduling: When Fairness Is Fine},
journal = {Algorithmica},
volume = {36},
number = {3},
pages = {315--330},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1018-5},
doi = {10.1007/S00453-003-1018-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EdmondsP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FerraroG03,
author = {Pascal Ferraro and
Christophe Godin},
title = {An Edit Distance between Quotiented Trees},
journal = {Algorithmica},
volume = {36},
number = {1},
pages = {1--39},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1002-5},
doi = {10.1007/S00453-002-1002-5},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FerraroG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GalluccioP03,
author = {Anna Galluccio and
Guido Proietti},
title = {Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems},
journal = {Algorithmica},
volume = {36},
number = {4},
pages = {361--374},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1024-7},
doi = {10.1007/S00453-003-1024-7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GalluccioP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HongE03,
author = {Seok{-}Hee Hong and
Peter Eades},
title = {Drawing Trees Symmetrically in Three Dimensions},
journal = {Algorithmica},
volume = {36},
number = {2},
pages = {153--178},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1011-4},
doi = {10.1007/S00453-002-1011-4},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HongE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Iwata03,
author = {Satoru Iwata},
title = {Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial
Relaxation},
journal = {Algorithmica},
volume = {36},
number = {4},
pages = {331--341},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1022-9},
doi = {10.1007/S00453-003-1022-9},
timestamp = {Wed, 16 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Iwata03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarlinKR03,
author = {Anna R. Karlin and
Claire Kenyon and
Dana Randall},
title = {Dynamic {TCP} Acknowledgment and Other Stories about e/(e-1)},
journal = {Algorithmica},
volume = {36},
number = {3},
pages = {209--224},
year = {2003},
timestamp = {Thu, 28 Nov 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KarlinKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KatzNS03,
author = {Matthew J. Katz and
Frank Nielsen and
Michael Segal},
title = {Maintenance of a Piercing Set for Intervals with Applications},
journal = {Algorithmica},
volume = {36},
number = {1},
pages = {59--73},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1006-1},
doi = {10.1007/S00453-002-1006-1},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KatzNS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SeidenS03,
author = {Steven S. Seiden and
Rob van Stee},
title = {New Bounds for Multidimensional Packing},
journal = {Algorithmica},
volume = {36},
number = {3},
pages = {261--293},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1016-7},
doi = {10.1007/S00453-003-1016-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SeidenS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Sun03,
author = {Xiaoming Sun},
title = {A 3-Party Simultaneous Protocol for {SUM-INDEX}},
journal = {Algorithmica},
volume = {36},
number = {1},
pages = {89--111},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1007-0},
doi = {10.1007/S00453-002-1007-0},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Sun03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Xu03,
author = {Ying Xu},
title = {An O(n\({}^{\mbox{1.5}}\)) Deterministic Gossiping Algorithm for Radio
Networks},
journal = {Algorithmica},
volume = {36},
number = {1},
pages = {93--96},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1010-5},
doi = {10.1007/S00453-002-1010-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Xu03.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-24 17:09 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:
