Author of the publication

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems.

, , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 73-84. Springer, (2012)

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

On the probabilistic minimum coloring and minimum k-coloring., and . Discret. Appl. Math., 154 (3): 564-586 (2006)An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs., , and . IWPEC, volume 5018 of Lecture Notes in Computer Science, page 55-65. Springer, (2008)Efficient algorithms for the max k-vertex cover problem., and . J. Comb. Optim., 28 (3): 674-691 (2014)Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation., , and . CIAC, volume 12701 of Lecture Notes in Computer Science, page 202-215. Springer, (2021)Algorithms and Models for the On-Line Vertex-Covering., and . WG, volume 2573 of Lecture Notes in Computer Science, page 102-113. Springer, (2002)Steiner Forests on Stochastic Metric Graphs., , and . COCOA, volume 4616 of Lecture Notes in Computer Science, page 112-123. Springer, (2007)On the Performance of Congestion Games for Optimum Satisfiability Problems., , , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 220-231. Springer, (2007)On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems., , and . IEEE Trans. Computers, 40 (12): 1413-1418 (1991)An improved general procedure for lexicographic bottleneck problems., , and . Oper. Res. Lett., 24 (4): 187-194 (1999)Approximating the max-edge-coloring problem., , , and . Theor. Comput. Sci., 411 (34-36): 3055-3067 (2010)