The Italian Conference on Theoretical Computer Science (ICTCS) is the conference of the Italian Chapter
of the European Association for Theoretical Computer Science.
The purpose of ICTCS is to foster the cross-fertilization of ideas stemming from different areas of
theoretical computer science. In particular, ICTCS provides an ideal environment where junior
researchers and PhD students can meet senior researchers.
Topics
Contributions in any area of theoretical computer science are warmly invited from researchers of all nationalities.
The topics of interest include, but are not limited to, the following:
- algorithms
- argumentation
- automata theory
- complexity theory
- computational logic
- computational social choice
- concurrency theory
- cryptography
- discrete mathematics
- distributed computing
- dynamical systems
- formal methods
- game theory
- graph theory
- knowledge representation
- languages
- model checking
- multiagent systems
- process algebras
- quantum computing
- reasoning
- rewriting systems
- security and trust
- search and planning
- semantics
- specification and verification
- symbolic AI
- systems biology
- theorem proving
- type theory
Paper Submission
Two types of contributions, written in English and formatted according to CEUR-WS style, are solicited.
Regular papers: up to 12 pages (bibliography excluded), presenting original results not appeared or submitted elsewhere. To ease the reviewing process, the authors of regular papers may add an appendix, although reviewers are not required to consider it in their evaluation.
Communications: up to 5 pages (bibliography excluded), suitable for extended abstracts of papers already appeared/submitted or to be submitted elsewhere, as well as papers reporting ongoing research and overviews of PhD theses or research projects.
Authors are invited to submit their manuscripts in PDF format by accessing:
easychair.org/conferences/?conf=ictcs2025
All accepted original contributions (regular papers and communications with at least 5 pages including the bibliography) will be published on CEUR-WS.org (unless the authors waive).
Please use the CEURART LaTeX style from the CEUR-WS.org website, using the one-column format.
For each accepted contribution, at least one of the authors is required to attend the conference and present the paper.
Submission deadline:
June 15, 2025
June 22, 2025 - EXTENDED
TCS Special Issue
Following the tradition, the authors of the very best papers presented at the conference will be invited to submit an extended version of their work in a special issue of Theoretical Computer Science journal.
Invitations will be sent out after the workshop. The target is to publish the special issue by the end of the year 2026.
Important dates
- Submission deadline:
June 15, 2025 June 22, 2025 - EXTENDED
- Notification of acceptance: July 21, 2025
- Camera-ready: August 24, 2025
- Conference: September 10-12, 2025
Program Committee
- Mario Alviano (Università della Calabria)
- Vincenzo Auletta (Università di Salerno)
- Viviana Bono (Università di Torino)
- Domenico Cantone (Università di Catania)
- Stefania Costantini (Università dell'Aquila)
- Gianlorenzo D'Angelo (Gran Sasso Science Institute)
- Ugo Dal Lago (Università di Bologna)
- Luca Geatti (Università di Udine)
- Laura Giordano (Università del Piemonte Orientale)
- Roberta Gori (Università di Pisa)
- Isabella Mastroeni (Università di Verona)
- Paolo Massazza (Università dell'Insubria)
- Emanuela Merelli (Università di Camerino)
- Luca Moscardelli (Università di Chieti-Pescara) (co-Chair)
- Beatrice Palano (Università di Milano)
- Francesco Pasquale (Università di Roma Tor Vergata)
- Sabina Rossi (Università Ca' Foscari Venezia)
- Ivano Salvo (Università di Roma Sapienza)
- Arnaud Sangnier (Università di Genova)
- Francesco Santini (Università di Perugia)
- Francesca Scozzari (Università di Chieti-Pescara) (co-Chair)
- Marinella Sciortino (Università di Palermo)
- Cosimo Vinci (Università del Salento)
- Enea Zaffanella (Università di Parma)
Organizing committee
Invited speakers
University of Salerno
Theoretical Computer Science and Explanations that Transform the World
One way of defining ``knowledge'' is as ``consisting of information with good explanatory function that has proven resistant to falsification'' (D. Deutsch). In this talk I will present my personal view of Theoretical Computer Science as an intellectual activity that has provided over the last decades explanations of natural phenomena that have transformed how we see the world and what we can do in it.
The talk is biased by my personal taste and thus it focuses on Algorithm and Computational Complexity, and on Cryptography, one of its most successful intellectual spinoffs.
I will start from the Cook-Levin theory of NP-completeness that explains the phenomenon of so many hard problems (they are essentially the same problem!) and then I move to the Foundations of Cryptography, seen as the provable consequence of the existence of one-way functions and trapdoor functions.
I will discuss the transformatory power of Cryptography by looking at three specific problems in Cryptography that I have studied in the recent years: Oblivious RAM, Private Information Retrieval and Anamorphic Encryption.
Aalborg University
Priced and Energy Timed Automata
Timed Automata (TA) -- supported by the model checking tool UPPAAL -- has for more than 30 years been used for modelling and verification of numerous industrial real-time system. In 2001 the extension of Priced Timed Automata (PTA) was introduced allowing for additional aspects of resource consumption to be modelled and optimized, simply by additional continuous (cost) variables that may evolve with different (positive) rates.
In the talk I will introduce PTA and survey the large number of the decidability and undecidability results as well as efficient symbolic algorithms, that have been established over the last 25 years for various extensions of the basic notion of PTA. It should be noted that PTA itself as well the extensions considered have been motivated by needs of particular case-studies. The extensions studied include multiple clock variables, multiple resource variables, resource constrained properties ranging from optimal reachability and safety to general resource constrained temporal properties as well as presence of an antagonistic opponent.
More recently, the seemingly slight extension Energy Timed Automata (ETA) was introduced in 2011: here resources are allowed not only to be consumed but also produced, reflected by rates of corresponding continuous cost-variables being either positive or negative. In the talk I will motivate the usefulness of this extension but also demonstrate the resulting drastic increase in complexity and our search for decidable yet useful subclasses. Most recently we found such a subclass (so-called SFETA) develop efficient algorithms exploiting quantifier elimination for linear arithmetic. In particular I will highlight how we may successfully synthesize optimal infinite production plans for an industrial case of a hydraulic oil pump.
Accepted papers
- Eva Graversen, Fabrizio Montesi and Marco Peressotti: Omission Failures in Choreographic Programming
- Angelo Borsotti, Stefano Crespi Reghizzi and Matteo Pradella: Attribute-based precedence relations for free-form grammars
- Gianluca Amato, Matteo Calosci, Marco Maggesi and Cosimo Perini Brogi: Displayed Universal Algebra in UniMath: Basic Definitions and Results
- Shira Zucker: The Black-and-White Coloring Problem on Tree-Structured Hypergraphs
- Eugenio Moggi: Realizability Models and Complexity Classes
- Andrea Manini, Matteo Rossi and Pierluigi San Pietro: On the Computation of Winning Strategies in Timed Games with Dense Real-Time Constraints (Extended Abstract)
- Vittorio Bilò, Martin Loebl and Cosimo Vinci: Advances in Fair Allocation of Indivisible Goods under Non-monotone Valuations (Short Communication)
- Antonella Bilotta, Marco Maggesi and Cosimo Perini Brogi: A modular proof of semantic completeness for normal systems beyond the modal cube, formalised in HOLMS
- Michele Boreale and Luisa Collodi: Linearization and model reduction in zonotope-based reachability analysis of nonlinear ODEs
- Luisa Collodi, Michele Boreale and Alessandro Pompa Di Gregorio: Towards algebraic analysis of probabilistic programs
- Arash Vaezi: Finite Guarding of Weakly Visible Segments via LineAspect Ratio in Simple Polygons
- Massimo Benerecetti, Dario Della Monica, Angelo Matteo, Fabio Mogavero and Gabriele Puppis: An Automaton-based Characterisation of First Order Logic over Infinite Trees (short paper)
- Michal Certik and Jaroslav Nesetril: Communications: Extended Abstract on Duality, chi-Boundedness and Order Density of Ordered Graphs
- Hareshkumar Jadav, Mihir Patel, Samip Shah, Ranveer Singh and Harsh Talati: Generating Constrained Lattice Paths in a Grid related to counting cycles
- Riccardo Borsetto and Margherita Zorzi: An Agda Implementation of the Modal Logic S4.2: first investigations
- Gianluca Amato, Nicola Balestra, Marco Maggesi and Maurizio Parton: Recurrent neural networks for guiding proof search in propositional logic
- Deepak Rajendraprasad, Varun Sani, Birenjith Sasidharan and Jishnu Sen: Multipacking in Hypercubes
- Gennaro Cordasco, Luisa Gargano and Adele Rescigno: Watching Systems with Bounded Probes
- Giuseppa Castiglione, Giovanna D'Agostino, Alberto Policriti, Antonio Restivo and Brian Riccardi: Wheelerness and Complementation
- Davide Ancona and Angelo Ferrando: On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
- Ahmad Dandeh and Tamas Lukovszki: Experimental Evaluation of Blum’s Maximum Matching Algorithm in General Graphs
- Michele Flammini, Maria Fomenko and Giovanna Varricchio: Non-obvious Manipulability in Hedonic Games with Friends Appreciation Preferences
- Simone Boscaratto, Francesco Nascimben and Alberto Policriti: Hyperset individualisation algorithms
- Mario Alviano, Laura Giordano and Daniele Theseider Dupre: A Temporal, Deontic, Conditional Logic with Typicality: an Preliminary Report
- Firas Ben Ramdhane, Alberto Dennunzio, Luciano Margara and Giuliamaria Menara: Structural Properties of Non-Linear Cellular Automata: Permutivity, Surjectivity, and Reversibility
- Paulis Barzdins and Normunds Gruzitis: OB-GRAG: LLM assisted graph creation and querying via domain specific ontology
Program
Venue: Room 9–11, Department of Economics, Viale Pindaro 42, Pescara
Talk length: Regular: 25 min (20 + 5 Q&A); Communication: 15 min (10 + 5 Q&A)
09:15 – 10:15
Invited Talk — “Priced and Energy Timed Automata”
Speaker: Kim G. Larsen (Aalborg University, Denmark) — Chair: Francesca Scozzari
Abstract
Timed Automata (TA) -- supported by the model checking tool UPPAAL -- has for more than 30 years been used for modelling
and verification of numerous industrial real-time system. In 2001 the extension of Priced Timed Automata (PTA) was
introduced allowing for additional aspects of resource consumption to be modelled and optimized, simply by additional
continuous (cost) variables that may evolve with different (positive) rates.
In the talk I will introduce PTA and survey the large number of the decidability and undecidability results as well as
efficient symbolic algorithms, that have been established over the last 25 years for various extensions of the basic
notion of PTA. It should be noted that PTA itself as well the extensions considered have been motivated by needs of
particular case-studies. The extensions studied include multiple clock variables, multiple resource variables, resource
constrained properties ranging from optimal reachability and safety to general resource constrained temporal properties
as well as presence of an antagonistic opponent.
More recently, the seemingly slight extension Energy Timed Automata (ETA) was introduced in 2011: here resources are
allowed not only to be consumed but also produced, reflected by rates of corresponding continuous cost-variables being
either positive or negative. In the talk I will motivate the usefulness of this extension but also demonstrate the
resulting drastic increase in complexity and our search for decidable yet useful subclasses. Most recently we found such
a subclass (so-called SFETA) develop efficient algorithms exploiting quantifier elimination for linear arithmetic. In
particular I will highlight how we may successfully synthesize optimal infinite production plans for an industrial case
of a hydraulic oil pump.
Session 1 — GRAPHS, ALGORITHMS AND COMPLEXITY 1 — Chair: Vittorio Bilò
10:20 – 10:45
Watching Systems with Bounded Probes [Regular paper]
Gennaro Cordasco, Luisa Gargano, Adele Rescigno
11:15 – 11:30
Extended Abstract on Duality, chi-Boundedness and Order Density of Ordered Graphs [Communication]
Michal Certik, Jaroslav Nesetril
11:30 – 11:55
Experimental Evaluation of Blum’s Maximum Matching Algorithm in General Graphs [Regular paper]
Ahmad Dandeh, Tamas Lukovszki
Session 2 — LOGIC AND FORMAL METHODS 1 — Chair: Fabio Fioravanti
12:00 – 12:15
Displayed Universal Algebra in UniMath: Basic Definitions and Results [Communication]
Gianluca Amato, Matteo Calosci, Marco Maggesi, Cosimo Perini Brogi
12:15 – 12:30
Realizability Models and Complexity Classes [Communication]
Eugenio Moggi
12:30 – 12:45
An Automaton-based Characterisation of First Order Logic over Infinite Trees [Communication]
Massimo Benerecetti, Dario Della Monica, Angelo Matteo, Fabio Mogavero, Gabriele Puppis
Session 3 — AUTOMATA, LANGUAGES AND COMPUTATION 1 — Chair: Giuseppa Castiglione
14:15 – 14:40
Omission Failures in Choreographic Programming [Regular paper]
Eva Graversen, Fabrizio Montesi, Marco Peressotti
14:40 – 14:55
Structural Properties of Non-Linear Cellular Automata: Permutivity, Surjectivity, and Reversibility [Communication]
Firas Ben Ramdhane, Alberto Dennunzio, Luciano Margara, Giuliamaria Menara
15:00 - 16:30
Assembly of the IC of the EATCS
16:30 – 23:00
Guided tour of the Trabocchi Coast and Conference Dinner
09:00 – 10:00
Invited Talk — “Theoretical Computer Science and Explanations that Transform the World”
Speaker: Giuseppe Persiano (University of Salerno, Italy) — Chair: Luca Moscardelli
Abstract
One way of defining ``knowledge'' is as ``consisting of information with good explanatory function that has proven resistant to falsification'' (D. Deutsch). In this talk I will present my personal view of Theoretical Computer Science as an intellectual activity that has provided over the last decades explanations of natural phenomena that have transformed how we see the world and what we can do in it.
The talk is biased by my personal taste and thus it focuses on Algorithm and Computational Complexity, and on Cryptography, one of its most successful intellectual spinoffs.
I will start from the Cook-Levin theory of NP-completeness that explains the phenomenon of so many hard problems (they are essentially the same problem!) and then I move to the Foundations of Cryptography, seen as the provable consequence of the existence of one-way functions and trapdoor functions.
I will discuss the transformatory power of Cryptography by looking at three specific problems in Cryptography that I have studied in the recent years: Oblivious RAM, Private Information Retrieval and Anamorphic Encryption.
Session 4 — LOGIC AND FORMAL METHODS 2 — Chair: Gianluca Amato
10:05 – 10:30
A Temporal, Deontic, Conditional Logic with Typicality: a Preliminary Report [Regular paper]
Mario Alviano, Laura Giordano, Daniele Theseider Dupre
10:30 – 10:45
Linearization and model reduction in zonotope-based reachability analysis of nonlinear ODEs [Communication]
Michele Boreale, Luisa Collodi
11:15 – 11:30
Towards algebraic analysis of probabilistic programs [Communication]
Luisa Collodi, Michele Boreale, Alessandro Pompa Di Gregorio
Session 5 — ALGORITHMIC GAME THEORY — Chair: Gianpiero Monaco
11:35 – 11:50
On the Computation of Winning Strategies in Timed Games with Dense Real-Time Constraints (Extended Abstract) [Communication]
Andrea Manini, Matteo Rossi, Pierluigi San Pietro
11:50 – 12:05
Advances in Fair Allocation of Indivisible Goods under Non-monotone Valuations (Short Communication) [Communication]
Vittorio Bilò, Martin Loebl, Cosimo Vinci
12:05 – 12:20
Non-obvious Manipulability in Hedonic Games with Friends Appreciation Preferences [Communication]
Michele Flammini, Maria Fomenko, Giovanna Varricchio
Session 6 — GRAPHS, ALGORITHMS AND COMPLEXITY 2 — Chair: Gianpiero Monaco
14:15 – 14:40
The Black-and-White Coloring Problem on Tree-Structured Hypergraphs [Regular paper]
Shira Zucker
14:40 – 15:05
Generating Constrained Lattice Paths in a Grid related to counting cycles [Regular paper]
Hareshkumar Jadav, Mihir Patel, Samip Shah, Ranveer Singh, Harsh Talati
15:05 – 15:30
Finite Guarding of Weakly Visible Segments via LineAspect Ratio in Simple Polygons [Regular paper]
Arash Vaezi
Session 7 — AUTOMATA, LANGUAGES AND COMPUTATION 2 — Chair: Gianluca Amato
16:00 – 16:25
Attribute-based precedence relations for free-form grammars [Regular paper]
Angelo Borsotti, Stefano Crespi Reghizzi, Matteo Pradella
16:25 – 16:50
Wheelerness and Complementation [Regular paper]
Giuseppa Castiglione, Giovanna D’Agostino, Alberto Policriti, Antonio Restivo, Brian Riccardi
16:50 – 17:15
On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle [Regular paper]
Davide Ancona, Angelo Ferrando
09:15 – 10:15
Best Young Researcher
Andrea Celli, Bocconi University
Title: Single-dimensional contract design
Abstract
In this talk, I will introduce the problem of algorithmic contract design and its Bayesian formulation.
I will highlight key differences and similarities between the single-dimensional and multi-dimensional settings,
and survey known results connecting the two. Finally, I will present some new results suggesting
that the single-dimensional case is, in several respects,
easier than the multi-dimensional counterpart from a computational and information-theoretic view point.
10:15 – 10:35
Best PhD Dissertation
Francesco Masillo, University of Verona
Title: On Data Structures for Texts and Permutations
10:35 – 10:40
Best Master Thesis
Francesca Ugazio, University of Verona
Title: On the Complexity and Approximability of Bounded Access Lempel Ziv Compression
Session 8 — GRAPHS, ALGORITHMS AND COMPLEXITY 3 — Chair: Cosimo Vinci
11:10 – 11:35
Multipacking in Hypercubes [Regular paper]
Deepak Rajendraprasad, Varun Sani, Birenjith Sasidharan, Jishnu Sen
11:35 – 12:00
Hyperset individualisation algorithms [Regular paper]
Simone Boscaratto, Francesco Nascimben, Alberto Policriti
12:00 – 12:15
OB-GRAG: LLM assisted graph creation and querying via domain specific ontology [Communication]
Paulis Barzdins, Normunds Gruzitis
Session 9 — LOGIC AND FORMAL METHODS 3 — Chair: Francesca Scozzari
12:15 – 12:40
Recurrent neural networks for guiding proof search in propositional logic [Regular paper]
Gianluca Amato, Nicola Balestra, Marco Maggesi, Maurizio Parton
12:40 – 12:55
A modular proof of semantic completeness for normal systems beyond the modal cube, formalised in HOLMS [Communication]
Antonella Bilotta, Marco Maggesi, Cosimo Perini Brogi
12:55 – 13:10
An Agda Implementation of the Modal Logic S4.2: first investigations [Communication]
Riccardo Borsetto, Margherita Zorzi
| Wednesday 10 Sep |
Thursday 11 Sep |
Friday 12 Sep |
09:00 – 09:15
Opening ICTCS 2025 |
09:00 – 10:00
Invited Talk – “Theoretical Computer Science and Explanations that Transform the World” (G. Persiano) |
09:00 – 10:40
EATCS Prize Ceremony
Best Young Researcher Award
Best PhD Dissertation Award
Best Master Thesis Award
|
09:15 – 10:15
Invited Talk – “Priced and Energy Timed Automata” (K. G. Larsen) |
10:20 – 10:45
SESSION 1 — Graphs, Algorithms and Complexity |
10:05 – 10:45
SESSION 4 — Logic and Formal Methods |
10:45 – 11:15
Coffee break |
10:45 – 11:15
Coffee break |
10:40 – 11:10
Coffee break |
11:15 – 11:55
SESSION 1 — Graphs, Algorithms and Complexity |
11:15 – 11:30
SESSION 4 — Logic and Formal Methods |
11:10 – 12:15
SESSION 8 — Graphs, Algorithms and Complexity |
12:00 - 12:45
SESSION 2 — Logic and Formal Methods 1 |
11:35 - 12:20
SESSION 5 — Algorithmic Game Theory |
12:15 – 13:10
SESSION 9 — Logic and Formal Methods |
13:10 – 13:25
Closing ICTCS 2025 |
12:45 – 14:15
Lunch |
12:45 – 14:15
Lunch |
13:30 –
Lunch |
14:15 – 14:55
SESSION 3 — Automata, Languages and Computation |
14:15 – 15:30
SESSION 6 — Graphs, Algorithms and Complexity |
|
15:00 – 16:30
Assembly of the IC of the EATCS |
15:30 – 16:00
Coffee break |
16:30 – 23:00
Guided tour of the Trabocchi Coast & Conference Dinner |
16:00 – 17:15
SESSION 7 — Automata, Languages and Computation |
Last updated: 14 August 2025
Registration
Registration is open!
You can register at the page:
abruzzoincoming.it/en/tour/ictcs-2025-26th-italian-conference-on-theoretical-computer-science/
For each accepted contribution, at least one of the authors is required to register, attend the conference and present the paper.
Early Registration fees – up to August 16th, 2025 included
- Junior (non-faculty members: PhD students, post-docs, etc.) : € 280
- Senior (faculty members: professors and researchers) : € 340
Late Registration fees – from August 17th, 2025
- Junior (non-faculty members: PhD students, post-docs, etc.) : € 340
- Senior (faculty members: professors and researchers) : € 400
Notes
Registration fees include: Access to the conference sessions, daily coffee breaks and lunches, conference dinner and one year membership to EATCS and to the Italian Chapter.
If you need additional tickets for the social dinner (€55.00 each), please send an email to booking@abruzzoincoming.it after completing your conference registration.
Conference location
Università degli Studi “G. d'Annunzio” di Chieti-Pescara
viale Pindaro 42, Pescara
Room 9-11
Reaching Pescara
Pescara has a small airport,
Abruzzo Airport, very close to downtown. If traveling directly to Abruzzo Airport is not an option (very likely!), consider going through
Rome Fiumicino Airport.
From there, there are many bus connections (3h10m - 4h00m travel time), with either
Prontobus,
Di Carlo Bus or Flixbus.
Another option is landing in
Rome Ciampino Airport: from there you can find bus connections to Pescara (~ 3h30m travel time) with
Prontobus, Flixbus or itabus. If you are in Rome but not at the airport, all companies above have buses departing from Rome Tiburtina bus station.
You can also reach Pescara by trains departing from Rome Tiburtina train station. However, trains on the line
Rome–Pescara are quite slow. On the bright side, the trip by train is interesting since trains pass trough
many small rural villages in the innermost part of Italy. If you have time to spare (and no work to do... probably
no Internet connection there) it could be an alternative.
If you are in Italy everywhere else, you can reach Pescara by bus (see bus companies above) or
train.
Accommodations
This is a list of hotels in downtown Pescara or near the place of the conference.
4-stars hotel
Location: center of Pescara, at the seafront (the conference place can be reached by bus in 15 minutes)
4-stars hotel
Location: center of Pescara (the conference place can be reached by bus in 15 minutes)
3-stars hotel
Location: center of Pescara (the conference place can be reached by bus in 15 minutes)
Location: close to the university (the conference place can be reached on foot in 5 minutes)
3-stars hotel
Location: at the seafront (the conference place can be reached on foot in 15 minutes)
Camera ready instruction
Below are the instructions for preparing the final version of accepted contributions to ICTCS 2025.
The camera ready version of the paper, along with the copyright form and requested information, must be uploaded in EasyChair,
at the page
easychair.org/conferences/?conf=ictcs2025
using the "Update information" and "Add or update files" buttons in the submission section.
Deadline: August 24, 2025
Update information
Authors must update the following information in EasyChair:
- Paper length: Please choose between regular paper or communication.
- Publication in CEUR-WS.org: Please specify whether you want to publish your paper in CEUR-WS.org.
Camera ready format
- The paper must follow the CEURART LaTeX style
from the CEUR-WS.org website, using the one-column format, and the lenght of the paper must be as follows:
- Regular papers: up to 12 pages (bibliography excluded).
- Communications: up to 5 pages (bibliography excluded).
- Ensure the first page includes the correct conference name, copyright and license.
You can use the following LaTex commands to include the information in your paper:
\copyrightyear{2025}
\copyrightclause{Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).}
\conference{ICTCS 2025: Italian Conference on Theoretical Computer Science, September 10--12, 2025, Pescara, Italy}
Copyright Form (only for CEUR-WS submission)
To complete the submission, one author must fill in and hand-sign the AUTHOR-AGREEMENT form.
Scanned handwritten signatures are required; image signatures are not allowed.
Author agreement variants
- AUTHOR-AGREEMENT (NTP):
use this form if you included no copyrighted third party material in your paper text (or accompanying sources, datasets),
and no material in the paper was produced with the help of Generative Artificial Intelligence tools including tools
based on large language models (LLM). This is the right variant in most cases.
- AUTHOR-AGREEMENT (TP):
use this form if you did include copyrighted third party material in your paper or accompanying material.
You must then also attach a copy of the permission by the third party to use this material in the signed author agreement!
Required Information in the Form
- Name and year of the event:
Italian Conference on Theoretical Computer Science,
September 10--12, 2025, Pescara, Italy (ICTCS 2025)
- Editors:
Luca Moscardelli, Francesca Scozzari
Past editions
- 25th ICTCS, Torino, September 11-13, 2024
- 24th ICTCS, Palermo, September 13-15, 2023
- 23rd ICTCS, Roma, September 7-9, 2022
- 22nd ICTCS, Bologna, September 13-15, 2021
- 21th ICTCS, Ischia, September 14-16, 2020
- 20th ICTCS, Como, September 9-11, 2019
- 19th ICTCS, Urbino, September 18-20, 2018
- 18th ICTCS, Napoli, September 26-28, 2017
- 16th ICTCS, Firenze, September 9-11, 2015
- 15th ICTCS, Perugia, September 17-19, 2014
- 14th ICTCS, Palermo, September 9-11, 2013
- 13th ICTCS, Varese, September 19-21, 2012
- 12th ICTCS, Camerino, September 15-17, 2010
- 11th ICTCS, Cremona, September 28-30, 2009
- 10th ICTCS, Roma, October 3-5, 2007
- 9th ICTCS, Pontignano, October 12-14, 2005
- 8th ICTCS, Bertinoro, October 13-15, 2003
- 7th ICTCS, Torino, October 4-6, 2001
- 6th ICTCS, Prato, November 9-11, 1998
- 5th ICTCS, Ravello, November 7-9, 1995
- 4th ICTCS, L’Aquila, October 28-30, 1992
- 3rd ICTCS, Mantova, November 2-4, 1989
- 2nd ICTCS, Mantova, November 21-23, 1974
- 1st ICTCS, Pisa, March 1-3, 1973
