Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/algorithmica/AgostinoPS97,
  author       = {Sergio De Agostino and
                  Rossella Petreschi and
                  Andrea Sterbini},
  title        = {An O(n{\({^3}\)}) Recognition Algorithm for Bithreshold Graphs},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {4},
  pages        = {416--425},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523681},
  doi          = {10.1007/BF02523681},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AgostinoPS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AlonS97,
  author       = {Noga Alon and
                  Aravind Srinivasan},
  title        = {Improved Parallel Approximation of a Class of Integer Programming
                  Problems},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {4},
  pages        = {449--462},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523683},
  doi          = {10.1007/BF02523683},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AlonS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AlonYZ97,
  author       = {Noga Alon and
                  Raphael Yuster and
                  Uri Zwick},
  title        = {Finding and Counting Given Length Cycles},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {3},
  pages        = {209--223},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523189},
  doi          = {10.1007/BF02523189},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AlonYZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AlonsoRS97,
  author       = {Laurent Alonso and
                  Jean{-}Luc R{\'{e}}my and
                  Ren{\'{e}} Schott},
  title        = {A Linear-Time Algorithm for the Generation of Trees},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {2},
  pages        = {162--183},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02522824},
  doi          = {10.1007/BF02522824},
  timestamp    = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AlonsoRS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AryaS97,
  author       = {Sunil Arya and
                  Michiel H. M. Smid},
  title        = {Efficient Construction of a Bounded-Degree Spanner with Low Weight},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {1},
  pages        = {33--54},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523237},
  doi          = {10.1007/BF02523237},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AryaS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AvnaimBDPY97,
  author       = {Francis Avnaim and
                  Jean{-}Daniel Boissonnat and
                  Olivier Devillers and
                  Franco P. Preparata and
                  Mariette Yvinec},
  title        = {Evaluating Signs of Determinants Using Single-Precision Arithmetic},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {2},
  pages        = {111--132},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02522822},
  doi          = {10.1007/BF02522822},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AvnaimBDPY97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Bang-JensenHMP97,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Mohamed El Haddad and
                  Yannis Manoussakis and
                  Teresa M. Przytycka},
  title        = {Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path
                  Problems in Semicomplete Bipartite Digraphs},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {1},
  pages        = {67--87},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523239},
  doi          = {10.1007/BF02523239},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Bang-JensenHMP97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BazziN97,
  author       = {Rida A. Bazzi and
                  Gil Neiger},
  title        = {The Complexity of Almost-Optimal Simultaneous Coordination},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {3},
  pages        = {308--321},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523194},
  doi          = {10.1007/BF02523194},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BazziN97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BermanD97,
  author       = {Piotr Berman and
                  Bhaskar DasGupta},
  title        = {Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {4},
  pages        = {331--356},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523677},
  doi          = {10.1007/BF02523677},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BermanD97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BhuyanDR97,
  author       = {Jay N. Bhuyan and
                  Jitender S. Deogun and
                  Vijay V. Raghavan},
  title        = {Algorithms for the Boundary Selection Problem},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {2},
  pages        = {133--161},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02522823},
  doi          = {10.1007/BF02522823},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BhuyanDR97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChazelleP97,
  author       = {Bernard Chazelle and
                  Leonidas Palios},
  title        = {Decomposing the Boundary of a Nonconvex Polyhedron},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {3},
  pages        = {245--265},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523191},
  doi          = {10.1007/BF02523191},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChazelleP97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Chen97,
  author       = {Lin Chen},
  title        = {Efficient Parallel Recognition of Some Circular Arc Graphs, {II}},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {3},
  pages        = {266--280},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523192},
  doi          = {10.1007/BF02523192},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Chen97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/CohenELR97,
  author       = {Robert F. Cohen and
                  Peter Eades and
                  Tao Lin and
                  Frank Ruskey},
  title        = {Three-Dimensional Graph Drawing},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {2},
  pages        = {199--208},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02522826},
  doi          = {10.1007/BF02522826},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CohenELR97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DehneK97,
  author       = {Frank K. H. A. Dehne and
                  Rolf Klein},
  title        = {"The Big Sweep": On the Power of the Wavefront Approach to Voronoi
                  Diagrams},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {1},
  pages        = {19--32},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523236},
  doi          = {10.1007/BF02523236},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DehneK97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DixonT97,
  author       = {Brandon Dixon and
                  Robert Endre Tarjan},
  title        = {Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic
                  Time},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {1},
  pages        = {11--18},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523235},
  doi          = {10.1007/BF02523235},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DixonT97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GranotST97,
  author       = {Frieda Granot and
                  Jadranka Skorin{-}Kapov and
                  Amir Tamir},
  title        = {Using Quadratic Programming to Solve High Multiplicity Scheduling
                  Problems on Parallel Machines},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {2},
  pages        = {100--110},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02522821},
  doi          = {10.1007/BF02522821},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GranotST97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GreenbergS97,
  author       = {Ronald I. Greenberg and
                  Jau{-}Der Shih},
  title        = {Minimizing Channel Density with Movable Terminals},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {2},
  pages        = {89--99},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02522820},
  doi          = {10.1007/BF02522820},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GreenbergS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GuhaS97,
  author       = {Sumanta Guha and
                  Ichiro Suzuki},
  title        = {Proximity Problems for Points on a Rectilinear Plane with Rectangular
                  Obstacles},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {3},
  pages        = {281--307},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523193},
  doi          = {10.1007/BF02523193},
  timestamp    = {Wed, 25 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GuhaS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HagerupK97,
  author       = {Torben Hagerup and
                  Miroslaw Kutylowski},
  title        = {Fast Integer Merging on the {EREW} {PRAM}},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {1},
  pages        = {55--66},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523238},
  doi          = {10.1007/BF02523238},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HagerupK97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HambruschT97,
  author       = {Susanne E. Hambrusch and
                  Hung{-}Yi Tu},
  title        = {New Algorithms for Minimizing the Longest Wire Length During Circuit
                  Compaction},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {4},
  pages        = {426--448},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523682},
  doi          = {10.1007/BF02523682},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HambruschT97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HanPR97,
  author       = {Yijie Han and
                  Victor Y. Pan and
                  John H. Reif},
  title        = {Efficient Parallel Algorithms for Computing All Pair Shortest Paths
                  in Directed Graphs},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {4},
  pages        = {399--415},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523680},
  doi          = {10.1007/BF02523680},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HanPR97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KaufmannS97,
  author       = {Michael Kaufmann and
                  Jop F. Sibeyn},
  title        = {Randomized Multipacket Routing and Sorting on Meshes},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {3},
  pages        = {224--244},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523190},
  doi          = {10.1007/BF02523190},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KaufmannS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/MehlhornSU97,
  author       = {Kurt Mehlhorn and
                  R. Sundar and
                  Christian Uhrig},
  title        = {Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic
                  Time},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {2},
  pages        = {183--198},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02522825},
  doi          = {10.1007/BF02522825},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MehlhornSU97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Pellegrini97,
  author       = {Marco Pellegrini},
  title        = {On Counting Pairs of Intersecting Segments and Off-Line Triangle Range
                  Searching},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {4},
  pages        = {380--398},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523679},
  doi          = {10.1007/BF02523679},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Pellegrini97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Rimon97,
  author       = {Elon Rimon},
  title        = {Construction of C-Space Roadmaps from Local Sensory Data. What Should
                  the Sensors Look For?},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {4},
  pages        = {357--379},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523678},
  doi          = {10.1007/BF02523678},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Rimon97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/RomerR97,
  author       = {Theodore H. Romer and
                  Louis E. Rosier},
  title        = {An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related
                  to Pinwheel Scheduling},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {1},
  pages        = {1--10},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523234},
  doi          = {10.1007/BF02523234},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/RomerR97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Wenger97,
  author       = {Rephael Wenger},
  title        = {Randomized Quickhull},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {3},
  pages        = {322--329},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523195},
  doi          = {10.1007/BF02523195},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Wenger97.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.