default search action
Luigi Laura
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c61]Valentina Albano, Donatella Firmani, Luigi Laura, Jerin George Mathew, Anna Lucia Paoletti, Irene Torrente:
Resolving duplicates in Large Multiple-Choice Questions Repositories. IRCDL 2024: 34-40 - 2023
- [j22]Valentina Albano, Donatella Firmani
, Luigi Laura
NLP-Based Management of Large Multiple-Choice Test Item Repositories. J. Learn. Anal. 10(3): 28-44 (2023) - 2022
- [j21]Pasquale De Rosa, Michel Deriaz, Marco De Marco, Luigi Laura:
Service Recommendations with Deep Learning: A Study on Neural Collaborative Engines. Pac. Asia J. Assoc. Inf. Syst. 14(2): 5 (2022) - [c60]Luigi Laura, Antonio Miloso:
A Theoretical Framework for Computer Vision Learning Environment. ICWL 2022: 527-534 - [c59]Valentina Albano, Donatella Firmani, Luigi Laura, Anna Lucia Paoletti, Irene Torrente:
Managing Large Multiple-choice Test Items Repositories. IV 2022: 275-279 - 2021
- [j20]Marco De Marco, Paolo Fantozzi
Cognitive analytics management of the customer lifetime value: an artificial neural network approach. J. Enterp. Inf. Manag. 34(2): 679-696 (2021) - [c58]Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis:
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. ALENEX 2021: 85-97 - [c57]Paolo Fantozzi
Non-isomorphic CNF Generation. DCAI (1) 2021: 98-107 - [c56]Paolo Fantozzi, Luigi Laura, Antonio Nuzzo, Riccardo Piselli:
Justice as a Service. IESS 2021: 2007 - [c55]Tania Di Mascio
Age and Gender (Face) Recognition: A Brief Survey. MIS4TEL 2021: 105-113 - [i9]Luca Benedetto, Paolo Fantozzi, Luigi Laura:
Complexity-based partitioning of CSFI problem instances with Transformers. CoRR abs/2106.14481 (2021) - 2020
- [c54]Paolo Fantozzi
Collaborative Recommendations in Online Judges Using Autoencoder Neural Networks. DCAI 2020: 113-123 - [c53]Giovanni Luca Cascio Rizzo, Marco De Marco, Pasquale De Rosa
Collaborative Recommendations with Deep Feed-Forward Networks: An Approach to Service Personalization. IESS 2020: 65-78 - [c52]Giorgio Ausiello, Francesco Cristiano, Paolo Fantozzi, Luigi Laura:
Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. ICTCS 2020: 190-201
2010 – 2019
- 2019
- [c51]Loukas Georgiadis
Dynamic Dominators and Low-High Orders in DAGs. ESA 2019: 50:1-50:18 - [c50]Giorgio Audrito, Tania Di Mascio
Recommending Tasks in Online Judges. MIS4TEL 2019: 129-136 - 2018
- [j19]Loukas Georgiadis
2-vertex connectivity in directed graphs. Inf. Comput. 261: 248-264 (2018) - [c49]Tania Di Mascio
A Framework for Personalized Competitive Programming Training. ITHET 2018: 1-8 - [c48]Paolo Fantozzi
Visual Analysis of Vertex-Disjoint Path Connectivity in Networks. IV 2018: 260-265 - [c47]William Di Luigi, Paolo Fantozzi
Learning Analytics in Competitive Programming Training Systems. IV 2018: 321-325 - [c46]Vincenzo Baraniello, Luigi Laura, Maurizio Naldi:
Collaborative Language Learning Through Computer-Assisted Translation on a Wiki-Based Platform: Operations and Management. MIS4TEL 2018: 88-96 - 2017
- [j18]Luigi Laura
Searching the Web for illegal content: the anatomy of a semantic search engine. Soft Comput. 21(5): 1245-1252 (2017) - [j17]Giorgio Ausiello, Luigi Laura
Directed hypergraphs: Introduction and fundamental algorithms - A survey. Theor. Comput. Sci. 658: 293-306 (2017) - [c45]Loukas Georgiadis
Incremental Low-High Orders of Directed Graphs and Applications. SEA 2017: 27:1-27:21 - 2016
- [j16]Donatella Firmani
Strong Articulation Points and Strong Bridges in Large Scale Graphs. Algorithmica 74(3): 1123-1147 (2016) - [j15]Loukas Georgiadis
2-Edge Connectivity in Directed Graphs. ACM Trans. Algorithms 13(1): 9:1-9:24 (2016) - [c44]Vincenzo Baraniello, Chiara Degano, Luigi Laura, María Lozano Zahonero, Maurizio Naldi, Sandra Petroni:
Accuracy of Second Language Skills Self-assessment Through a Web-Based Survey Tool. MIS4TEL 2016: 163-171 - [c43]Giuseppe Chiapparo, Umberto Ferraro Petrillo, Donatella Firmani, Luigi Laura:
Biconnectivity of Social and Web Graphs. SEBD 2016: 54-65 - [i8]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
An Experimental Study of Dynamic Dominators. CoRR abs/1604.02711 (2016) - [i7]Loukas Georgiadis, Aikaterini Karanasiou, Konstantinos Giannis, Luigi Laura:
On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications. CoRR abs/1608.06462 (2016) - 2015
- [c42]William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Connectivity in Directed Graphs: An Experimental Study. ALENEX 2015: 173-187 - [c41]Loukas Georgiadis
2-Vertex Connectivity in Directed Graphs. ICALP (1) 2015: 605-616 - [c40]Luigi Laura, Gianluigi Me:
Searching the Web for Illegal Content: The Anatomy of a Semantic Search Engine. ICGS3 2015: 113-122 - [c39]Gabriele Farina, Luigi Laura:
Dynamic Subtrees Queries Revisited: The Depth First Tour Tree. IWOCA 2015: 148-160 - [c38]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. SODA 2015: 1988-2005 - [i6]Gabriele Farina, Luigi Laura:
Dynamic subtrees queries revised: the Depth First Tour Tree. CoRR abs/1502.05292 (2015) - 2014
- [c37]Luigi Laura
The Organization of Large-Scale Repositories of Learning Objects with Directed Hypergraphs. ICWL Workshops 2014: 23-33 - [c36]Luigi Laura
Visual Analysis Based on Dominator Trees with Application to Personalized eLearning. ICWL 2014: 207-212 - [c35]Luigi Laura
Vertical Semantic Discovery: The SICH Approach on NPS. INCoS 2014: 119-124 - [c34]Paolo Franchin, Luigi Laura
Probabilistic Inference in the Physical Simulation of Interdependent Critical Infrastructure Systems. SAFECOMP Workshops 2014: 328-338 - [c33]Donatella Firmani
The (not so) Critical Nodes of Criminal Networks. SocInfo Workshops 2014: 87-96 - [c32]Loukas Georgiadis
Loop Nesting Forests, Dominators, and Applications. SEA 2014: 174-186 - [i5]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura:
Experimental Evaluation of Algorithms for the Food-Selection Problem. CoRR abs/1401.7591 (2014) - [i4]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. CoRR abs/1407.3041 (2014) - [i3]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Vertex Connectivity in Directed Graphs. CoRR abs/1409.6277 (2014) - 2013
- [j14]Maurizio Naldi
A traffic-based evolutionary algorithm for network clustering. Appl. Soft Comput. 13(11): 4303-4319 (2013) - [c31]Donatella Firmani
Is Timetabling Routing Always Reliable for Public Transport?. ATMOS 2013: 15-26 - [c30]Giorgio Ausiello, Donatella Firmani
The (betweenness) centrality of critical nodes and network cores. IWCMC 2013: 90-95 - [c29]Loukas Georgiadis
Dominator Certification and Independent Spanning Trees: An Experimental Study. SEA 2013: 284-295 - 2012
- [j13]Giorgio Ausiello, Donatella Firmani
Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components. Networks 59(3): 275-288 (2012) - [j12]Giuseppe F. Italiano
Finding strong bridges and strong articulation points in linear time. Theor. Comput. Sci. 447: 74-84 (2012) - [c28]Loukas Georgiadis
An Experimental Study of Dynamic Dominators. ESA 2012: 491-502 - [c27]Fabrizio d'Amore, Luigi Laura, Luca Luciani, Fabio Pagliarini:
Planning, Designing and Evaluating Multiple eGovernment Interventions. DCNET/ICE-B/OPTICS 2012: 85-92 - [c26]Fabrizio d'Amore, Luigi Laura:
eGovernment Interventions: The Multiple Projects Evaluation Problem. ICETE (Selected Papers) 2012: 88-100 - [c25]Giorgio Ausiello, Giuseppe F. Italiano
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO 2012: 1-14 - [c24]Sancho Salcedo-Sanz, Leopoldo Carro-Calvo
Traffic vs topology in network clustering: Does it matter? IWCMC 2012: 36-41 - [c23]Giorgio Ausiello, Donatella Firmani
Real-time analysis of critical nodes in network cores. IWCMC 2012: 42-46 - [c22]Donatella Firmani
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. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j11]Paola Alimonti, Esteban Feuerstein, Luigi Laura
Linear time analysis of properties of conflict-free and general Petri nets. Theor. Comput. Sci. 412(4-5): 320-338 (2011) - [c21]Roberto Beretta, Luigi Laura
Performance Evaluation of Algorithms for Newspaper Article Identification. ICDAR 2011: 394-398 - [c20]Giorgio Ausiello, Donatella Firmani
Real-time anomalies detection and analysis of network structure, with application to the Autonomous System network. IWCMC 2011: 1575-1579 - [c19]Sancho Salcedo-Sanz, Maurizio Naldi
An evolutionary algorithm for network clustering through traffic matrices. IWCMC 2011: 1580-1584 - [c18]Luigi Laura
Computing Strongly Connected Components in the Streaming Model. TAPAS 2011: 193-205 - [e2]Luigi Laura, Leonardo Querzoni:
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 [contents] - 2010
- [c17]Giuseppe F. Italiano
Finding Strong Bridges and Strong Articulation Points in Linear Time. COCOA (1) 2010: 157-169 - [c16]Luigi Laura
Traffic-based network clustering. IWCMC 2010: 321-325
2000 – 2009
- 2009
- [c15]Giorgio Ausiello, Donatella Firmani, Luigi Laura:
Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components. ICTCS 2009: 26-29 - [c14]Fabio Dellutri, Luigi Laura
Extracting social networks from seized smartphones and web data. WIFS 2009: 101-105 - 2008
- [j10]Giorgio Ausiello, Vincenzo Bonifaci
The online Prize-Collecting Traveling Salesman Problem. Inf. Process. Lett. 107(6): 199-204 (2008) - [j9]Giorgio Ausiello, Vincenzo Bonifaci
The on-line asymmetric traveling salesman problem. J. Discrete Algorithms 6(2): 290-298 (2008) - [j8]Vincenzo Bonifaci
The complexity of uniform Nash equilibria and related regular subgraph problems. Theor. Comput. Sci. 401(1-3): 144-152 (2008) - [j7]Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci
On the power of lookahead in on-line server routing problems. Theor. Comput. Sci. 408(2-3): 116-128 (2008) - 2007
- [j6]Luca Allulli, Roberto Baldoni, Luigi Laura
On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern. IEEE Trans. Computers 56(6): 853-858 (2007) - [j5]Debora Donato, Luigi Laura
The Web as a graph: How far we are. ACM Trans. Internet Techn. 7(1): 4 (2007) - [c13]Tania Di Mascio
The Interface of VISTO, a New Vector Image Search Tool. HCI (8) 2007: 417-426 - [e1]Giuseppe F. Italiano, Eugenio Moggi, Luigi Laura:
Theoretical Computer Science, 10th Italian Conference, ICTCS 2007, Rome, Italy, October 3-5, 2007, Proceedings. World Scientific 2007, ISBN 981-277-098-4 [contents] - 2006
- [j4]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) - [c12]Vincenzo Bonifaci
Visual editing of animated algorithms: the Leonardo Web builder. AVI 2006: 476-479 - [c11]Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance. TAMC 2006: 1-20 - 2005
- [c10]Luca Allulli, Giorgio Ausiello, Luigi Laura:
On the Power of Lookahead in On-Line Vehicle Routing Problems. COCOON 2005: 728-736 - [c9]Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura:
On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems. FCT 2005: 197-208 - [c8]Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura:
The On-line Asymmetric Traveling Salesman Problem. WADS 2005: 306-317 - [c7]Vincenzo Bonifaci
New Results on the Complexity of Uniformly Mixed Nash Equilibria. WINE 2005: 1023-1032 - [c6]Vincenzo Bonifaci
Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83 - 2004
- [j3]Debora Donato, Luigi Laura
Simulating the Webgraph: a comparative analysis of models. Comput. Sci. Eng. 6(6): 84-89 (2004) - [j2]Giorgio Ausiello, Marc Demange, Luigi Laura
Algorithms for the On-Line Quota Traveling Salesman Problem. Inf. Process. Lett. 92(2): 89-94 (2004) - [j1]Vincenzo Bonifaci
A Java-based system for building animated presentations over the Web. Sci. Comput. Program. 53(1): 37-49 (2004) - [c5]Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos:
Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON 2004: 290-299 - 2003
- [c4]Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn:
Algorithms and Experiments for the Webgraph. ESA 2003: 703-714 - [c3]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
- [c2]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 - [c1]Luigi Laura, Stefano Leonardi, Guido Caldarelli, Paolo De Los Rios:
A Multi-Layer Model for the Web Graph. WebDyn@WWW 2002: 25-34
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-09 23:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: