Luca Forlizzi

Orcid: 0000-0002-3923-7668

Affiliations:
  • University of L'Aquila, Italy


According to our database1, Luca Forlizzi authored at least 24 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Learning Iteration for Grades 2-3: Puzzles vs. UMC in Code.org.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 2, 2023

On the k-Hamming and k-Edit Distances.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2020
Supporting the Construction of Learning Paths in a Competency-Based Informatics Curriculum.
Proceedings of the Methodologies and Intelligent Systems for Technology Enhanced Learning, 2020

2019
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem.
J. Comb. Optim., 2019

2018
A Core Informatics Curriculum for Italian Compulsory Education.
Proceedings of the Informatics in Schools. Fundamentals of Computer Science and Software Engineering, 2018

Problem Solving Olympics: An Inclusive Education Model for Learning Informatics.
Proceedings of the Informatics in Schools. Fundamentals of Computer Science and Software Engineering, 2018

Stability of Reapproximation Algorithms for the \beta β -Metric Traveling Salesman (Path) Problem.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2016
On the Clustered Shortest-Path Tree Problem.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2012
A Collaborative Environment to Learn Programming.
Proceedings of the CSEDU 2012, 2012

2011
Approximating the Metric TSP in Linear Time.
Theory Comput. Syst., 2011

2008
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems.
Internet Math., 2008

2007
On the Approximability of TSP on Local Modifications of Optimally Solved Instances.
Algorithmic Oper. Res., 2007

An algorithm composition scheme preserving monotonicity.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
On the Stability of Approximation for Hamiltonian Path Problems.
Algorithmic Oper. Res., 2006

Reusing Optimal TSP Solutions for Locally Modified Input Instances.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2003
Algorithms and models for spatial data.
PhD thesis, 2003

Algorithms for Moving Objects Databases.
Comput. J., 2003

Region-Based Querz Languages for Spatial Databases in the Topological Data Model.
Proceedings of the Advances in Spatial and Temporal Databases, 8th International Symposium, 2003

Quality of Service in Wireless Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Access Methods and Query Processing Techniques.
Proceedings of the Spatio-Temporal Databases: The CHOROCHRONOS Approach, 2003

2000
Characterization Results for the Poset Based Representation of Topological Relations - II: Intersection and Union.
Informatica (Slovenia), 2000

A Data Model and Data Structures for Moving Objects Databases.
Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000

1999
Characterization Results for the Poset Based Representation of Topological Relations - I: Introduction and Models.
Informatica (Slovenia), 1999

1998
Some Results on the Modelling of Spatial Data.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998


  Loading...