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