LEDA

swMATH509MaRDI QIDQ13265FDOQ13265

Author name not available (Why is that?)

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

• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• Bounded ordered dictionaries in O(log log N) time and O(n) space
• In Praise of Numerical Computation
• Title not available (Why is that?)
• Trading uninitialized space for time
• An intersection-sensitive algorithm for snap rounding
• Delaunay triangulation of imprecise points in linear time after preprocessing
• An integer programming algorithm for routing optimization in IP networks
• Minimum weight convex Steiner partitions
• COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
• How to Decrease the Degree of Envy in Allocations of Indivisible Goods
• An exact and efficient approach for computing a cell in an arrangement of quadrics
• Experimental and Efficient Algorithms
• Speeding up the incremental construction of the union of geometric objects in practice.
• A combinatorial approximation algorithm for concurrent flow problem and its application
• A separation bound for real algebraic expressions
• Exact, efficient, and complete arrangement computation for cubic curves
• Structural filtering: a paradigm for efficient and exact geometric programs
• Maintaining a topological order under edge insertions
• A framework for the verification of certifying computations
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
• A graph library for Isabelle
• Title not available (Why is that?)
• 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
• Practical Guide to Computer Simulations
• Linear-time certifying algorithms for near-graphical sequences
• Title not available (Why is that?)
• Experimental and Efficient Algorithms
• Title not available (Why is that?)
• Programming with C++ concepts
• Infimaximal Frames: A Technique for Making Lines Look Like Segments
• On cycles and the stable multi-set polytope
• 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
• Open problems on graph eigenvalues studied with AutoGraphiX
• An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
• On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms – ESA 2004
• Algorithms for the multiple label placement problem
• Shortest path and maximum flow problems in networks with additive losses and gains
• How to make OR-results available: A proposal for project scheduling
• The complexity of searching succinctly represented graphs
• Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
• Topological mesh operators
• Graph layering by promotion of nodes
• 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
• AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
• Computing the topology of an arrangement of implicitly defined real algebraic plane curves
• A general approach to the analysis of controlled perturbation algorithms
• A computational basis for higher-dimensional computational geometry and applications
• The infection time of graphs
• Checking geometric programs or verification of geometric structures
• The point of polygon problem for arbitrary polygons
• Optimal scrap combination for steel production
• Parallelization alternatives and their performance for the convex hull problem
• On design and implementation of a generic number type for real algebraic number computations based on expression dags
• Title not available (Why is that?)
• Parametric search made practical
• Simple algorithms for partial point set pattern matching under rigid motion
• Sorting and searching in faulty memories
• Constructive root bound for \(k\)-ary rational input numbers
• Certifying 3-edge-connectivity
• Filtering policies in loss queueing network location problems
• Advanced programming techniques applied to CGAL's arrangement package
• Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
• A special case of Mahler's conjecture
• Low-energy excitations in the three-dimensional random-field Ising model
• Evaluating signs of determinants using single-precision arithmetic
• Title not available (Why is that?)
• Parameterized complexity: exponential speed-up for planar graph problems
• Title not available (Why is that?)
• Polynomial-time data reduction for dominating set
• Much Ado about Zero
• Title not available (Why is that?)
• Title not available (Why is that?)
• An object-oriented design for graph visualization
• Efficient authenticated data structures for graph connectivity and geometric search problems
• Minimum-cost flow algorithms: an experimental evaluation
• Crossover can provably be useful in evolutionary computation
• Randomized search trees
• Voronoi diagram for services neighboring a highway
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Title not available (Why is that?)
• Recognizing optimal 1-planar graphs in linear time
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
• An exact algorithm for side-chain placement in protein design
• Title not available (Why is that?)
• Partitioning planar graphs: a fast combinatorial approach for max-cut
• Exact primitives for smallest enclosing ellipses
• An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• The weak-heap data structure: variants and applications
• Gallai-Edmonds decomposition as a pruning technique

This page was built for software: LEDA