Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarGiuseppe 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
showing all ?? records
2010 – today
- 2018
[j81]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Dynamic algorithms via the primal-dual method. Inf. Comput. 261(Part): 219-239 (2018)- [j80]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-vertex connectivity in directed graphs. Inf. Comput. 261(Part): 248-264 (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) - [c126]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 - [c125]Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham:
Maximum Colorful Cliques in Vertex-Colored Graphs. COCOON 2018: 480-491 - [c124]Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham:
Maximum Colorful Cycles in Vertex-Colored Graphs. CSR 2018: 106-117 - [c123]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. ESA 2018: 46:1-46:16 - [c122]Giovanni Bottazzi, Giuseppe F. Italiano, Domenico Spera:
Preventing Ransomware Attacks Through File System Filter Drivers. ITASEC 2018 - [c121]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) - [c120]Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano:
Computing Critical Nodes in Directed Graphs. ALENEX 2017: 43-57 - [c119]Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham:
Tropical Paths in Vertex-Colored Graphs. COCOA (2) 2017: 291-305 - [c118]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. ESA 2017: 50:1-50:15 - [c117]Giacomo Marciani, Michele Porretta, Matteo Nardelli, Giuseppe F. Italiano:
A Data Streaming Approach to Link Mining in Criminal Networks. FiCloud Workshops 2017: 138-143 - [c116]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 - [c115]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 - [c114]Giovanni Bottazzi, Giuseppe Francesco Italiano, Giuseppe Giulio Rutigliano:
An Operational Framework for Incident Handling. ITASEC 2017: 126-135 - [c113]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Strong Connectivity in Directed Graphs under Failures, with Applications. SODA 2017: 1880-1899 - [c112]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 - [c111]Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski:
Decremental single-source reachability in planar digraphs. STOC 2017: 1108-1121 - [c110]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 - [c109]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. Bulletin of the 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) - [c108]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
2-Connectivity in Directed Graphs. ESA 2016: 1:1-1:14 - [c107]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 - [c106]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental 2-Edge-Connectivity in Directed Graphs. ICALP 2016: 49:1-49:15 - [c105]Nilakantha Paudel, Marco Querini, Giuseppe F. Italiano:
Handwritten Signature Verification for Mobile Phones. ICISSP 2016: 46-52 - [c104]Giovanni Bottazzi, Giuseppe F. Italiano, Giuseppe Giulio Rutigliano:
Frequency Domain Analysis of Large-Scale Proxy Logs for Botnet Traffic Detection. SIN 2016: 76-80 - [c103]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]
- [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]
- [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. IJCSA 12(2): 37-56 (2015) - [c102]Giovanni Bottazzi, Giuseppe Francesco Italiano:
Fast Mining of Large-Scale Logs for Botnet Detection: A Field Study. CIT/IUCC/DASC/PICom 2015: 1989-1996 - [c101]William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Connectivity in Directed Graphs: An Experimental Study. ALENEX 2015: 173-187 - [c100]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 - [c99]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Design of Dynamic Algorithms via Primal-Dual Method. ICALP (1) 2015: 206-218 - [c98]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Vertex Connectivity in Directed Graphs. ICALP (1) 2015: 605-616 - [c97]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SODA 2015: 785-804 - [c96]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. SODA 2015: 1988-2005 - [e15]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 fuer Informatik 2015, ISBN 978-3-939897-99-6 [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 I. Lecture Notes in Computer Science 9234, Springer 2015, ISBN 978-3-662-48056-4 [contents] - [e13]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] - [e12]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] - [e11]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) - [c95]Marco Querini, Marco Gattelli, Valerio M. Gentile, Giuseppe F. Italiano:
Handwritten Signature Verification with 2D Color Barcodes. FedCSIS 2014: 701-708 - [c94]Daniel Delling, Giuseppe F. Italiano, Thomas Pajor, Federico Santaroni:
Better transit routing by exploiting vehicle GPS data. IWCTS@SIGSPATIAL 2014: 31-40 - [c93]Donatella Firmani, Giuseppe F. Italiano, Luigi Laura:
The (not so) Critical Nodes of Criminal Networks. SocInfo Workshops 2014: 87-96 - [c92]Donatella Firmani, Giuseppe F. Italiano, Marco Querini:
Engineering Color Barcode Algorithms for Mobile Applications. SEA 2014: 211-222 - [c91]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]
- [j66]Marco Querini, Giuseppe F. Italiano:
Facial Recognition with 2D Color Barcodes. IJCSA 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 Journal of Experimental Algorithmics 18 (2013) - [j63]Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano:
On a facility location problem with applications to tele-diagnostic. Optimization Letters 7(6): 1179-1192 (2013) - [c90]Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Is Timetabling Routing Always Reliable for Public Transport?. ATMOS 2013: 15-26 - [c89]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini:
On Resilient Graph Spanners. ESA 2013: 85-96 - [c88]Giuseppe F. Italiano, Henning Meyerhenke, Guy E. Blelloch, Philippas Tsigas:
Topic 12: Theory and Algorithms for Parallel Computation - (Introduction). Euro-Par 2013: 645-646 - [c87]
- [p2]Camil Demetrescu, Giuseppe F. Italiano:
The Quest for the Shortest Route. The Power of Algorithms 2013: 85-105 - [e10]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] - [e9]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) - [c86]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
An Experimental Study of Dynamic Dominators. ESA 2012: 491-502 - [c85]
- [c84]Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco:
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO 2012: 1-14 - [c83]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 - [c82]Giuseppe F. Italiano:
Strong Bridges and Strong Articulation Points of Directed Graphs. SOFSEM 2012: 43 - [c81]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. IJCSA 8(1): 136-155 (2011) - [c80]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 - [c79]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 - [c78]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 - [c77]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 - [c76]Dany Breslauer, Giuseppe F. Italiano:
Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. SPIRE 2011: 156-167 - [c75]
- [c74]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 - [c73]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. Discrete Applied Mathematics 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. Discrete Math., Alg. and Appl. 2(4): 591-606 (2010) - [j57]Maurizio Naldi, Giuseppe D'Acquisto, Giuseppe F. Italiano:
The value of location in keyword auctions. Electronic Commerce Research and Applications 9(2): 160-170 (2010) - [c72]
- [c71]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 - [c70]Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Finding Strong Bridges and Strong Articulation Points in Linear Time. COCOA (1) 2010: 157-169 - [c69]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON 2010: 160-172 - [c68]Alessandro Distefano, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano:
SecureMyDroid: enforcing security in the mobile devices lifecycle. CSIIRW 2010: 27 - [c67]Antonio Grillo, Alessandro Lentini, Marco Querini, Giuseppe F. Italiano:
High Capacity Colored Two Dimensional Codes. IMCSIT 2010: 709-716 - [c66]