Accepted papers

The booklet of abstracts is available here.

• Luis Crespo Ruiz and Francisco Santos. Realizations of multiassociahedra via rigidity.
• Sergey Bereg, José-Miguel Díaz-Bañez, Alina Kasiuk, Miguel-Angel Pérez-Cutiño and Fabio Rodríguez. Covering segments on a line with drones.
• Frank Duque. Computing k-Crossing Visibility through k-levels.
• José Miguel Díaz Bañez, José Manuel Higes López, Miguel Angel Pérez Cutiño and Juan Sebastián Valverde García. Algorithms for efficient solar tracking in CSP plants.
• Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban and Anil Maheshwari. Approximate shortest paths on weighted disks.
• Oswin Aichholzer, Birgit Vogtenhuber and Alexandra Weinberger. Isomorphisms of simple drawings of complete multipartite graphs.
• Pablo Pérez-Lantero and Carlos Seara. Center of maximum-sum matchings of bichromatic points.
• Pablo Pérez-Lantero, Carlos Seara and Jorge Urrutia. A fitting problem in three dimension.
• Jacob Lahne, David Orden, Katherine Phetxumphou and Marino Tejedor-Romero. The free-linking task: Graphs for better discrimination of sensory similarity.
• José Cáceres, Delia Garijo, Alberto Marquez and Rodrigo Silveira. The Borsuk number of geometric graphs.
• Nicolau Oliver and Carlos Seara. On strip separability.
• Joachim Orthaber. Crossing minimal and generalized convex drawings: 2 non-hard problems.
• Javier Tejel and Alfredo García. Some routing problems on a half-line with release times and deadlines.
• Víctor Manuel Gómez Sousa, Desamparados Fernández-Ternero, Juan Núñez-Valdés and Eduardo Paluzo-Hidalgo. Algebraically-informed deep networks for associative evolution algebras.
• Ruy Fabila-Monroy, Rosna Paul, Jenifer Viafara-Chanchi and Alexandra Weinberger. On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs.
• Oswin Aichholzer, Alfredo Garcia, Javier Tejel, Birgit Vogtenhuber and Alexandra Weinberger. Recognizing rotation systems of generalized twisted drawings in O(n^2) time.
• Oswin Aichholzer, Alfredo Garcia, Javier Tejel, Birgit Vogtenhuber and Alexandra Weinberger. Characterizing rotation systems of generalized twisted drawings via 5-tuples.
• Belén Cruces Mateo, Clemens Huemer and Dolores Lara. On the number of drawings of a combinatorial triangulation.
• Andrea de Las Heras, Guillermo Esteban, Delia Garijo, Clemens Huemer, Antoni Lozano, Nicolau Oliver and David Orden. Measuring cocircularity in a point set.
• Alireza Bagheri, Anna Brötzner, Faezeh Farivar, Rahmat Ghasemi, Fatemeh Keshavarz-Kohjerdi, Erik Krohn, Bengt J. Nilsson and Christiane Schmidt. Minsum m watchmen’s routes in Stiegl polygons.
• Narcis Coll, Marta Fort and Oriol Balló. Coverage maps on domains with obstacles.
• Andrea de Las Heras Parrilla, Merce Claverol and Clemens Huemer. Special constructions to understand the structure of higher order Voronoi diagrams.
• Carmen Hernando, Montserrat Maureso, Mercè Mora and Javier Tejel. Fault-tolerant resolvability in maximal outerplanar graphs.
• Aleksander Bjoern Grodt Christiansen, Linda Kleist, Irene Parada and Eva Rotenberg. Augmenting plane geometric graphs to meet degree parity constraints.
• Luis Herrera, Pablo Pérez Lantero and Carlos Seara. Computing the (α, k)-hull for points in convex position.
• Alexander Pahlow and Erik Krohn. VC dimension with half guards.
• Kimberly Kokado and Csaba Toth. On the Realizability of Planar and Spherical Occlusion Diagrams.
• David Kirkpatrick. Maintaining low congestion potential among moving entities using minimal query frequency.
• Nicolau Oliver and Carlos Seara. Comparing box and disk bichromatic discrepancy.