K. Mehlhorn and S. N aher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Home/Search Document Details and Download
Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Certifying Algorithms for Recognizing Interval Graphs and.. - Graphs Dieter Kratsch Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn, S. Naher and C. Uhrig, The LEDA platform for combinatorial and geometric computing, Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), LNCS, 1256 (1997), pp. 7--16.
Certifying Algorithms for Recognizing Interval Graphs and.. - Graphs Dieter Kratsch Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher, The LEDA Platform for Combinatorial and Geometric Computing, Cambridge University Press, 1999.
Resource Constrained Shortest Paths - Kurt Mehlhorn And (2000) (4 citations) Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. The LEDA platform for combinatorial and geometric computing. Cambridge University Press, 1999.
Exact Geometric Computation in LEDA - Burnikel Konemann Mehlhorn (1995) (36 citations) Self-citation (Mehlhorn Naher) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. CACM, Jan. 1995.
A Separation Bound for Real Algebraic Expressions - Christoph Burnikel Stefan (2001) (6 citations) Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages.
A Polynomial-Time Fragment of Dominance Constraints - Koller, Mehlhorn, Niehren (2000) (3 citations) Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. 1999. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge. See also http://www.mpi-sb. mpg.de/LEDA/.
EXACUS: Efficient and Exact Algorithms for Curves and.. - Berberich.. Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000.
A Heuristic for Dijkstra's Algorithm with - Many Targets And Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. N aher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages.
Geometric Computing with CGAL and LEDA - Kurt Mehlhorn And Self-citation (Mehlhorn) (Correct)
No context found.
Mehlhorn, K., and S. Naher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Extending LEDA to Secondary Memory - Andreas Crauser And (1999) Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. Draft versions of some chapters are available at
Controlled Perturbation for Delaunay Triangulations - Stefan Funke Christian Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages.
A Strong and Easily Computable Separation Bound.. - Burnikel.. (1997) (9 citations) Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A Platform for Combinatorial and Geometric Computing. Communications of the ACM, 38(1):96--102, 1995. cf. http://www.mpi-sb.mpg.de/LEDA/leda.html.
Implementing Minimum Cycle Basis Algorithms - Mehlhorn, Michail (2005) Self-citation (Mehlhorn) (Correct)
No context found.
Mehlhorn, K., Naher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press (1999)
Implementation of O(nm log n) Weighted Matchings in General.. - Mehlhorn, Schäfer Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages.
A Separation Bound for Real Algebraic Expressions - Burnikel, Funke, Mehlhorn.. (2001) (6 citations) Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages.
Accelerating Heuristic Search in Spatial Domains - Stefan Edelkamp Shahid (2003) (Correct)
No context found.
K. Mehlhorn and S. N aher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Distance Patterns in Structural Similarity - Kämpke (2006) (Correct)
No context found.
Kurt Mehlhorn and Stephan N aher. LEDA A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, 2000.
A Coarse Grained Parallel Algorithm - For Hausdorff Voronoi (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: a platform for combinatorial and geometric computing. Communications of the ACM, 38(1):96--102, 1995.
Multicommodity Flow Approximation used for - Exact Graph Partitioning (Correct)
No context found.
K Mehlhorn and S. Nhler. LEDA: A Platform for Combinatorial and Geometric Computing. Communications of the ACM, 38(1):96--102, 1995.
Multicommodity Flow Approximation used for - Exact Graph Partitioning (2003) (Correct)
No context found.
K Mehlhorn and S. Nhler. LEDA: A Platform for Combinatorial and Geometric Computing. Communications of the ACM, 38(1):96--102, 1995.
Compact Representations Of Simplicial - Meshes In Two (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Automatic Generation of Staged Geometric Predicates - Aleksandar Nanevski Carnegie (2001) (1 citation) (Correct)
No context found.
K. Mehlhofl and S. Naher. LEDA:A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Graph Drawing and Manipulation with LINK - Jonathan Berry Nathaniel (1997) (5 citations) (Correct)
No context found.
K. Mehlhorn and S. Nahger. Leda: A platform for combinatorial and geometric computing. CACM, 38(1):96--102, Jan 1995.
Workspace-based Connectivity Oracle - An Adaptive Sampling.. - Kurniawati, Hsu (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
of the Psuedo ow Algorithm for the Maximum Flow - Anderson November Pseduo (Correct)
No context found.
Kurt Mehlhorn and Stefan Naher. Leda: Platform for Combinatorial and Geometric Computing. Cambridge University Press, 2000.
A Coarse Grained Parallel Algorithm - For Hausdorff Voronoi (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: a platform for combinatorial and geometric computing. Communications of the ACM, 38(1):96--102, 1995.
A Multilevel Algorithm for the Minimum 2-sum Problem - Safro, Ron, Brandt (2006) (Correct)
No context found.
K. Mehlhorn and S. Naher. Leda: a platform for combinatorial and geometric computing. Commun. ACM, 38(1):96--102, 1995.
Using Three-Valued Logic to Specify and Verify - Algorithms Of Computational (Correct)
No context found.
K. Mehlhorn and S. Naher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Efficient Convergence to Pure Nash Equilibria in Weighted .. - Panagopoulou, Spirakis (2005) (Correct)
No context found.
Mehlhorn, K., Naher, S.: LEDA -- A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Dependable Polygon-Processing Algorithms for Safety-Critical .. - Brandt, Schneider (2005) (Correct)
No context found.
K. Mehlhorn and S. Nher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Compact Data Structures with Fast Queries - Blandford (2005) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Distributed Algorithms and Educational Simulation/Visualisation.. - Koldehofe (2005) (Correct)
No context found.
Mehlhorn, K. and Nher, S. 1999. LEDA: A Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, England.
Integrating a Simulation-Visualisation Environment.. - Koldehofe.. (2003) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, England, Jan. 1999.
Routing in All-Optical Ring Networks Revisited - Stefanakos, Erlebach (2004) (Correct)
No context found.
K. Mehlhorn and S. Nher, LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.
An Evolutionary Annealing Approach to Graph Coloring - Fotakis, Likothanassis.. (2001) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.
Jacobi Curves: Computing the Exact Topology of Arrangements of.. - Wolpert (2000) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA -- A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Common subexpression search in LEDA reals - a study of the.. - Schmitt (2004) (Correct)
No context found.
K. Mehlhorn and S. Naher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999, 1018 pages.
Unknown - Ist- Ective Computational (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000. 13
Finding Planar Regions in a Terrain - in Practice and with .. - Funke, Malamatos, Ray (2000) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, U.K., 1999.
Algorithm Engineering - Demetrescu, Finocchi, Italiano (2003) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A Platform of Combinatorial and Geometric Computing. Cambrige University Press, 1999.
Sorting and Searching in the Presence of Memory Faults.. - Finocchi, Italiano (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.
Map Labeling - Wolff (1995) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. N aher, LEDA: a platform for combinatorial and geometric computing, Communications of the ACM 38 (1995) 96--102
Engineering an External Memory Minimum Spanning Tree.. - Dementiev, Sanders.. (2004) (Correct)
No context found.
K. Mehlhorn and S. Nher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Geometric Travel Planning - Edelkamp, Jabbar, Willhalm (2003) (Correct)
No context found.
K. Mehlhorn and S. N aher, The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Using Sifting for k-Layer Straightline Crossing.. - Matuszewski, Schönfeld.. (1999) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. Naher. The Leda Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page at http://www.mpi-sb.mpg.de/LEDA/.
Geometric Travel Planning - Edelkamp, Jabbar, l. (2003) (Correct)
No context found.
K. Mehlhorn and S. N aher, The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Combining Speed-Up Techniques for Shortest-Path Computations - Holzer, Schulz, Willhalm (2004) (Correct)
No context found.
Naher, S., Mehlhorn, K.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press (1999) (http://www.algorithmicsolutions. com).
A Tutorial for Designing Flexible Geometric Algorithms - Kapoor, Kühl, Wolff (Correct)
No context found.
Kurt Mehlhorn and Stefan Naher. LEDA: A Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, England, January 1999.
A Barcode Shape Descriptor for Curve Point - Cloud Data Anne (Correct)
No context found.
K. Mehlhorn, S. Naher, The LEDA Platform of Combinatorial and Geometric Computing, Cambridge University Press, Cambridge, UK, 1999.
Engineering a Sorted List Data Structure for 32 Bit Keys - Dementiev, Kettner.. (Correct)
No context found.
K. Mehlhorn and S. Naher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC