default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Forlizzi
Person information
- affiliation: University of L'Aquila, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci:
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper). ICTCS 2024: 219-224- [i3]Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci:
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets. CoRR abs/2405.13875 (2024) - 2023
- [c18]Chiara Epifanio, Luca Forlizzi, Francesca Marzi, Filippo Mignosi, Giuseppe Placidi, Matteo Spezialetti:
On the k-Hamming and k-Edit Distances. ICTCS 2023: 143-156 - [c17]Enrico Nardelli
, Francesco Lacchia, Renzo Davoli, Michael Lodi, Marco Sbaraglia, Veronica Rossano, Enrichetta Gentile, Violetta Lonati, Mattia Monga, Anna Morpurgo, Luca Forlizzi, Giovanna Melideo, Sara Capecchi, Ilenia Fronza, Tullio Vardanega:
Learning Iteration for Grades 2-3: Puzzles vs. UMC in Code.org. SIGCSE (2) 2023: 1368 - [i2]Chiara Epifanio, Luca Forlizzi, Francesca Marzi, Filippo Mignosi, Giuseppe Placidi, Matteo Spezialetti:
On the k-Hamming and k-Edit Distances. CoRR abs/2306.09144 (2023) - 2020
- [c16]Luca Forlizzi, Giovanna Melideo, Cintia Scafa Urbaez Vilchez:
Supporting the Construction of Learning Paths in a Competency-Based Informatics Curriculum. MIS4TEL 2020: 185-194
2010 – 2019
- 2019
- [j8]Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. 38(1): 165-184 (2019) - 2018
- [c15]Annalisa D'Andrea, Luca Forlizzi, Guido Proietti:
Stability of Reapproximation Algorithms for the \beta β -Metric Traveling Salesman (Path) Problem. Adventures Between Lower Bounds and Higher Altitudes 2018: 156-171 - [c14]Luca Forlizzi, Michael Lodi, Violetta Lonati, Claudio Mirolo, Mattia Monga, Alberto Montresor, Anna Morpurgo, Enrico Nardelli:
A Core Informatics Curriculum for Italian Compulsory Education. ISSEP 2018: 141-153 - [c13]Roberto Borchia, Antonella Carbonaro, Giorgio Casadei, Luca Forlizzi, Michael Lodi, Simone Martini:
Problem Solving Olympics: An Inclusive Education Model for Learning Informatics. ISSEP 2018: 319-335 - [i1]Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. CoRR abs/1801.10416 (2018) - 2016
- [c12]Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
On the Clustered Shortest-Path Tree Problem. ICTCS 2016: 263-268 - 2012
- [c11]Giuseppe Bizzarri, Luca Forlizzi, F. Ricci:
A Collaborative Environment to Learn Programming. CSEDU (2) 2012: 471-476 - 2011
- [j7]Davide Bilò, Luca Forlizzi, Guido Proietti:
Approximating the Metric TSP in Linear Time. Theory Comput. Syst. 49(3): 615-631 (2011)
2000 – 2009
- 2008
- [j6]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. Internet Math. 5(4): 411-437 (2008) - [c10]Davide Bilò, Luca Forlizzi, Guido Proietti:
Approximating the Metric TSP in Linear Time. WG 2008: 43-54 - 2007
- [j5]Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer:
On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Oper. Res. 2(2): 83-93 (2007) - [c9]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
An algorithm composition scheme preserving monotonicity. PODC 2007: 360-361 - [c8]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE 2007: 503-514 - 2006
- [j4]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Oper. Res. 1(1) (2006) - [c7]Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer:
Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS 2006: 251-270 - 2005
- [c6]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM 2005: 147-156 - 2003
- [b1]Luca Forlizzi:
Algorithms and models for spatial data. Sapienza University of Rome, Italy, 2003 - [j3]José Antonio Cotelo Lema, Luca Forlizzi, Ralf Hartmut Güting, Enrico Nardelli, Markus Schneider:
Algorithms for Moving Objects Databases. Comput. J. 46(6): 680-712 (2003) - [c5]Adriano Di Pasquale, Luca Forlizzi, Christian S. Jensen, Yannis Manolopoulos, Enrico Nardelli, Dieter Pfoser, Guido Proietti, Simonas Saltenis, Yannis Theodoridis, Theodoros Tzouramanis, Michael Vassilakopoulos:
Access Methods and Query Processing Techniques. Spatio-Temporal Databases: The CHOROCHRONOS Approach 2003: 203-261 - [c4]Vittorio Bilò, Adriano Di Pasquale, Fabio Fioravanti, Michele Flammini, Luca Forlizzi, Francesco Lo Presti, Giovanna Melideo, Enrico Nardelli, Alfredo Navarra, Guido Proietti:
Quality of Service in Wireless Networks. IPDPS 2003: 224 - [c3]Luca Forlizzi, Bart Kuijpers, Enrico Nardelli:
Region-Based Querz Languages for Spatial Databases in the Topological Data Model. SSTD 2003: 344-361 - 2000
- [j2]Luca Forlizzi, Enrico Nardelli:
Characterization Results for the Poset Based Representation of Topological Relations - II: Intersection and Union. Informatica (Slovenia) 24(1) (2000) - [c2]Luca Forlizzi, Ralf Hartmut Güting, Enrico Nardelli, Markus Schneider:
A Data Model and Data Structures for Moving Objects Databases. SIGMOD Conference 2000: 319-330
1990 – 1999
- 1999
- [j1]Luca Forlizzi, Enrico Nardelli:
Characterization Results for the Poset Based Representation of Topological Relations - I: Introduction and Models. Informatica (Slovenia) 23(2) (1999) - 1998
- [c1]Luca Forlizzi, Enrico Nardelli:
Some Results on the Modelling of Spatial Data. SOFSEM 1998: 332-343
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 2025-01-20 23:04 CET 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:
