The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Giuseppe F. Italiano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Giuseppe F. Italiano
    Amortized Efficiency of a Path Retrieval Data Structure. [Citation Graph (9, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:48, n:3, pp:273-281 [Journal]
  2. Giuseppe F. Italiano
    Finding Paths and Deleting Edges in Directed Acyclic Graphs. [Citation Graph (4, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:1, pp:5-11 [Journal]
  3. Roberto Grossi, Giuseppe F. Italiano
    Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). [Citation Graph (2, 0)][DBLP]
    ICALP, 1997, pp:605-615 [Conf]
  4. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
    Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1992, pp:60-69 [Conf]
  5. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    Incremental Algorithms for Minimal Length Paths. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:615-638 [Journal]
  6. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    On-Line Computation of Minimal and Maximal Length Paths. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:95, n:2, pp:245-261 [Journal]
  7. Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
    Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:111-125 [Conf]
  8. Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
    Wavelength rerouting in optical networks, or the Venetian routing problem. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:72-83 [Conf]
  9. Fabrizio Grandoni, Giuseppe F. Italiano
    Improved Algorithms for Max-restricted Path Consistency. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:858-862 [Conf]
  10. Fabrizio Grandoni, Giuseppe F. Italiano
    Algorithms and Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:2-14 [Conf]
  11. Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
    Visualization in Algorithm Engineering: Tools and Techniques. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:24-50 [Conf]
  12. Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
    Small Stretch Spanners on Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:532-543 [Conf]
  13. Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup
    Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:732-743 [Conf]
  14. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Designing Reliable Algorithms in Unreliable Memories. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:1-8 [Conf]
  15. Daniele Frigioni, Giuseppe F. Italiano
    Dynamically Switching Vertices in Planar Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:186-199 [Conf]
  16. Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch
    Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:212-223 [Conf]
  17. Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano
    The Price of Resiliency: A Case Study on Sorting with Memory Faults. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:768-779 [Conf]
  18. Camil Demetrescu, Giuseppe F. Italiano
    Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:381-389 [Conf]
  19. Camil Demetrescu, Giuseppe F. Italiano
    Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:260-267 [Conf]
  20. Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
    Predicting deadlock in Store-and-Forward Networks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:123-142 [Conf]
  21. Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
    Engineering and Visualizing Algorithms. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:509-513 [Conf]
  22. Camil Demetrescu, Giuseppe F. Italiano
    Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:633-643 [Conf]
  23. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Optimal Resilient Sorting and Searching in the Presence of Memory Faults. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:286-298 [Conf]
  24. Zvi Galil, Giuseppe F. Italiano
    Maintaining Biconnected Components of Dynamic Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:339-350 [Conf]
  25. Roberto Grossi, Giuseppe F. Italiano
    Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:372-381 [Conf]
  26. Giuseppe F. Italiano, Rajiv Ramaswami
    Maintaining Spanning Trees of Small Diameter. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:227-238 [Conf]
  27. Gianluigi Me, Giuseppe F. Italiano, Paolo Spagnoletti
    GSM and GPRS Performance of IPSEC Data Communication. [Citation Graph (0, 0)][DBLP]
    ICETE (2), 2004, pp:3-11 [Conf]
  28. Giuseppe Cattaneo, Umberto Ferraro Petrillo, Giuseppe F. Italiano, Vittorio Scarano
    Concurrent Algorithms and Data Types Animation over the Internet. [Citation Graph (0, 0)][DBLP]
    IFIP Congress: Fundamentals - Foundations of Computer Science, 1998, pp:63-80 [Conf]
  29. Giuseppe F. Italiano, Rajeev Rastogi, Bülent Yener
    Restoration Algorithms for Virtual Private Networks in the Hose Model. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  30. Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby
    On the Optimal Placement of Web Proxies in the Internet. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:1282-1290 [Conf]
  31. Fabrizio Grandoni, Giuseppe F. Italiano
    Improved Approximation for Single-Sink Buy-at-Bulk. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:111-120 [Conf]
  32. Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
    Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:1-16 [Conf]
  33. Camil Demetrescu, Giuseppe F. Italiano
    What Do We Learn from Experimental Algorithmics? [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:36-51 [Conf]
  34. Giuseppe Amato II, Giuseppe Cattaneo, Giuseppe F. Italiano
    Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:314-323 [Conf]
  35. David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano
    An Empirical Study of Dynamic Graph Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:192-201 [Conf]
  36. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    Incremental Algorithms for Minimal Length Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:12-21 [Conf]
  37. Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung
    Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:158-167 [Conf]
  38. Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano
    Experimental analysis of dynamic all pairs shortest path algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:369-378 [Conf]
  39. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
    Sparse Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:513-522 [Conf]
  40. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung
    Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:1-11 [Conf]
  41. Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
    Getting Back to the Past in the Union-Find Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:8-17 [Conf]
  42. Camil Demetrescu, Giuseppe F. Italiano
    A new approach to dynamic all pairs shortest paths. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:159-166 [Conf]
  43. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator based sparsification for dynamic planar graph algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:208-217 [Conf]
  44. Irene Finocchi, Giuseppe F. Italiano
    Sorting and searching in the presence of memory faults (without redundancy). [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:101-110 [Conf]
  45. Zvi Galil, Giuseppe F. Italiano
    Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:317-327 [Conf]
  46. Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
    Fully Dynamic Planarity Testing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:495-506 [Conf]
  47. Dora Giammarresi, Giuseppe F. Italiano
    Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:221-232 [Conf]
  48. Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
    JIVE: Java Interactive Software Visualization Environment. [Citation Graph (0, 0)][DBLP]
    VL/HCC, 2004, pp:41-43 [Conf]
  49. Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:352-372 [Conf]
  50. Giuseppe F. Italiano, Neil Sarnak
    Fully Persistent Data Structures for Disjoint Set Union Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:449-460 [Conf]
  51. Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
    New Algorithms for Examination Timetabling. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:230-242 [Conf]
  52. Giuseppe F. Italiano
    Distributed Algorithms for Updating Shortest Paths (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1991, pp:200-211 [Conf]
  53. Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano
    Search Data Structures for Skewed Strings. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:81-96 [Conf]
  54. Camil Demetrescu, Giuseppe F. Italiano
    Engineering Shortest Path Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:191-198 [Conf]
  55. Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
    A Stochastic Location Problem with Applications to Tele-diagnostic. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:201-213 [Conf]
  56. Fabrizio Grandoni, Giuseppe F. Italiano
    Decremental Clique Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:142-153 [Conf]
  57. Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura
    Portraying Algorithms with Leonardo Web. [Citation Graph (0, 0)][DBLP]
    WISE Workshops, 2005, pp:73-83 [Conf]
  58. Dora Giammarresi, Giuseppe F. Italiano
    Decremental 2- and 3-Connectivity on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:3, pp:263-287 [Journal]
  59. Daniele Frigioni, Giuseppe F. Italiano
    Dynamically Switching Vertices in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:1, pp:76-103 [Journal]
  60. Giuseppe F. Italiano
    Guest Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:4, pp:471-472 [Journal]
  61. Giuseppe F. Italiano, Rajiv Ramaswami
    Maintaining Spanning Trees of Small Diameter. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:3, pp:275-304 [Journal]
  62. Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
    The Set Union Problem with Dynamic Weighted Backtracking. [Citation Graph (0, 0)][DBLP]
    BIT, 1991, v:31, n:3, pp:383-393 [Journal]
  63. Camil Demetrescu, Giuseppe F. Italiano
    Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  64. Giuseppe Cattaneo, Giuseppe F. Italiano
    Algorithm Engineering. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1999, v:31, n:3es, pp:3- [Journal]
  65. Zvi Galil, Giuseppe F. Italiano
    Data Structures and Algorithms for Disjoint Set Union Problems. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1991, v:23, n:3, pp:319-344 [Journal]
  66. Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
    Algorithm engineering, Algorithmics Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:79, n:, pp:48-63 [Journal]
  67. Camil Demetrescu, Giuseppe F. Italiano
    Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:171, n:1, pp:3-15 [Journal]
  68. Roberto Grossi, Giuseppe F. Italiano
    Efficient Splitting and Merging Algorithms for Order Decomposable Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:154, n:1, pp:1-33 [Journal]
  69. Zvi Galil, Giuseppe F. Italiano
    A Note on Set Union with Arbitrary Deunions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:6, pp:331-335 [Journal]
  70. Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li
    An algorithm for finding a k-median in a directed tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:81-88 [Journal]
  71. Camil Demetrescu, Giuseppe F. Italiano
    A new approach to dynamic all pairs shortest paths. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:6, pp:968-992 [Journal]
  72. Camil Demetrescu, Giuseppe F. Italiano
    Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:147-156 [Journal]
  73. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
    Sparse Dynamic Programming I: Linear Cost Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:519-545 [Journal]
  74. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
    Sparse Dynamic Programming II: Convex and Concave Cost Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:546-567 [Journal]
  75. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
    Sparsification - a technique for speeding up dynamic graph algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:5, pp:669-696 [Journal]
  76. Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
    Fully Dynamic Planarity Testing with Applications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:1, pp:28-91 [Journal]
  77. Gianfranco Bilardi, Giuseppe F. Italiano
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:1- [Journal]
  78. Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
    Wavelength rerouting in optical networks, or the Venetian Routing problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:93-125 [Journal]
  79. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung
    Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:1, pp:33-54 [Journal]
  80. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung
    Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:1, pp:173- [Journal]
  81. David Eppstein, Giuseppe F. Italiano
    PREFACE: Festschrift for Zvi Galil. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:1, pp:1-3 [Journal]
  82. Camil Demetrescu, Giuseppe F. Italiano
    Fully dynamic all pairs shortest paths with real edge weights. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:5, pp:813-837 [Journal]
  83. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:3-27 [Journal]
  84. Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
    CHECKCOL: Improved local search for graph coloring. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:277-298 [Journal]
  85. Camil Demetrescu, Giuseppe F. Italiano
    Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:3, pp:353-383 [Journal]
  86. Giuseppe F. Italiano, Alberto Marchetti-Spaccamela
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:3, pp:337-338 [Journal]
  87. David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano
    An Empirical Study of Dynamic Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1997, v:2, n:, pp:5- [Journal]
  88. Giorgio Ausiello, Giuseppe F. Italiano
    On-Line Algorithms for Polynomially Solvable Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1991, v:10, n:1/2/3&4, pp:69-90 [Journal]
  89. Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo
    Design of trees in the hose model: The balanced case. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:6, pp:601-606 [Journal]
  90. Alberto Apostolico, Giuseppe F. Italiano, Giorgio Gambosi, Maurizio Talamo
    The Set Union Problem With Unlimited Backtracking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:50-70 [Journal]
  91. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator-Based Sparsification II: Edge and Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:341-381 [Journal]
  92. Zvi Galil, Giuseppe F. Italiano
    Fully Dynamic Algorithms for 2-Edge Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:6, pp:1047-1069 [Journal]
  93. Zvi Galil, Giuseppe F. Italiano
    Maintaining the 3-Edge-Connected Components of a Graph On-Line. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:11-28 [Journal]
  94. Camil Demetrescu, Giuseppe F. Italiano
    Experimental analysis of dynamic all pairs shortest path algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:578-601 [Journal]
  95. Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
    Worst-Case Analysis of the Set-Union Problem with Extended Backtracking. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:68, n:1, pp:57-70 [Journal]
  96. Giuseppe Cattaneo, Giuseppe F. Italiano, Umberto Ferraro Petrillo
    CATAI: Concurrent Algorithms and Data Types Animation over the Internet. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 2002, v:13, n:4, pp:391-419 [Journal]
  97. Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
    Optimal Resilient Dynamic Dictionaries. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:347-358 [Conf]
  98. Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
    Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:605-617 [Conf]
  99. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Resilient search trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:547-553 [Conf]
  100. Lars Arge, Giuseppe F. Italiano
    Preface. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]
  101. Giuseppe F. Italiano, Catuscia Palamidessi
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:1- [Journal]

  102. Transaction Oriented Text Messaging with Trusted-SMS. [Citation Graph (, )][DBLP]


  103. Resilient Algorithms and Data Structures. [Citation Graph (, )][DBLP]


  104. Penalized Second Price: A New Pricing Algorithm for Advertising in Search Engines. [Citation Graph (, )][DBLP]


  105. Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. [Citation Graph (, )][DBLP]


  106. Transparent File Protection in On-Demand Computing. [Citation Graph (, )][DBLP]


  107. An automatized methodology design for real-time signal processing applications in multiple multi-core platforms. [Citation Graph (, )][DBLP]


  108. Experimental Study of Resilient Algorithms and Data Structures. [Citation Graph (, )][DBLP]


  109. Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. [Citation Graph (, )][DBLP]


  110. Traffic-based network clustering. [Citation Graph (, )][DBLP]


  111. Data reverse engineering on a smartphone. [Citation Graph (, )][DBLP]


  112. The Price of Resiliency: a Case Study on Sorting with Memory Faults. [Citation Graph (, )][DBLP]


  113. Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. [Citation Graph (, )][DBLP]


  114. Sorting and Searching in Faulty Memories. [Citation Graph (, )][DBLP]


  115. Graph Spanners in the Streaming Model: An Experimental Study. [Citation Graph (, )][DBLP]


  116. Maintaining dynamic minimum spanning trees: An experimental study. [Citation Graph (, )][DBLP]


  117. The value of location in keyword auctions. [Citation Graph (, )][DBLP]


Search in 0.090secs, Finished in 0.099secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002