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/algorithmica11.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AgarwalS94,
author = {Pankaj K. Agarwal and
Micha Sharir},
title = {Planar Geometric Location Problems},
journal = {Algorithmica},
volume = {11},
number = {2},
pages = {185--195},
year = {1994},
url = {https://doi.org/10.1007/BF01182774},
doi = {10.1007/BF01182774},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bar-YehudaF94,
author = {Reuven Bar{-}Yehuda and
Sergio Fogel},
title = {Variations on Ray Shooting},
journal = {Algorithmica},
volume = {11},
number = {2},
pages = {133--145},
year = {1994},
url = {https://doi.org/10.1007/BF01182772},
doi = {10.1007/BF01182772},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Bar-YehudaF94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BatageljKK94,
author = {Vladimir Batagelj and
Simona Korenjak{-}Cerne and
Sandi Klavzar},
title = {Dynamic Programming and Convex Clustering},
journal = {Algorithmica},
volume = {11},
number = {2},
pages = {93--103},
year = {1994},
url = {https://doi.org/10.1007/BF01182769},
doi = {10.1007/BF01182769},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BatageljKK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-DavidB94,
author = {Shai Ben{-}David and
Allan Borodin},
title = {A New Measure for the Study of On-Line Algorithms},
journal = {Algorithmica},
volume = {11},
number = {1},
pages = {73--91},
year = {1994},
url = {https://doi.org/10.1007/BF01294264},
doi = {10.1007/BF01294264},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ben-DavidB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-DavidBKTW94,
author = {Shai Ben{-}David and
Allan Borodin and
Richard M. Karp and
G{\'{a}}bor Tardos and
Avi Wigderson},
title = {On the Power of Randomization in On-Line Algorithms},
journal = {Algorithmica},
volume = {11},
number = {1},
pages = {2--14},
year = {1994},
url = {https://doi.org/10.1007/BF01294260},
doi = {10.1007/BF01294260},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Ben-DavidBKTW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BernDEG94,
author = {Marshall W. Bern and
David P. Dobkin and
David Eppstein and
Robert L. Grossman},
title = {Visibility with a Moving Point of View},
journal = {Algorithmica},
volume = {11},
number = {4},
pages = {360--378},
year = {1994},
url = {https://doi.org/10.1007/BF01187019},
doi = {10.1007/BF01187019},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BernDEG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BernGRS94,
author = {Marshall W. Bern and
Daniel H. Greene and
Arvind Raghunathan and
Madhu Sudan},
title = {On-Line Algorithms for Locating Checkpoints},
journal = {Algorithmica},
volume = {11},
number = {1},
pages = {33--52},
year = {1994},
url = {https://doi.org/10.1007/BF01294262},
doi = {10.1007/BF01294262},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BernGRS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoothW94,
author = {Heather Booth and
Jeffery R. Westbrook},
title = {A Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path
Trees of Planar Graphs},
journal = {Algorithmica},
volume = {11},
number = {4},
pages = {341--352},
year = {1994},
url = {https://doi.org/10.1007/BF01187017},
doi = {10.1007/BF01187017},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoothW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChazelleEGS94,
author = {Bernard Chazelle and
Herbert Edelsbrunner and
Leonidas J. Guibas and
Micha Sharir},
title = {Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains},
journal = {Algorithmica},
volume = {11},
number = {2},
pages = {116--132},
year = {1994},
url = {https://doi.org/10.1007/BF01182771},
doi = {10.1007/BF01182771},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChazelleEGS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CohenM94,
author = {Edith Cohen and
Nimrod Megiddo},
title = {Algorithms and Complexity Analysis for Some Flow Problems},
journal = {Algorithmica},
volume = {11},
number = {3},
pages = {320--340},
year = {1994},
url = {https://doi.org/10.1007/BF01240739},
doi = {10.1007/BF01240739},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CohenM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EadesW94,
author = {Peter Eades and
Nicholas C. Wormald},
title = {Edge Crossings in Drawings of Bipartite Graphs},
journal = {Algorithmica},
volume = {11},
number = {4},
pages = {379--403},
year = {1994},
url = {https://doi.org/10.1007/BF01187020},
doi = {10.1007/BF01187020},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EadesW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinKKMNS94,
author = {Peter Epstein and
J. Kavanagh and
A. Knight and
J. May and
T. Nguyen and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {A Workbench for Computational Geometry},
journal = {Algorithmica},
volume = {11},
number = {4},
pages = {404--428},
year = {1994},
url = {https://doi.org/10.1007/BF01187021},
doi = {10.1007/BF01187021},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinKKMNS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Feder94,
author = {Tom{\'{a}}s Feder},
title = {Network Flow and 2-Satisfiability},
journal = {Algorithmica},
volume = {11},
number = {3},
pages = {291--319},
year = {1994},
url = {https://doi.org/10.1007/BF01240738},
doi = {10.1007/BF01240738},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Feder94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FiatRRS94,
author = {Amos Fiat and
Yuval Rabani and
Yiftach Ravid and
Baruch Schieber},
title = {A Deterministic O(k{\({^3}\)})-Competitive k-Server Algorithm for
the Circle},
journal = {Algorithmica},
volume = {11},
number = {6},
pages = {572--578},
year = {1994},
url = {https://doi.org/10.1007/BF01189994},
doi = {10.1007/BF01189994},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FiatRRS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fleischer94,
author = {Rudolf Fleischer},
title = {A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort},
journal = {Algorithmica},
volume = {11},
number = {2},
pages = {104--115},
year = {1994},
url = {https://doi.org/10.1007/BF01182770},
doi = {10.1007/BF01182770},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Fleischer94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Gabow94,
author = {Harold N. Gabow},
title = {Editor's Foreword: Special Issur on Network Flow Algorithms},
journal = {Algorithmica},
volume = {11},
number = {3},
pages = {197--199},
year = {1994},
url = {https://doi.org/10.1007/BF01240732},
doi = {10.1007/BF01240732},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Gabow94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Golin94,
author = {Mordecai J. Golin},
title = {A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm},
journal = {Algorithmica},
volume = {11},
number = {6},
pages = {501--524},
year = {1994},
url = {https://doi.org/10.1007/BF01189991},
doi = {10.1007/BF01189991},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Golin94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GusfieldT94,
author = {Dan Gusfield and
{\'{E}}va Tardos},
title = {A Faster Parametric Minimum-Cut Algorithm},
journal = {Algorithmica},
volume = {11},
number = {3},
pages = {278--290},
year = {1994},
url = {https://doi.org/10.1007/BF01240737},
doi = {10.1007/BF01240737},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GusfieldT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Irani94,
author = {Sandy Irani},
title = {Coloring Inductive Graphs On-Line},
journal = {Algorithmica},
volume = {11},
number = {1},
pages = {53--72},
year = {1994},
url = {https://doi.org/10.1007/BF01294263},
doi = {10.1007/BF01294263},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Irani94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IwanoMTF94,
author = {Kazuo Iwano and
Shinji Misono and
Shu Tezuka and
Satoru Fujishige},
title = {A New Scaling Algorithm for the Maximum Mean Cut Problem},
journal = {Algorithmica},
volume = {11},
number = {3},
pages = {243--255},
year = {1994},
url = {https://doi.org/10.1007/BF01240735},
doi = {10.1007/BF01240735},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/IwanoMTF94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Jeuring94,
author = {Johan Jeuring},
title = {The Derivation of On-Line Algorithms, with an Application To Finding
Palindromes},
journal = {Algorithmica},
volume = {11},
number = {2},
pages = {146--184},
year = {1994},
url = {https://doi.org/10.1007/BF01182773},
doi = {10.1007/BF01182773},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Jeuring94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarlinMMO94,
author = {Anna R. Karlin and
Mark S. Manasse and
Lyle A. McGeoch and
Susan S. Owicki},
title = {Competitive Randomized Algorithms for Nonuniform Problems},
journal = {Algorithmica},
volume = {11},
number = {6},
pages = {542--571},
year = {1994},
url = {https://doi.org/10.1007/BF01189993},
doi = {10.1007/BF01189993},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KarlinMMO94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhullerN94,
author = {Samir Khuller and
Joseph Naor},
title = {Flow in Planar Graphs with Vertex Capacities},
journal = {Algorithmica},
volume = {11},
number = {3},
pages = {200--225},
year = {1994},
url = {https://doi.org/10.1007/BF01240733},
doi = {10.1007/BF01240733},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhullerN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/OvermarsS94,
author = {Mark H. Overmars and
Micha Sharir},
title = {An Improved Technique for Output-Sensitive Hidden Surface Removal},
journal = {Algorithmica},
volume = {11},
number = {5},
pages = {469--484},
year = {1994},
url = {https://doi.org/10.1007/BF01293267},
doi = {10.1007/BF01293267},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/OvermarsS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PapadimitriouRS94,
author = {Christos H. Papadimitriou and
P. Venkat Rangan and
Martha Sideri},
title = {Designing Secure Communication Protocols from Trust Specification},
journal = {Algorithmica},
volume = {11},
number = {5},
pages = {485--499},
year = {1994},
url = {https://doi.org/10.1007/BF01293268},
doi = {10.1007/BF01293268},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PapadimitriouRS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PintoS94,
author = {Yaron Pinto and
Ron Shamir},
title = {Efficient Algorithms for Minimum-Cost Flow Problems with Piecewise-Linear
Convex Costs},
journal = {Algorithmica},
volume = {11},
number = {3},
pages = {256--276},
year = {1994},
url = {https://doi.org/10.1007/BF01240736},
doi = {10.1007/BF01240736},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PintoS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RadzikG94,
author = {Tomasz Radzik and
Andrew V. Goldberg},
title = {Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and
Related Results},
journal = {Algorithmica},
volume = {11},
number = {3},
pages = {226--242},
year = {1994},
url = {https://doi.org/10.1007/BF01240734},
doi = {10.1007/BF01240734},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RadzikG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Raghavan94,
author = {Prabhakar Raghavan},
title = {Guest Editor's Foreword: Special Issue on On-Line Algorithms},
journal = {Algorithmica},
volume = {11},
number = {1},
pages = {1},
year = {1994},
url = {https://doi.org/10.1007/BF01294259},
doi = {10.1007/BF01294259},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Raghavan94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RamachandranY94,
author = {Vijaya Ramachandran and
Honghua Yang},
title = {Finding the Closed Partition of a Planar Graph},
journal = {Algorithmica},
volume = {11},
number = {5},
pages = {443--468},
year = {1994},
url = {https://doi.org/10.1007/BF01293266},
doi = {10.1007/BF01293266},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RamachandranY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ReingoldWS94,
author = {Nick Reingold and
Jeffery R. Westbrook and
Daniel Dominic Sleator},
title = {Randomized Competitive Algorithms for the List Update Problem},
journal = {Algorithmica},
volume = {11},
number = {1},
pages = {15--32},
year = {1994},
url = {https://doi.org/10.1007/BF01294261},
doi = {10.1007/BF01294261},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ReingoldWS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Spencer94,
author = {Thomas H. Spencer},
title = {Provably Good Pattern Generators for a Random Pattern Test},
journal = {Algorithmica},
volume = {11},
number = {5},
pages = {429--442},
year = {1994},
url = {https://doi.org/10.1007/BF01293265},
doi = {10.1007/BF01293265},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Spencer94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Tuncel94,
author = {Levent Tun{\c{c}}el},
title = {On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems},
journal = {Algorithmica},
volume = {11},
number = {4},
pages = {353--359},
year = {1994},
url = {https://doi.org/10.1007/BF01187018},
doi = {10.1007/BF01187018},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Tuncel94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Young94,
author = {Neal E. Young},
title = {The k-Server Dual and Loose Competitiveness for Paging},
journal = {Algorithmica},
volume = {11},
number = {6},
pages = {525--541},
year = {1994},
url = {https://doi.org/10.1007/BF01189992},
doi = {10.1007/BF01189992},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Young94.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-26 03:08 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:
