An approximation algorithm for circular arc colouring
- V. Kumar
- 2001
- Algorithmica (New York)
Paper
Publications
35 results at Algorithmica (New York)
Efficient regular data structures and algorithms for dilation, location, and proximity problems
- A. Amir
- A. Efrat
- et al.
- 2001
- Algorithmica (New York)
PaperSolving systems of difference constraints incrementally
- G. Ramalingam
- Junehwa Song
- et al.
- 1999
- Algorithmica (New York)
PaperTwo-way and multiway partitioning of a set of intervals for clique-width maximization
- A.H. Farrahi
- D.T. Lee
- et al.
- 1999
- Algorithmica (New York)
PaperA new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- E. Papadopoulou
- D.T. Lee
- 1998
- Algorithmica (New York)
PaperApproximating minimum feedback sets and multicuts in directed graphs
- G. Even
- J. Naor
- et al.
- 1998
- Algorithmica (New York)
PaperMaintaining spanning trees of small diameter
- G.F. Italiano
- Rajiv Ramaswami
- 1998
- Algorithmica (New York)
PaperThe Bit Complexity of Distributed Sorting
- O. Gerstel
- S. Zaks
- 1997
- Algorithmica (New York)
PaperReconstructing surfaces and functions on surfaces from unorganized three-dimensional data
- C.L. Bajaj
- Fausto Bernardini
- et al.
- 1997
- Algorithmica (New York)
PaperOrthogonal Queries in Segments
- Takeshi Tokuyama
- 1997
- Algorithmica (New York)
Paper