default search action
Search dblp for Publications
export results for "toc:db/journals/algorithmica/algorithmica19.bht:"
@article{DBLP:journals/algorithmica/AggarwalKPS97, author = {Alok Aggarwal and Dina Kravets and James K. Park and Sandeep Sen}, title = {Parallel Searching in Generalized Monge Arrays}, journal = {Algorithmica}, volume = {19}, number = {3}, pages = {291--317}, year = {1997}, url = {https://doi.org/10.1007/PL00009175}, doi = {10.1007/PL00009175}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/AggarwalKPS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/AsbergBBGOTWZ97, author = {Boudewijn Asberg and Gregoria Blanco and Prosenjit Bose and Jesus Garcia{-}Lopez and Mark H. Overmars and Godfried T. Toussaint and Gordon T. Wilfong and Binhai Zhu}, title = {Feasibility of Design in Stereolithography}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {61--83}, year = {1997}, url = {https://doi.org/10.1007/PL00014421}, doi = {10.1007/PL00014421}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/AsbergBBGOTWZ97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BajajBX97, author = {Chandrajit L. Bajaj and Fausto Bernardini and Guoliang Xu}, title = {Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {243--261}, year = {1997}, url = {https://doi.org/10.1007/PL00014418}, doi = {10.1007/PL00014418}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BajajBX97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BaraffMK97, author = {David Baraff and Raju S. Mattikalli and Pradeep K. Khosla}, title = {Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {4--39}, year = {1997}, url = {https://doi.org/10.1007/PL00014419}, doi = {10.1007/PL00014419}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BaraffMK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BiedlKK97, author = {Therese Biedl and Goos Kant and Michael Kaufmann}, title = {On Triangulating Planar Graphs Under the Four-Connectivity Constraint}, journal = {Algorithmica}, volume = {19}, number = {4}, pages = {427--446}, year = {1997}, url = {https://doi.org/10.1007/PL00009182}, doi = {10.1007/PL00009182}, timestamp = {Tue, 02 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BiedlKK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BoseBK97, author = {Prosenjit Bose and David Bremner and Marc J. van Kreveld}, title = {Determining the Castability of Simple Polyhedra}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {84--113}, year = {1997}, url = {https://doi.org/10.1007/PL00014422}, doi = {10.1007/PL00014422}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BoseBK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BradyBP97, author = {Martin L. Brady and Donna J. Brown and K. D. Powers}, title = {Hexagonal Models for Channel Routing}, journal = {Algorithmica}, volume = {19}, number = {3}, pages = {263--290}, year = {1997}, url = {https://doi.org/10.1007/PL00009174}, doi = {10.1007/PL00009174}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BradyBP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChenH97, author = {Zhi{-}Zhong Chen and Xin He}, title = {Parallel Algorithms for Maximal Acyclic Sets}, journal = {Algorithmica}, volume = {19}, number = {3}, pages = {354--368}, year = {1997}, url = {https://doi.org/10.1007/PL00009178}, doi = {10.1007/PL00009178}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChenH97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CherkasskyG97, author = {Boris V. Cherkassky and Andrew V. Goldberg}, title = {On Implementing the Push-Relabel Method for the Maximum Flow Problem}, journal = {Algorithmica}, volume = {19}, number = {4}, pages = {390--410}, year = {1997}, url = {https://doi.org/10.1007/PL00009180}, doi = {10.1007/PL00009180}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/CherkasskyG97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DanielsM97, author = {Karen L. Daniels and Victor Milenkovic}, title = {Multiple Translational Containment. Part {I:} An Approximate Algorithm}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {148--182}, year = {1997}, url = {https://doi.org/10.1007/PL00014415}, doi = {10.1007/PL00014415}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/DanielsM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DasKS97, author = {Gautam Das and Sanjiv Kapoor and Michiel H. M. Smid}, title = {On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees}, journal = {Algorithmica}, volume = {19}, number = {4}, pages = {447--460}, year = {1997}, url = {https://doi.org/10.1007/PL00009183}, doi = {10.1007/PL00009183}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/DasKS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/EmirisCS97, author = {Ioannis Z. Emiris and John F. Canny and Raimund Seidel}, title = {Efficient Perturbations for Handling Geometric Degeneracies}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {219--242}, year = {1997}, url = {https://doi.org/10.1007/PL00014417}, doi = {10.1007/PL00014417}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/EmirisCS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GiegerichK97, author = {Robert Giegerich and Stefan Kurtz}, title = {From Ukkonen to McCreight and Weiner: {A} Unifying View of Linear-Time Suffix Tree Construction}, journal = {Algorithmica}, volume = {19}, number = {3}, pages = {331--353}, year = {1997}, url = {https://doi.org/10.1007/PL00009177}, doi = {10.1007/PL00009177}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/GiegerichK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KarasickLNR97, author = {Michael S. Karasick and Derek Lieber and Lee R. Nackman and V. T. Rajan}, title = {Visualization of Three-Dimensional Delaunay Meshes}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {114--128}, year = {1997}, url = {https://doi.org/10.1007/PL00014413}, doi = {10.1007/PL00014413}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/KarasickLNR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/LinL97, author = {Shun{-}Shii Lin and Kwei{-}Jay Lin}, title = {A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound}, journal = {Algorithmica}, volume = {19}, number = {4}, pages = {411--426}, year = {1997}, url = {https://doi.org/10.1007/PL00009181}, doi = {10.1007/PL00009181}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/LinL97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Milenkovic97, author = {Victor Milenkovic}, title = {Multiple Translational Containment. Part {II:} Exact Algorithms}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {183--218}, year = {1997}, url = {https://doi.org/10.1007/PL00014416}, doi = {10.1007/PL00014416}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Milenkovic97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/MillerT97, author = {Gary L. Miller and Shang{-}Hua Teng}, title = {Tree-Based Parallel Algorithm Design}, journal = {Algorithmica}, volume = {19}, number = {4}, pages = {369--389}, year = {1997}, url = {https://doi.org/10.1007/PL00009179}, doi = {10.1007/PL00009179}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/MillerT97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Rus97, author = {Daniela Rus}, title = {Coordinated Manipulation of Objects in a Plane}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {129--147}, year = {1997}, url = {https://doi.org/10.1007/PL00014414}, doi = {10.1007/PL00014414}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Rus97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/WallackC97, author = {Aaron S. Wallack and John F. Canny}, title = {Planning for Modular and Hybrid Fixture}, journal = {Algorithmica}, volume = {19}, number = {1/2}, pages = {40--60}, year = {1997}, url = {https://doi.org/10.1007/PL00014420}, doi = {10.1007/PL00014420}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/WallackC97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Weng97, author = {J. F. Weng}, title = {Expansion of Linear Steiner Trees}, journal = {Algorithmica}, volume = {19}, number = {3}, pages = {318--330}, year = {1997}, url = {https://doi.org/10.1007/PL00009176}, doi = {10.1007/PL00009176}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Weng97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.