The following pages link to LEDA (Q13265):
Displaying 50 items.
- Exact primitives for smallest enclosing ellipses (Q293400) (← links)
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662) (← links)
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance (Q351554) (← links)
- Crossover can provably be useful in evolutionary computation (Q418021) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox (Q458475) (← links)
- Certifying algorithms (Q465678) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Parametric search made practical (Q598230) (← links)
- Programming with C++ concepts (Q608245) (← links)
- ISB-tree: A new indexing scheme with efficient expected behaviour (Q616991) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- Arrangements on parametric surfaces. I: General framework and infrastructure (Q626974) (← links)
- Topological mesh operators (Q630999) (← links)
- Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture (Q644918) (← links)
- A general approach to the analysis of controlled perturbation algorithms (Q654290) (← links)
- On design and implementation of a generic number type for real algebraic number computations based on expression dags (Q655162) (← links)
- Evaluating signs of determinants using single-precision arithmetic (Q675307) (← links)
- An exact algorithm for side-chain placement in protein design (Q691432) (← links)
- A combinatorial approximation algorithm for concurrent flow problem and its application (Q707017) (← links)
- Cardinal directions between spatial objects: the pairwise-consistency problem (Q707346) (← links)
- Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- Filtering policies in loss queueing network location problems (Q816422) (← links)
- Trading uninitialized space for time (Q834884) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings (Q856671) (← links)
- The infection time of graphs (Q858307) (← links)
- Constructive root bound for \(k\)-ary rational input numbers (Q861279) (← links)
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
- An intersection-sensitive algorithm for snap rounding (Q868103) (← links)
- ILIGRA: an efficient inverse line graph algorithm (Q894425) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
- Improving the topology computation of an arrangement of cubics (Q945944) (← links)
- An efficient local approach to convexity testing of piecewise-linear hypersurfaces (Q955229) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- Low-energy excitations in the three-dimensional random-field Ising model (Q978939) (← links)
- Sorting and searching in faulty memories (Q1006385) (← links)
- Voronoi diagram for services neighboring a highway (Q1007626) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
