The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tiziana Calamoneri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
    A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:27-36 [Conf]
  2. Tiziana Calamoneri, Rossella Petreschi
    An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:31-40 [Conf]
  3. Tiziana Calamoneri, Rossella Petreschi
    L(2, 1)-labeling of planar graphs. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:28-33 [Conf]
  4. Tiziana Calamoneri, Miriam Di Ianni
    Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:1029-1039 [Conf]
  5. Tiziana Calamoneri, Annalisa Massini
    Nearly Optimal Three Dimensional Layout of Hypercube Networks. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:247-258 [Conf]
  6. Tiziana Calamoneri, Annalisa Massini
    On Three-Dimensional Layout of Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:64-75 [Conf]
  7. Tiziana Calamoneri, Andrea Sterbini
    Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:53-62 [Conf]
  8. Tiziana Calamoneri
    Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:163-173 [Conf]
  9. Tiziana Calamoneri, Rossella Petreschi
    On the Radiocoloring Problem. [Citation Graph (0, 0)][DBLP]
    IWDC, 2002, pp:118-127 [Conf]
  10. Tiziana Calamoneri, Rossella Petreschi
    L(2, 1)-Coloring Matrogenic Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:236-247 [Conf]
  11. Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi
    Graph Coloring with Distance Constraints. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2005, pp:131-140 [Conf]
  12. Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
    Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:227-239 [Conf]
  13. Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca
    L(h, 1, 1)-Labeling of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:268-279 [Conf]
  14. Tiziana Calamoneri, Paola Vocca
    On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:65-77 [Conf]
  15. Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg
    A Tight Layout of the Butterfly Network. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:170-175 [Conf]
  16. Paola Alimonti, Tiziana Calamoneri
    Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:2-16 [Conf]
  17. Tiziana Calamoneri
    The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:5, pp:585-608 [Journal]
  18. Tiziana Calamoneri, Rossella Petreschi
    lambda-Coloring matrogenic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:17, pp:2445-2457 [Journal]
  19. Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi
    Labeling trees with a condition at distance two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1534-1539 [Journal]
  20. Tiziana Calamoneri, Rossella Petreschi
    Optimal Layout of Trivalent Cayley Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:277-288 [Journal]
  21. Tiziana Calamoneri, Annalisa Massini
    An optimal layout of multigrid networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:3-4, pp:137-141 [Journal]
  22. Tiziana Calamoneri, Rossella Petreschi
    A New 3D Representation of Trivalent Cayley Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:5, pp:247-252 [Journal]
  23. Tiziana Calamoneri, Andrea Sterbini
    3D Straight-Line Grid Drawing of 4-Colorable Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:2, pp:97-102 [Journal]
  24. Tiziana Calamoneri, Rossella Petreschi
    Edge-clique graphs and the l-coloring problem. [Citation Graph (0, 0)][DBLP]
    J. Braz. Comp. Soc., 2001, v:7, n:3, pp:38-47 [Journal]
  25. Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi
    Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:2, pp:- [Journal]
  26. Tiziana Calamoneri, Miriam Di Ianni
    Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Benes networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:11, pp:1017-1025 [Journal]
  27. Tiziana Calamoneri, Annalisa Massini
    Efficient algorithms for checking the equivalence of multistage interconnection networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:1, pp:135-150 [Journal]
  28. Tiziana Calamoneri, Rossella Petreschi
    L(h, 1)-labeling subclasses of planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:3, pp:414-426 [Journal]
  29. Tiziana Calamoneri, Rossella Petreschi
    Orthogonally Drawing Cubic Graphs in Parallel. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:55, n:1, pp:94-108 [Journal]
  30. Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg
    A Tight Layout of the Butterfly Network. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:4, pp:475-488 [Journal]
  31. Tiziana Calamoneri, Annalisa Massini
    Nearly optimal three dimensional layout of hypercube networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:1, pp:1-8 [Journal]
  32. Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
    On max cut in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms Appl., 2002, v:17, n:3, pp:165-183 [Journal]
  33. Tiziana Calamoneri, Annalisa Massini
    Optimal three-dimensional layout of interconnection networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:263-279 [Journal]
  34. Tiziana Calamoneri, Annalisa Massini, Imrich Vrto
    New results on edge-bandwidth. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:3, pp:503-513 [Journal]
  35. Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi
    A Simple Parallel Algorithm to Draw Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:10, pp:1009-1018 [Journal]
  36. Tiziana Calamoneri, Emanuele G. Fusco, Anil M. Shende, Sunil M. Shende
    Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:208-221 [Conf]
  37. Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi
    On the L(h, k)-Labeling of Co-comparability Graphs. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:116-127 [Conf]
  38. Tiziana Calamoneri
    Optimal L(h, k)-Labeling of Regular Grids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:141-158 [Journal]

  39. Snap and Spread: A Self-deployment Algorithm for Mobile Sensor Networks. [Citation Graph (, )][DBLP]


  40. Autonomous deployment of heterogeneous mobile sensors. [Citation Graph (, )][DBLP]


  41. Mobile Sensor Deployment in Unknown Fields. [Citation Graph (, )][DBLP]


  42. Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. [Citation Graph (, )][DBLP]


  43. Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. [Citation Graph (, )][DBLP]


  44. Impact of Information on the Complexity of Asynchronous Radio Broadcasting. [Citation Graph (, )][DBLP]


  45. Variable Density Deployment and Topology Control for the Solution of the Sink-Hole Problem. [Citation Graph (, )][DBLP]


  46. Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). [Citation Graph (, )][DBLP]


  47. Autonomous Deployment of Self-Organizing Mobile Sensors for a Complete Coverage. [Citation Graph (, )][DBLP]


  48. Push&Pull: autonomous deployment of mobile sensors for a complete coverage [Citation Graph (, )][DBLP]


  49. Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms [Citation Graph (, )][DBLP]


  50. The L(2, 1)-Labeling Problem on Oriented Regular Grids [Citation Graph (, )][DBLP]


  51. Antibandwidth of complete k-ary trees. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002