Author of the publication

Realizability of Graph Specifications: Characterizations and Algorithms.

, , , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 3-13. Springer, (2018)

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

The Power of Small Coalitions in Graphs., and . SIROCCO, volume 2 of Proceedings in Informatics, page 173-184. Carleton Scientific, (1995)Labeling schemes for flow and connectivity., , , and . SODA, page 927-936. ACM/SIAM, (2002)Approximating Minimum Max-Stretch spanning Trees on unweighted graphs., and . SODA, page 261-270. SIAM, (2004)An Optimal Synchronizer for the Hypercube., and . PODC, page 77-85. ACM, (1987)How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract)., and . PODC, page 290-299. ACM, (1996)The Complexity of Data Mining on the Web (Abstract)., , , and . PODC, page 153. ACM, (1996)A near-linear-time algorithm for computing replacement paths in planar directed graphs., , and . ACM Trans. Algorithms, 6 (4): 64:1-64:13 (2010)Informative Labeling Schemes for Graphs.. MFCS, volume 1893 of Lecture Notes in Computer Science, page 579-588. Springer, (2000)Low-Diameter Graph Decomposition is in NC., , , and . SWAT, volume 621 of Lecture Notes in Computer Science, page 83-93. Springer, (1992)Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks.. CAAN, volume 4235 of Lecture Notes in Computer Science, page 1-4. Springer, (2006)