Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Luigi Laura
2010 – today
- 2013
[j13]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)- [c28]Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni: Is Timetabling Routing Always Reliable for Public Transport?. ATMOS 2013: 15-26
- [c27]Giorgio Ausiello, Donatella Firmani, Luigi Laura: The (betweenness) centrality of critical nodes and network cores. IWCMC 2013: 90-95
- [c26]Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan: Dominator Certification and Independent Spanning Trees: An Experimental Study. SEA 2013: 284-295
- 2012
- [j12]Giorgio Ausiello, Donatella Firmani, Luigi Laura: Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components. Networks 59(3): 275-288 (2012)
- [j11]Giuseppe F. Italiano, Luigi Laura, Federico Santaroni: Finding strong bridges and strong articulation points in linear time. Theor. Comput. Sci. 447: 74-84 (2012)
- [c25]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni: An Experimental Study of Dynamic Dominators. ESA 2012: 491-502
- [c24]Fabrizio d'Amore, Luigi Laura, Luca Luciani, Fabio Pagliarini: Planning, Designing and Evaluating Multiple eGovernment Interventions. DCNET/ICE-B/OPTICS 2012: 85-92
- [c23]Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco: Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO 2012: 1-14
- [c22]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
- [c21]Giorgio Ausiello, Donatella Firmani, Luigi Laura: Real-time analysis of critical nodes in network cores. IWCMC 2012: 42-46
- [c20]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
- [i2]Giorgio Ausiello, Donatella Firmani, Luigi Laura: Real-Time Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components. CoRR abs/1202.0319 (2012)
- [i1]Giorgio Ausiello, Francesco Cristiano, Luigi Laura: Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. Electronic Colloquium on Computational Complexity (ECCC) 19: 122 (2012)
- 2011
- [j10]Paola Alimonti, Esteban Feuerstein, Luigi Laura, Umberto Nanni: Linear time analysis of properties of conflict-free and general Petri nets. Theor. Comput. Sci. 412(4-5): 320-338 (2011)
- [c19]Roberto Beretta, Luigi Laura: Performance Evaluation of Algorithms for Newspaper Article Identification. ICDAR 2011: 394-398
- [c18]Giorgio Ausiello, Donatella Firmani, Luigi Laura: Real-time anomalies detection and analysis of network structure, with application to the Autonomous System network. IWCMC 2011: 1575-1579
- [c17]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
- [c16]Luigi Laura, Federico Santaroni: Computing Strongly Connected Components in the Streaming Model. TAPAS 2011: 193-205
- [e2]Luigi Laura, Leonardo Querzoni (Eds.): First International Workshop on Algorithms and Models for Distributed Event Processing 2011, Rome, Italy, September 19, 2011. Proceedings. ACM International Conference Proceeding Series 585, ACM 2011, ISBN 978-1-4503-0922-6
- 2010
- [c15]Giuseppe F. Italiano, Luigi Laura, Federico Santaroni: Finding Strong Bridges and Strong Articulation Points in Linear Time. COCOA (1) 2010: 157-169
- [c14]Luigi Laura, Maurizio Naldi, Giuseppe F. Italiano: Traffic-based network clustering. IWCMC 2010: 321-325
2000 – 2009
- 2009
- [c13]Giorgio Ausiello, Donatella Firmani, Luigi Laura: Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components. ICTCS 2009: 26-29
- 2008
- [j9]Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura: The online Prize-Collecting Traveling Salesman Problem. Inf. Process. Lett. 107(6): 199-204 (2008)
- [j8]Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura: The on-line asymmetric traveling salesman problem. J. Discrete Algorithms 6(2): 290-298 (2008)
- [j7]Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura: The complexity of uniform Nash equilibria and related regular subgraph problems. Theor. Comput. Sci. 401(1-3): 144-152 (2008)
- [j6]Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura: On the power of lookahead in on-line server routing problems. Theor. Comput. Sci. 408(2-3): 116-128 (2008)
- 2007
- [j5]Luca Allulli, Roberto Baldoni, Luigi Laura, Sara Tucci Piergiovanni: On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern. IEEE Trans. Computers 56(6): 853-858 (2007)
- [j4]Debora Donato, Luigi Laura, Stefano Leonardi, Stefano Millozzi: The Web as a graph: How far we are. ACM Trans. Internet Techn. 7(1) (2007)
- [c12]Tania Di Mascio, Luigi Laura, Valeria Mirabella: The Interface of VISTO, a New Vector Image Search Tool. HCI (8) 2007: 417-426
- [e1]Giuseppe F. Italiano, Eugenio Moggi, Luigi Laura (Eds.): Theoretical Computer Science, 10th Italian Conference, ICTCS 2007, Rome, Italy, October 3-5, 2007, Proceedings. World Scientific 2007, ISBN 981-277-098-4
- 2006
- [j3]Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn: Algorithms and Experiments for the Webgraph. J. Graph Algorithms Appl. 10(2): 219-236 (2006)
- [c11]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura: Visual editing of animated algorithms: the Leonardo Web builder. AVI 2006: 476-479
- [c10]Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura: On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance. TAMC 2006: 1-20
- 2005
- [c9]Luca Allulli, Giorgio Ausiello, Luigi Laura: On the Power of Lookahead in On-Line Vehicle Routing Problems. COCOON 2005: 728-736
- [c8]Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura: On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems. FCT 2005: 197-208
- [c7]Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura: The On-line Asymmetric Traveling Salesman Problem. WADS 2005: 306-317
- [c6]Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura: New Results on the Complexity of Uniformly Mixed Nash Equilibria. WINE 2005: 1023-1032
- [c5]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura: Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83
- 2004
- [j2]Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos: Algorithms for the On-Line Quota Traveling Salesman Problem. Inf. Process. Lett. 92(2): 89-94 (2004)
- [j1]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura: A Java-based system for building animated presentations over the Web. Sci. Comput. Program. 53(1): 37-49 (2004)
- [c4]Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos: Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON 2004: 290-299
- 2003
- [c3]Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn: Algorithms and Experiments for the Webgraph. ESA 2003: 703-714
- [c2]Devdatt P. Dubhashi, Luigi Laura, Alessandro Panconesi: Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. FSTTCS 2003: 168-182
- 2002
- [c1]Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie: Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. APPROX 2002: 200-214
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:07 CEST by the dblp team