scientific article; zbMATH DE number 1368469

zbMATH Open0976.68156MaRDI QIDQ4702188FDOQ4702188

Authors: K. Mehlhorn, S. Näher 

Publication date: 24 November 1999

Title of this publication is not available (Why is that?)

Recommendations

• LEDA. A platform for combinatorial and geometric computing. 2-part set
• scientific article; zbMATH DE number 1639663
• On the design of CGAL a computational geometry algorithms library
• scientific article; zbMATH DE number 1433426
• Computational Geometry in C

zbMATH Keywords

LEDA

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (only showing first 100 items - show all)

• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• A Linear Kernel for Planar Feedback Vertex Set
• Trading uninitialized space for time
• An intersection-sensitive algorithm for snap rounding
• Much Ado about Zero
• Delaunay triangulation of imprecise points in linear time after preprocessing
• Efficient authenticated data structures for graph connectivity and geometric search problems
• Minimum weight convex Steiner partitions
• An exact and efficient approach for computing a cell in an arrangement of quadrics
• Crossover can provably be useful in evolutionary computation
• Sweep synchronization as a global propagation mechanism
• A separation bound for real algebraic expressions
• Exact, efficient, and complete arrangement computation for cubic curves
• Voronoi diagram for services neighboring a highway
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
• Structural filtering: a paradigm for efficient and exact geometric programs
• Recognizing optimal 1-planar graphs in linear time
• Maintaining a topological order under edge insertions
• A framework for the verification of certifying computations
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
• An exact algorithm for side-chain placement in protein design
• Partitioning planar graphs: a fast combinatorial approach for max-cut
• An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
• A graph library for Isabelle
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Bid evaluation in procurement auctions with piecewise linear supply curves
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
• The weak-heap data structure: variants and applications
• Gallai-Edmonds decomposition as a pruning technique
• Linear-time certifying algorithms for near-graphical sequences
• Programming with C++ concepts
• A polynomial algorithm for the multicriteria cent-dian location problem
• On the design of CGAL a computational geometry algorithms library
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox
• Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
• ISB-tree: A new indexing scheme with efficient expected behaviour
• On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
• Tree decompositions of graphs: saving memory in dynamic programming
• A cubic kernel for feedback vertex set and loop cutset
• Title not available (Why is that?)
• LEDA
• Title not available (Why is that?)
• Shortest path and maximum flow problems in networks with additive losses and gains
• Short trees in polygons
• Global constraints for round robin tournament scheduling.
• Experiments on data reduction for optimal domination in networks
• Reducing rank-maximal to maximum weight matching
• Arrangements on parametric surfaces. I: General framework and infrastructure
• Polygon decomposition for efficient construction of Minkowski sums
• An efficient local approach to convexity testing of piecewise-linear hypersurfaces
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Computational study on planar dominating set problem
• Certifying algorithms
• Computing the topology of an arrangement of implicitly defined real algebraic plane curves
• GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance
• Classroom examples of robustness problems in geometric computations
• A general approach to the analysis of controlled perturbation algorithms
• ILIGRA: an efficient inverse line graph algorithm
• The infection time of graphs
• The point of polygon problem for arbitrary polygons
• Parallelization alternatives and their performance for the convex hull problem
• Cardinal directions between spatial objects: the pairwise-consistency problem
• An extended model and a column generation algorithm for the planar multicommodity flow problem
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
• Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
• Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture
• On Nonparametric Maximum Likelihood Estimation with Interval Censoring and Left Truncation
• Simple algorithms for partial point set pattern matching under rigid motion
• Sorting and searching in faulty memories
• Certifying 3-edge-connectivity
• Multi-core Implementations of Geometric Algorithms
• Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
• Solving a gas-lift optimization problem by dynamic programming
• Low-energy excitations in the three-dimensional random-field Ising model
• On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
• An adaptable and extensible geometry kernel
• Finding strong components using depth-first search
• Title not available (Why is that?)
• Point-to-point and multi-goal path planning for industrial robots
• Spin glasses: a computational challenge for the 21st century
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
• A decomposition-based approach to layered manufacturing
• Computing orthogonal drawings with the minimum number of bends
• Approximation algorithms in combinatorial scientific computing
• Of What Use Is Floating-Point Arithmetic in Computational Geometry?
• On a routing and scheduling problem concerning multiple edge traversals in graphs
• A generalization of the scaling max-flow algorithm
• Classification of robust cycle bases and relations to fundamental cycle bases
• Metabolic isotopomer labeling systems. II: Structural flux identifiability analysis.
• A Lagrangian relaxation approach for the multiple sequence alignment problem
• Dynamic Matching Algorithms in Practice
• Empirical study of exact algorithms for the multi-objective spanning tree
• Trustworthy Graph Algorithms (Invited Talk)
• A package for exact kinetic data structures and sweepline algorithms
• Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
• Building Mathematics-Based Software Systems to Advance Science and Create Knowledge
• Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
• Is the World Linear?

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702188)