Author of the publication

An improved approximation ratio for the minimum linear arrangement problem.

, and . Inf. Process. Lett., 101 (1): 26-29 (2007)

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

Robust Combinatorial Optimization with Exponential Scenarios., , , and . IPCO, volume 4513 of Lecture Notes in Computer Science, page 439-453. Springer, (2007)The RPR2 Rounding Technique for Semidefinite Programs., and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 213-224. Springer, (2001)Demand Queries with Preprocessing., and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 477-488. Springer, (2014)On the Cost of Recomputing: Tight Bounds on Pebbling with Faults., , and . ICALP, volume 820 of Lecture Notes in Computer Science, page 47-58. Springer, (1994)A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium., and . SAGT, volume 6386 of Lecture Notes in Computer Science, page 138-149. Springer, (2010)On the Hardness of Computing the Permanent of Random Matrices., and . Comput. Complex., 6 (2): 101-132 (1997)The Noisy Oracle Problem., , and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 284-296. Springer, (1988)Interactive Proofs and the Hardness of Approximating Cliques., , , , and . J. ACM, 43 (2): 268-292 (1996)Contagious Sets in Expanders., , , and . SODA, page 1953-1987. SIAM, (2015)A Tight Negative Example for MMS Fair Allocations., , and . WINE, volume 13112 of Lecture Notes in Computer Science, page 355-372. Springer, (2021)