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

Reductions That Preserve Approximability., and . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)Reductions, completeness and the hardness of approximability., and . Eur. J. Oper. Res., 172 (3): 719-739 (2006)Differential approximation of min sat., and . Eur. J. Oper. Res., 181 (2): 620-633 (2007)Structural parameters, tight bounds, and approximation for (k, r)-center., , and . Discret. Appl. Math., (2019)Proving completeness by logic., and . Int. J. Comput. Math., 82 (2): 151-161 (2005)An improved general procedure for lexicographic bottleneck problems., , and . Oper. Res. Lett., 24 (4): 187-194 (1999)Structurally Parameterized $d$-Scattered Set., , and . CoRR, (2017)Computing Optimal Solutions for the min 3-set covering Problem., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 685-692. Springer, (2005)Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation., , , , and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 896-907. Springer, (2004)Weighted Coloring: Further Complexity and Approximability Results., , and . ICTCS, volume 3701 of Lecture Notes in Computer Science, page 205-214. Springer, (2005)