The following pages link to (Q4702188):
Displaying 50 items.
- LEDA (Q13265) (← 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)
- 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)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← 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)
- 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)
- An exact algorithm for side-chain placement in protein design (Q691432) (← 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)
- Trading uninitialized space for time (Q834884) (← links)
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings (Q856671) (← links)
- The infection time of graphs (Q858307) (← 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)
- 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)
- 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)
- A Lagrangian relaxation approach for the multiple sequence alignment problem (Q1016042) (← links)
- Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- Computing the topology of an arrangement of implicitly defined real algebraic plane curves (Q1045532) (← links)
- Short trees in polygons (Q1348253) (← links)
- Global constraints for round robin tournament scheduling. (Q1417492) (← links)
- Spin glasses: a computational challenge for the 21st century (Q1613752) (← links)
- Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks (Q1662465) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
