LEDA
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Sorting and searching in faulty memories
- Voronoi diagram for services neighboring a highway
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- A Lagrangian relaxation approach for the multiple sequence alignment problem
- Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Computational study on planar dominating set problem
- Crossing minimization in weighted bipartite graphs
- Linear-time certifying algorithms for near-graphical sequences
- Computing the topology of an arrangement of implicitly defined real algebraic plane curves
- A computational basis for higher-dimensional computational geometry and applications
- Detecting geometric infeasibility
- Sign determination in residue number systems
- A special case of Mahler's conjecture
- Class Steiner trees and VLSI-design
- AGD
- Checking geometric programs or verification of geometric structures
- Optimal scrap combination for steel production
- CGAL
- Relocalization -- theory and practice
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
- MRC -- data structures and procedures for computing in monoid and group rings
- A workbench for computational geometry
- binstretch
- ParLeda
- PlaNet
- Short trees in polygons
- SYNAPS
- INGRID
- SCIL
- METAFONT
- Global constraints for round robin tournament scheduling.
- Speeding up the incremental construction of the union of geometric objects in practice.
- GraphBase
- GeoBench
- GraphXML
- VLSI
- LOOK
- JGAP
- EXACUS
- BRITE
- A polyhedral approach to sequence alignment problems
- EXPtime tableaux for ALC
- TPIE
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Software visualization. International seminar Dagstuhl Castle, Germany, May 20--25, 2001. Revised papers
- LOOK: A lazy object-oriented kernel design for geometric computation
- QuickHeapsort, an efficient mix of classical sorting algorithms
- Spin glasses: a computational challenge for the 21st century
- Geomview
- Edgebreaker
- PBGL
- Qhull
- Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
- PPRN
- Blossom V
- Blossom IV
- Recognizing optimal 1-planar graphs in linear time
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
- core 2
- MAPC
- LEMON
- MCF
- RelaxIV
- Miniball
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- GTL
- PIGALE
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- JGraphT
- Estimating the domain of attraction for uncertain polynomial systems
- Joint optimization for area traffic control and network flow
- SLEEF
- Local search for the Steiner tree problem in the Euclidean plane
- VRONI
- Metabolic isotopomer labeling systems. II: Structural flux identifiability analysis.
- AutoGraphiX
- Computing large planar regions in terrains, with an application to fracture surfaces
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- GeoWin
- Maintaining a topological order under edge insertions
- Optimal robot localization in trees
- Computers and discovery in algebraic graph theory
- A decomposition-based approach to layered manufacturing
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
- A generalization of the scaling max-flow algorithm
- STXXL
- MCSTL
- approxBlackhole
- gBlackhole
- How to make OR-results available: A proposal for project scheduling
- Algorithms for dense graphs and networks on the random access computer
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
- Randomized search trees
- The weak-heap data structure: variants and applications
- Mining blackhole and volcano patterns in directed graphs: a general approach
- CirclePack
- A graph library for Isabelle
- FindSteinerTree
- A \(2/3\)-approximation algorithm for vertex-weighted matching
This page was built for software: LEDA
