Author of the publication

Enumeration of isolated cliques and pseudo-cliques.

, and . ACM Trans. Algorithms, 5 (4): 40:1-40:21 (2009)

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

Worst-Case Upper Bounds for kSAT (Column: Algorithmics).. Bulletin of the EATCS, (2004)Exponential Lower Bounds for the Tree-Like Hajós Calculus., and . Inf. Process. Lett., 54 (5): 289-294 (1995)Avoiding Routing Loops on the Internet., , , and . SIROCCO, volume 13 of Proceedings in Informatics, page 197-210. Carleton Scientific, (2002)Improved upper bounds for 3-SAT., and . SODA, page 328. SIAM, (2004)Approximating vertex cover on dense graphs., and . SODA, page 582-589. SIAM, (2005)Separating Oblivious and Non-oblivious BPs., , and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 28-38. Springer, (2001)Online Independent Sets., , , and . COCOON, volume 1858 of Lecture Notes in Computer Science, page 202-209. Springer, (2000)Stable Nash Equilibria in the Gale-Shapley Matching Game., , and . CoRR, (2015)Correction: Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts. Algorithms 2014, 7, 166-185.. Algorithms, 7 (2): 188 (2014)A (2.954 epsilon)n oblivious routing algorithm on 2D meshes., and . SPAA, page 186-195. ACM, (2000)