default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th ICTCS 2014: Perugia, Italy
- Stefano Bistarelli, Andrea Formisano:
Proceedings of the 15th Italian Conference on Theoretical Computer Science, Perugia, Italy, September 17-19, 2014. CEUR Workshop Proceedings 1231, CEUR-WS.org 2014 - Stefano Bistarelli, Andrea Formisano:
Preface. i-v
Invited Talks
- Rocco De Nicola:
A formal approach to autonomic systems programming: the SCEL language. 1 - Giuseppe Liotta:
Graph drawing beyond planarity: some results and open problems. 3-8
ICTCS Young TCS Research Award
- Flavio Chierichetti:
Trace complexity. 9
ICTCS Doctoral Research Awards
- Livio Bioglio:
Type disciplines for systems biology. 11-13 - Andrea Marino:
Algorithms for biological graphs: analysis and enumeration. 15-19
Regular Papers
- Marco Bernardo, Flavio Corradini, Luca Tesei:
Timed process calculi: from durationless actions to durational ones. 21-32 - Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin, Linda Pini:
Size-constrained 2-clustering in the plane with Manhattan distance. 33-44 - Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of edge-intersecting and non-splitting paths. 45-58 - Antonio Bucciarelli, Alberto Carraro, Giordano Favro, Antonino Salibra:
A graph-easy class of mute lambda-terms. 59-71 - Tiziana Calamoneri, Blerina Sinaimeri:
Relating threshold tolerance graphs to other graph classes. 73-79 - Arturo Carpi, Flavio D'Alessandro:
Cerny-like problems for finite sets of words. 81-92 - Alberto Casagrande, Eugenio G. Omodeo:
Reasoning about connectivity without paths. 93-108 - Alessandra Cherubini, Andrzej Kisielewicz:
Binary 3-compressible automata. 109-120 - Giulianella Coletti, Davide Petturiti, Barbara Vantaggi:
Extendibility of Choquet rational preferences on generalized lotteries. 121-132 - Andrea Formisano, Flavio Vella:
On multiple learning schemata in conflict driven solvers. 133-146 - Chao Li, Liang Dou, Zongyuan Yang:
A metamodeling level transformation from UML sequence diagrams to Coq. 147-157 - Roberto Mantaci, Paolo Massazza, Jean-Baptiste Yunès:
An efficient algorithm for generating symmetric ice piles. 159-170 - Angelo Montanari, Marco Pazzaglia, Pietro Sala:
Adding two equivalence relations to the interval temporal logic AB. 171-182 - Soumen Nandi, Nitish Panigrahy, Mohit Agrawal, Sasthi Charan Ghosh, Sandip Das:
Efficient channel assignment for cellular networks modeled as honeycomb grid. 183-295 - Minh Ngo
, Fabio Massacci:
Programmable enforcement framework of information flow policies. 197-211 - Cosimo Vinci, Vittorio Bilò:
On the Stackelberg fuel pricing problem. 213-224 - Tomoyuki Yamakami:
Structural complexity of multi-valued partial functions computed by nondeterministic pushdown automata. 225-236
Communications
- Stefano Berardi, Paulo Oliva, Silvia Steila:
Proving termination of programs having transition invariants of height ω. 237-240 - Luca Bernardinello, Lucia Pomello, Stefania Rombolà:
Orthomodular algebraic lattices related to combinatorial posets. 241-245 - Stefano Bistarelli, Martine Ceberio, Joel A. Henderson, Francesco Santini:
Abstract argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making. 247-257 - Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Maria Cristina Pinotti:
Optimal placement of storage nodes in a wireless sensor network. 259-263 - Mattia D'Emidio, Daniele Frigioni:
Engineering shortest-path algorithms for dynamic networks. 265-269 - Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
Minimal models for rational closure in SHIQ. 271-277 - Christian Choffrut, Bruno Guillon:
An algebraic characterization of unary two-way transducers. 279-283 - Stefano Mazzanti:
Logspace computability and regressive machines. 285-289
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 2025-02-09 14:45 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:
