LEDA

swMATH509MaRDI QIDQ13265FDOQ13265

Author name not available (Why is that?)

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

• 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
• Estimating the domain of attraction for uncertain polynomial systems
• EXPtime tableaux for ALC
• Sign determination in residue number systems
• Theory of Real Computation According to EGC
• A polynomial algorithm for the multicriteria cent-dian location problem
• On the design of CGAL a computational geometry algorithms library
• JGAP: a Java-based graph algorithms platform
• A simple min-cut algorithm
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Class Steiner trees and VLSI-design
• Algorithms for dense graphs and networks on the random access computer
• New analysis and computational study for the planar connected dominating set problem
• Network service scheduling and routing
• Tree decompositions of graphs: saving memory in dynamic programming
• Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
• A cubic kernel for feedback vertex set and loop cutset
• Title not available (Why is that?)
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constant-work-space algorithms for shortest paths in trees and simple polygons
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• Heuristics for the maximum outerplanar subgraph problem
• Short trees in polygons
• Algorithms – ESA 2005
• Global constraints for round robin tournament scheduling.
• On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
• A faster algorithm for betweenness centrality*
• Experiments on data reduction for optimal domination in networks
• Reducing rank-maximal to maximum weight matching
• Title not available (Why is that?)
• A polyhedral approach to sequence alignment problems
• The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
• Title not available (Why is that?)
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Computational study on planar dominating set problem
• The design and implementation of panar maps in CGAL
• VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
• Certifying algorithms
• GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance
• Local search for the Steiner tree problem in the Euclidean plane
• Classroom examples of robustness problems in geometric computations
• Discovering and certifying lower bounds for the online bin stretching problem
• ILIGRA: an efficient inverse line graph algorithm
• Cardinal directions between spatial objects: the pairwise-consistency problem
• An extended model and a column generation algorithm for the planar multicommodity flow problem
• A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
• Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
• Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture
• Constraint satisfaction algorithms for graph pattern matching
• MRC -- data structures and procedures for computing in monoid and group rings
• Title not available (Why is that?)
• LOOK: A lazy object-oriented kernel design for geometric computation
• On Nonparametric Maximum Likelihood Estimation with Interval Censoring and Left Truncation
• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
• Joint optimization for area traffic control and network flow
• QuickHeapsort, an efficient mix of classical sorting algorithms
• Optimizing the quality control station configuration
• Shortest paths on dynamic graphs
• Model selection and error estimation
• Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
• Mining blackhole and volcano patterns in directed graphs: a general approach
• Solving a gas-lift optimization problem by dynamic programming
• LMI-based computation of optimal quadratic Lyapunov functions for odd polynomial systems
• 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

This page was built for software: LEDA