Tiziana Calamoneri

Daniele Tavernelli

Comput. J., July, 2023

(Eternal) Vertex Cover Number of Infinite and Finite Grid Graphs (short paper).

[BibT_eX]

[DOI]

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

L(3, 2, 1)-Labeling of Certain Planar Graphs.

[BibT_eX]

[DOI]

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

2022

Editorial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Linear Time Reconciliation With Bounded Transfers of Genes.

[BibT_eX]

[DOI]

Daniele Tavernelli

Paola Vocca

IEEE ACM Trans. Comput. Biol. Bioinform., 2022

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

[BibT_eX]

[DOI]

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

(Eternal) Vertex Cover Number of Infinite and Finite Grid Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Multi-Depot Multi-Trip Vehicle Routing with Total Completion Time Minimization.

[BibT_eX]

[DOI]

Simona Mancini

CoRR, 2022

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

[BibT_eX]

[DOI]

Fabrizio Petroni

CoRR, 2022

A Realistic Model to Support Rescue Operations After an Earthquake via UAVs.

[BibT_eX]

[DOI]

Simona Mancini

IEEE Access, 2022

Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

A Matheuristic for Multi-Depot Multi-Trip Vehicle Routing Problems.

[BibT_eX]

[DOI]

Simona Mancini

Proceedings of the Metaheuristics - 14th International Conference, 2022

2021

On Generalizations of Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Visualizing co-phylogenetic reconciliations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2020

A Realistic Model for Rescue Operations after an Earthquake.

[BibT_eX]

[DOI]

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 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

Comparing Related Phylogenetic Trees.

[BibT_eX]

[DOI]

Angelo Di Mambro

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2018

On dynamic threshold graphs and related classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

2017

Autonomous Mobile Sensor Placement in Complex Environments.

[BibT_eX]

[DOI]

ACM Trans. Auton. Adapt. Syst., 2017

Report on ICTCS 2017.

[BibT_eX]

[DOI]

Bull. EATCS, 2017

Extracting Few Representative Reconciliations with Host Switches.

[BibT_eX]

[DOI]

Mattia Gastaldello

Marie-France Sagot

Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2017

2016

Pairwise Compatibility Graphs: A Survey.

[BibT_eX]

[DOI]

SIAM Rev., 2016

Report on ICTCS 2016.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

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

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

On Maximal Chain Subgraphs and Covers of Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 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

Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Optimal L(j, k)-Edge-Labeling of Regular Grids.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

On Pairwise Compatibility of Some Graph (Super)Classes.

[BibT_eX]

[DOI]

Mattia Gastaldello

CoRR, 2015

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

[BibT_eX]

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

2014

On pairwise compatibility graphs having Dilworth number k.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On pairwise compatibility graphs having Dilworth number two.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Report from the Italian Chapter.

[BibT_eX]

[DOI]

Bull. EATCS, 2014

Pairwise Compatibility Graphs of Caterpillars.

[BibT_eX]

[DOI]

Antonio Frangioni

Comput. J., 2014

On Dilworth k Graphs and Their Pairwise Compatibility.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Relating threshold tolerance graphs to other graph classes.

[BibT_eX]

[DOI]

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

Exploring pairwise compatibility graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Optimal L(δ1, δ2, 1)-labeling of eight-regular grids.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Graphs with Dilworth Number Two are Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Report from ICTCS 2013.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2013

L(2, 1)L(2, 1)-labeling of oriented planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

Dario Frascaria

Comput. J., 2013

2012

Sensor activation and radius adaptation (SARA) in heterogeneous sensor networks.

[BibT_eX]

[DOI]

ACM Trans. Sens. Networks, 2012

Editorial: Preface to the special issue.

[BibT_eX]

[DOI]

Irene Finocchi

Networks, 2012

On Relaxing the Constraints in Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

2011

Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Emanuele G. Fusco

Riccardo Silvestri

IEEE Trans. Parallel Distributed Syst., 2011

Autonomous Deployment of Heterogeneous Mobile Sensors.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2011

On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks.

[BibT_eX]

[DOI]

Mob. Networks Appl., 2011

Recognition of Unigraphs through Superposition of Graphs.

[BibT_eX]

[DOI]

Alessandro Borri

J. Graph Algorithms Appl., 2011

Editorial.

[BibT_eX]

[DOI]

Josep Díaz

J. Discrete Algorithms, 2011

The L(2, 1)-labeling of unigraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

The L(2, 1)-Labeling Problem on Oriented Regular Grids.

[BibT_eX]

[DOI]

Comput. J., 2011

The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography.

[BibT_eX]

[DOI]

Comput. J., 2011

L(2, 1)-Labeling of Unigraphs - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Labeling of Oriented Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

