Tiziana Calamoneri

According to our database1, Tiziana Calamoneri authored at least 97 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs.
Theor. Comput. Sci., 2019

Some classes of graphs that are not PCGs.
Theor. Comput. Sci., 2019

Comparing Related Phylogenetic Trees.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2018
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

2017
Autonomous Mobile Sensor Placement in Complex Environments.
TAAS, 2017

Report on ICTCS 2017.
Bulletin of the EATCS, 2017

Visualizing Co-phylogenetic Reconciliations.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Extracting Few Representative Reconciliations with Host Switches.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2017

2016
Pairwise Compatibility Graphs: A Survey.
SIAM Review, 2016

Report on ICTCS 2016.
Bulletin of the EATCS, 2016

Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

On Maximal Chain Subgraphs and Covers of Bipartite Graphs.
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.
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].
Theor. Comput. Sci., 2015

Optimal L(j, k)-Edge-Labeling of Regular Grids.
Int. J. Found. Comput. Sci., 2015

On Pairwise Compatibility of Some Graph (Super)Classes.
CoRR, 2015

Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract).
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
On pairwise compatibility graphs having Dilworth number k.
Theor. Comput. Sci., 2014

On pairwise compatibility graphs having Dilworth number two.
Theor. Comput. Sci., 2014

Report from the Italian Chapter.
Bulletin of the EATCS, 2014

Pairwise Compatibility Graphs of Caterpillars.
Comput. J., 2014

On Dilworth k Graphs and Their Pairwise Compatibility.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Relating threshold tolerance graphs to other graph classes.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013
Exploring pairwise compatibility graphs.
Theor. Comput. Sci., 2013

Optimal L(δ1, δ2, 1)-labeling of eight-regular grids.
Inf. Process. Lett., 2013

Graphs with Dilworth Number Two are Pairwise Compatibility Graphs.
Electron. Notes Discret. Math., 2013

Report from ICTCS 2013.
Bulletin of the EATCS, 2013

On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs.
Discrete Math., Alg. and Appl., 2013

L(2, 1)L(2, 1)-labeling of oriented planar graphs.
Discret. Appl. Math., 2013

All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs.
Comput. J., 2013

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

Editorial: Preface to the special issue.
Networks, 2012

On Relaxing the Constraints in Pairwise Compatibility Graphs.
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.
IEEE Trans. Parallel Distrib. Syst., 2011

Autonomous Deployment of Heterogeneous Mobile Sensors.
IEEE Trans. Mob. Comput., 2011

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

Recognition of Unigraphs through Superposition of Graphs.
J. Graph Algorithms Appl., 2011

Editorial.
J. Discrete Algorithms, 2011

The L(2, 1)-labeling of unigraphs.
Discret. Appl. Math., 2011

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

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

L(2, 1)-Labeling of Unigraphs - (Extended Abstract).
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Labeling of Oriented Planar Graphs.
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.
Wireless Networks, 2010

Mobile Sensor Deployment in Unknown Fields.
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.
Networks, 2009

L ( h , 1, 1)-labeling of outerplanar graphs.
Math. Meth. of OR, 2009

Recognition of Unigraphs through Superposition of Graphs (Extended Abstract).
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.
Proceedings of the Quality of Service in Heterogeneous Networks, 2009

The L(2, 1)-Labeling Problem on Oriented Regular Grids.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Autonomous deployment of heterogeneous mobile sensors.
Proceedings of the 17th annual IEEE International Conference on Network Protocols, 2009

2008
Minimum-Energy Broadcast and disk cover in grid wireless networks.
Theor. Comput. Sci., 2008

A General Approach to L ( h, k )-Label Interconnection Networks.
J. Comput. Sci. Technol., 2008

Impact of Information on the Complexity of Asynchronous Radio Broadcasting.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 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

Autonomous Deployment of Self-Organizing Mobile Sensors for a Complete Coverage.
Proceedings of the Self-Organizing Systems, Third International Workshop, 2008

Snap and Spread: A Self-deployment Algorithm for Mobile Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2008

2007
Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers.
Proceedings of the Structural Information and Communication Complexity, 2007

Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

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

2006
Nearly optimal three dimensional layout of hypercube networks.
Networks, 2006

Antibandwidth of Complete k-Ary Trees.
Electron. Notes Discret. Math., 2006

Optimal L(h, k)-Labeling of Regular Grids.
Discrete Mathematics & Theoretical Computer Science, 2006

lambda-Coloring matrogenic graphs.
Discret. Appl. Math., 2006

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

L(h, 1, 1)-Labeling of Outerplanar Graphs.
Proceedings of the Structural Information and Communication Complexity, 2006

2005
A general approach to L(h, k)-label interconnection networks.
Electron. Notes Discret. Math., 2005

On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2005

Graph Coloring with Distance Constraints.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

2004
L(h, 1)-labeling subclasses of planar graphs.
J. Parallel Distributed Comput., 2004

Efficient algorithms for checking the equivalence of multistage interconnection networks.
J. Parallel Distributed Comput., 2004

2003
New results on edge-bandwidth.
Theor. Comput. Sci., 2003

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

Labeling trees with a condition at distance two.
Electron. Notes Discret. Math., 2003

Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2002
On max cut in cubic graphs.
Parallel Algorithms Appl., 2002

L(2, 1)-Coloring Matrogenic Graphs.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Radiocoloring Problem.
Proceedings of the Distributed Computing, 2002

2001
Optimal three-dimensional layout of interconnection networks.
Theor. Comput. Sci., 2001

Edge-clique graphs and the l-coloring problem.
J. Braz. Comp. Soc., 2001

LD-Coloring of Regular Tiling (Extended Abstract).
Electron. Notes Discret. Math., 2001

L(2, 1)-labeling of planar graphs.
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.
IEEE Trans. Parallel Distrib. Syst., 2000

1999
Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs.
J. Graph Algorithms Appl., 1999

An optimal layout of multigrid networks.
Inf. Process. Lett., 1999

Optimal Layout of Trivalent Cayley Interconnection Networks.
Int. J. Found. Comput. Sci., 1999

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.
Proceedings of the Advances in Computing Science, 1999

1998
A Tight Layout of the Butterfly Network.
Theory Comput. Syst., 1998

Orthogonally Drawing Cubic Graphs in Parallel.
J. Parallel Distributed Comput., 1998

Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
3D Straight-Line Grid Drawing of 4-Colorable Graphs.
Inf. Process. Lett., 1997

A New 3D Representation of Trivalent Cayley Networks.
Inf. Process. Lett., 1997

On Three-Dimensional Layout of Interconnection Networks.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995
An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995


  Loading...