Abstract is missing.
- PrefaceStefano Bistarelli, Andrea Formisano. [doi]
- A formal approach to autonomic systems programming: the SCEL languageRocco De Nicola. 1 [doi]
- Graph drawing beyond planarity: some results and open problemsGiuseppe Liotta. 3-8 [doi]
- Trace complexityFlavio Chierichetti. 9 [doi]
- Type disciplines for systems biologyLivio Bioglio. 11-13 [doi]
- Algorithms for biological graphs: analysis and enumerationAndrea Marino. 15-19 [doi]
- Timed process calculi: from durationless actions to durational onesMarco Bernardo, Flavio Corradini, Luca Tesei. 21-32 [doi]
- Size-constrained 2-clustering in the plane with Manhattan distanceAlberto Bertoni, Massimiliano Goldwurm, Jianyi Lin, Linda Pini. 33-44 [doi]
- Graphs of edge-intersecting and non-splitting pathsArman Boyaci, Tinaz Ekim, Mordechai Shalom, Shmuel Zaks. 45-58 [doi]
- A graph-easy class of mute lambda-termsAntonio Bucciarelli, Alberto Carraro, Giordano Favro, Antonino Salibra. 59-71 [doi]
- Relating threshold tolerance graphs to other graph classesTiziana Calamoneri, Blerina Sinaimeri. 73-79 [doi]
- Cerny-like problems for finite sets of wordsArturo Carpi, Flavio D'Alessandro. 81-92 [doi]
- Reasoning about connectivity without pathsAlberto Casagrande, Eugenio G. Omodeo. 93-108 [doi]
- Binary 3-compressible automataAlessandra Cherubini, Andrzej Kisielewicz. 109-120 [doi]
- Extendibility of Choquet rational preferences on generalized lotteriesGiulianella Coletti, Davide Petturiti, Barbara Vantaggi. 121-132 [doi]
- On multiple learning schemata in conflict driven solversAndrea Formisano, Flavio Vella. 133-146 [doi]
- A metamodeling level transformation from UML sequence diagrams to CoqChao Li, Liang Dou, Zongyuan Yang. 147-157 [doi]
- An efficient algorithm for generating symmetric ice pilesRoberto Mantaci, Paolo Massazza, Jean-Baptiste Yunès. 159-170 [doi]
- Adding two equivalence relations to the interval temporal logic ABAngelo Montanari, Marco Pazzaglia, Pietro Sala. 171-182 [doi]
- Efficient channel assignment for cellular networks modeled as honeycomb gridSoumen Nandi, Nitish Panigrahy, Mohit Agrawal, Sasthi Charan Ghosh, Sandip Das. 183-295 [doi]
- Programmable enforcement framework of information flow policiesMinh Ngo, Fabio Massacci. 197-211 [doi]
- On the Stackelberg fuel pricing problemCosimo Vinci, Vittorio Bilò. 213-224 [doi]
- Structural complexity of multi-valued partial functions computed by nondeterministic pushdown automataTomoyuki Yamakami. 225-236 [doi]
- Proving termination of programs having transition invariants of height ωStefano Berardi, Paulo Oliva, Silvia Steila. 237-240 [doi]
- Orthomodular algebraic lattices related to combinatorial posetsLuca Bernardinello, Lucia Pomello, Stefania Rombolà. 241-245 [doi]
- Abstract argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision makingStefano Bistarelli, Martine Ceberio, Joel A. Henderson, Francesco Santini. 247-257 [doi]
- Optimal placement of storage nodes in a wireless sensor networkGianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Maria Cristina Pinotti. 259-263 [doi]
- Engineering shortest-path algorithms for dynamic networksMattia D'Emidio, Daniele Frigioni. 265-269 [doi]
- Minimal models for rational closure in SHIQLaura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato. 271-277 [doi]
- An algebraic characterization of unary two-way transducersChristian Choffrut, Bruno Guillon. 279-283 [doi]
- Logspace computability and regressive machinesStefano Mazzanti. 285-289 [doi]