thumbnail

Springer Science and Business Media LLC

  0178-4617

  1432-0541

 

Cơ quản chủ quản:  SPRINGER , Springer New York

Lĩnh vực:
Applied MathematicsComputer Science (miscellaneous)Computer Science Applications

Các bài báo tiêu biểu

A sweepline algorithm for Voronoi diagrams
- 1987
Steven Fortune
On multiple moving objects
Tập 2 Số 1-4 - Trang 477-521 - 1987
Michael Erdmann, Tomás Lozano‐Pérez
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
Tập 2 Số 1-4 - Trang 209-233 - 1987
Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert E. Tarjan
Randomized incremental construction of Delaunay and Voronoi diagrams
Tập 7 Số 1-6 - Trang 381-413 - 1992
Leonidas J. Guibas, Donald E. Knuth, Micha Sharir
Computational complexity of optimum multiuser detection
Tập 4 Số 1-4 - Trang 303-312 - 1989
Sergio Verdú
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
- 1998
Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
Tập 18 Số 1 - Trang 145-163 - 1997
Magnús M. Halldórsson, Jaikumar Radhakrishnan
The pairing heap: A new form of self-adjusting heap
- 1986
Michael L. Fredman, Robert Sedgewick, Daniel D. Sleator, Robert E. Tarjan
Competitive randomized algorithms for nonuniform problems
Tập 11 Số 6 - Trang 542-571 - 1994
Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan Owicki
The longest common subsequence problem revisited
- 1987
Alberto Apostolico, Concettina Guerra