Cited in
(only showing first 100 items - show all)- Graph Simultaneous Embedding Tool, GraphSET
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- Optimal robot localization in trees
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- An experimental study of priority queues in external memory
- Software visualization. International seminar Dagstuhl Castle, Germany, May 20--25, 2001. Revised papers
- Exact medial axis computation for circular arc boundaries
- A branch-and-price algorithm for switch-box routing
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- In Praise of Numerical Computation
- VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
- scientific article; zbMATH DE number 2086260 (Why is no real title available?)
- Trading uninitialized space for time
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- Parameterized complexity: exponential speed-up for planar graph problems
- scientific article; zbMATH DE number 1962158 (Why is no real title available?)
- An intersection-sensitive algorithm for snap rounding
- The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
- An adaptable and extensible geometry kernel
- Polynomial-time data reduction for dominating set
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Much Ado about Zero
- Maintaining dynamic minimum spanning trees: an experimental study
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- Efficient authenticated data structures for graph connectivity and geometric search problems
- An object-oriented design for graph visualization
- An integer programming algorithm for routing optimization in IP networks
- Point-to-point and multi-goal path planning for industrial robots
- Minimum weight convex Steiner partitions
- Computers and discovery in algebraic graph theory
- scientific article; zbMATH DE number 1820633 (Why is no real title available?)
- scientific article; zbMATH DE number 1947437 (Why is no real title available?)
- Maximum network flow with floating point arithmetic.
- scientific article; zbMATH DE number 1956209 (Why is no real title available?)
- scientific article; zbMATH DE number 1444339 (Why is no real title available?)
- Spin glasses: a computational challenge for the 21st century
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- Crossover can provably be useful in evolutionary computation
- scientific article; zbMATH DE number 1639663 (Why is no real title available?)
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
- Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
- scientific article; zbMATH DE number 5909229 (Why is no real title available?)
- Minimum-cost flow algorithms: an experimental evaluation
- Experimental and Efficient Algorithms
- A combinatorial approximation algorithm for concurrent flow problem and its application
- Speeding up the incremental construction of the union of geometric objects in practice.
- scientific article; zbMATH DE number 1982173 (Why is no real title available?)
- A decomposition-based approach to layered manufacturing
- A separation bound for real algebraic expressions
- Exact, efficient, and complete arrangement computation for cubic curves
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
- Voronoi diagram for services neighboring a highway
- Randomized search trees
- An Experimental Study and Comparison of Topological Peeling and Topological Walk
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
- FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE
- scientific article; zbMATH DE number 1962159 (Why is no real title available?)
- Structural filtering: a paradigm for efficient and exact geometric programs
- Detecting geometric infeasibility
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Continuous path verification in multi-axis NC-machining
- Recognizing optimal 1-planar graphs in linear time
- scientific article; zbMATH DE number 2080088 (Why is no real title available?)
- Maintaining a topological order under edge insertions
- An exact algorithm for side-chain placement in protein design
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- 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
- Exact primitives for smallest enclosing ellipses
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
- scientific article; zbMATH DE number 1424547 (Why is no real title available?)
- Relocalization -- theory and practice
- A graph library for Isabelle
- Computations that require higher than double precision for robust and exact decision making
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- scientific article; zbMATH DE number 1670643 (Why is no real title available?)
- Of What Use Is Floating-Point Arithmetic in Computational Geometry?
- Approximation algorithms in combinatorial scientific computing
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- Bid evaluation in procurement auctions with piecewise linear supply curves
- Gallai-Edmonds decomposition as a pruning technique
- A theoretical and experimental study on the construction of suffix arrays in external memory
- Dynamic proximity calculations for situation awareness
- A generalization of the scaling max-flow algorithm
- The weak-heap data structure: variants and applications
- On a routing and scheduling problem concerning multiple edge traversals in graphs
- Linear-time certifying algorithms for near-graphical sequences
- Estimating the domain of attraction for uncertain polynomial systems
- scientific article; zbMATH DE number 970258 (Why is no real title available?)
- Practical Guide to Computer Simulations
- EXPtime tableaux for ALC
- The complexity of searching implicit graphs
- Classification of robust cycle bases and relations to fundamental cycle bases
- Sign determination in residue number systems
- scientific article; zbMATH DE number 2079615 (Why is no real title available?)
- scientific article; zbMATH DE number 1875412 (Why is no real title available?)
- Metabolic isotopomer labeling systems. II: Structural flux identifiability analysis.
This page was built for software: LEDA
