( en | de | ru )

 

Disambiguation of "Monti, Angelo"

Author of the publication

copydeleteadd this publication to your clipboard
Some classes of graphs that are not PCGs.

, , , and . CoRR, (2017)

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

On dynamic threshold graphs and related classes., , and . Theor. Comput. Sci., (2018)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)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)Some classes of graphs that are not PCGs., , , and . CoRR, (2017)On the Complexity of Some Reachability Problems., and . CIAC, volume 778 of Lecture Notes in Computer Science, page 192-202. Springer, (1994)Flooding Time of Edge-Markovian Evolving Graphs., , , , and . SIAM J. Discret. Math., 24 (4): 1694-1712 (2010)On the Computational Complexity of Graph Closures.. Inf. Process. Lett., 57 (6): 291-295 (1996)Trade-off Between Computational Power and Common Knowledge in Anonymous Rings., , and . SIROCCO, page 35-48. Carleton University Press, (1994)Systolic tree omega-Languages: the operational and the logical view., and . Theor. Comput. Sci., 233 (1-2): 1-18 (2000)