Journal: Algorithmica

Found 758 papers in total
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
2002,
We consider the total weighted completion time scheduling problem for parallel...
Polygonal Representations of Digital Sets
Polygonal Representations of Digital Sets
2004,
In the context of discrete curve evolution the following problem is of relevance:...
Decomposition of a Three‐Dimensional Discrete Object Surface into Discrete Plane Pieces
Decomposition of a Three‐Dimensional Discrete Object Surface into Discrete Plane Pieces
2004,
This paper deals with the polyhedrization of discrete volumes. The aim is to do a...
Comparison of Distance Measures for Planar Curves
Comparison of Distance Measures for Planar Curves
2004,
The Hausdorff distance is a very natural and straightforward distance measure for...
Combinatorial and Experimental Methods for Approximate Point Pattern Matching
Combinatorial and Experimental Methods for Approximate Point Pattern Matching
2004,
Point pattern matching is an important problem in computational geometry, with...
Free‐Form Pose Estimation by Using Twist Representations
Free‐Form Pose Estimation by Using Twist Representations
2004,
In this article we discuss the 2D–3D pose estimation problem of 3D...
Finding the Consensus Shape for a Protein Family
Finding the Consensus Shape for a Protein Family
2004,
We define and prove properties of the consensus shape for a protein family , a...
New Results on Path Approximation
New Results on Path Approximation
2004,
In this paper we give bounds on the complexity of some algorithms for approximating...
Covering with Ellipses
Covering with Ellipses
2004,
We address the problem of how to cover a set of required points by a small number of...
Testing the Quality ofManufactured Disks and Balls
Testing the Quality ofManufactured Disks and Balls
2004,
We consider the problem of testing the roundness of manufactured disks and balls using...
Approximating the Medial Axis from the Voronoi Diagram with a ConvergenceGuarantee
Approximating the Medial Axis from the Voronoi Diagram with a ConvergenceGuarantee
2004,
The medial axis of a surface in 3D is the closure of all points that have two or more...
A Reflective Symmetry Descriptor for 3D Models
A Reflective Symmetry Descriptor for 3D Models
2004,
Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer...
Blowing Bubbles for Multi‐Scale Analysis and Decomposition ofTriangle Meshes
Blowing Bubbles for Multi‐Scale Analysis and Decomposition ofTriangle Meshes
2004,
Tools for the automatic decomposition of a surface into shape features will facilitate...
Parallel Computation of the Topology of Level Sets
Parallel Computation of the Topology of Level Sets
2004,
This paper introduces two efficient algorithms that compute the Contour Tree of a...
Compressing Two‐Dimensional Routing Tables
Compressing Two‐Dimensional Routing Tables
2003,
We consider an algorithmic problem that arises in the context of routing tables used...
An Explicit Lower Bound for TSP with Distances One and Two
An Explicit Lower Bound for TSP with Distances One and Two
2003,
We show that, for any ϵ>0 , it is NP‐hard to approximate the...
Approximate Matching of Run‐Length Compressed Strings
Approximate Matching of Run‐Length Compressed Strings
2003,
We focus on the problem of approximate matching of strings that have been compressed...
Weighted Matching in the Semi‐Streaming Model
Weighted Matching in the Semi‐Streaming Model
2012,
We present an approximation algorithm to find a weighted matching of a graph in the...
Biased Range Trees
Biased Range Trees
2012,
A data structure, called a biased range tree , is presented that preprocesses a set S...
Complexity of Finding Graph Roots with Girth Conditions
Complexity of Finding Graph Roots with Girth Conditions
2012,
Graph G is the square of graph H if two vertices x , y have an edge in G if and only...
Stronger Lempel‐Ziv Based Compressed Text Indexing
Stronger Lempel‐Ziv Based Compressed Text Indexing
2012,
Given a text T [1.. u ] over an alphabet of size σ , the full‐text search...
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
2012,
We continue the study of bin packing with splittable items and cardinality...
A Linear Algorithm for the Random Sampling from Regular Languages
A Linear Algorithm for the Random Sampling from Regular Languages
2012,
We present the first linear algorithm for the random sampling from regular languages....
A Self‐stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
A Self‐stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
2012,
Given a graph G =( V , E ), a vertex v of G is a median vertex if it minimizes the sum...
Papers per page: