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/algorithmica13.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AgarwalM95,
author = {Pankaj K. Agarwal and
Jir{\'{\i}} Matousek},
title = {Dynamic Half-Space Range Reporting and Its Applications},
journal = {Algorithmica},
volume = {13},
number = {4},
pages = {325--345},
year = {1995},
url = {https://doi.org/10.1007/BF01293483},
doi = {10.1007/BF01293483},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlizadehKNW95,
author = {Farid Alizadeh and
Richard M. Karp and
Lee Aaron Newberg and
Deborah K. Weisser},
title = {Physical Mapping of Chromosomes: {A} Combinatorial Problem in Molecular
Biology},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {52--76},
year = {1995},
url = {https://doi.org/10.1007/BF01188581},
doi = {10.1007/BF01188581},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlizadehKNW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AtkinsonV95,
author = {David S. Atkinson and
Pravin M. Vaidya},
title = {Using Geometry To Solve the Transportation Problem in the Plane},
journal = {Algorithmica},
volume = {13},
number = {5},
pages = {442--461},
year = {1995},
url = {https://doi.org/10.1007/BF01190848},
doi = {10.1007/BF01190848},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AtkinsonV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BruschiR95,
author = {Danilo Bruschi and
F. Ravasio},
title = {Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings,
and Cycles},
journal = {Algorithmica},
volume = {13},
number = {4},
pages = {346--356},
year = {1995},
url = {https://doi.org/10.1007/BF01293484},
doi = {10.1007/BF01293484},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BruschiR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChaoM95,
author = {Kun{-}Mao Chao and
Webb Miller},
title = {Linear-Space Algorithms that Build Local Alignments from Fragments},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {106--134},
year = {1995},
url = {https://doi.org/10.1007/BF01188583},
doi = {10.1007/BF01188583},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChaoM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CohenT95,
author = {Robert F. Cohen and
Roberto Tamassia},
title = {Dynamic Expression Trees},
journal = {Algorithmica},
volume = {13},
number = {3},
pages = {245--265},
year = {1995},
url = {https://doi.org/10.1007/BF01190506},
doi = {10.1007/BF01190506},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CohenT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CrochemoreR95,
author = {Maxime Crochemore and
Wojciech Rytter},
title = {Squares, Cubes, and Time-Space Efficient String Searching},
journal = {Algorithmica},
volume = {13},
number = {5},
pages = {405--425},
year = {1995},
url = {https://doi.org/10.1007/BF01190846},
doi = {10.1007/BF01190846},
timestamp = {Sat, 09 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CrochemoreR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Du95,
author = {Ding{-}Zhu Du},
title = {On Greedy Heuristics for Steiner Minimum Trees},
journal = {Algorithmica},
volume = {13},
number = {4},
pages = {381--386},
year = {1995},
url = {https://doi.org/10.1007/BF01293486},
doi = {10.1007/BF01293486},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Du95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Eppstein95,
author = {David Eppstein},
title = {Asymptotic Speed-Ups in Constructive Solid Geometry},
journal = {Algorithmica},
volume = {13},
number = {5},
pages = {462--471},
year = {1995},
url = {https://doi.org/10.1007/BF01190849},
doi = {10.1007/BF01190849},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Eppstein95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FarachKW95,
author = {Martin Farach and
Sampath Kannan and
Tandy J. Warnow},
title = {A Robust Model for Finding Optimal Evolutionary Trees},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {155--179},
year = {1995},
url = {https://doi.org/10.1007/BF01188585},
doi = {10.1007/BF01188585},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FarachKW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FellowsKMP95,
author = {Michael R. Fellows and
Jan Kratochv{\'{\i}}l and
Matthias Middendorf and
Frank Pfeiffer},
title = {The Complexity of Induced Minors and Related Problems},
journal = {Algorithmica},
volume = {13},
number = {3},
pages = {266--282},
year = {1995},
url = {https://doi.org/10.1007/BF01190507},
doi = {10.1007/BF01190507},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FellowsKMP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HabibHS95,
author = {Michel Habib and
Marianne Huchard and
Jeremy P. Spinrad},
title = {A Linear Algorithm To Decompose Inheritance Graphs Into Modules},
journal = {Algorithmica},
volume = {13},
number = {6},
pages = {573--591},
year = {1995},
url = {https://doi.org/10.1007/BF01189070},
doi = {10.1007/BF01189070},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HabibHS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/He95,
author = {Xin He},
title = {An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane
Triangular Graphs},
journal = {Algorithmica},
volume = {13},
number = {6},
pages = {553--572},
year = {1995},
url = {https://doi.org/10.1007/BF01189069},
doi = {10.1007/BF01189069},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/He95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Henzinger95,
author = {Monika Rauch Henzinger},
title = {Fully Dynamic Biconnectivity in Graphs},
journal = {Algorithmica},
volume = {13},
number = {6},
pages = {503--538},
year = {1995},
url = {https://doi.org/10.1007/BF01189067},
doi = {10.1007/BF01189067},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Henzinger95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HumenikMSY95,
author = {Keith E. Humenik and
Peter Matthews and
A. B. Stephens and
Yelena Yesha},
title = {A Lower Bound on the Probability of Conflict Under Nonuniform Access
in Database Systems},
journal = {Algorithmica},
volume = {13},
number = {3},
pages = {283--312},
year = {1995},
url = {https://doi.org/10.1007/BF01190508},
doi = {10.1007/BF01190508},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HumenikMSY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JungerP95,
author = {Michael J{\"{u}}nger and
William R. Pulleyblank},
title = {New Primal and Dual Matching Heuristics},
journal = {Algorithmica},
volume = {13},
number = {4},
pages = {357--386},
year = {1995},
url = {https://doi.org/10.1007/BF01293485},
doi = {10.1007/BF01293485},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JungerP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KececiogluM95,
author = {John D. Kececioglu and
Eugene W. Myers},
title = {Combinatiorial Algorithms for {DNA} Sequence Assembly},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {7--51},
year = {1995},
url = {https://doi.org/10.1007/BF01188580},
doi = {10.1007/BF01188580},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KececiogluM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KececiogluS95,
author = {John D. Kececioglu and
David Sankoff},
title = {Exact and Approximation Algorithms for Sorting by Reversals, with
Application to Genome Rearrangement},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {180--210},
year = {1995},
url = {https://doi.org/10.1007/BF01188586},
doi = {10.1007/BF01188586},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KececiogluS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KnightM95,
author = {James R. Knight and
Eugene W. Myers},
title = {Super-Pattern Matching},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {211--243},
year = {1995},
url = {https://doi.org/10.1007/BF01188587},
doi = {10.1007/BF01188587},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KnightM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LazanasL95,
author = {Anthony Lazanas and
Jean{-}Claude Latombe},
title = {Landmark-Based Robot Navigation},
journal = {Algorithmica},
volume = {13},
number = {5},
pages = {472--501},
year = {1995},
url = {https://doi.org/10.1007/BF01190850},
doi = {10.1007/BF01190850},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LazanasL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LenhofS95,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
title = {Maintaining the Visibility Map of Spheres While Moving the Viewpoint
on a Circle at Infinity},
journal = {Algorithmica},
volume = {13},
number = {3},
pages = {301--312},
year = {1995},
url = {https://doi.org/10.1007/BF01190509},
doi = {10.1007/BF01190509},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LenhofS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Mahmoud95,
author = {Hosam M. Mahmoud},
title = {The Joint Distribution of the Three Types of Nodes in Uniform Binary
Trees},
journal = {Algorithmica},
volume = {13},
number = {3},
pages = {313--323},
year = {1995},
url = {https://doi.org/10.1007/BF01190510},
doi = {10.1007/BF01190510},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Mahmoud95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/McGeoch95,
author = {Catherine C. McGeoch},
title = {All-Pairs Shortest Paths and the Essential Subgraph},
journal = {Algorithmica},
volume = {13},
number = {5},
pages = {426--441},
year = {1995},
url = {https://doi.org/10.1007/BF01190847},
doi = {10.1007/BF01190847},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/McGeoch95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Myers95,
author = {Eugene W. Myers},
title = {Guest Editor's Foreword: Special Issue on Computational Molecular
Biology},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {1--6},
year = {1995},
url = {https://doi.org/10.1007/BF01188579},
doi = {10.1007/BF01188579},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Myers95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Pevzner95,
author = {Pavel A. Pevzner},
title = {{DNA} Physical Mapping and Alternating Eulerian Cycles in Colored
Graphs},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {77--105},
year = {1995},
url = {https://doi.org/10.1007/BF01188582},
doi = {10.1007/BF01188582},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Pevzner95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PevznerW95,
author = {Pavel A. Pevzner and
Michael S. Waterman},
title = {Multiple Filtration and Approximate Pattern Matching},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {135--154},
year = {1995},
url = {https://doi.org/10.1007/BF01188584},
doi = {10.1007/BF01188584},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PevznerW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RezendeL95,
author = {Pedro Jussieu de Rezende and
D. T. Lee},
title = {Point Set Pattern Matching in d-Dimensions},
journal = {Algorithmica},
volume = {13},
number = {4},
pages = {387--404},
year = {1995},
url = {https://doi.org/10.1007/BF01293487},
doi = {10.1007/BF01293487},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RezendeL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SchweikardW95,
author = {Achim Schweikard and
Randall H. Wilson},
title = {Assembly Sequences for Polyhedra},
journal = {Algorithmica},
volume = {13},
number = {6},
pages = {539--552},
year = {1995},
url = {https://doi.org/10.1007/BF01189068},
doi = {10.1007/BF01189068},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SchweikardW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/TorreGS95,
author = {Pilar de la Torre and
Raymond Greenlaw and
Alejandro A. Sch{\"{a}}ffer},
title = {Optimal Edge Ranking of Trees in Polynomial Time},
journal = {Algorithmica},
volume = {13},
number = {6},
pages = {592--618},
year = {1995},
url = {https://doi.org/10.1007/BF01189071},
doi = {10.1007/BF01189071},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/TorreGS95.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 14:12 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:
