Monti, Angelo
458  Ergebnisse:
Personensuche X
?
1

On Star-Multi-interval Pairwise Compatibility Graphs:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Monti, Angelo ; Sinaimeri, Blerina - p. 267-278 , 2023
 
?
3

Some classes of graphs that are not PCGs:

Baiocchi, Pierluigi ; Calamoneri, Tiziana ; Monti, Angelo.
Theoretical Computer Science.  791 (2019)  - p. 62-75 , 2019
 
?
 
?
5

Families of locally separated Hamilton paths:

Körner, János ; Monti, Angelo
Journal of Graph Theory.  88 (2017)  3 - p. 402-410 , 2017
 
?
6

Deciding the winner in k rounds for DISJOINT ARROWS , a new..:

Monti, Angelo
Theoretical Computer Science.  513 (2013)  - p. 96-108 , 2013
 
?
7

Fast flooding over Manhattan:

Clementi, Andrea ; Monti, Angelo ; Silvestri, Riccardo
Distributed Computing.  26 (2012)  1 - p. 25-38 , 2012
 
?
10

Reverse-free codes and permutations:

Füredi, Zoltán ; Kantor, Ida ; Monti, Angelo.
Electronic Notes in Discrete Mathematics.  38 (2011)  - p. 383-387 , 2011
 
?
11

Fast flooding over Manhattan:

, In: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing,
 
?
12

On Reverse-Free Codes and Permutations:

Füredi, Zoltan ; Kantor, Ida ; Monti, Angelo.
SIAM Journal on Discrete Mathematics.  24 (2010)  3 - p. 964-978 , 2010
 
?
13

Flooding Time of Edge-Markovian Evolving Graphs:

Clementi, Andrea E. F. ; Macci, Claudio ; Monti, Angelo..
SIAM Journal on Discrete Mathematics.  24 (2010)  4 - p. 1694-1712 , 2010
 
?
14

Broadcasting in dynamic radio networks:

Clementi, Andrea E.F. ; Monti, Angelo ; Pasquale, Francesco.
Journal of Computer and System Sciences.  75 (2009)  4 - p. 213-230 , 2009
 
1-15