default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiuseppe F. Italiano
Giuseppe Francesco Italiano
Person information
- affiliation: University of Rome Tor Vergata, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c149]Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han:
Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking. ICDE 2024: 3257-3269- [c148]Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal:
Black Hole Search in Dynamic Tori. SAND 2024: 6:1-6:16 - [c147]Saswata Jana
, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal:
Online Drone Scheduling for Last-Mile Delivery. SIROCCO 2024: 488-493 - [c146]Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal:
Black Hole Search in Dynamic Cactus Graph. WALCOM 2024: 288-303 - [i41]Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal:
Black Hole Search in Dynamic Tori. CoRR abs/2402.04746 (2024) - [i40]Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal:
Online Drone Scheduling for Last-mile Delivery. CoRR abs/2402.16085 (2024) - [i39]Lutz Oettershagen, Athanasios L. Konstantinidis, Fariba Ranjbar, Giuseppe F. Italiano:
Consistent Strong Triadic Closure in Multilayer Networks. CoRR abs/2409.08405 (2024) - 2023
- [j93]Giuseppe F. Italiano:
EATCS-Fellows 2023. Bull. EATCS 140 (2023) - [j92]Massimo Bernaschi, Alessandro Celestini, Marco Cianfriglia, Stefano Guarino, Giuseppe F. Italiano, Enrico Mastrostefano, Lena Rebecca Zastrow:
Seeking critical nodes in digraphs. J. Comput. Sci. 69: 102012 (2023) - [c145]Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos:
Structural Parameterization of Cluster Deletion. WALCOM 2023: 371-383 - [d1]Massimo Bernaschi, Alessandro Celestini, Marco Cianfriglia, Stefano Guarino, Giuseppe F. Italiano, Enrico Mastrostefano, Lena Rebecca Zastrow:
Seeking Critical Nodes in Digraphs. Zenodo, 2023
- [i38]Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano:
Temporal Network Core Decomposition and Community Search. CoRR abs/2309.11843 (2023) - [i37]Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal:
Black Hole Search in Dynamic Cactus Graph. CoRR abs/2311.10984 (2023) - [i36]Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han:
Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking. CoRR abs/2312.10486 (2023) - 2022
- [c144]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. ESA 2022: 60:1-60:16 - [c143]Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han:
Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions. ICDE 2022: 872-884 - [c142]Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano:
Inferring Tie Strength in Temporal Networks. ECML/PKDD (2) 2022: 69-85 - [c141]Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma:
Dispersion of Mobile Robots on Directed Anonymous Graphs. SIROCCO 2022: 191-211 - [i35]Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano:
Inferring Tie Strength in Temporal Networks. CoRR abs/2206.11705 (2022) - [i34]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak:
On maximal 3-edge-connected subgraphs of undirected graphs. CoRR abs/2211.06521 (2022) - 2021
- [j91]Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Tropical paths in vertex-colored graphs. J. Comb. Optim. 42(3): 476-498 (2021) - [j90]Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri:
A family of tree-based generators for bubbles in directed graphs. J. Graph Algorithms Appl. 25(1): 563-580 (2021) - [j89]Seunghwan Min, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han:
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. Proc. VLDB Endow. 14(8): 1298-1310 (2021) - [c140]Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini:
Compressed Weighted de Bruijn Graphs. CPM 2021: 16:1-16:16 - [c139]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph in Linear Time. ESA 2021: 47:1-47:17 - [c138]Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han:
Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space. ICDE 2021: 1368-1379 - [c137]Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. SODA 2021: 273-289 - [c136]Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis:
Planar Reachability Under Single Vertex or Edge Failures. SODA 2021: 2739-2758 - [c135]Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. SEA 2021: 20:1-20:19 - [i33]Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis:
Planar Reachability Under Single Vertex or Edge Failures. CoRR abs/2101.02574 (2021) - [i32]Seunghwan Min, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han:
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. CoRR abs/2104.00886 (2021) - [i31]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph in Linear Time. CoRR abs/2105.02910 (2021) - [i30]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph. CoRR abs/2108.08558 (2021) - 2020
- [j88]Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri:
On Bubble Generators in Directed Graphs. Algorithmica 82(4): 898-914 (2020) - [j87]Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano:
EATCS Fellows 2021 - Call for Nominations. Bull. EATCS 132 (2020) - [j86]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Strong Connectivity in Directed Graphs under Failures, with Applications. SIAM J. Comput. 49(5): 865-926 (2020) - [j85]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou:
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. Theor. Comput. Sci. 807: 185-200 (2020) - [j84]Gabriele Fici, Giuseppe F. Italiano:
Preface. Theor. Comput. Sci. 812: 1 (2020) - [c134]Vicente Acuña, Leandro Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri:
A Family of Tree-Based Generators for Bubbles in Directed Graphs. IWOCA 2020: 17-29 - [e18]Luís Antunes, Maurizio Naldi, Giuseppe F. Italiano, Kai Rannenberg, Prokopios Drogkaris:
Privacy Technologies and Policy - 8th Annual Privacy Forum, APF 2020, Lisbon, Portugal, October 22-23, 2020, Proceedings. Lecture Notes in Computer Science 12121, Springer 2020, ISBN 978-3-030-55195-7 [contents] - [i29]Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. CoRR abs/2007.08914 (2020)
2010 – 2019
- 2019
- [j83]Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano:
EATCS Fellows 2020 - Call for Nominations. Bull. EATCS 129 (2019) - [c133]Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura:
Dynamic Dominators and Low-High Orders in DAGs. ESA 2019: 50:1-50:18 - [c132]Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf:
Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP 2019: 7:1-7:15 - [c131]Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis:
Dynamic Algorithms for the Massively Parallel Computation Model. SPAA 2019: 49-58 - [c130]Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic:
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. STACS 2019: 35:1-35:17 - [e17]Maurizio Naldi, Giuseppe F. Italiano, Kai Rannenberg, Manel Medina, Athena Bourka:
Privacy Technologies and Policy - 7th Annual Privacy Forum, APF 2019, Rome, Italy, June 13-14, 2019, Proceedings. Lecture Notes in Computer Science 11498, Springer 2019, ISBN 978-3-030-21751-8 [contents] - [i28]Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic:
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. CoRR abs/1901.09877 (2019) - [i27]Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis:
Dynamic Algorithms for the Massively Parallel Computation Model. CoRR abs/1905.09175 (2019) - 2018
- [j82]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Dynamic algorithms via the primal-dual method. Inf. Comput. 261: 219-239 (2018) - [j81]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-vertex connectivity in directed graphs. Inf. Comput. 261: 248-264 (2018) - [j80]Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano:
Computing Critical Nodes in Directed Graphs. ACM J. Exp. Algorithmics 23 (2018) - [j79]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SIAM J. Comput. 47(3): 859-887 (2018) - [c129]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel:
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. ALENEX 2018: 169-183 - [c128]Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Maximum Colorful Cliques in Vertex-Colored Graphs. COCOON 2018: 480-491 - [c127]Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Maximum Colorful Cycles in Vertex-Colored Graphs. CSR 2018: 106-117 - [c126]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. ESA 2018: 46:1-46:16 - [c125]Giovanni Bottazzi, Giuseppe F. Italiano, Domenico Spera:
Preventing Ransomware Attacks Through File System Filter Drivers. ITASEC 2018 - [c124]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. LATIN 2018: 529-543 - [i26]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR abs/1802.10189 (2018) - [i25]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. CoRR abs/1806.10772 (2018) - [i24]Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski:
Faster Algorithms for All-Pairs Bounded Min-Cuts. CoRR abs/1807.05803 (2018) - 2017
- [j78]Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán:
Foreword. Theor. Comput. Sci. 658: 263 (2017) - [j77]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. 698: 40-66 (2017) - [c123]Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano:
Computing Critical Nodes in Directed Graphs. ALENEX 2017: 43-57 - [c122]Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Tropical Paths in Vertex-Colored Graphs. COCOA (2) 2017: 291-305 - [c121]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. ESA 2017: 50:1-50:15 - [c120]Giacomo Marciani, Michele Porretta, Matteo Nardelli, Giuseppe F. Italiano:
A Data Streaming Approach to Link Mining in Criminal Networks. FiCloud Workshops 2017: 138-143 - [c119]Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP 2017: 42:1-42:15 - [c118]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs 2-Reachability in O(n^w log n) Time. ICALP 2017: 74:1-74:14 - [c117]Giovanni Bottazzi, Giuseppe Francesco Italiano, Giuseppe Giulio Rutigliano:
An Operational Framework for Incident Handling. ITASEC 2017: 126-135 - [c116]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Strong Connectivity in Directed Graphs under Failures, with Applications. SODA 2017: 1880-1899 - [c115]Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis:
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. SODA 2017: 1900-1918 - [c114]Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski:
Decremental single-source reachability in planar digraphs. STOC 2017: 1108-1121 - [c113]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou:
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders. SEA 2017: 9:1-9:16 - [c112]Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri:
On Bubble Generators in Directed Graphs. WG 2017: 18-31 - [i23]Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR abs/1704.08235 (2017) - [i22]Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis:
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. CoRR abs/1705.10709 (2017) - [i21]Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski:
Decremental Single-Source Reachability in Planar Digraphs. CoRR abs/1705.11163 (2017) - [i20]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. CoRR abs/1706.10228 (2017) - 2016
- [j76]Donatella Firmani, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Strong Articulation Points and Strong Bridges in Large Scale Graphs. Algorithmica 74(3): 1123-1147 (2016) - [j75]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
On Resilient Graph Spanners. Algorithmica 74(4): 1363-1385 (2016) - [j74]Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas:
EATCS Fellows' Advice to the Young Theoretical Computer Scientist. Bull. EATCS 119 (2016) - [j73]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. ACM Trans. Algorithms 13(1): 9:1-9:24 (2016) - [c111]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
2-Connectivity in Directed Graphs. ESA 2016: 1:1-1:14 - [c110]Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis:
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS 2016: 315-324 - [c109]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental 2-Edge-Connectivity in Directed Graphs. ICALP 2016: 49:1-49:15 - [c108]Nilakantha Paudel, Marco Querini, Giuseppe F. Italiano:
Online Handwritten Signature Verification for Low-End Devices. ICISSP (Revised Selected Papers) 2016: 25-43 - [c107]Nilakantha Paudel, Marco Querini, Giuseppe F. Italiano:
Handwritten Signature Verification for Mobile Phones. ICISSP 2016: 46-52 - [c106]Giovanni Bottazzi, Giuseppe F. Italiano, Giuseppe Giulio Rutigliano:
Frequency Domain Analysis of Large-Scale Proxy Logs for Botnet Traffic Detection. SIN 2016: 76-80 - [c105]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA 2016: 150-166 - [r22]Camil Demetrescu, Giuseppe F. Italiano:
Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms 2016: 506-509 - [r21]Giuseppe F. Italiano:
Fully Dynamic All Pairs Shortest Paths. Encyclopedia of Algorithms 2016: 790-792 - [r20]Giuseppe F. Italiano:
Fully Dynamic Connectivity: Upper and Lower Bounds. Encyclopedia of Algorithms 2016: 793-797 - [r19]Giuseppe F. Italiano:
Fully Dynamic Higher Connectivity. Encyclopedia of Algorithms 2016: 797-800 - [r18]Giuseppe F. Italiano:
Fully Dynamic Higher Connectivity for Planar Graphs. Encyclopedia of Algorithms 2016: 800-802 - [r17]Giuseppe F. Italiano:
Fully Dynamic Minimum Spanning Trees. Encyclopedia of Algorithms 2016: 802-805 - [r16]Giuseppe F. Italiano:
Fully Dynamic Planarity Testing. Encyclopedia of Algorithms 2016: 806-808 - [r15]Camil Demetrescu, Giuseppe F. Italiano:
Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2016: 1994-1996 - [r14]Camil Demetrescu, Giuseppe F. Italiano:
Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2016: 2242-2246 - [r13]Camil Demetrescu, Giuseppe F. Italiano:
Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2016: 2333-2337 - [i19]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
An Experimental Study of Dynamic Dominators. CoRR abs/1604.02711 (2016) - [i18]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Design of Dynamic Algorithms via Primal-Dual Method. CoRR abs/1604.05337 (2016) - [i17]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental 2-Edge-Connectivity in Directed Graphs. CoRR abs/1607.07073 (2016) - [i16]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs $2$-reachability in Õ(nω) Time. CoRR abs/1612.08075 (2016) - [i15]Giuseppe F. Italiano, Marc J. van Kreveld, Bettina Speckmann, Guy Theraulaz:
Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022). Dagstuhl Reports 6(1): 55-68 (2016) - 2015
- [j72]Hans L. Bodlaender, MohammadTaghi Hajiaghayi, Giuseppe F. Italiano:
Editorial. Algorithmica 73(4): 748-749 (2015) - [j71]Hans L. Bodlaender, Mohammad Taghi Hajiaghayi, Giuseppe F. Italiano:
Erratum to: Editorial. Algorithmica 73(4): 750 (2015) - [j70]Marco Querini, Marco Gattelli, Valerio M. Gentile, Giuseppe F. Italiano:
A New System for Secure Handwritten Signing of Documents. Int. J. Comput. Sci. Appl. 12(2): 37-56 (2015) - [c104]Giovanni Bottazzi, Giuseppe Francesco Italiano:
Fast Mining of Large-Scale Logs for Botnet Detection: A Field Study. CIT/IUCC/DASC/PICom 2015: 1989-1996 - [c103]William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Connectivity in Directed Graphs: An Experimental Study. ALENEX 2015: 173-187 - [c102]Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis:
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA 2015: 582-594 - [c101]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Design of Dynamic Algorithms via Primal-Dual Method. ICALP (1) 2015: 206-218 - [c100]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Vertex Connectivity in Directed Graphs. ICALP (1) 2015: 605-616 - [c99]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SODA 2015: 785-804 - [c98]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. SODA 2015: 1988-2005 - [e16]Giuseppe F. Italiano, Marie Schmidt:
15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2015, September 17, 2015, Patras, Greece. OASIcs 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-99-6 [contents] - [e15]Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella:
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. Lecture Notes in Computer Science 9234, Springer 2015, ISBN 978-3-662-48056-4 [contents] - [e14]Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella:
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9235, Springer 2015, ISBN 978-3-662-48053-3 [contents] - [e13]Giuseppe F. Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer, Roman Spanek, Martin Rimnac:
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) , Pec pod Snezkou, Czech Republic, January 24-29, 2015. CEUR Workshop Proceedings 1326, CEUR-WS.org 2015 [contents] - [e12]Giuseppe F. Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer:
SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings. Lecture Notes in Computer Science 8939, Springer 2015, ISBN 978-3-662-46077-1 [contents] - [i14]Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis:
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR abs/1509.02841 (2015) - [i13]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR abs/1511.02913 (2015) - 2014
- [j69]Marco Querini, Giuseppe F. Italiano:
Reliability and data density in high capacity color barcodes. Comput. Sci. Inf. Syst. 11(4): 1595-1615 (2014) - [c97]Marco Querini, Marco Gattelli, Valerio M. Gentile, Giuseppe F. Italiano:
Handwritten Signature Verification with 2D Color Barcodes. FedCSIS 2014: 701-708 - [c96]Daniel Delling, Giuseppe F. Italiano, Thomas Pajor, Federico Santaroni:
Better transit routing by exploiting vehicle GPS data. IWCTS@SIGSPATIAL 2014: 31-40 - [c95]Donatella Firmani, Giuseppe F. Italiano, Luigi Laura:
The (not so) Critical Nodes of Criminal Networks. SocInfo Workshops 2014: 87-96 - [c94]Donatella Firmani, Giuseppe F. Italiano, Marco Querini:
Engineering Color Barcode Algorithms for Mobile Applications. SEA 2014: 211-222 - [c93]Luca Allulli, Giuseppe F. Italiano, Federico Santaroni:
Exploiting GPS Data in Public Transport Journey Planners. SEA 2014: 295-306 - [i12]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura:
Experimental Evaluation of Algorithms for the Food-Selection Problem. CoRR abs/1401.7591 (2014) - [i11]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. CoRR abs/1407.3041 (2014) - [i10]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Vertex Connectivity in Directed Graphs. CoRR abs/1409.6277 (2014) - [i9]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. CoRR abs/1412.1318 (2014) - [i8]Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán:
Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201). Dagstuhl Reports 4(5): 1-26 (2014) - 2013
- [j68]Maurizio Naldi, Sancho Salcedo-Sanz, Leopoldo Carro-Calvo, Luigi Laura, Antonio Portilla-Figueras, Giuseppe F. Italiano:
A traffic-based evolutionary algorithm for network clustering. Appl. Soft Comput. 13(11): 4303-4319 (2013) - [j67]Giuseppe F. Italiano:
The Gödel Prize 2014 - Call for Nominations. Bull. EATCS 111 (2013) - [j66]Marco Querini, Giuseppe F. Italiano:
Facial Recognition with 2D Color Barcodes. Int. J. Comput. Sci. Appl. 10(1): 78-97 (2013) - [j65]Dany Breslauer, Giuseppe F. Italiano:
Near real-time suffix tree construction via the fringe marked ancestor problem. J. Discrete Algorithms 18: 32-48 (2013) - [j64]Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano:
Data structures resilient to memory faults: An experimental study of dictionaries. ACM J. Exp. Algorithmics 18 (2013) - [j63]Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano:
On a facility location problem with applications to tele-diagnostic. Optim. Lett. 7(6): 1179-1192 (2013) - [c92]Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Is Timetabling Routing Always Reliable for Public Transport?. ATMOS 2013: 15-26 - [c91]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini:
On Resilient Graph Spanners. ESA 2013: 85-96 - [c90]Giuseppe F. Italiano, Henning Meyerhenke, Guy E. Blelloch, Philippas Tsigas:
Topic 12: Theory and Algorithms for Parallel Computation - (Introduction). Euro-Par 2013: 645-646 - [c89]Marco Querini, Giuseppe F. Italiano:
Color Classifiers for 2D Color Barcodes. FedCSIS 2013: 611-618 - [p5]Camil Demetrescu, Giuseppe F. Italiano:
The Quest for the Shortest Route. The Power of Algorithms 2013: 85-105 - [e11]Hans L. Bodlaender, Giuseppe F. Italiano:
Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. Lecture Notes in Computer Science 8125, Springer 2013, ISBN 978-3-642-40449-8 [contents] - [e10]Peter van Emde Boas, Frans C. A. Groen, Giuseppe F. Italiano, Jerzy R. Nawrocki, Harald Sack:
SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings. Lecture Notes in Computer Science 7741, Springer 2013, ISBN 978-3-642-35842-5 [contents] - [i7]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
On Robust Graph Spanners. CoRR abs/1303.1559 (2013) - [i6]Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner:
Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports 3(9): 169-189 (2013) - 2012
- [j62]Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Finding strong bridges and strong articulation points in linear time. Theor. Comput. Sci. 447: 74-84 (2012) - [j61]Dany Breslauer, Giuseppe F. Italiano:
On suffix extensions in suffix trees. Theor. Comput. Sci. 457: 27-34 (2012) - [c88]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
An Experimental Study of Dynamic Dominators. ESA 2012: 491-502 - [c87]Marco Querini, Giuseppe F. Italiano:
Facial Biometrics for 2D Barcodes. FedCSIS 2012: 755-762 - [c86]Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco:
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO 2012: 1-14 - [c85]Sancho Salcedo-Sanz, Leopoldo Carro-Calvo, Antonio Portilla-Figueras, Maurizio Naldi, Luigi Laura, Giuseppe F. Italiano:
Traffic vs topology in network clustering: Does it matter? IWCMC 2012: 36-41 - [c84]Giuseppe F. Italiano:
Strong Bridges and Strong Articulation Points of Directed Graphs. SOFSEM 2012: 43 - [c83]Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi, Federico Santaroni:
Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs. SEA 2012: 195-207 - [i5]Giuseppe D'Acquisto, Maurizio Naldi, Giuseppe F. Italiano:
Personal data disclosure and data breaches: the customer's viewpoint. CoRR abs/1203.3870 (2012) - 2011
- [j60]Marco Querini, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano:
2D Color Barcodes for Mobile Phones. Int. J. Comput. Sci. Appl. 8(1): 136-155 (2011) - [c82]Maurizio Naldi, Antonio Pavignani, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano:
The Competitor Busting Strategy in Keyword Auctions: Who's Worst Hit? CNSR 2011: 153-160 - [c81]Sancho Salcedo-Sanz, Maurizio Naldi, Leopoldo Carro-Calvo, Luigi Laura, Antonio Portilla-Figueras, Giuseppe F. Italiano:
An evolutionary algorithm for network clustering through traffic matrices. IWCMC 2011: 1580-1584 - [c80]Vittorio Ottaviani, Alessandro Lentini, Antonio Grillo, Silvia Di Cesare, Giuseppe F. Italiano:
Shared Backup & Restore: Save, Recover and Share Personal Information into Closed Groups of Smartphones. NTMS 2011: 1-5 - [c79]Davide Cannone, Maurizio Naldi, Giuseppe F. Italiano, Andrea Brancaleoni:
A Simulator of a Mobile Ad-Hoc Network in a Hostile Environment. SIMULTECH 2011: 413-417 - [c78]Dany Breslauer, Giuseppe F. Italiano:
Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. SPIRE 2011: 156-167 - [c77]Dany Breslauer, Giuseppe F. Italiano:
On Suffix Extensions in Suffix Trees. SPIRE 2011: 301-312 - [c76]Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313-322 - [c75]Maurizio Naldi, Antonio Pavignani, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano:
A Model for the Dynamics of Bidders in the Simulation of Keyword Auctions. UKSim 2011: 440-445 - 2010
- [j59]Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano:
Maintaining dynamic minimum spanning trees: An experimental study. Discret. Appl. Math. 158(5): 404-425 (2010) - [j58]Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. Discret. Math. Algorithms Appl. 2(4): 591-606 (2010) - [j57]Maurizio Naldi, Giuseppe D'Acquisto, Giuseppe F. Italiano:
The value of location in keyword auctions. Electron. Commer. Res. Appl. 9(2): 160-170 (2010) - [c74]Giuseppe F. Italiano:
Resilient Algorithms and Data Structures. CIAC 2010: 13-24 - [c73]Antonio Grillo, Alessandro Lentini, Maurizio Naldi, Giuseppe F. Italiano:
Penalized Second Price: A New Pricing Algorithm for Advertising in Search Engines. CNSR 2010: 207-214 - [c72]Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Finding Strong Bridges and Strong Articulation Points in Linear Time. COCOA (1) 2010: 157-169 - [c71]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON 2010: 160-172 - [c70]Alessandro Distefano, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano:
SecureMyDroid: enforcing security in the mobile devices lifecycle. CSIIRW 2010: 27 - [c69]Antonio Grillo, Alessandro Lentini, Marco Querini, Giuseppe F. Italiano:
High Capacity Colored Two Dimensional Codes. IMCSIT 2010: 709-716 - [c68]Luigi Laura, Maurizio Naldi, Giuseppe F. Italiano:
Traffic-based network clustering. IWCMC 2010: 321-325 - [c67]Antonio Grillo, Alessandro Lentini, Vittorio Ottaviani, Giuseppe F. Italiano, Fabrizio Battisti:
SAVED: Secure Android Value addED services. MobiCASE 2010: 415-427 - [c66]Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano:
Experimental Study of Resilient Algorithms and Data Structures. SEA 2010: 1-12 - [c65]Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano:
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. SEA 2010: 398-410 - [e9]Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders:
Algorithm Engineering, 27.06. - 02.07.2010. Dagstuhl Seminar Proceedings 10261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i4]Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders:
10261 Abstracts Collection - Algorithm Engineering. Algorithm Engineering 2010 - [i3]Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders:
10261 Executive Summary - Algorithm Engineering. Algorithm Engineering 2010 - [i2]Giuseppe F. Italiano, Piotr Sankowski:
Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs. CoRR abs/1011.2843 (2010)
2000 – 2009
- 2009
- [j56]Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano:
The Price of Resiliency: a Case Study on Sorting with Memory Faults. Algorithmica 53(4): 597-620 (2009) - [j55]Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55(2): 346-374 (2009) - [j54]Giuseppe F. Italiano, Rossella Petreschi:
Preface. J. Discrete Algorithms 7(3): 279 (2009) - [j53]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Resilient dictionaries. ACM Trans. Algorithms 6(1): 1:1-1:19 (2009) - [j52]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small stretch (alpha, beta)-spanners in the streaming model. Theor. Comput. Sci. 410(36): 3406-3413 (2009) - [j51]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Optimal resilient sorting and searching in the presence of memory faults. Theor. Comput. Sci. 410(44): 4457-4470 (2009) - [c64]Paolo Spallaccini, Francesco Iovine, Giuseppe F. Italiano:
An automatized methodology design for real-time signal processing applications in multiple multi-core platforms. ICME 2009: 1829-1832 - [c63]Fabio Dellutri, Vittorio Ottaviani, Daniele Bocci, Giuseppe F. Italiano, Gianluigi Me:
Data reverse engineering on a smartphone. ICUMT 2009: 1-8 - [c62]Fabio Dellutri, Luigi Laura, Vittorio Ottaviani, Giuseppe F. Italiano:
Extracting social networks from seized smartphones and web data. WIFS 2009: 101-105 - 2008
- [j50]Camil Demetrescu, Giuseppe F. Italiano:
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. Algorithmica 51(4): 387-427 (2008) - [j49]Irene Finocchi, Giuseppe F. Italiano:
Sorting and Searching in Faulty Memories. Algorithmica 52(3): 309-332 (2008) - [j48]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
Novel Local-Search-Based Approaches to University Examination Timetabling. INFORMS J. Comput. 20(1): 86-99 (2008) - [c61]Antonio Grillo, Alessandro Lentini, Gianluigi Me, Giuseppe F. Italiano:
Transaction Oriented Text Messaging with Trusted-SMS. ACSAC 2008: 485-494 - [r12]Camil Demetrescu, Giuseppe F. Italiano:
Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms 2008 - [r11]Camil Demetrescu, Giuseppe F. Italiano:
Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2008 - [r10]Camil Demetrescu, Giuseppe F. Italiano:
Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2008 - [r9]Camil Demetrescu, Giuseppe F. Italiano:
Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2008 - [r8]Giuseppe F. Italiano:
Fully Dynamic All Pairs Shortest Paths. Encyclopedia of Algorithms 2008 - [r7]Giuseppe F. Italiano:
Fully Dynamic Connectivity: Upper and Lower Bounds. Encyclopedia of Algorithms 2008 - [r6]Giuseppe F. Italiano:
Fully Dynamic Higher Connectivity. Encyclopedia of Algorithms 2008 - [r5]Giuseppe F. Italiano:
Fully Dynamic Higher Connectivity for Planar Graphs. Encyclopedia of Algorithms 2008 - [r4]Giuseppe F. Italiano:
Fully Dynamic Minimum Spanning Trees. Encyclopedia of Algorithms 2008 - [r3]Giuseppe F. Italiano:
Fully Dynamic Planarity Testing. Encyclopedia of Algorithms 2008 - 2007
- [j47]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Designing reliable algorithms in unreliable memories. Comput. Sci. Rev. 1(2): 77-87 (2007) - [j46]Lars Arge, Giuseppe F. Italiano:
Preface. ACM J. Exp. Algorithmics 12: 2.1:1 (2007) - [j45]Giuseppe F. Italiano, Catuscia Palamidessi:
Preface. Theor. Comput. Sci. 380(1-2): 1 (2007) - [c60]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 - [c59]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 - [c58]Fabio Dellutri, Salvatore Di Blasi, Giuseppe F. Italiano:
Transparent File Protection in On-Demand Computing. GCA 2007: 116-122 - [c57]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Resilient search trees. SODA 2007: 547-553 - [e8]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, ISBN 981-277-098-4 [contents] - [e7]Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plásil:
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. Lecture Notes in Computer Science 4362, Springer 2007, ISBN 978-3-540-69506-6 [contents] - [e6]Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plásil, 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, ISBN 80-903298-9-6 [contents] - 2006
- [j44]Camil Demetrescu, Giuseppe F. Italiano:
Fully dynamic all pairs shortest paths with real edge weights. J. Comput. Syst. Sci. 72(5): 813-837 (2006) - [j43]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
CHECKCOL: Improved local search for graph coloring. J. Discrete Algorithms 4(2): 277-298 (2006) - [j42]Giuseppe F. Italiano, Alberto Marchetti-Spaccamela:
Preface. J. Discrete Algorithms 4(3): 337-338 (2006) - [j41]Camil Demetrescu, Giuseppe F. Italiano:
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. J. Discrete Algorithms 4(3): 353-383 (2006) - [j40]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small Stretch Spanners on Dynamic Graphs. J. Graph Algorithms Appl. 10(2): 365-385 (2006) - [j39]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) - [j38]Camil Demetrescu, Giuseppe F. Italiano:
Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithms 2(4): 578-601 (2006) - [c56]Fabrizio Grandoni, Giuseppe F. Italiano:
Algorithms and Constraint Programming. CP 2006: 2-14 - [c55]Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup:
Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA 2006: 732-743 - [c54]Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano:
The Price of Resiliency: A Case Study on Sorting with Memory Faults. ESA 2006: 768-779 - [c53]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) 2006: 286-298 - [c52]Fabrizio Grandoni, Giuseppe F. Italiano:
Improved Approximation for Single-Sink Buy-at-Bulk. ISAAC 2006: 111-120 - [c51]Camil Demetrescu, Giuseppe F. Italiano:
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. WCAN@ICALP 2006: 3-15 - [p4]Gianluigi Me, Giuseppe F. Italiano, Paolo Spagnoletti:
GSM and GPRS performance of IPSEC data communication. e-Business and Telecommunication Networks 2006: 134-142 - [e5]Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano:
Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings. Lecture Notes in Computer Science 3998, Springer 2006, ISBN 3-540-34375-X [contents] - 2005
- [j37]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) - [c50]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Designing Reliable Algorithms in Unreliable Memories. ESA 2005: 1-8 - [c49]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small Stretch Spanners on Dynamic Graphs. ESA 2005: 532-543 - [c48]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura:
Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83 - [e4]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. Lecture Notes in Computer Science 3580, Springer 2005, ISBN 3-540-27580-0 [contents] - 2004
- [j36]Camil Demetrescu, Giuseppe F. Italiano:
A new approach to dynamic all pairs shortest paths. J. ACM 51(6): 968-992 (2004) - [c47]Gianluigi Me, Giuseppe F. Italiano, Paolo Spagnoletti:
GSM and GPRS Performance of IPSEC Data Communication. ICETE (2) 2004: 3-11 - [c46]Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano:
Experimental analysis of dynamic all pairs shortest path algorithms. SODA 2004: 369-378 - [c45]Irene Finocchi, Giuseppe F. Italiano:
Sorting and searching in the presence of memory faults (without redundancy). STOC 2004: 101-110 - [c44]Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano:
JIVE: Java Interactive Software Visualization Environment. VL/HCC 2004: 41-43 - [c43]Camil Demetrescu, Giuseppe F. Italiano:
Engineering Shortest Path Algorithms. WEA 2004: 191-198 - [c42]Fabrizio Grandoni, Giuseppe F. Italiano:
Decremental Clique Problem. WG 2004: 142-153 - [c41]Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano:
A Stochastic Location Problem with Applications to Tele-diagnostic. WG 2004: 201-213 - [e3]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, ISBN 0-89871-564-4 [contents] - [r2]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Dynamic Trees. Handbook of Data Structures and Applications 2004 - [r1]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Dynamic Graphs. Handbook of Data Structures and Applications 2004 - 2003
- [j35]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Algorithm engineering, Algorithmics Column. Bull. EATCS 79: 48-63 (2003) - [j34]Gianfranco Bilardi, Giuseppe F. Italiano:
Preface. J. Algorithms 49(1): 1 (2003) - [c40]Fabrizio Grandoni, Giuseppe F. Italiano:
Improved Algorithms for Max-restricted Path Consistency. CP 2003: 858-862 - [c39]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Engineering and Visualizing Algorithms. GD 2003: 509-513 - [c38]Camil Demetrescu, Giuseppe F. Italiano:
A new approach to dynamic all pairs shortest paths. STOC 2003: 159-166 - [c37]Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano:
Search Data Structures for Skewed Strings. WEA 2003: 81-96 - [p3]Harold N. Gabow, Camil Demetrescu, Irene Finocchi, Giuseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graphs in Computer Science. Handbook of Graph Theory 2003: 952-1073 - 2002
- [j33]Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms 45(2): 93-125 (2002) - [j32]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) - [c36]Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano:
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. ALENEX 2002: 111-125 - [c35]Camil Demetrescu, Giuseppe F. Italiano:
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. ICALP 2002: 633-643 - [c34]Giuseppe F. Italiano, Rajeev Rastogi, Bülent Yener:
Restoration Algorithms for Virtual Private Networks in the Hose Model. INFOCOM 2002: 131-139 - 2001
- [j31]Giuseppe F. Italiano:
Guest Editor's Introduction. Algorithmica 30(4): 471-472 (2001) - [c33]Camil Demetrescu, Giuseppe F. Italiano:
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. FOCS 2001: 260-267 - [i1]Camil Demetrescu, Giuseppe F. Italiano:
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. CoRR cs.DS/0104001 (2001) - 2000
- [j30]Daniele Frigioni, Giuseppe F. Italiano:
Dynamically Switching Vertices in Planar Graphs. Algorithmica 28(1): 76-103 (2000) - [j29]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) - [c32]Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX 2000: 72-83 - [c31]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher:
Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics 2000: 24-50 - [c30]Camil Demetrescu, Giuseppe F. Italiano:
Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. FOCS 2000: 381-389 - [c29]Camil Demetrescu, Giuseppe F. Italiano:
What Do We Learn from Experimental Algorithmics? MFCS 2000: 36-51 - [c28]Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
New Algorithms for Examination Timetabling. WAE 2000: 230-242
1990 – 1999
- 1999
- [j28]Giuseppe Cattaneo, Giuseppe F. Italiano:
Algorithm Engineering. ACM Comput. Surv. 31(3es): 3 (1999) - [j27]Roberto Grossi, Giuseppe F. Italiano:
Efficient Splitting and Merging Algorithms for Order Decomposable Problems. Inf. Comput. 154(1): 1-33 (1999) - [j26]Zvi Galil, Giuseppe F. Italiano, Neil Sarnak:
Fully Dynamic Planarity Testing with Applications. J. ACM 46(1): 28-91 (1999) - [j25]David Eppstein, Giuseppe F. Italiano:
PREFACE: Festschrift for Zvi Galil. J. Complex. 15(1): 1-3 (1999) - [c27]Roberto Grossi, Giuseppe F. Italiano:
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. ICALP 1999: 372-381 - [c26]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 - [p2]David Eppstein, Zvi Galil, Giuseppe F. Italiano:
Dynamic Graph Algorithms. Algorithms and Theory of Computation Handbook 1999 - [p1]Giuseppe F. Italiano, Rajeev Raman:
Topics in Data Structures. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j24]Giuseppe F. Italiano, Rajiv Ramaswami:
Maintaining Spanning Trees of Small Diameter. Algorithmica 22(3): 275-304 (1998) - [j23]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) - [c25]Roberto Grossi, Giuseppe F. Italiano:
Efficient cross-trees for external memory. External Memory Algorithms 1998: 87-106 - [c24]Fabio Pittarello, Mauro Pittarello, Giuseppe F. Italiano:
Architecture and Digital Exhibitions the Einstein Tower World. EGVE 1998: 162-171 - [c23]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 - [c22]Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni:
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. MFCS 1998: 1-16 - [e2]Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci:
Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings. Lecture Notes in Computer Science 1461, Springer 1998, ISBN 3-540-64848-8 [contents] - 1997
- [j22]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) - [j21]David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano:
An Empirical Study of Dynamic Graph Algorithms. ACM J. Exp. Algorithmics 2: 5 (1997) - [c21]Daniele Frigioni, Giuseppe F. Italiano:
Dynamically Switching Vertices in Planar Graphs (Extended Abstract). ESA 1997: 186-199 - [c20]Roberto Grossi, Giuseppe F. Italiano:
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). ICALP 1997: 605-615 - [c19]Giuseppe Amato, Giuseppe Cattaneo, Giuseppe F. Italiano:
Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract). SODA 1997: 314-323 - [e1]Giuseppe F. Italiano, Salvatore Orlando:
Workshop on Algorithm Engineering, WAE '97, Venezia, Italy, September 11-13, 1997. Proceedings. Università Ca' Foscari di Venezia 1997 [contents] - 1996
- [j20]Dora Giammarresi, Giuseppe F. Italiano:
Decremental 2- and 3-Connectivity on Planar Graphs. Algorithmica 16(3): 263-287 (1996) - [j19]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) - [c18]David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano:
An Empirical Study of Dynamic Graph Algorithms (Extended Abstract). SODA 1996: 192-201 - 1994
- [j18]Alberto Apostolico, Giuseppe F. Italiano, Giorgio Gambosi, Maurizio Talamo:
The Set Union Problem With Unlimited Backtracking. SIAM J. Comput. 23(1): 50-70 (1994) - [c17]Giuseppe F. Italiano, Rajiv Ramaswami:
Maintaining Spanning Trees of Small Diameter. ICALP 1994: 227-238 - 1993
- [j17]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 15(1): 173 (1993) - [j16]Zvi Galil, Giuseppe F. Italiano:
Maintaining the 3-Edge-Connected Components of a Graph On-Line. SIAM J. Comput. 22(1): 11-28 (1993) - [c16]Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch:
Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). ESA 1993: 212-223 - [c15]David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer:
Separator based sparsification for dynamic planar graph algorithms. STOC 1993: 208-217 - 1992
- [j15]David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano:
Sparse Dynamic Programming I: Linear Cost Functions. J. ACM 39(3): 519-545 (1992) - [j14]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) - [j13]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 13(1): 33-54 (1992) - [j12]Zvi Galil, Giuseppe F. Italiano:
Fully Dynamic Algorithms for 2-Edge Connectivity. SIAM J. Comput. 21(6): 1047-1069 (1992) - [j11]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) - [c14]David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig:
Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract). FOCS 1992: 60-69 - [c13]Zvi Galil, Giuseppe F. Italiano, Neil Sarnak:
Fully Dynamic Planarity Testing (Extended Abstract). STOC 1992: 495-506 - [c12]Dora Giammarresi, Giuseppe F. Italiano:
Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version). SWAT 1992: 221-232 - 1991
- [j10]Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo:
The Set Union Problem with Dynamic Weighted Backtracking. BIT 31(3): 381-393 (1991) - [j9]Zvi Galil, Giuseppe F. Italiano:
Data Structures and Algorithms for Disjoint Set Union Problems. ACM Comput. Surv. 23(3): 319-344 (1991) - [j8]Zvi Galil, Giuseppe F. Italiano:
A Note on Set Union with Arbitrary Deunions. Inf. Process. Lett. 37(6): 331-335 (1991) - [j7]Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Incremental Algorithms for Minimal Length Paths. J. Algorithms 12(4): 615-638 (1991) - [j6]Giorgio Ausiello, Giuseppe F. Italiano:
On-Line Algorithms for Polynomially Solvable Satisfiability Problems. J. Log. Program. 10(1): 69-90 (1991) - [j5]Zvi Galil, Giuseppe F. Italiano:
Reducing edge connectivity to vertex connectivity. SIGACT News 22(1): 57-61 (1991) - [c11]Zvi Galil, Giuseppe F. Italiano:
Maintaining Biconnected Components of Dynamic Planar Graphs. ICALP 1991: 339-350 - [c10]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 - [c9]Zvi Galil, Giuseppe F. Italiano:
Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract). STOC 1991: 317-327 - [c8]Giuseppe F. Italiano, Neil Sarnak:
Fully Persistent Data Structures for Disjoint Set Union Problems. WADS 1991: 449-460 - [c7]Giuseppe F. Italiano:
Distributed Algorithms for Updating Shortest Paths (Extended Abstract). WDAG 1991: 200-211 - 1990
- [j4]Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi:
Predicting deadlock in store-and-forward networks. Networks 20(7): 861-881 (1990) - [c6]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA 1990: 1-11 - [c5]Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Incremental Algorithms for Minimal Length Paths. SODA 1990: 12-21 - [c4]David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano:
Sparse Dynamic Programming. SODA 1990: 513-522
1980 – 1989
- 1989
- [j3]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) - [c3]Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). WADS 1989: 352-372 - 1988
- [j2]Giuseppe F. Italiano:
Finding Paths and Deleting Edges in Directed Acyclic Graphs. Inf. Process. Lett. 28(1): 5-11 (1988) - [c2]Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi:
Predicting deadlock in Store-and-Forward Networks. FSTTCS 1988: 123-142 - [c1]Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo:
Getting Back to the Past in the Union-Find Problem. STACS 1988: 8-17 - 1986
- [j1]Giuseppe F. Italiano:
Amortized Efficiency of a Path Retrieval Data Structure. Theor. Comput. Sci. 48(3): 273-281 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
