scientific article; zbMATH DE number 1368469
From MaRDI portal
Publication:4702188
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
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)
- 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?
- Certifying induced subgraphs in large graphs
- Practical algorithms for branch-decompositions of planar graphs
- Crossing minimization in weighted bipartite graphs
- A \(2/3\)-approximation algorithm for vertex-weighted matching
- Title not available (Why is that?)
- Computing cyclic invariants for molecular graphs
- Robustness and Randomness
- A simple certifying algorithm for 3-edge-connectivity
- Efficient Predicate Evaluation Using Randomized Degeneracy Detection
- Balancing sparse Hamiltonian eigenproblems
- An Improved Upward Planarity Testing Algorithm and Related Applications
- Computing large planar regions in terrains, with an application to fracture surfaces
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
- An experimental study on generating planar graphs
- Computing Large Planar Regions in Terrains
- Consistent digital curved rays and pseudoline arrangements
- Probabilistic data propagation in wireless sensor networks
- Improving the topology computation of an arrangement of cubics
- LEDA. A platform for combinatorial and geometric computing. 2-part set
- Attributed relational graph matching based on the nested assignment structure
- Graph Simultaneous Embedding Tool, GraphSET
- 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
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)
