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/algorithmica30.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AmirEIS01,
author = {Arnon Amir and
Alon Efrat and
Piotr Indyk and
Hanan Samet},
title = {Efficient Regular Data Structures and Algorithms for Dilation, Location,
and Proximity Problems},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {164--187},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0013-y},
doi = {10.1007/S00453-001-0013-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmirEIS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaurF01,
author = {Christoph Baur and
S{\'{a}}ndor P. Fekete},
title = {Approximation of Geometric Dispersion Problems},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {451--470},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0022-x},
doi = {10.1007/S00453-001-0022-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaurF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-AmramG01,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {A Generalization of a Lower Bound Technique due to Fredman and Saks},
journal = {Algorithmica},
volume = {30},
number = {1},
pages = {34--66},
year = {2001},
url = {https://doi.org/10.1007/s004530010077},
doi = {10.1007/S004530010077},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ben-AmramG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoissonnatCDY01,
author = {Jean{-}Daniel Boissonnat and
Jurek Czyzowicz and
Olivier Devillers and
Mariette Yvinec},
title = {Circular Separability of Polygons},
journal = {Algorithmica},
volume = {30},
number = {1},
pages = {67--82},
year = {2001},
url = {https://doi.org/10.1007/s004530010078},
doi = {10.1007/S004530010078},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoissonnatCDY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuchsbaumGW01,
author = {Adam L. Buchsbaum and
Raffaele Giancarlo and
Jeffery R. Westbrook},
title = {An Approximate Determinization Algorithm for Weighted Finite-State
Automata},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {503--526},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0026-6},
doi = {10.1007/S00453-001-0026-6},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuchsbaumGW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CheriyanJN01,
author = {Joseph Cheriyan and
Tibor Jord{\'{a}}n and
Zeev Nutov},
title = {On Rooted Node-Connectivity Problems},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {353--375},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0017-7},
doi = {10.1007/S00453-001-0017-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CheriyanJN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChristofR01,
author = {Thomas Christof and
Gerhard Reinelt},
title = {Algorithmic Aspects of Using Small Instance Relaxations in Parallel
Branch-and-Cut},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {597--629},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0029-3},
doi = {10.1007/S00453-001-0029-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChristofR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CodenottiLP01,
author = {Bruno Codenotti and
Mauro Leoncini and
Franco P. Preparata},
title = {The Role of Arithmetic in Fast Parallel Matrix Inversion},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {685--707},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0033-7},
doi = {10.1007/S00453-001-0033-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CodenottiLP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/El-YanivFKT01,
author = {Ran El{-}Yaniv and
Amos Fiat and
Richard M. Karp and
G. Turpin},
title = {Optimal Search and One-Way Trading Online Algorithms},
journal = {Algorithmica},
volume = {30},
number = {1},
pages = {101--139},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0003-0},
doi = {10.1007/S00453-001-0003-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/El-YanivFKT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Estivill-CastroH01,
author = {Vladimir Estivill{-}Castro and
Michael E. Houle},
title = {Robust Distance-Based Clustering with Applications to Spatial Data
Mining},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {216--242},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0010-1},
doi = {10.1007/S00453-001-0010-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Estivill-CastroH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EvansKT01,
author = {William S. Evans and
David G. Kirkpatrick and
G. Townsend},
title = {Right-Triangulated Irregular Networks},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {264--286},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0006-x},
doi = {10.1007/S00453-001-0006-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EvansKT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fernandez-Baca01,
author = {David Fern{\'{a}}ndez{-}Baca},
title = {On Nonlinear Parametric Search},
journal = {Algorithmica},
volume = {30},
number = {1},
pages = {1--11},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0001-2},
doi = {10.1007/S00453-001-0001-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Fernandez-Baca01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GoldS01,
author = {Christopher M. Gold and
Jack Snoeyink},
title = {A One-Step Crust and Skeleton Extraction Algorithm},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {144--163},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0014-x},
doi = {10.1007/S00453-001-0014-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GoldS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Held01,
author = {Martin Held},
title = {{FIST:} Fast Industrial-Strength Triangulation of Polygons},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {563--596},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0028-4},
doi = {10.1007/S00453-001-0028-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Held01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Italiano01,
author = {Giuseppe F. Italiano},
title = {Guest Editor's Introduction},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {471--472},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0035-5},
doi = {10.1007/S00453-001-0035-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Italiano01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JagerB01,
author = {Bram de Jager and
J. Banens},
title = {{VISOR:} Vast Independence System Optimization Routine},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {630--644},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0030-x},
doi = {10.1007/S00453-001-0030-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JagerB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenR01,
author = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Guest Editors' Introduction},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {351--352},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0025-7},
doi = {10.1007/S00453-001-0025-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Karpinski01,
author = {Marek Karpinski},
title = {Polynomial Time Approximation Schemes for Some Dense Instances of
NP-Hard Optimization Problems},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {386--397},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0012-z},
doi = {10.1007/S00453-001-0012-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Karpinski01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kortsarz01,
author = {Guy Kortsarz},
title = {On the Hardness of Approximating Spanners},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {432--450},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0021-y},
doi = {10.1007/S00453-001-0021-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kortsarz01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kreveld01,
author = {Marc J. van Kreveld},
title = {Guest Editor's Foreword},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {141--143},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0024-8},
doi = {10.1007/S00453-001-0024-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kreveld01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kumar01,
author = {V. Kumar},
title = {An Approximation Algorithm for Circular Arc Colouring},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {406--417},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0023-9},
doi = {10.1007/S00453-001-0023-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kumar01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LamY01,
author = {Tak Wah Lam and
Fung Ling Yue},
title = {Optimal Edge Ranking of Trees in Linear Time},
journal = {Algorithmica},
volume = {30},
number = {1},
pages = {12--33},
year = {2001},
url = {https://doi.org/10.1007/s004530010076},
doi = {10.1007/S004530010076},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LamY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LanthierMS01,
author = {Mark Lanthier and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Approximating Shortest Paths on Weighted Polyhedral Surfaces},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {527--562},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0027-5},
doi = {10.1007/S00453-001-0027-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LanthierMS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LeeLP01,
author = {Myungho Lee and
Wenheng Liu and
Viktor K. Prasanna},
title = {Parallel Implementation of a Class of Adaptive Signal Processing Applications},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {645--684},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0031-9},
doi = {10.1007/S00453-001-0031-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LeeLP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LittleS01,
author = {James J. Little and
Ping Shi},
title = {Structural Lines, TINs, and DEMs},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {243--263},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0015-9},
doi = {10.1007/S00453-001-0015-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LittleS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LonerganJ01,
author = {M. Lonergan and
Cliff B. Jones},
title = {An Iterative Displacement Method for Conflict Resolution in Map Generalization},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {287--301},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0011-0},
doi = {10.1007/S00453-001-0011-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LonerganJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MackanessP01,
author = {William A. Mackaness and
Ross S. Purves},
title = {Automated Displacement for Large Numbers of Discrete Map Objects},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {302--311},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0007-9},
doi = {10.1007/S00453-001-0007-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MackanessP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NavarroB01,
author = {Gonzalo Navarro and
Ricardo A. Baeza{-}Yates},
title = {Improving an Algorithm for Approximate Pattern Matching},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {473--502},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0034-6},
doi = {10.1007/S00453-001-0034-6},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/NavarroB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PanY01,
author = {Victor Y. Pan and
Yanqiang Yu},
title = {Certification of Numerical Computation of the Sign of the Determinant
of a Matrix},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {708--724},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0032-8},
doi = {10.1007/S00453-001-0032-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PanY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PapadiasMT01,
author = {Dimitris Papadias and
Nikos Mamoulis and
Yannis Theodoridis},
title = {Constraint-Based Processing of Multiway Spatial Joins},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {188--215},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0005-y},
doi = {10.1007/S00453-001-0005-Y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PapadiasMT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Regnauld01,
author = {N. Regnauld},
title = {Contextual Building Typification in Automated Map Generalization},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {312--333},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0008-8},
doi = {10.1007/S00453-001-0008-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Regnauld01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RosenkrantzYR01,
author = {Daniel J. Rosenkrantz and
Lin Yu and
S. S. Ravi},
title = {Efficient Construction of Minimum Makespan Schedules for Tasks with
a Fixed Number of Distinct Execution Times},
journal = {Algorithmica},
volume = {30},
number = {1},
pages = {83--100},
year = {2001},
url = {https://doi.org/10.1007/s004530010079},
doi = {10.1007/S004530010079},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RosenkrantzYR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SaksZ01,
author = {Michael E. Saks and
Shiyu Zhou},
title = {Sample Spaces with Small Bias on Neighborhoods and Error-Correcting
Communication Protocols},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {418--431},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0020-z},
doi = {10.1007/S00453-001-0020-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SaksZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Sviridenko01,
author = {Maxim Sviridenko},
title = {Best Possible Approximation Algorithm for {MAX} {SAT} with Cardinality
Constraint},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {398--405},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0019-5},
doi = {10.1007/S00453-001-0019-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Sviridenko01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/TetaliV01,
author = {Prasad Tetali and
Santosh S. Vempala},
title = {Random Sampling of Euler Tours},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {376--385},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0018-6},
doi = {10.1007/S00453-001-0018-6},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/TetaliV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WagnerWKS01,
author = {Frank Wagner and
Alexander Wolff and
Vikas Kapoor and
Tycho Strijk},
title = {Three Rules Suffice for Good Label Placement},
journal = {Algorithmica},
volume = {30},
number = {2},
pages = {334--349},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0009-7},
doi = {10.1007/S00453-001-0009-7},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WagnerWKS01.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-06 09:35 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:
