Algorithm Design and Engineering Group

Department of Computer and System Sciences, University of Rome "La Sapienza"

Selected publications   [All publications]
Journals	Conferences	Book chapters	Books	Technical reports

Selected journals
1	2013	Andreas Wiese, Vincenzo Bonifaci, Sanjoy Baruah Partitioned EDF scheduling on a few types of unrelated multiprocessors Real-Time Systems, 49(2), pp. 219-238, 2013.
2	2012	Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling Algorithmica, 62(3-4), pp. 1034-1049, 2012.
3	2012	Vincenzo Bonifaci, Alberto Marchetti-Spaccamela Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems Algorithmica, 63(4), pp. 763-780, 2012.
4	2012	Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Paschos Online maximum k-coverage Discrete Applied Mathematics , 160(13-14), pp. 1901-1913, 2012.
5	2012	Giorgio Ausiello, Donatella Firmani, Luigi Laura Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components Networks, 59(3), pp. 275-288, 2012.
6	2012	Giuseppe F. Italiano, Luigi Laura, Federico Santaroni Finding strong bridges and strong articulation points in linear time Theoretical Computer Science, 447, pp. 74-84, 2012.
7	2012	Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow Algorithms and complexity for periodic real-time scheduling ACM Transactions on Algorithms, 9(1), pp. 6-6, 2012.
8	2012	U. Nanni, F. Betsou, S. Riondino, L. Rossetti, A. Spila, M.G. Valente, D. Della Morte, R. Palmirotta, M. Roselli, P. Ferroni, F. Guadagni SPRECware: software tools for Standard PREanalytical Code (SPREC) labelling – effective exchange and search of stored biospecimens The International Journal of Biological Markers, 27(3), pp. 272-279, 2012. doi:10.5301/JBM.2012.9718.
9	2012	Umberto Nanni, Marco Temperini eLearning for knowledge management in collaborative architectural design International Journal of Design Sciences & Technology, 19(2), pp. 105-121, 2012. http://europia.org/IJDST/Vol19/IJDSTV19N2_Paper Seven [2012].pdf.
10	2012	S Lehmann, F Guadagni, H Moore, G Ashton, M Barnes, E Benson, J Clements, I Koppandi, D Coppola, SY Demiroglu, Y DeSouza, A De Wilde, J Duker, J Eliason, B Glazer, K Harding, JP Jeon, J Kessler, T Kokkat, U Nanni, K Shea, A Skubitz, S Somiari, G Tybring, E Gunter, F Betsou Standard preanalytical coding for biospecimens: Review and implementation of the Sample PREanalytical Code (SPREC) Biopreservation and Biobanking, 10(4), pp. 366-374, 2012. DOI:10.1089/bio.2012.0012 .
11	2012	Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julian Mestre, Martin Skutella, Leen Stougie Universal Sequencing on an Unreliable Machine SIAM J. Comput., 41(3), pp. 565-586, 2012. DOI: http://dx.doi.org/10.1137/110844210.
12	2012	Vicente Acuna, Paulo Vieira Milreu, Ludovic Cottret, Alberto Marchetti-Spaccamela, Leen Stougie, Marie-France Sagot Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks Bioinformatics, 28(19), pp. 2474-2483, 2012. http://dx.doi.org/10.1093/bioinformatics/bts423.
13	2012	Vicente Acuna, Etienne Birmelé, Ludovic Cottret, Pierluigi Crescenzi, Fabien Jourdan, Vincent Lacroix, Alberto Marchetti-Spaccamela, Andrea Marino, Paulo Vieira Milreu, Marie-France Sagot, Leen Stougie Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets Theoretical Computer Science, 457, pp. 1-9, 2012. http://dx.doi.org/10.1016/j.tcs.2012.07.023.
14	2011	André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer Budgeted Matching and Budgeted Matroid Intersection via the Gasoline Puzzle Mathematical Programming, 128(1-2), pp. 355-372, 2011.
15	2011	Paola Alimonti, Esteban Feuerstein, Luigi Laura, Umberto Nanni Linear Time Analysis of Properties of Conflict-Free and General Petri Nets Theoretical Computer Science, 412(4-5), pp. 320-338, 2011. doi: 10.1016/j.tcs.2010.09.030.
16	2011	Umberto Nanni, Antonella Spila, Silvia Riondino, Maria Giovanna Valente, Paolo Somma, Mauro Iacoboni, Jhessica Alessandroni, Patrizia Ferroni, Mario Roselli, Fiorella Guadagni RFID as a new ICT tool to monitor Specimen Life Cycle and Quality Control in a Biobank International Journal of Biological Markers, 26(2), pp. 129-135, 2011. doi:10.5301/JBM.2011.8323 .
17	2011	G. S. Frandsen, P. Sankowski Dynamic normal forms and dynamic characteristic polynomial Theoretical Computer Science, 412(16), pp. 1470-1483, 2011.
18	2011	Aris Anagnostopoulos, Ravi Kumar, Mohamad Mahdian, Eli Upfal Sorting and selection on dynamic data Theoretical Computer Science, 2011. To appear.
19	2011	Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie Minimizing Flow Time in the Wireless Gathering Problem ACM Transactions on Algorithms, 7, pp. 33:1-33:20, 2011.
20	2010	Fotini Betsou, Sylvain Lehmann, Garry Ashton, Michael Barnes, Erica E. Benson, Domenico Coppola, Yvonne Desouza, James Eliason, Barbara Glazer, Fiorella Guadagni, Keith Harding, David J. Horsfall, Cynthia Kleeberger, Umberto Nanni, Anil Prasad, Kathi Shea, Amy Skubitz, Stella Somiari, Elaine Gunter Standard Preanalytical Coding for Biospecimens: Defining the Sample PREanalytical Code (SPREC) Cancer Epidemiology Biomarkers and Prevention, 19(4), pp. 1004-1011, 2010. doi: 10.1158/1055-9965.EPI-09-1268.
21	2010	Piotr Sankowski, Marcin Mucha Fast Dynamic Transitive Closure with Lookahead Algorithmica, 56(2), pp. 180-197, 2010.
22	2010	Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller Improved multiprocessor global schedulability analysis Real-Time Systems, 46(1), pp. 3-24, 2010.
23	2010	Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini Adapting parallel algorithms to the W-Stream model, with applications to graph problems Theoretical Computer Science, 411, pp. 3994-4004, 2010. DOI: 10.1016/j.tcs.2010.08.030.
24	2010	Vicente Acuna, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie A note on the complexity of finding and enumerating elementary modes Biosystems, 99(3), pp. 210-214, 2010.
25	2009	Camil Demetrescu, Irene Finocchi, Andrea Ribichini Trading off space for passes in graph streaming problems ACM Transactions on Algorithms, 6(1), pp. 1-17, 2009.
26	2009	Michail Vlachos, Aris Anagnostopoulos, Olivier Verscheure, Philip Yu Online Pairing of VoIP Conversations The VLDB Journal, 18(1), pp. 77-98, 2009.
27	2009	Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti Latency Constrained Aggregation in Sensor Networks ACM Transactions on Algorithms, 6(1), pp. 1-20, 2009.
28	2009	Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, Andrea Vitaletti Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. Theoretical Computer Science, 410(14), pp. 1346-1354, 2009.
29	2008	Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran Oracles for distances avoiding a failed node or link SIAM Journal on Computing, 37(5), pp. 1299-1318, 2008.
30	2008	Giorgio Ausiello, Camil Demetrescu, Paolo G. Franciosa, Giuseppe F. Italiano, Andrea Ribichini Graph Spanners in the Streaming Model: an Experimental Study Algorithmica, 2008. Appeared online.
31	2008	Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura On the Power of Lookahead in On-line Server Routing Problems Theoretical Computer Science, 408(2--3), pp. 116-128, 2008.
32	2008	Giorgio Ausiello, Paolo G. Franciosa, Giuseppe F. Italiano Small Stretch (alpha, beta)-Spanners in the Streaming Model Theoretical Computer Science, 2008. Special Issue in Honour of Burkhard Monien, to appear.
33	2008	Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura The complexity of uniform Nash equilibria and related regular subgraph problems Theoretical Computer Science, 401(1--3), pp. 144-152, 2008.
34	2008	Debora Donato, Stefano Leonardi, Stefano Millozzi, Panayiotis Tsaparas Mining The Inner Structure of the Web Graph Journal of Physics A: Mathematical and Theoretical, 41(22), pp. 224017-12pp, 2008.
35	2008	Debora Donato, Stefano Leonardi, Panayiotis Tsaparas Stability and Similarity of Link Analysis Ranking Algorithms. Internet Mathematics, 3(4), pp. 445-473, 2008.
36	2008	Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo Baeza-Yates, Stefano Leonardi Link analysis for web spam detection ACM Transactions on the Web (TWEB), 2(1), pp. 1-42, 2008.
37	2008	Jochen Koenemann, Stefano Leonardi, Guido Schaefer, Stefan H. M. van Zwam A group-strategyproof cost sharing mechanism for the steiner forest game. SIAM Journal on Computing, 37(5), pp. 1319-1341, 2008.
38	2007	Luca Allulli, Roberto Baldoni, Luigi Laura, Sara Tucci Piergiovanni On the Complexity of Removing Z-cycles from a Checkpoints and Communication Pattern IEEE Transaction on Computers, 56(6), pp. 853-858, 2007.
39	2007	Luca Becchetti Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy ACM Transactions on Algorithms, 3(2), 2007.
40	2006	Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schaefer, T. Vredeveld Average case and smoothed competitive analysis of the multi-level feedback algorithm Mathematics of Operations Research, 31, 2006. A preliminary version appeared in proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), 2003.
41	2006	Camil Demetrescu, Giuseppe F. Italiano Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms ACM Transactions on Algorithms, 2(4), pp. 578-601, 2006. Special issue devoted to selected papers from the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04).
42	2006	Giorgio Ausiello, Vangelis Paschos Reductions, completeness and the hardness of approximability European Journal of Operations Research, 172, pp. 719-739, 2006.
43	2005	Camil Demetrescu, Giuseppe F. Italiano Trade-Offs for Fully Dynamic Reachability on DAGs: Breaking Through the $O(n^2)$ Barrier Journal of the Association for Computing Machinery (JACM), 52(2), pp. 147-156, 2005.
44	2005	Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni Partially Dynamic Maintenance of Minimum Weight Hyperpaths Journal of Discrete Algorithms, 3(1), pp. 27-46, 2005.
45	2005	Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos Completeness in differential approximation classes International Journal of Foundations of Computer Science, 16(6), 2005.
46	2004	Camil Demetrescu, Giuseppe F. Italiano A New Approach to Dynamic All Pairs Shortest Paths Journal of the Association for Computing Machinery (JACM), 51(6), pp. 968-992, 2004.
47	2004	Luca Becchetti, Stefano Leonardi Non-clairvoyant scheduling to minimize the average flow time on Journal of the Association for Computing Machinery (JACM), 51, pp. 517-539, 2004.
48	2004	Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs Semi-clairvoyant scheduling Theoretical Computer Science, 324(2-3), pp. 325-335, 2004.
49	2004	Luca Becchetti, Stefano Leonardi, S. Muthukrishnan Scheduling to minimize average stretch without migration Journal of Computer and System Sciences (JCSS), 68, pp. 80-95, 2004.
50	2004	Stefano Leonardi, Guido Shaefer Cross-monotonic cost-sharing methods for connected facility location games Theoretical Computer Science, 326, pp. 431-442, 2004. A preliminary version appeared in Proc. of the ACM Conference on Electronic Commerce, 2004.

