Author of the publication

Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem.

, , and . COCOA, volume 6831 of Lecture Notes in Computer Science, page 126-140. Springer, (2011)

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

Complexity of determining the most vital elements for the p-median and p-center location problems., , and . J. Comb. Optim., 25 (2): 191-207 (2013)Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures., , and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 154-166. Springer, (2010)On the Observability of Smart Grids and Related Optimization Methods., , , and . OR, page 281-287. Springer, (2019)The most vital nodes with respect to independent set and vertex cover., , and . Discret. Appl. Math., 159 (17): 1933-1946 (2011)Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem., , and . COCOA, volume 6831 of Lecture Notes in Computer Science, page 126-140. Springer, (2011)Critical edges for the assignment problem: Complexity and exact resolution., , and . Oper. Res. Lett., 41 (6): 685-689 (2013)Efficient determination of the k most vital edges for the minimum spanning tree problem., , and . Comput. Oper. Res., 39 (11): 2888-2898 (2012)An Object-Oriented Approach for Modelling Security Scenarios., , and . UKSim, page 396-400. IEEE, (2013)Algorithms and applications for a class of bilevel MILPs., , , and . Discret. Appl. Math., (2020)A survivable variant of the ring star problem., , , and . Networks, 83 (2): 324-347 (March 2024)