Click here for a printable version of the conference program.
Please note that 15 minutes are allocated for each presentation and 5 minutes for questions and the transition to the next talk.
Wednesday June 26, 2013
08:00 h.: |
Conference registration |
09:00 h.: |
Welcome and opening speech |
09:30 h.: |
Invited talk
Art gallery problems, old and recent.
|
10:30 h.: |
Session 1
10:30 h.: |
Continuous surveillance of points by rotating floodlights.
|
10:50 h.: |
Some results on open edge guarding of polygons.
|
11:10 h.: |
Guarding the vertices of thin orthogonal polygons is NP-hard.
|
|
11:30 h.: |
Coffee break |
12:00 h.: |
Session 2
12:00 h.: |
Solving common influence region queries with the GPU.
|
12:20 h.: |
Reporting flock patterns on the GPU.
|
12.40 h.: |
Parallel constrained Delaunay triangulation.
|
13:00 h |
Metaheuristic approaches for the Minimum Dilation Triangulation problem.
|
|
13:30 h.: |
Lunch |
15:30 h.: |
Invited talk
Three location tapas calling for CG sauce.
|
16:30 h.: |
Coffee break |
17:00 h.: |
Session 3
17:00 h.: |
On the barrier-resilience of arrangements of ray-sensors.
|
17:20 h.: |
Computing the stretch of an embedded graph.
|
17.40 h.: |
An algorithm that constructs irreducible triangulations of once-punctured surfaces.
|
18:00 h.: |
On the enumeration of permutominoes.
|
18:20 h.: |
Distance domination, guarding and vertex cover for maximal outerplanar graphs.
|
|
Thursday June 27, 2013
09:00 h.: |
Invited talk
Abstract Voronoi Diagrams.
|
10:00 h.: |
Session 4
10:00 h.: |
Equipartitioning triangles.
|
10:20 h.: |
On the nonexistence of k-reptile simplices in R3 and R4.
|
10.40 h.: |
Drawing the double circle on a grid of minimum size.
|
|
11:00 h.: |
Coffee break |
11:30 h.: |
Session 5
11:30 h.: |
SensoGraph: Using proximity graphs for sensory analysis.
|
11:50 h.: |
Simulated Annealing applied to the MWPT problem.
|
12.10 h.: |
A symbolic-numeric dynamic geometry environment for the computation of equidistant curves.
|
12:30 h.: |
Simulating distributed algorithms for lattice agents.
|
|
13:00 h.: |
Lunch |
15:00 h.: |
Session 6
15:00 h.: |
Empty convex polytopes in random point sets
|
15:20 h.: |
Note on the number of obtuse angles in point sets.
|
15:40 h.: |
Stabbing simplices of point sets with k-flats.
|
16.00 h.: |
Stackable tessellations.
. |
|
16:30 h.: |
Business meeting |
20:30 h.: |
Flamenco Concert at the Restaurant "Los Seises" |
21:30 h.: |
Conference Dinner at the Restaurant "Los Seises" |
Friday June 28, 2013
09:30 h. |
Session 7
09:30 h. |
Improved enumeration of simple topological graphs.
|
09:50 h. |
On three parameters of invisibility graphs.
|
10.10 h.: |
On making a graph crossing-critical.
|
10:30 h.: |
Witness bar visibility.
|
10:50 h.: |
The alternating path problem revisited. |
|
11:10 h.: |
Coffee break |
11:40 h.: |
Session 8
11:40 h.: |
Phase transitions in the Ramsey-Turan theory
|
12:00 h.: |
On 4-connected geometric graphs.
|
12.20 h.: |
Monotone crossing number of complete graphs.
|
12:40 h.: |
Flips in combinatorial pointed pseudo-triangulations with face degree at most four.
|
|
13:00 h.: |
Break |
13:15 h.: |
Invited talk
Recent developments in the crossing number of the complete graph.
|
14:30 h.: |
Lunch |
|