From post

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.

 

Другие публикации лиц с тем же именем

Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem., , , , , и . WINE, том 4858 из Lecture Notes in Computer Science, стр. 404-411. Springer, (2007)On Approximating the d-Girth of a Graph., , и . SOFSEM, том 6543 из Lecture Notes in Computer Science, стр. 467-481. Springer, (2011)Approximating the Traffic Grooming Problem in Tree and Star Networks., , , , и . WG, том 4271 из Lecture Notes in Computer Science, стр. 147-158. Springer, (2006)The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation., , и . SEA², том 11544 из Lecture Notes in Computer Science, стр. 21-34. Springer, (2019)Online Coalition Structure Generation in Graph Games., , , , и . AAMAS, стр. 1353-1361. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology., , и . SIROCCO, том 5869 из Lecture Notes in Computer Science, стр. 281-294. Springer, (2009)On-line maximum matching in complete multi-partite graphs with an application to optical networks., , и . Discret. Appl. Math., (2016)On the complexity of the regenerator location problem treewidth and other parameters., , и . Discret. Appl. Math., (2016)Online Regenerator Placement., , , и . OPODIS, том 7109 из Lecture Notes in Computer Science, стр. 4-17. Springer, (2011)Minimum Reload Cost Graph Factors., , , и . CoRR, (2018)