Author of the publication

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

Computing Roots of Graphs Is Hard., and . Discret. Appl. Math., 54 (1): 81-88 (1994)Finding large cycles in Hamiltonian graphs., and . Discret. Appl. Math., 158 (8): 882-893 (2010)Approximate Frequency Counts over Data Streams., and . Proc. VLDB Endow., 5 (12): 1699 (2012)Perfect Graphs and Orthogonally Convex Covers., , and . SIAM J. Discret. Math., 2 (3): 371-392 (1989)RAPID: Randomized pharmacophore identification for drug design., , , , , , and . Comput. Geom., 10 (4): 263-272 (1998)The Probabilistic Method Yields Deterministic Parallel Algorithms., , and . J. Comput. Syst. Sci., 49 (3): 478-516 (1994)k-connected spanning subgraphs of low degree., , and . Electron. Colloquium Comput. Complex., (2006)Finding large cycles in Hamiltonian graphs., and . Electron. Colloquium Comput. Complex., (2006)On Syntactic versus Computational Views of Approximability, , , and . Electron. Colloquium Comput. Complex., (1995)Randomized Algorithms., and . Cambridge University Press, (1995)