1 We are indebted to Milward (1994) for provoking and providing a starting point for this renewed research on coordination. Many of these ideas were discussed at various meetings and in email discussions and we thank the many participants: Caroline Brun, Max Copperman, Mary Dalrymple, Marc Dymetman, John Fry, Ron Kaplan, Lauri Karttunen, Martin Kay, Paula Newman, Mar a-Eugenia Ni~ no, Fr ed eri...

In general, not much is known about the arithmetic of K3 surfaces. Once the geometric Picard number, which is the rank of the Néron-Severi group over an algebraic closure of the base field, is high enough, more structure is known and more can be said. However, until recently not a single K3 surface was known to have geometric Picard number one. We give explicit examples of such surfaces over th...

Given a tree and a set P of non-trivial simple paths on it, Vpt(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P of the tree T , and Ept(P) is the EPT graph (i.e. the edge intersection graph) of P. These graphs have been extensively studied in the literature. Given two (edge) intersecting paths in a graph, their split vertices is the set of vertices having degree at least...

http://dx.doi.org/10.1016/j.infsof.2015.02.002 0950-5849/ 2015 Elsevier B.V. All rights reserved. ⇑ Corresponding author at: Department of Computer Languages and Systems, University of Seville, Spain. E-mail addresses: [email protected], [email protected] (J.A. Galindo), deepak. [email protected] (D. Dhungana), [email protected] (R. Rabiser), [email protected] (D. Benavides), goetz.botterweck...