( en | de | ru )

 

Disambiguation of "Monti, Angelo"

Author of the publication

copydeleteadd this publication to your clipboard
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees.

, , and . ICTCS, volume 1720 of CEUR Workshop Proceedings, page 103-121. CEUR-WS.org, (2016)

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.

Ingrid Monti

Lanfranco Monti

Jan Monti

Gianni Monti

Alessandro Monti

 

Other publications of authors with the same name

Trade-off Between Computational Power and Common Knowledge in Anonymous Rings., , and . SIROCCO, page 35-48. Carleton University Press, (1994)On dynamic threshold graphs and related classes., , and . Theor. Comput. Sci., (2018)On Star-Multi-interval Pairwise Compatibility Graphs., and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 267-278. Springer, (2023)On Graphs that are not Star-k-PCGs (short paper)., and . ICTCS, volume 3587 of CEUR Workshop Proceedings, page 92-97. CEUR-WS.org, (2023)Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks., , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 452-463. Springer, (2001)An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem., , and . WG, volume 4769 of Lecture Notes in Computer Science, page 154-165. Springer, (2007)Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)., , , and . IWOCA, volume 10979 of Lecture Notes in Computer Science, page 39-51. Springer, (2018)Flooding Time of Edge-Markovian Evolving Graphs., , , , and . SIAM J. Discret. Math., 24 (4): 1694-1712 (2010)Testing and Reconfiguration of VLSI Linear Arrays., , and . Theor. Comput. Sci., 197 (1-2): 171-188 (1998)On the Complexity of Some Reachability Problems., and . CIAC, volume 778 of Lecture Notes in Computer Science, page 192-202. Springer, (1994)