Author of the publication

Why Certain Subgraph Computations Require Only Linear Time

, , and . FOCS, page 117-125. IEEE Computer Society, (1985)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Algorithms for Coloring Quadtrees., , and . Algorithmica, 32 (1): 87-94 (2002)Visibility with a Moving Point of View., , , and . SODA, page 107-117. SIAM, (1990)Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs., , and . J. Algorithms, 8 (2): 216-235 (1987)Spectrum Fusion: Using Multiple Mass Spectra for De Novo Peptide Sequencing., and . RECOMB, volume 4955 of Lecture Notes in Computer Science, page 140-153. Springer, (2008)Mesh Generation., and . Handbook of Computational Geometry, North Holland / Elsevier, (2000)Möbius-invariant natural neighbor interpolation., and . SODA, page 128-129. ACM/SIAM, (2003)On the Number of Minimal 1-Steiner Trees., , and . Discret. Comput. Geom., (1994)Polynomially solvable special cases of the Steiner problem in planar networks., and . Ann. Oper. Res., 33 (6): 403-418 (1991)Erratum: Polynomial-size nonobtuse triangulation of polygons., and . Int. J. Comput. Geom. Appl., 2 (4): 449-450 (1992)Algorithms for Coloring Quadtrees, , and . CoRR, (1999)