[GDNET] EuroCG 2022: list of accepted papers

[Fabrizio Montecchiani]

Dear colleagues,

Below please find the list of papers accepted for presentation at EuroCG
2022.

Best wishes,
Emilio and Fabrizio, on behalf of the PC
http://eurocg2022.unipg.it/

******************************
*   Paul Jungeblut, Linda Kleist and Till Miltzow. The Complexity of the
Hausdorff Distance
*   Mayank Chaturvedi and Bengt J. Nilsson. APX-Hardness of the Minimum
Vision Points Problem
*   Arash Vaezi, Bodhayan Roy and Mohammad Ghodsi. Reflection Helps
Guarding an Art Gallery
*   Walter Didimo, Michael Kaufmann, Giuseppe Liotta and Giacomo Ortali. On
Rectilinear Planarity Testing of SP-Graphs in the Variable Embedding Setting
*   Rodrigo Castro, José-Miguel Díaz-Báñez, Marco A. Heredia, Jorge
Urrutia, Inmaculada Ventura and Francisco J. Zaragoza. Euclidean Bipartite
Edge Cover in Subcubic Time
*   Travis Gagie, Mozhgan Saeidi and Allan Sapucaia. Ruler Wrapping
*   Yuan Sha and Joachim Gudmundsson. Approximating the discrete center
line segment in linear time
*   Aya Bernstine and Yehonatan Mizrahi. Efficiently Enumerating Scaled
Copies of Point Set Patterns
*   Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene
Parada, Manfred Scheucher and Birgit Vogtenhuber. Blocking Delaunay
Triangulations from Exterior
*   Philipp Kindermann, Jan Sauer and Alexander Wolff. The Computational
Complexity of the ChordLink Model
*   Satyan Devadoss and Matthew Harvey. Unfolding the Simplex and Orthoplex
*   Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg and Carsten
Thomassen. Explicit Dynamic Schnyder Woods Require Linear (Amortized)
Update Time
*   Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer
and Patrick Schnider. Well-Separation and Hyperplane Transversals in High
Dimensions
*   Soeren Nickel, Martin Nöllenburg, Manuel Sorge, Anaïs Villedieu,
Hsiang-Yun Wu and Jules Wulms. Planarizing Graphs and their Drawings by
Vertex Splitting
*   Balázs Keszegh. A new discrete theory of pseudoconvexity
*   Sarita de Berg, Frank Staals and Marc van Kreveld. The complexity of
geodesic spanners
*   Helena Bergold, Stefan Felsner and Manfred Scheucher. Extendability of
higher dimensional signotopes
*   Sabine Storandt and Johannes Zink. Polyline Simplification under the
Local Fréchet Distance has Subcubic Complexity
*   Hugo Akitaya, Erik Demaine, Matias Korman, Irina Kostitsyna, Irene
Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara and Jules Wulms.
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding
Squares
*   Maike Buchin and Lukas Plätz. The k-outlier Fréchet distance
*   Delia Garijo, Alberto Marquez and Rodrigo Silveira. Continuous mean
distance of a weighted graph
*   Nicolas Grelier. Approximation of Minimum Convex Partition
*   Hana Dal Poz Kourimska and Mathijs Wintraecken. Curvature variation
based adaptive sampling for Delaunay triangulations of Riemannian manifolds
*   Stefan Felsner, Sandro Roch and Manfred Scheucher. Arrangements of
Pseudocircles: On Digons and Triangles
*   Katharina Klost. Unweighted Shortest Path in Disk Graphs
*   Franz Aurenhammer and Michael Steinkogler. An Insertion Strategy for
Motorcycle Graphs
*   Bengt J. Nilsson and Christiane Schmidt. $k$-Transmitter Watchman Routes
*   Christina Katsamaki, Fabrice Rouillier and Elias Tsigaridas. An
algorithm for the convex hull computation of rational plane curves
*   Andrea de Las Heras Parrilla, Mercè Claverol and Clemens Huemer.
Properties for Voronoi Diagrams of Arbitrary Order in the Sphere
*   Md. Jawaherul Alam, Michael Bekos, Martin Gronemann, Michael Kaufmann
and Sergey Pupyrev. The Mixed Page Number of Graphs
*   Oswin Aichholzer, Man-Kwun Chiu, Hung Hoang, Michael Hoffmann, Yannic
Maus, Birgit Vogtenhuber and Alexandra Weinberger. Gioan's Theorem for
complete bipartite graphs
*   Rahul Gangopadhyay and Gaiane Panina. A Note on Rectilinear Crossing
number of Hypergraphs
*   Vincent Despré, Loïc Dubois, Benedikt Kolbe and Monique Teillaud.
Experimental analysis of Delaunay flip algorithms on genus two hyperbolic
surfaces
*   Michaela Borzechowski and Wolfgang Mulzer. Unique Sink Orientations of
Grids is in Unique End of Potential Line
*   Florian Barth, Stefan Funke and Claudius Proissl. On the Number of
Optimal Paths in Multicriteria Route Planning
*   Oswin Aichholzer, Kristin Knorr, Maarten Löffler, Zuzana Masárová,
Wolfgang Mulzer, Johannes Obenaus, Rosna Paul and Birgit Vogtenhuber.
Flipping Plane Spanning Paths
*   Arun Kumar Das, Sandip Das, Guilherme D. da Fonseca, Yan Gerard and
Bastien Rivier. Complexity Results on Untangling Planar Rectilinear
Red-Blue Matchings
*   Esther Ezra, Micha Sharir and Tslil Tsabari. Ray Shooting amid
Tetrahedra in Four Dimensions
*   Mark de Berg, Arpan Sadhukhan and Frits Spieksma. On Stable Range
Assignments in $S^1$
*   Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana
Masárová, Tamara Mchedlidze, Maarten Löffler and Günter Rote. Removing
Popular Faces in Curve Arrangements by Inserting one more Curve
*   Thomas Depian, Guangping Li, Martin Nöllenburg and Jules Wulms.
Transitions in Dynamic Map Labeling
*   Vahideh Keikha, Sepehr Moradi and Ali Mohades. Preprocessing Imprecise
Points for Furthest Distance Queries
*   Maike Buchin, Antonia Kalb and Bernd Zey. Augmenting Graphs with
Maximal Matchings
*   Leonhard Löffler-Dauth. Small Area Drawings of Cactus-Graphs
*   Will Evans, Ivor van der Hoog, David Kirkpatrick and Maarten Löffler.
Towards the Minimization of Global Measures of Congestion Potential for
Moving Points
*   Daniel Bertschinger, Meghana M. Reddy and Enrico Mann. Lions and
Contamination: Monotone Clearings
*   Anne Driemel, David Göckede, Ivor van der Hoog and Eva Rotenberg. A
Conditional Lower Bound for the Discrete Fréchet Distance in a Graph
*   Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler,
Aleksandr Popov, Marcel Roeloffzen and Frank Staals. Segment Visibility
Counting Queries in Polygons
*   Kevin Buchin, Max van Mulken, Bettina Speckmann and Kevin Verbeek.
Kinetic Group Density in 1D
*   Eva-Maria Hainzl, Maarten Löffler, Daniel Perz, Josef Tkadlec and
Markus Wallinger. Finding a Battleship of Uncertain Shape
*   Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder and Raphael
Steiner. Linear size universal point sets for classes of planar graphs
*   Irina Kostitsyna, Tom Peters and Bettina Speckmann. Fast
Reconfiguration for Programmable Matter
*   Niloufar Fuladi, Alfredo Hubard and Arnaud De Mesmay. Short topological
decompositions of non-orientable surfaces
*   Boris Aronov, Esther Ezra, Micha Sharir and Guy Zigdon. Time and Space
Efficient Collinearity Indexing
*   Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen Kobourov,
Myroslav Kryven, Alexander Wolff and Johannes Zink. Universal Lower Bounds
on the Segment Number of Some Classes of Planar Graphs
*   Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz,
Felix Klesen and Alexander Wolff. Outside-Obstacle Representations with All
Vertices on the Outer Face
*   Felix Weitbrecht. Linear Time Point Location in Delaunay Simplex
Enumeration over all Contiguous Subsequences
*   Joachim Gudmundsson, Martin Seybold and Sampson Wong. Approximating
Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with
Linear Size
*   Taekang Eom and Hee-Kap Ahn. An Optimal Algorithm for Weighted Center
Problem on Cycle Graphs
*   Daniel Bertschinger, Henry Förster and Birgit Vogtenhuber.
Intersections of Double-Wedge Arrangements
*   Hugo Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin and Carola
Wenk. Realizability of Free Space Diagrams for 1D Curves
*   Frank Staals, Jérôme Urhausen and Jordi L. Vermeulen. Querying the
Hausdorff Distance of a Line Segment
*   Shahin John J S, Remi Raman, R Subashini and Subhasree
Methirumangalath. Watchman Route on Line Segments
*   Péter Ágoston, Gábor Damásdi, Balázs Keszegh and Dömötör Pálvölgyi.
Orientation type of convex sets
*   Erin Chambers, Elizabeth Munch and Tim Ophelders. A quality measure for
Reeb graph drawings
*   Mart Hagedoorn and Irina Kostitsyna. The Shortest Path with Increasing
Chords in a Simple Polygon
*   Guillermo Esteban, Prosenjit Bose, David Orden and Rodrigo Silveira.
Spanning ratio of shortest paths in weighted square tessellations
*   Sam van der Poel, Gaurish Telang, Joseph Mitchell and Logan Graham. On
Some Relations Between Optimal TSP Solutions and Proximity Graphs in the
Plane
******************************
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.dia.uniroma3.it/pipermail/gdnet/attachments/20220211/0e558f85/attachment.html>