Giuseppe F. Italiano
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
116
Venues
40
Active years
1988–2026
Best venue rank
A*
Where they publish
- AESA17 papers
- A*SODA14 papers
- A*ICALP12 papers
- A*STOC7 papers
- A*FOCS5 papers
- A*ICDE4 papers
- BMFCS4 papers
- AALENEX4 papers
- BWG3 papers
- CFedCSIS3 papers
- BIWCMC3 papers
- CIWOCA2 papers
- BSIROCCO2 papers
- BWALCOM2 papers
- ASTACS2 papers
- NationalCOCOON2 papers
- CCOCOA2 papers
- CICISSP2 papers
- CSPIRE2 papers
- ACP2 papers
- A*INFOCOM2 papers
- BWADS2 papers
- BEDBT1 paper
- CAlgosensors1 paper
- AWSDM1 paper
- BCPM1 paper
- BSPAA1 paper
- NationalCSR1 paper
- BLATIN1 paper
- CSIN1 paper
- CATMOS1 paper
- BEuroPar1 paper
- BSOFSEM1 paper
- CSIMULTECH1 paper
- CCIAC1 paper
- AACSAC1 paper
- BISAAC1 paper
- BWISE1 paper
- AGD1 paper
- CEGVE1 paper
Papers
116 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | EDBT | Fast Landmark Reconfiguration for Highway Cover Indexes. | David Coudert, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano |
| 2026 | ICDE | Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint. | Siwoo Song, Wonseok Shin, Kunsoo Park, Giuseppe F. Italiano, Zhengyi Yang, Wenjie Zhang |
| 2026 | IWOCA | Beer Path Problems in Temporal Graphs. | Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos, Anna Mpanti, Aris Pagourtzis, Christos Pergaminelis |
| 2025 | Algosensors | Graph Traversal via Connected Mobile Agents. | Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal |
| 2025 | ESA | Faster Dynamic 2-Edge Connectivity in Directed Graphs. | Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano |
| 2025 | MFCS | On the Performance of Mildly Greedy Players in k-Coloring Games. | Vittorio Bil, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano |
| 2025 | MFCS | Higher Connectivity in Directed Graphs (Invited Talk). | Giuseppe F. Italiano |
| 2025 | WSDM | An Edge-Based Decomposition Framework for Temporal Networks. | Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano |
| 2024 | FOCS | Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2024 | ICDE | Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking. | Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han |
| 2024 | SIROCCO | Online Drone Scheduling for Last-Mile Delivery. | Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal |
| 2024 | WALCOM | Black Hole Search in Dynamic Cactus Graph. | Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal |
| 2023 | WALCOM | Structural Parameterization of Cluster Deletion. | Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos |
| 2022 | ESA | Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2022 | ICDE | Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions. | Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han |
| 2022 | SIROCCO | Dispersion of Mobile Robots on Directed Anonymous Graphs. | Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma |
| 2021 | CPM | Compressed Weighted de Bruijn Graphs. | Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini |
| 2021 | ESA | Computing the 4-Edge-Connected Components of a Graph in Linear Time. | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2021 | ICDE | Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space. | Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han |
| 2021 | SODA | All-Pairs LCA in DAGs: Breaking through the | Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski |
| 2021 | SODA | Planar Reachability Under Single Vertex or Edge Failures. | Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis |
| 2020 | IWOCA | A Family of Tree-Based Generators for Bubbles in Directed Graphs. | Vicente Acua, Leandro Lima, Giuseppe F. Italiano, Luca Pep Sciarria, Marie-France Sagot, Blerina Sinaimeri |
| 2019 | ESA | Dynamic Dominators and Low-High Orders in DAGs. | Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura |
| 2019 | ICALP | Faster Algorithms for All-Pairs Bounded Min-Cuts. | Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf |
| 2019 | STACS | Dominating Sets and Connected Dominating Sets in Dynamic Graphs. | Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic |
| 2019 | SPAA | Dynamic Algorithms for the Massively Parallel Computation Model. | Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis |
| 2018 | ALENEX | Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. | Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel |
| 2018 | COCOON | Maximum Colorful Cliques in Vertex-Colored Graphs. | Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham |
| 2018 | CSR | Maximum Colorful Cycles in Vertex-Colored Graphs. | Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham |
| 2018 | ESA | Decremental SPQR-trees for Planar Graphs. | Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg |
| 2018 | LATIN | Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2017 | ALENEX | Computing Critical Nodes in Directed Graphs. | Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano |
| 2017 | COCOA | Tropical Paths in Vertex-Colored Graphs. | Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham |
| 2017 | ESA | Contracting a Planar Graph Efficiently. | Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski |
| 2017 | ICALP | All-Pairs 2-Reachability in O(n^w log n) Time. | Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski |
| 2017 | ICALP | Decremental Data Structures for Connectivity and Dominators in Directed Graphs. | Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis |
| 2017 | SODA | Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. | Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis |
| 2017 | SODA | Strong Connectivity in Directed Graphs under Failures, with Applications. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2017 | STOC | Decremental single-source reachability in planar digraphs. | Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski |
| 2017 | WG | On Bubble Generators in Directed Graphs. | Vicente Acua, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri |
| 2016 | ESA | 2-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2016 | FOCS | Decremental Single-Source Reachability and Strongly Connected Components in (m√n) Total Update Time. | Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis |
| 2016 | ICALP | Incremental 2-Edge-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2016 | ICISSP | Handwritten Signature Verification for Mobile Phones. | Nilakantha Paudel, Marco Querini, Giuseppe F. Italiano |
| 2016 | ICISSP | Online Handwritten Signature Verification for Low-End Devices. | Nilakantha Paudel, Marco Querini, Giuseppe F. Italiano |
| 2016 | SIN | Frequency Domain Analysis of Large-Scale Proxy Logs for Botnet Traffic Detection. | Giovanni Bottazzi, Giuseppe F. Italiano, Giuseppe Giulio Rutigliano |
| 2015 | ALENEX | 2-Connectivity in Directed Graphs: An Experimental Study. | William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
| 2015 | ESA | Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis |
| 2015 | ICALP | Design of Dynamic Algorithms via Primal-Dual Method. | Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano |
| 2015 | ICALP | 2-Vertex Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
| 2015 | SODA | Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. | Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano |
| 2015 | SODA | 2-Edge Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
| 2014 | FedCSIS | Handwritten Signature Verification with 2D Color Barcodes. | Marco Querini, Marco Gattelli, Valerio M. Gentile, Giuseppe F. Italiano |
| 2013 | ATMOS | Is Timetabling Routing Always Reliable for Public Transport?. | Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni |
| 2013 | EuroPar | Topic 12: Theory and Algorithms for Parallel Computation - (Introduction). | Giuseppe F. Italiano, Henning Meyerhenke, Guy E. Blelloch, Philippas Tsigas |
| 2013 | FedCSIS | Color Classifiers for 2D Color Barcodes. | Marco Querini, Giuseppe F. Italiano |
| 2012 | ESA | An Experimental Study of Dynamic Dominators. | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni |
| 2012 | FedCSIS | Facial Biometrics for 2D Barcodes. | Marco Querini, Giuseppe F. Italiano |
| 2012 | IWCMC | Traffic vs topology in network clustering: Does it matter? | Sancho Salcedo-Sanz, Leopoldo Carro-Calvo, Antonio Portilla-Figueras, Maurizio Naldi, Luigi Laura, Giuseppe F. Italiano |
| 2012 | SOFSEM | Strong Bridges and Strong Articulation Points of Directed Graphs. | Giuseppe F. Italiano |
| 2011 | IWCMC | An evolutionary algorithm for network clustering through traffic matrices. | Sancho Salcedo-Sanz, Maurizio Naldi, Leopoldo Carro-Calvo, Luigi Laura, Antonio Portilla-Figueras, Giuseppe F. Italiano |
| 2011 | STOC | Improved algorithms for min cut and max flow in undirected planar graphs. | Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen |
| 2011 | SIMULTECH | A Simulator of a Mobile Ad-Hoc Network in a Hostile Environment. | Davide Cannone, Maurizio Naldi, Giuseppe F. Italiano, Andrea Brancaleoni |
| 2011 | SPIRE | Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. | Dany Breslauer, Giuseppe F. Italiano |
| 2011 | SPIRE | On Suffix Extensions in Suffix Trees. | Dany Breslauer, Giuseppe F. Italiano |
| 2010 | CIAC | Resilient Algorithms and Data Structures. | Giuseppe F. Italiano |
| 2010 | COCOA | Finding Strong Bridges and Strong Articulation Points in Linear Time. | Giuseppe F. Italiano, Luigi Laura, Federico Santaroni |
| 2010 | COCOON | Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. | Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini |
| 2010 | IWCMC | Traffic-based network clustering. | Luigi Laura, Maurizio Naldi, Giuseppe F. Italiano |
| 2008 | ACSAC | Transaction Oriented Text Messaging with Trusted-SMS. | Antonio Grillo, Alessandro Lentini, Gianluigi Me, Giuseppe F. Italiano |
| 2007 | ESA | Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. | Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini |
| 2007 | ESA | Optimal Resilient Dynamic Dictionaries. | Gerth Stlting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave |
| 2007 | SODA | Resilient search trees. | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano |
| 2006 | CP | Algorithms and Constraint Programming. | Fabrizio Grandoni, Giuseppe F. Italiano |
| 2006 | ESA | Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? | Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup |
| 2006 | ESA | The Price of Resiliency: A Case Study on Sorting with Memory Faults. | Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano |
| 2006 | ICALP | Optimal Resilient Sorting and Searching in the Presence of Memory Faults. | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano |
| 2006 | ISAAC | Improved Approximation for Single-Sink Buy-at-Bulk. | Fabrizio Grandoni, Giuseppe F. Italiano |
| 2005 | ESA | Small Stretch Spanners on Dynamic Graphs. | Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano |
| 2005 | ESA | Designing Reliable Algorithms in Unreliable Memories. | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano |
| 2005 | WISE | Portraying Algorithms with Leonardo Web. | Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura |
| 2004 | SODA | Experimental analysis of dynamic all pairs shortest path algorithms. | Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano |
| 2004 | STOC | Sorting and searching in the presence of memory faults (without redundancy). | Irene Finocchi, Giuseppe F. Italiano |
| 2004 | WG | A Stochastic Location Problem with Applications to Tele-diagnostic. | Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano |
| 2004 | WG | Decremental Clique Problem. | Fabrizio Grandoni, Giuseppe F. Italiano |
| 2003 | CP | Improved Algorithms for Max-restricted Path Consistency. | Fabrizio Grandoni, Giuseppe F. Italiano |
| 2003 | GD | Engineering and Visualizing Algorithms. | Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano |
| 2003 | STOC | A new approach to dynamic all pairs shortest paths. | Camil Demetrescu, Giuseppe F. Italiano |
| 2002 | ALENEX | Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. | Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano |
| 2002 | ICALP | Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. | Camil Demetrescu, Giuseppe F. Italiano |
| 2002 | INFOCOM | Restoration Algorithms for Virtual Private Networks in the Hose Model. | Giuseppe F. Italiano, Rajeev Rastogi, Blent Yener |
| 2001 | FOCS | Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. | Camil Demetrescu, Giuseppe F. Italiano |
| 2000 | FOCS | Fully Dynamic Transitive Closure: Breaking Through the O(n | Camil Demetrescu, Giuseppe F. Italiano |
| 2000 | MFCS | What Do We Learn from Experimental Algorithmics? | Camil Demetrescu, Giuseppe F. Italiano |
| 1999 | ICALP | Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. | Roberto Grossi, Giuseppe F. Italiano |
| 1999 | INFOCOM | On the Optimal Placement of Web Proxies in the Internet. | Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby |
| 1998 | EGVE | Architecture and Digital Exhibitions the Einstein Tower World. | Fabio Pittarello, Mauro Pittarello, Giuseppe F. Italiano |
| 1998 | MFCS | Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. | Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni |
| 1997 | ESA | Dynamically Switching Vertices in Planar Graphs (Extended Abstract). | Daniele Frigioni, Giuseppe F. Italiano |
| 1997 | ICALP | Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). | Roberto Grossi, Giuseppe F. Italiano |
| 1997 | SODA | Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract). | Giuseppe Amato, Giuseppe Cattaneo, Giuseppe F. Italiano |
| 1996 | SODA | An Empirical Study of Dynamic Graph Algorithms (Extended Abstract). | David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano |
| 1994 | ICALP | Maintaining Spanning Trees of Small Diameter. | Giuseppe F. Italiano, Rajiv Ramaswami |
| 1993 | ESA | Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). | Giuseppe F. Italiano, Johannes A. La Poutr, Monika Rauch |
| 1993 | STOC | Separator based sparsification for dynamic planar graph algorithms. | David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer |
| 1992 | FOCS | Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) | David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig |
| 1992 | STOC | Fully Dynamic Planarity Testing (Extended Abstract) | Zvi Galil, Giuseppe F. Italiano, Neil Sarnak |
| 1991 | ICALP | Maintaining Biconnected Components of Dynamic Planar Graphs. | Zvi Galil, Giuseppe F. Italiano |
| 1991 | SODA | Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. | Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung |
| 1991 | STOC | Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) | Zvi Galil, Giuseppe F. Italiano |
| 1991 | WADS | Fully Persistent Data Structures for Disjoint Set Union Problems. | Giuseppe F. Italiano, Neil Sarnak |
| 1990 | SODA | Incremental Algorithms for Minimal Length Paths. | Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni |
| 1990 | SODA | Sparse Dynamic Programming. | David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano |
| 1990 | SODA | Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. | David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung |
| 1989 | WADS | Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). | Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni |
| 1988 | STACS | Getting Back to the Past in the Union-Find Problem. | Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo |