According to our database1, Angelo Monti authored at least 59 papers between 1991 and 2018.
Legend:Book In proceedings Article PhD thesis Other
On dynamic threshold graphs and related classes.
Theor. Comput. Sci., 2018
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract).
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract).
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game.
Theor. Comput. Sci., 2013
Optimal gossiping in geometric radio networks in the presence of dynamical faults.
Rainbow graph splitting.
Theor. Comput. Sci., 2011
Reverse-free codes and permutations.
Electronic Notes in Discrete Mathematics, 2011
Modelling mobility: A discrete revolution.
Ad Hoc Networks, 2011
On Reverse-Free Codes and Permutations.
SIAM J. Discrete Math., 2010
Flooding Time of Edge-Markovian Evolving Graphs.
SIAM J. Discrete Math., 2010
Fast flooding over Manhattan.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010
Modelling Mobility: A Discrete Revolution.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
Broadcasting in dynamic radio networks.
J. Comput. Syst. Sci., 2009
Information spreading in stationary Markovian evolving graphs.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
Flooding time in edge-Markovian dynamic graphs.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms.
Proceedings of the 11th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2008
On the bounded-hop MST problem on random Euclidean instances.
Theor. Comput. Sci., 2007
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007
Communication in dynamic radio networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
Spanning Trees with Many Leaves in Regular Bipartite Graphs.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks.
Proceedings of the Structural Information and Communication Complexity, 2006
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, 2006
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
Proceedings of the Structural Information and Communication Complexity, 2005
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
Proceedings of the STACS 2004, 2004
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004
Distributed broadcast in radio networks of unknown topology.
Theor. Comput. Sci., 2003
Delta-Systems and Qualitative (In)Dependence.
J. Comb. Theory, Ser. A, 2002
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Compact Representations of the Intersection Structure of Families of Finite Sets.
SIAM J. Discrete Math., 2001
A Better Bound for Locally Thin Set Families.
J. Comb. Theory, Ser. A, 2001
Delta-systems and qualitative (in)dependence.
Electronic Notes in Discrete Mathematics, 2001
Logical definability of Y-tree and trellis systolic omega-languages.
Acta Cybern., 2001
Selective families, superimposed codes, and broadcasting on unknown radio networks.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
On Computing Ad-hoc Selective Families.
Proceedings of the Approximation, 2001
Distributed multi-broadcast in unknown radio networks.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks.
Proceedings of the Algorithms, 2001
Systolic tree omega-Languages: the operational and the logical view.
Theor. Comput. Sci., 2000
String Quartets In Binary.
Combinatorics, Probability & Computing, 2000
Testing and Reconfiguration of VLSI Linear Arrays.
Theor. Comput. Sci., 1998
A Logical Characterization of Systolic Languages.
Proceedings of the STACS 98, 1998
Succinctness of Descriptions of SBTA-Languages.
Theor. Comput. Sci., 1997
Chomsky Hierarchy and Systolic Y-Tree Automata.
Fundam. Inform., 1997
A Gap Theorem for the Anonymous Torus.
Inf. Process. Lett., 1996
On the Computational Complexity of Graph Closures.
Inf. Process. Lett., 1996
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees.
Proceedings of the Algorithm Theory, 1996
Completeness Results Concerning Systolic Tree Automata and EOL Languages.
Inf. Process. Lett., 1995
Systolic Tree Omega-Languages.
State Complexity of SBTA Languages.
Proceedings of the LATIN '95: Theoretical Informatics, 1995
A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata.
J. Comput. Syst. Sci., 1994
Trade-off Between Computational Power and Common Knowledge in Anonymous Rings.
Proceedings of the Structural Information and Communication Complexity, 1994
On the Complexity of Some Reachability Problems.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994
On Reconfigurability of VLSI Linear Arrays.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations.
Acta Inf., 1992
Systolic Tree with Base Automata.
Int. J. Found. Comput. Sci., 1991
Systolic Y-Tree Automata: Closure Properties and Decision Problems.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991