Author of the publication

Recognizing Bipartite Incident-Graphs of Circulant Digraphs.

, , and . WG, volume 1665 of Lecture Notes in Computer Science, page 215-227. Springer, (1999)

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

A Meta-Theorem for Distributed Certification., , , and . Algorithmica, 86 (2): 585-612 (February 2024)A topological perspective on distributed network algorithms., , , , , and . Theor. Comput. Sci., (2021)Present-Biased Optimization., , and . CoRR, (2020)Local certification of graphs with bounded genus., , , , , and . Discret. Appl. Math., (2023)Present-biased optimization., , and . Math. Soc. Sci., (2022)Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth., , , , and . PODC, page 205-208. ACM, (2024)The topology of local computing in networks., and . J. Appl. Comput. Topol., 8 (4): 1069-1098 (September 2024)A Topological Perspective on Distributed Network Algorithms., , , , , and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 3-18. Springer, (2019)A Meta-Theorem for Distributed Certification., , , and . SIROCCO, volume 13298 of Lecture Notes in Computer Science, page 116-134. Springer, (2022)How Do Mobile Agents Benefit from Randomness?. SSS, volume 13046 of Lecture Notes in Computer Science, page 90-107. Springer, (2021)