Search dblp for Publications

export results for "toc:db/journals/algorithmica/algorithmica8.bht:"

 download as .bib file

@article{DBLP:journals/algorithmica/AdlerM92,
  author       = {Ilan Adler and
                  Renato D. C. Monteiro},
  title        = {A Geometric View of Parametric Linear Programming},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {2},
  pages        = {161--176},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758841},
  doi          = {10.1007/BF01758841},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AdlerM92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AltFKMNSU92,
  author       = {Helmut Alt and
                  Rudolf Fleischer and
                  Michael Kaufmann and
                  Kurt Mehlhorn and
                  Stefan N{\"{a}}her and
                  Stefan Schirra and
                  Christian Uhrig},
  title        = {Approximate Motion Planning and the Complexity of the Boundary of
                  the Union of Simple Geometric Figures},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {5{\&}6},
  pages        = {391--406},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758853},
  doi          = {10.1007/BF01758853},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AltFKMNSU92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Apostolico92,
  author       = {Alberto Apostolico},
  title        = {Optimal Parallel Detection of Squares in Strings},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {4},
  pages        = {285--319},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758848},
  doi          = {10.1007/BF01758848},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Apostolico92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Atallah92,
  author       = {Mikhail J. Atallah},
  title        = {Editor's Foreword: Special Issue on the Sixth Annual Symposium on
                  Computational Geometry},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {5{\&}6},
  pages        = {343--344},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758850},
  doi          = {10.1007/BF01758850},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Atallah92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AtallahT92,
  author       = {Mikhail J. Atallah and
                  Jyh{-}Jong Tsay},
  title        = {On the Parallel-Decomposability of Geometric Problems},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {3},
  pages        = {209--231},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758844},
  doi          = {10.1007/BF01758844},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AtallahT92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BoissonnatY92,
  author       = {Jean{-}Daniel Boissonnat and
                  Mariette Yvinec},
  title        = {Probing a Scene of Nonconvex Polyhedra},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {4},
  pages        = {321--342},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758849},
  doi          = {10.1007/BF01758849},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BoissonnatY92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Briggs92,
  author       = {Amy J. Briggs},
  title        = {An Efficient Algorithm for One-Step Planar Compliant Motion Planning
                  with Uncertainty},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {3},
  pages        = {195--208},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758843},
  doi          = {10.1007/BF01758843},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Briggs92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChangTL92,
  author       = {Maw{-}Shang Chang and
                  Chuan Yi Tang and
                  Richard C. T. Lee},
  title        = {Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood
                  Graphs},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {3},
  pages        = {177--194},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758842},
  doi          = {10.1007/BF01758842},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChangTL92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChazelleSW92,
  author       = {Bernard Chazelle and
                  Micha Sharir and
                  Emo Welzl},
  title        = {Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone
                  Theorems},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {5{\&}6},
  pages        = {407--429},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758854},
  doi          = {10.1007/BF01758854},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChazelleSW92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChengH92,
  author       = {Chung{-}Kuan Cheng and
                  T. C. Hu},
  title        = {Maximum Concurrent Flows and Minimum Cuts},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {3},
  pages        = {233--249},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758845},
  doi          = {10.1007/BF01758845},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChengH92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/FleischerMRWY92,
  author       = {Rudolf Fleischer and
                  Kurt Mehlhorn and
                  G{\"{u}}nter Rote and
                  Emo Welzl and
                  Chee{-}Keng Yap},
  title        = {Simultaneous Inner and Outer Approximation of Shapes},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {5{\&}6},
  pages        = {365--389},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758852},
  doi          = {10.1007/BF01758852},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FleischerMRWY92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GoldfarbH92,
  author       = {Donald Goldfarb and
                  Jianxiu Hao},
  title        = {Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network
                  Flow Problem},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {2},
  pages        = {145--160},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758840},
  doi          = {10.1007/BF01758840},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GoldfarbH92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GoodrichSG92,
  author       = {Michael T. Goodrich and
                  Steven B. Shauck and
                  Sumanta Guha},
  title        = {Parallel Methods for Visibility and Shortest-Path Problems in Simple
                  Polygons},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {5{\&}6},
  pages        = {461--486},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758856},
  doi          = {10.1007/BF01758856},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GoodrichSG92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GusfieldP92,
  author       = {Dan Gusfield and
                  Leonard Pitt},
  title        = {A Bounded Approximation for the Minimum Cost 2-Sat Problem},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {2},
  pages        = {103--117},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758838},
  doi          = {10.1007/BF01758838},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GusfieldP92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LevcopoulosL92,
  author       = {Christos Levcopoulos and
                  Andrzej Lingas},
  title        = {There Are Planar Graphs Almost as Good as the Complete Graphs and
                  Almost as Cheap as Minimum Spanning Trees},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {3},
  pages        = {251--256},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758846},
  doi          = {10.1007/BF01758846},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LevcopoulosL92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LiM92,
  author       = {Zhenyu Li and
                  Victor Milenkovic},
  title        = {Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {5{\&}6},
  pages        = {345--364},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758851},
  doi          = {10.1007/BF01758851},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LiM92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Mitchell92,
  author       = {Joseph S. B. Mitchell},
  title        = {L{\_}1 Shortest Paths Among Polygonal Obstacles in the Plane},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {1},
  pages        = {55--88},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758836},
  doi          = {10.1007/BF01758836},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Mitchell92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/MitchellRW92,
  author       = {Joseph S. B. Mitchell and
                  G{\"{u}}nter Rote and
                  Gerhard J. Woeginger},
  title        = {Minimum-Link Paths Among Obstacles in the Plan},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {5{\&}6},
  pages        = {431--459},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758855},
  doi          = {10.1007/BF01758855},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MitchellRW92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/PreparataVY92,
  author       = {Franco P. Preparata and
                  Jeffrey Scott Vitter and
                  Mariette Yvinec},
  title        = {Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {4},
  pages        = {257--283},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758847},
  doi          = {10.1007/BF01758847},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/PreparataVY92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/RajasekaranT92,
  author       = {Sanguthevar Rajasekaran and
                  Thanasis Tsantilas},
  title        = {Optimal Routing Algorithms for Mesh-Connected Processor Arrays},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {1},
  pages        = {21--38},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758834},
  doi          = {10.1007/BF01758834},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/RajasekaranT92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Rub92,
  author       = {Christine R{\"{u}}b},
  title        = {Line-Segment Intersection Reporting in Parallel},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {2},
  pages        = {119--144},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758839},
  doi          = {10.1007/BF01758839},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Rub92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/SchwartzS92,
  author       = {Jacob T. Schwartz and
                  Micha Sharir},
  title        = {Finding Effective "Force Targets" for Two-Dimensional Multifinger
                  Frictional Grips},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {1},
  pages        = {1--20},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758833},
  doi          = {10.1007/BF01758833},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/SchwartzS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/WebberS92,
  author       = {Robert E. Webber and
                  Hanan Samet},
  title        = {Linear-Time Border-Tracing Algorithms for Quadtrees},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {1},
  pages        = {39--54},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758835},
  doi          = {10.1007/BF01758835},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/WebberS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/WuM92,
  author       = {Sun Wu and
                  Udi Manber},
  title        = {Path-Matching Problems},
  journal      = {Algorithmica},
  volume       = {8},
  number       = {2},
  pages        = {89--101},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01758837},
  doi          = {10.1007/BF01758837},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/WuM92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.