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
- 2025
[c151]Giuseppe Francesco Italiano, Alessio Martino, Giorgio Piccardo:
Invited Paper: Security and Privacy in Large Language and Foundation Models: A Survey on GenAI Attacks. ICDCIT 2025: 1-17- 2024
- [c150]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. FOCS 2024: 62-85 - [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]