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

Minimal selectors and fault tolerant networks., , , and . Networks, 55 (4): 326-340 (2010)From Balls and Bins to Points and Vertices., , , and . Algorithmic Operations Research, 4 (2): 133-143 (2009)Hardness and Approximation of Traffic Grooming., , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 561-573. Springer, (2007)Study of a Combinatorial Game in Graphs Through Linear Programming., , , and . Algorithmica, 82 (2): 212-244 (2020)Hardness and approximation of Gathering in static radio networks., , , , and . PerCom Workshops, page 75-79. IEEE Computer Society, (2006)On the Path-Width of Planar Graphs., , and . SIAM J. Discret. Math., 23 (3): 1311-1316 (2009)Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter., , , , and . CoRR, (2020)GMPLS label space minimization through hypergraph layouts., , , , , and . Theor. Comput. Sci., (2012)Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols., and . SIAM J. Discret. Math., 17 (4): 521-540 (2004)On the Hardness of Equal Shortest Path Routing., , and . Electron. Notes Discret. Math., (2013)