default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th ICTCS 2025: Pescara, Italy
- Luca Moscardelli, Francesca Scozzari:
Proceedings of the 26th Italian Conference on Theoretical Computer Science, Pescara, Italy, September 10-12, 2025. CEUR Workshop Proceedings 4039, CEUR-WS.org 2025
Session 1: Graphs, Games, Algorithms and Complexity
- Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Watching Systems with Bounded Probes. 3-15 - Ahmad Dandeh, Tamás Lukovszki:
Experimental Evaluation of Blum's Maximum Matching Algorithm in General Graphs. 16-27 - Shira Zucker:
The Black-and-White Coloring Problem on Tree-Structured Hypergraphs. 28-37 - Hareshkumar Jadav, Mihir Patel, Samip Shah, Ranveer Singh, Harsh Talati:
Generating Constrained Lattice Paths in a Grid Related to Counting Cycles. 38-48 - Arash Vaezi:
Finite Guarding of Weakly Visible Segments via LineAspect Ratio in Simple Polygons. 49-59 - Deepak Rajendraprasad, Varun Sani, Birenjith Sasidharan, Jishnu Sen:
Multipacking in Hypercubes. 60-66 - Simone Boscaratto, Francesco Nascimben, Alberto Policriti:
Hyperset Individualisation Algorithms. 67-80
Session 2: Graphs, Games, Algorithms and Complexity (Communications)
- Michal Certík, Jaroslav Nesetril:
Communications: Duality, chi-Boundedness and Order Density of Homomorphisms of Ordered Graphs. 81-86 - Michele Flammini, Maria Fomenko, Giovanna Varricchio:
Non-obvious Manipulability in Hedonic Games with Friends Appreciation Preferences. 87-93 - Paulis F. Barzdins, Normunds Gruzitis:
OB-GRAG: LLM Assisted Graph Creation and Querying via Domain Specific Ontology. 94-100
Session 3: Logic and Formal Methods
- Mario Alviano, Laura Giordano, Daniele Theseider Dupré:
A Temporal, Deontic, Conditional Logic with Typicality: a Preliminary Report. 101-112 - Gianluca Amato, Nicola Balestra, Marco Maggesi, Maurizio Parton:
Recurrent Neural Networks for Guiding Proof Search in Propositional Logic. 113-126
Session 4: Logic and Formal Methods (Communications)
- Gianluca Amato, Matteo Calosci, Marco Maggesi, Cosimo Perini Brogi:
Displayed Universal Algebra in UniMath: Basic Definitions and Results. 127-133 - Eugenio Moggi:
Realizability Models and Complexity Classes. 134-139 - Michele Boreale, Luisa Collodi:
Linearization and Model Reduction in Zonotope-Based Reachability Analysis of Nonlinear ODEs. 140-146 - Luisa Collodi, Michele Boreale, Alessandro Pompa Di Gregorio:
Towards Algebraic Analysis of Probabilistic Programs. 147-153 - Antonella Bilotta, Marco Maggesi, Cosimo Perini Brogi:
A Modular Proof of Semantic Completeness for Normal Systems beyond the Modal Cube, Formalised in HOLMS. 154-162 - Riccardo Borsetto, Margherita Zorzi:
An Agda Implementation of the Modal Logic S4.2: First Investigations. 163-168
Session 5: Automata, Languages and Computation
- Eva Graversen, Fabrizio Montesi, Marco Peressotti:
Omission Failures in Choreographic Programming. 169-184 - Angelo Borsotti, Stefano Crespi-Reghizzi, Matteo Pradella:
Attribute-Based Precedence Relations for Free-Form Grammars. 185-197 - Giuseppa Castiglione, Giovanna D'Agostino, Alberto Policriti, Antonio Restivo, Brian Riccardi:
Wheelerness and Complementation. 198-210 - Davide Ancona, Angelo Ferrando:
On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle. 211-223
Session 6: Automata, Languages and Computation (Communications)
- Firas Ben Ramdhane, Alberto Dennunzio, Luciano Margara, Giuliamaria Menara:
Structural Properties of Non-Linear Cellular Automata: Permutivity, Surjectivity, and Reversibility. 224-229
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.
last updated on 2026-06-16 22:39 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:
