Author of the publication

Exact and Approximation Algorithms for Densest k-Subgraph.

, , , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 114-125. Springer, (2013)

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

Approximating the max-edge-coloring problem., , , and . Theor. Comput. Sci., 411 (34-36): 3055-3067 (2010)Probabilistic graph-coloring in bipartite and split graphs., , , , and . J. Comb. Optim., 17 (3): 274-311 (2009)Using Topic Generation Model to explore the French Parliamentary Debates during the early Third Republic (1881-1899)., , and . DiPaDA@DHNB, volume 3133 of CEUR Workshop Proceedings, page 35-51. CEUR-WS.org, (2022)Fast algorithms for min independent dominating set, , and . CoRR, (2009)The max quasi-independent set problem., , , , , and . J. Comb. Optim., 23 (1): 94-117 (2012)Exact Algorithms for Dominating Clique Problems., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 4-13. Springer, (2009)A Bottom-Up Method and Fast Algorithms for max independent set., , , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 62-73. Springer, (2010)Exponential approximation schemata for some network design problems., , , and . J. Discrete Algorithms, (2013)Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms., , and . Discret. Appl. Math., 159 (17): 1954-1970 (2011)Fast Algorithms for min independent dominating set., , and . SIROCCO, volume 6058 of Lecture Notes in Computer Science, page 247-261. Springer, (2010)