Angelo Monti

Proceedings of the WALCOM: Algorithms and Computation, 2023

On Graphs that are not Star-k-PCGs (short paper).

[BibT_eX]

[DOI]

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2022

On the domination number of $t$-constrained de Bruijn graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

All Graphs with at most 8 nodes are 2-interval-PCGs.

[BibT_eX]

[DOI]

Fabrizio Petroni

CoRR, 2022

2021

On Generalizations of Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

2020

String factorisations with maximum or minimum dimension.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs.

[BibT_eX]

[DOI]

Matteo Dell'Orefice

Theor. Comput. Sci., 2019

Some classes of graphs that are not PCGs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

2018

On dynamic threshold graphs and related classes.

[BibT_eX]

[DOI]

Rossella Petreschi

Theor. Comput. Sci., 2018

Families of locally separated Hamilton paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

On variants of Vertex Geography on undirected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2016

Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs.

[BibT_eX]

[DOI]

Rossella Petreschi

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.

[BibT_eX]

[DOI]

Matteo Dell'Orefice

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015

Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract).

[BibT_eX]

Rossella Petreschi

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013

Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Fast flooding over Manhattan.

[BibT_eX]

[DOI]

Andrea Clementi

Distributed Comput., 2013

2012

Optimal gossiping in geometric radio networks in the presence of dynamical faults.

[BibT_eX]

[DOI]

Networks, 2012

2011

Information Spreading in Stationary Markovian Evolving Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2011

Rainbow graph splitting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Reverse-free codes and permutations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Modelling mobility: A discrete revolution.

[BibT_eX]

[DOI]

Andrea Clementi

Ad Hoc Networks, 2011

2010

Flooding Time of Edge-Markovian Evolving Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Modelling Mobility: A <i>Discrete</i> Revolution.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Broadcasting in dynamic radio networks.

[BibT_eX]

[DOI]

Francesco Pasquale

J. Comput. Syst. Sci., 2009

2008

Minimum-Energy Broadcast and disk cover in grid wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Flooding time in edge-Markovian dynamic graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Gianluca Rossi

Proceedings of the 11th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2008

2007

On the bounded-hop MST problem on random Euclidean instances.

[BibT_eX]

Theor. Comput. Sci., 2007

An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem.

[BibT_eX]

[DOI]

Paolo Penna

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Communication in dynamic radio networks.

[BibT_eX]

[DOI]

Francesco Pasquale

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.

[BibT_eX]

[DOI]

Francesco Pasquale

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Spanning Trees with Many Leaves in Regular Bipartite Graphs.

[BibT_eX]

[DOI]

Emanuele G. Fusco

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, 2006

2005

Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004

Round Robin is optimal for fault-tolerant broadcasting on wireless networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.

[BibT_eX]

[DOI]

Christoph Ambühl

Proceedings of the STACS 2004, 2004

The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.

[BibT_eX]

[DOI]

Christoph Ambühl

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Distributed broadcast in radio networks of unknown topology.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Compact Representations of the Intersection Structure of Families of Finite Sets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

A Better Bound for Locally Thin Set Families.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2001

Delta-systems and qualitative (in)dependence.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Self-Similarity Bounds for Locally Thin Set Families.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

Distributed Broadcast in Wireless Networks with Unknown Topology

[BibT_eX]

[DOI]

CoRR, 2001

Logical definability of Y-tree and trellis systolic omega-languages.

[BibT_eX]

[DOI]

Acta Cybern., 2001

Selective families, superimposed codes, and broadcasting on unknown radio networks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On Computing Ad-hoc Selective Families.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

Distributed multi-broadcast in unknown radio networks.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000

The Shuffled Mesh: a flexible and efficient model for parallel computing.

[BibT_eX]

[DOI]

Telecommun. Syst., 2000

Systolic tree omega-Languages: the operational and the logical view.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

String Quartets In Binary.

[BibT_eX]

[DOI]

Noga Alon

Comb. Probab. Comput., 2000

1999

A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees.

[BibT_eX]

[DOI]

Algorithmica, 1999

1998

Testing and Reconfiguration of VLSI Linear Arrays.

[BibT_eX]

[DOI]

Roberto De Prisco

Linda Pagli

Theor. Comput. Sci., 1998

A Logical Characterization of Systolic Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

1997

Succinctness of Descriptions of SBTA-Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Chomsky Hierarchy and Systolic Y-Tree Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

1996

A Gap Theorem for the Anonymous Torus.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

On the Computational Complexity of Graph Closures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

1995

Completeness Results Concerning Systolic Tree Automata and EOL Languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Systolic Tree Omega-Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

State Complexity of SBTA Languages.

[BibT_eX]

[DOI]

Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994

A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Trade-off Between Computational Power and Common Knowledge in Anonymous Rings.

[BibT_eX]

Paolo Ferragina

Proceedings of the Structural Information and Communication Complexity, 1994

On the Complexity of Some Reachability Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993

On Reconfigurability of VLSI Linear Arrays.

[BibT_eX]

[DOI]

Roberto De Prisco

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992

Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations.

[BibT_eX]

[DOI]

Acta Informatica, 1992

1991

Systolic Tree with Base Automata.

[BibT_eX]

[DOI]