Selected conferences
1	2013	Graham Cormode, Donatella Firmani On Unifying the Space of l_0 Sampling Algorithms in Meeting on Algorithm Engineering & Experiments (ALENEX), 2013. To Appear.
2	2013	Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds in Proc. of the 40th Int. Colloquium on Automata, Languages and Programming (ICALP), 2013. To appear.
3	2012	Emilio Coppa, Camil Demetrescu, Irene Finocchi Input-Sensitive Profiling in Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2012), pp. 89-98, 2012.
4	2012	Giorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani k-Calling Context Profiling in Proceedings of the 27th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA 2012), pp. 867-878, 2012. DOI: 10.1145/2384616.2384679.
5	2012	Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese Assigning Sporadic Tasks to Unrelated Parallel Machines in 39th International Colloquium on Automata, Languages, and Programming (ICALP 2012), pp. 665-676, 2012. http://dx.doi.org/10.1007/978-3-642-31594-7_56.
6	2011	Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi Mining Hot Calling Contexts in Small Space in Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2011), pp. 516-527, 2011.
7	2011	G.F. Italiano, Y. Nussbaum, P. Sankowski, C. Wulff-Nilsen Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs in In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC 2011), 2011. To appear.
8	2011	Camil Demetrescu, Irene Finocchi, Andrea Ribichini Reactive Imperative Programming with Dataflow Constraints in Proceedings of the 26th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2011), pp. 407-426, 2011. Distinguished paper award.
9	2011	Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie Mixed-Criticality Scheduling of Sporadic Task Systems in Proceedings of the 19th Annual European Symposium on Algorithms, pp. 555-566, 2011.
10	2010	Aris Anagnostopoulos, Farizio Grandoni, Stefano Leonardi, Piotr Sankowski Online Network Design with Outliers in n Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Springer, pp. 114-126, 2010.
11	2010	A. Anagnostopoulos, C. Dombry, N. Guillotin-Plantard, I. Kontoyiannis, E. Upfal Stochastic analysis of the $k$-server problem on the circle in Proc. 21st International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2010), DMTCS, pp. 21-34, 2010.
12	2010	G. Borradaile, P. Sankowski, C. Wulff-Nilsen Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time in Proc. of the 51st Annual IEEE Symposium on. Foundations of Computer Science, pp. 601-610, 2010.
13	2010	M. Cygan, L. Kowalik, M. Mucha, M. Pilipczuk, P. Sankowski Fast Approximation in Subspaces by Doubling Metric Decomposition in In Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010), pp. 72-83, 2010.
14	2010	Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow Algorithms and Complexity for Periodic Real-Time Scheduling in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, pp. 1350-1359, 2010.
15	2010	Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie Scheduling Real-Time Mixed-Criticality Jobs in Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, pp. 90-101, 2010. http://dx.doi.org/10.1007/978-3-642-15155-2_10.
16	2010	Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julian Mestre, Martin Skutella, Leen Stougie Universal Sequencing on a Single Machine in Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, pp. 230-243, 2010. http://dx.doi.org/10.1007/978-3-642-13036-6_18.
17	2010	Vincenzo Bonifaci, Alberto Marchetti-Spaccamela Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems in 18th Annual European Symposium on Algorithms (ESA 2010), Liverpool, UK, September 6-8, pp. 230-241, 2010. http://dx.doi.org/10.1007/978-3-642-15781-3_20.
18	2010	Paulo Vieira Milreu, Vicente Acuna, Etienne Birmele, Pierluigi Crescenzi, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie, Vincent Lacroix Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms in Algorithms in Bioinformatics, 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, pp. 226-237, 2010. http://dx.doi.org/10.1007/978-3-642-15294-8_19.
19	2009	Ilaria Bordino, Debora Donato Dynamic characterization of a large Web graph in 1st Web Science Conference, 2009 (To appear), 2009.
20	2009	Irene Cappiello, Stefano Puglia, Andrea Vitaletti Design and Initial Evaluation of a Ubiquitous Touch-Based Remote Grocery Shopping Process in Proceedings of 1st IEEE International Workshop on Near Field Communication (NFC), pp. 9-14, 2009.
21	2009	Ioannis Chatzigiannakis, Christos Koninis, Georgios Mylonas, Ugo Colesanti, Andrea Vitaletti A Peer-to-Peer Framework for Globally-Available Sensor Networks and its Application in Building Management in 2nd International Workshop on Sensor Network Engineering (IWSNE 2009), 2009.
22	2009	Luca Becchetti, Ugo Colesanti, Alberto Marchetti-Spaccamela, Andrea Vitaletti Fully Decentralized Reccommendations in Pervasive Systems: Models and Experimental Analysis in First International Workshop on Data Warehousing and Knowledge Discovery from Sensors and Streams (DKSS), 2009. Extended version submitted to Knowledge and Information Systems (KAISS) by invitation.
23	2008	André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schaefer Budgeted matching and budgeted matroid intersection via the gasoline puzzle in Proc. 13th Conf. on Integer Programming and Combinatorial Optimization (IPCO '08), pp. 273-287, 2008.
24	2008	Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie Minimizing flow time in the wireless gathering problem in Proc. 25th Symposium on Theoretical Aspects of Computer Science (STACS '08), pp. 109-120, 2008.
25	2008	Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller A constant-approximate feasibility test for multiprocessor real-time scheduling in Proc. 16th European Symposium on Algorithms (ESA '08), pp. 210-221, 2008.
26	2008	Vincenzo Bonifaci, Tobias Harks, Guido Schaefer Stackelberg routing in arbitrary networks in Proc. 4th Workshop on Internet and Network Economics (WINE '08), pp. 239-250, 2008.
27	2008	Ludovic Couttret, Paulo Vieira Milreu, Vicente Acuna, Alberto Marchetti-Spaccamela, Fabio Viduani Martinez, Marie France Sagot, Leen Stougie Enumerating Precursor Sets of Target Metabolites in a Metabolic Network in Proc. Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Proceedings. LNCS vol 5251 Springer 2008, pp. 233-244, 2008.
28	2008	Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie Minimizing Average Flow Time in Sensor Data Gathering in Algorithmic Aspects of Wireless Sensor Networks, Fourth International Workshop, ALGOSENSORS 2008, pp. 18-29, 2008.
29	2008	Ilaria Bordino, Debora Donato, Aristides Gionis, Stefano Leonardi Mining large networks with subgraph counting in Proceedings of the Eighth IEEE International Conference on Data Mining (ICDM 2008), pp. 737-742, 2008.
30	2008	Luca Becchetti, Paolo Boldi, Carlos Castillo, Aris Gionis Efficient Semi-Streaming Algorithms for Local Triangle Counting in Massive Graphs in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD), pp. 16-24, 2008.
31	2008	Luca Becchetti, Ugo Colesanti, Alberto Marchetti-Spaccamela, Andrea Vitaletti Self-Adaptive Recommendation Systems: Models and Experimental Analysis in Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, pp. 479-480, 2008.
32	2007	Luca Allulli, Peter Lichodzijewski, Norbert Zeh Improved Cache-Oblivious Single-Source Shortest Paths For Small Edge Weights in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07), 2007.
33	2007	Giorgio Ausiello, Camil Demetrescu, Paolo G. Franciosa, Giuseppe F. Italiano, Andrea Ribichini Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments in Proceedings of the 15th Annual European Symposium on Algorithms (Engineering and Applications Track), pp. 605-617, 2007.
34	2006	Camil Demetrescu, Irene Finocchi, Andrea Ribichini Trading off space for passes in graph streaming problems in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06), pp. 714-723, 2006.
35	2006	Luciana Buriol, Carlos Castillo, Debora Donato, Stefano Leonardi, Stefano Millozzi Temporal Evolution of the Wikigraph in Proceedings of IEEE Web Intelligence, 2006.
36	2006	Luca Becchetti, Carlos Castillo The distribution of PageRank follows a power-law only for particular values of the damping factor in Proceedings of the 15th international conference on World Wide Web, pp. 941-942, 2006.
37	2006	Luca Becchetti, Carlos Castillo, Debora Donato, Adriano Fazzone A comparison of sampling techniques for Web characterization in Workshop on Link Analysis ({LinkKDD}), 2006.
38	2006	Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Massimo Santini, Sebastiano Vigna A Reference Collection for Web Spam in SIGIR Forum, Vol. 40, No. 2, 2006.
39	2006	Camil Demetrescu, Irene Finocchi A Data-driven Graphical Toolkit for Software Visualization in Proceedings of the 3rd ACM Symposium on Software Visualization (SOFTVIS 2006), pp. 57-66, 2006.
40	2006	Lisa Fleischer, Jochen Konemann, Stefano Leonardi, Guido Sch\"afer Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006.
41	2006	Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, Riccardo Baeza-Yates Using Rank Propagation and Probabilistic Counting for Link-Based Spam Detection in Proceedings of the Workshop on Web Mining and Web Usage Analysis ({WebKDD}), 2006, ACM press, 2006.
42	2006	Luciana Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler Counting Triangles in Data Streams in Proceedings of Symposium on Principles of Database Systems, {PODS}, ACM Press, 2006.
43	2006	M. Mastrogiovanni, C. Petrioli, M. Rossi, A. Vitaletti, M. Zorzi Integrated data delivery and interest dissemination techniques for wireless sensor networks in 49th annual {IEEE} {G}lobal {T} elecommunications {C}onference, 2006.
44	2006	Josep Diaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela Balanced Cut Approximation in Random Geometric Graphs in Proc. {ISAAC} 2006, Lect. Notes in Computer Sci. Springer Verlag, 2006.
45	2006	Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti Latency Constrained Aggregation in Sensor Networks in Proceedings of the European Symposium on Algorithms ({ESA}), 2006.
46	2005	Luca Becchetti, Jochen Koenemann, Stefano Leonardi, M. Pal Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy in Proceedings of the SIAM-ACM Symposium on Discrete Algorithms (SODA'05), pp. 375-384, 2005. Accepted for publication under minor revision in ACM Transaction on Algorithms.
47	2005	Jochen Koenemann, Stefano Leonardi, Guido Schaefer A group-strategyproof mechanism for Steiner forests in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05), 2005.
48	2005	Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano Small Stretch Spanners on Dynamic Graphs in Proceedings of European Symposium on Algorithms (ESA 2005) - LNCS 3669 - Springer, 2005.
49	2005	Jochen Könemann, Stefano Leonardi, Guido Schaefer, Stefan van Zwam From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. in Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lecture Notes in Computer Science 3580 Springer , pp. 930-942, 2005.
50	2004	Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), New Orleans, LA, pp. 369-378, 2004.
51	2004	Luca Becchetti Modeling locality: A probabilistic analysis of LRU and FWF in Proceedings of the 12th European Symposium on Algorithms (ESA'04), 2004.
52	2004	Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide Scheduling against an adversarial network in Proceedings of the 16th Annual ACM symposium on Parallel Algorithms (SPAA 2004), 2004.
53	2002	Camil Demetrescu, Giuseppe F. Italiano Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths in Proceedings of the 29-th International Colloquium on Automata, Languages, and Programming (ICALP'02), Málaga, Spain, 2002.

Selected book chapters
1	2010	Giorgio Ausiello Algoritmi nella storia Chapter L’informatica invisibile, a cura di G. Ausiello, R. Petreschi, Mondadori Università – Sapienza Università di Roma, 2010.
2	2010	Camil Demetrescu, Giuseppe F. Italiano La ricerca della via più breve Chapter L’informatica invisibile, a cura di G. Ausiello, R. Petreschi, Mondadori Università – Sapienza Università di Roma, 2010.
3	2007	Camil Demetrescu, Irene Finocchi Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems, A. Nayak ed I. Stojmenovic eds Chapter 13, Algorithms for Data Streams, John Wiley and Sons, 2007.
4	2005	Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano Handbook on Data Structures and Applications Chapter 36: Dynamic Graphs, Dinesh Mehta and Sartaj Sahni (eds.), CRC Press Series, in Computer and Information Science, 2005.
5	2004	Giorgio Ausiello, Luca Becchetti Optimization Combinatoire Chapter Algorithmes on-line, Hermes, 2004.

Selected books
1	2010	Giorgio Ausiello, Rossella Petreschi (eds.) L’informatica invisibile Mondadori Università – Sapienza Università di Roma, 2010.
2	2009	Camil Demetrescu, Andrew V. Goldberg, David S. Johnson (eds.) The Shortest Path Problem: Ninth DIMACS Implementation Challenge American Mathematical Society, 2009. DIMACS Series in Discrete Mathematics and Theoretical Computer Science.
3	2007	Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Umberto Ferraro Petrillo Progetto di algoritmi e strutture dati in Java ISBN 9788838663741, McGraw-Hill, 2007. In italian. Website: http://www.ateneonline.it/demetrescu/.
4	2007	Camil Demetrescu WEA 2007, 6th International Workshop on Experimental Algorithms, Proceedings. Lecture Notes in Computer Science 4525 ISBN 978-3-540-72844-3, Springer Verlag, 2007. Website: http://www.informatik.uni-trier.de/~ley/db/conf/wea/wea2007.html.
5	2005	Camil Demetrescu, Roberto Tamassia, Robert Sedgewick ALENEX/ANALCO 2005: 7th Workshop on Algorithm Engineering and Experiments and 2nd Workshop on Analytic Algorithmics and Combinatorics, Proceedings SIAM, ISBN 0-89871-596-2, 2005. Website: http://www.informatik.uni-trier.de/~ley/db/conf/alenex/alenex2005.html.
6	2005	Gerth Stolting Brodal, Stefano Leonardi ESA 2005, 13th Annual European Symposium, Proceedings. Lecture Notes in Computer Science 3669 Springer Verlag, 2005.
7	2004	Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano Algoritmi e Strutture Dati ISBN 88-386-6161-8, McGraw-Hill, 2004. In italian. Website: http://www.ateneonline.it/demetrescu/.
8	2003	Giorgio Ausiello, Fabrizio d'Amore, Giorgio Gambosi Linguaggi, Modelli, Complessità Franco Angeli, 2003.
9	1999	Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Springer Verlag, 1999.

Selected technical reports
1	2010	Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco Classification and Traversal Algorithmic Techniques for Optimization Problems on Directed Hyperpaths Technical Report no. 18-10, Department of Computer and System Sciences, University of Rome"La Sapienza", 2010. http://ojs.uniroma1.it/index.php/DIS_TechnicalReports/article/view/8955/8912.
2	2004	Giorgio Ausiello, Paolo G. Franciosa, Giuseppe F. Italiano Fully dynamic maintenance of 3-spanners on general graphs Technical Report no. 16-04, Department of Computer and System Sciences, University of Rome "La Sapienza", 2004.

Webmaster