Push & Pull: autonomous deployment of mobile sensors for a complete coverage.

[BibT_eX]

[DOI]

Wirel. Networks, 2010

Mobile Sensor Deployment in Unknown Fields.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs.

[BibT_eX]

[DOI]

Networks, 2009

L ( h , 1, 1)-labeling of outerplanar graphs.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2009

Recognition of Unigraphs through Superposition of Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Alessandro Borri

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Variable Density Deployment and Topology Control for the Solution of the Sink-Hole Problem.

[BibT_eX]

[DOI]

Proceedings of the Quality of Service in Heterogeneous Networks, 2009

The L(2, 1)-Labeling Problem on Oriented Regular Grids.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Autonomous deployment of heterogeneous mobile sensors.

[BibT_eX]

[DOI]

Proceedings of the 17th annual IEEE International Conference on Network Protocols, 2009

2008

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A General Approach to L ( h, k )-Label Interconnection Networks.

[BibT_eX]

[DOI]

Saverio Caminiti

J. Comput. Sci. Technol., 2008

Impact of Information on the Complexity of Asynchronous Radio Broadcasting.

[BibT_eX]

[DOI]

Emanuele G. Fusco

Andrzej Pelc

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms.

[BibT_eX]

[DOI]

Gianluca Rossi

Riccardo Silvestri

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

Autonomous Deployment of Self-Organizing Mobile Sensors for a Complete Coverage.

[BibT_eX]

[DOI]

Proceedings of the Self-Organizing Systems, Third International Workshop, 2008

Snap and Spread: A Self-deployment Algorithm for Mobile Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2008

2007

Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks.

[BibT_eX]

[DOI]

Emanuele G. Fusco

Riccardo Silvestri

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

On the L(h, k)-Labeling of Co-comparability Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

2006

Nearly optimal three dimensional layout of hypercube networks.

[BibT_eX]

[DOI]

Networks, 2006

Antibandwidth of Complete k-Ary Trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Optimal L(h, k)-Labeling of Regular Grids.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

lambda-Coloring matrogenic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography.

[BibT_eX]

[DOI]

Comput. J., 2006

L(h, 1, 1)-Labeling of Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

2005

A general approach to L(h, k)-label interconnection networks.

[BibT_eX]

[DOI]

Saverio Caminiti

Electron. Notes Discret. Math., 2005

On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Paola Vocca

Proceedings of the Structural Information and Communication Complexity, 2005

Graph Coloring with Distance Constraints.

[BibT_eX]

Irene Finocchi

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

2004

L(h, 1)-labeling subclasses of planar graphs.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

Efficient algorithms for checking the equivalence of multistage interconnection networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

2003

New results on edge-bandwidth.

[BibT_eX]

[DOI]

Imrich Vrto

Theor. Comput. Sci., 2003

Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Benes networks.

[BibT_eX]

[DOI]

Miriam Di Ianni

J. Parallel Distributed Comput., 2003

Labeling trees with a condition at distance two.

[BibT_eX]

[DOI]

Andrzej Pelc

Electron. Notes Discret. Math., 2003

Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2002

On max cut in cubic graphs.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 2002

L(2, 1)-Coloring Matrogenic Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Radiocoloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 2002

2001

Optimal three-dimensional layout of interconnection networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Edge-clique graphs and the l-coloring problem.

[BibT_eX]

J. Braz. Comput. Soc., 2001

LD-Coloring of Regular Tiling (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

L(2, 1)-labeling of planar graphs.

[BibT_eX]

[DOI]

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000

A Simple Parallel Algorithm to Draw Cubic Graphs.

[BibT_eX]

[DOI]

Stephan Olariu

IEEE Trans. Parallel Distributed Syst., 2000

1999

Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs.

[BibT_eX]

[DOI]

Simone Jannelli

J. Graph Algorithms Appl., 1999

An optimal layout of multigrid networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Optimal Layout of Trivalent Cayley Interconnection Networks.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 1999

1998

A Tight Layout of the Butterfly Network.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1998

Orthogonally Drawing Cubic Graphs in Parallel.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1998

Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees.

[BibT_eX]

[DOI]

Miriam Di Ianni

Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997

3D Straight-Line Grid Drawing of 4-Colorable Graphs.

[BibT_eX]

[DOI]

Andrea Sterbini

Inf. Process. Lett., 1997

A New 3D Representation of Trivalent Cayley Networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

On Three-Dimensional Layout of Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.

[BibT_eX]

[DOI]

Paola Alimonti

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

Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume.

[BibT_eX]

[DOI]

Andrea Sterbini

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995

An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs.

[BibT_eX]

[DOI]