{"id":537,"date":"2023-02-18T10:25:39","date_gmt":"2023-02-18T10:25:39","guid":{"rendered":"https:\/\/dccg.upc.edu\/eurocg23\/?page_id=537"},"modified":"2023-05-02T13:54:33","modified_gmt":"2023-05-02T13:54:33","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/dccg.upc.edu\/eurocg23\/index.php\/accepted-papers\/","title":{"rendered":"Accepted papers"},"content":{"rendered":"\n

The booklet of abstracts is available here<\/a>.<\/p>\n\n\n\n

    \n
  1. Anna Br\u00f6tzner and Oswin Aichholzer. Two Equivalent Representations of Bicolored Order Types<\/em><\/li>\n\n\n\n
  2. Helena Bergold<\/a>, Stefan Felsner<\/a>, Meghana M. Reddy<\/a> and Manfred Scheucher<\/a>. Using SAT to study plane substructures in simple drawings<\/em><\/li>\n\n\n\n
  3. Jan Kyn\u010dl and Jan Soukup. Many views of planar point sets<\/em><\/li>\n\n\n\n
  4. Lucas Meijer<\/a> and Till Miltzow<\/a>. Sometimes Two Irrational Guards are Needed<\/em><\/li>\n\n\n\n
  5. Patrick Schnider<\/a> and Simon Weber<\/a>. On the Complexity of Recognizing Nerves of Convex Sets<\/em><\/li>\n\n\n\n
  6. Tsuri Farhana and Matthew Katz<\/a>. Spanners under the Hausdorff and Fr{\\’e}chet Distances<\/em><\/li>\n\n\n\n
  7. Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher and Birgit Vogtenhuber. Flip Graphs for Arrangements of Pseudocircles<\/em><\/li>\n\n\n\n
  8. Frederik Br\u00fcning, Anne Driemel, Alperen Erg\u00fcr and Heiko R\u00f6glin. On the number of iterations of the DBA algorithm<\/em><\/li>\n\n\n\n
  9. Michaela Borzechowski and Simon Weber<\/a>. On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem<\/em><\/li>\n\n\n\n
  10. Helena Bergold, Manfred Scheucher<\/a> and Felix Schr\u00f6der<\/a>. Holes in convex drawings<\/em><\/li>\n\n\n\n
  11. Honglin Zhu and Hyuk Jun Kweon. Maximum overlap area of a convex polyhedron and a convex polygon under translation<\/em><\/li>\n\n\n\n
  12. Sujoy Bhore, Robert Ganian<\/a>, Liana Khazaliya, Fabrizio Montecchiani<\/a> and Martin N\u00f6llenburg<\/a>. Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable<\/em><\/li>\n\n\n\n
  13. Jacobus Conradi, Anne Driemel<\/a> and Benedikt Kolbe. $(1+\\eps)$-ANN data structure for curves via subspaces of bounded doubling dimension<\/em><\/li>\n\n\n\n
  14. Mark de Berg and Geert van Wordragen. Improved Bounds for Discrete Voronoi Games<\/em><\/li>\n\n\n\n
  15. Merce Claverol, Andrea de Las Heras Parrilla, David Flores Pe\u00f1aloza, Clemens Huemer and David Orden. On polynomials associated to Voronoi diagrams of point sets and crossing numbers<\/em><\/li>\n\n\n\n
  16. Max van Mulken, Bettina Speckmann<\/a> and Kevin Verbeek. Density Approximation for Kinetic Groups<\/em><\/li>\n\n\n\n
  17. Fabian Klute<\/a> and Marc van Kreveld<\/a>. On the Size of Fully Diverse Sets of Polygons using the Earth Movers Distance or Wasserstein Distance<\/em><\/li>\n\n\n\n
  18. Camille Lanuel<\/a>, Francis Lazarus and Rudi Pendavingh. A linear bound for the Colin de Verdi\u00e8re parameter $\\mu$ for graphs embedded on surfaces<\/em><\/li>\n\n\n\n
  19. M\u00f3nica Reyes, Cristina Dalf\u00f3, Miquel Angel Fiol and Anrau Messegu\u00e9. On the algebraic connectivity of token graphs of a cycle<\/em><\/li>\n\n\n\n
  20. Henk Alkema and Mark de Berg<\/a>. Euclidean One-of-a-Set TSP<\/em><\/li>\n\n\n\n
  21. Guillermo Esteban<\/a>, Dan Halperin<\/a>, V\u00edctor Ru\u00edz, Vera Sacrist\u00e1n and Rodrigo Silveira<\/a>. Shortest coordinated motion for a pair of square robots<\/em><\/li>\n\n\n\n
  22. Simon D. Fink<\/a> and Ignaz Rutter<\/a>. Maintaining Triconnected Components under Node Expansion<\/em><\/li>\n\n\n\n
  23. Sarita de Berg, Frank Staals<\/a> and Tillmann Miltzow<\/a>. Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain<\/em><\/li>\n\n\n\n
  24. Attila Jung. Radon number of graph families<\/em><\/li>\n\n\n\n
  25. Julian Pfeifle. Proving non-realizability with grass-plucker3<\/em><\/li>\n\n\n\n
  26. Rahul Jain, Marco Ricci, Jonathan Rollin and Andr\u00e9 Schulz. On the geometric thickness of 2-degenerate graphs<\/em><\/li>\n\n\n\n
  27. Luis Crespo Ruiz and Francisco Santos<\/a>. Realizations of multiassociahedra via rigidity<\/em><\/li>\n\n\n\n
  28. Oswin Aichholzer<\/a>, Stefan Felsner<\/a>, Rosna Paul, Manfred Scheucher<\/a> and Birgit Vogtenhuber. Perfect Bichromatic Matchings with Crossings<\/em><\/li>\n\n\n\n
  29. Patrizio Angelini, Michael Bekos<\/a>, Julia Katheder, Michael Kaufmann and Maximilian Pfister. Axis-Parallel Right Angle Crossing Graphs<\/em><\/li>\n\n\n\n
  30. Carla Binucci<\/a>, Emilio Di Giacomo<\/a>, Giuseppe Liotta<\/a>, Michael Kaufmann<\/a> and Alessandra Tappini<\/a>. k-planar Placement and Packing of \\Delta-regular Caterpillars<\/em><\/li>\n\n\n\n
  31. Mark de Berg<\/a>, Leyla Biabani, Morteza Monemizadeh and Leonidas Theocharous. Clustering with Obstacles<\/em><\/li>\n\n\n\n
  32. Mart Hagedoorn and Valentin Polishchuck. 2-point link distance queries in polygonal domains<\/em><\/li>\n\n\n\n
  33. Oswin Aichholzer, Joachim Orthaber and Birgit Vogtenhuber. Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs<\/em><\/li>\n\n\n\n
  34. Meghana M. Reddy, Michael Hoffmann and Emanuel Seemann. Hamiltonian Cycles and Matchings in 1-planar Graphs<\/em><\/li>\n\n\n\n
  35. Nicholas Bieker, Thomas Bl\u00e4sius<\/a>, Emil Dohse and Paul Jungeblut<\/a>. Recognizing Unit Disk Graphs in Hyperbolic Geometry is ER-Complete<\/em><\/li>\n\n\n\n
  36. Alexander Dobler, Martin N\u00f6llenburg<\/a>, Daniel Stojanovic, Ana\u00efs Villedieu and Jules Wulms. Crossing Minimization in Time Interval Storylines<\/em><\/li>\n\n\n\n
  37. Jean Cardinal<\/a>. The Complexity of Intersection Graphs of Lines in Space and Circle Orders<\/em><\/li>\n\n\n\n
  38. Felix Weitbrecht. Interactive Exploration of the Temporal \u03b1-Shape<\/em><\/li>\n\n\n\n
  39. Felix Weitbrecht. On the number of Delaunay Simplices over all Time Window in any Dimension<\/em><\/li>\n\n\n\n
  40. Herman Haverkort<\/a>. Vorosketch and the L0 distance<\/em><\/li>\n\n\n\n
  41. Signe Lundqvist, Klara Stokes and Lars-Daniel \u00d6hman. Applying The Pebble Game Algorithm to Rod Configurations<\/em><\/li>\n\n\n\n
  42. Michael Hoffmann and Meghana M. Reddy. The Number of Edges in Maximal 2-planar Graphs<\/em><\/li>\n\n\n\n
  43. Jakob Baumann, Matthias Pfretzschner and Ignaz Rutter. Parameterized Complexity of Vertex Splitting to Pathwidth at most 1<\/em><\/li>\n\n\n\n
  44. S\u00e1ndor Fekete<\/a>, Dominik Krupke<\/a>, Michael Perk<\/a>, Christian Rieck<\/a> and Christian Scheffer. Circling a Square: The Lawn Mowing Problem Is Algebraically Hard<\/em><\/li>\n\n\n\n
  45. Thijs van der Horst, Tim Ophelders and Bart van der Steenhoven. Simply Realising an Imprecise Polyline is NP-hard<\/em><\/li>\n\n\n\n
  46. Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Carolin Rehs, Andr\u00e9 van Renssen and Sampson Wong. Oriented Spanners<\/em><\/li>\n\n\n\n
  47. Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer<\/a> and Liam Roditty. Insertion-Only Dynamic Connectivity in General Disk Graphs<\/em><\/li>\n\n\n\n
  48. Freija van Lent<\/a>, Julian Golak, Alexander Grigoriev<\/a> and Aida Abiad. An s-t Jordan curve crossing boundaries of a set of disk-homeomorphic objects in the plane<\/em><\/li>\n\n\n\n
  49. Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister and Johannes Zink. Simultaneous Drawing of Layered Tree<\/em>s<\/li>\n\n\n\n
  50. Erwin Glazenburg, Frank Staals and Marc van Kreveld. Classification of 2D bichromatic points with outliers<\/em><\/li>\n\n\n\n
  51. Stefan Funke<\/a> and Sabine Storandt. Gradual Simplification of Polylines<\/em><\/li>\n\n\n\n
  52. Panos Giannopoulos<\/a> and Sergio Cabello<\/a>. The Fr\u00e9chet mean in the space of segments<\/em><\/li>\n\n\n\n
  53. This paper was withdrawn by the authors.<\/em><\/li>\n\n\n\n
  54. Michal Opler, Pavel Valtr and Tung Anh Vu. On the Arrangement of Hyperplanes Determined by n Points<\/em><\/li>\n\n\n\n
  55. Kevin Buchin<\/a>, Maike Buchin<\/a>, Joachim Gudmundsson, Aleksandr Popov<\/a> and Sampson Wong. Map Matching Queries Under Fr\u00e9chet Distance on Low-Density Spanners<\/em><\/li>\n\n\n\n
  56. Ignaz Rutter<\/a> and Peter Stumpf. Simultaneous Representation of Interval Graphs in the Sunflower Case<\/em><\/li>\n\n\n\n
  57. J. Andreas B\u00e6rentzen, Rasmus E. Christensen, Emil Toftegaard G\u00e6de and Eva Rotenberg. On Computing Local Separators for Skeletonization<\/em><\/li>\n\n\n\n
  58. Minh Tuan Ha, Paul Jungeblut<\/a> and Torsten Ueckerdt<\/a>. Primal-Dual Cops and Robber<\/em><\/li>\n\n\n\n
  59. Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow<\/a> and Simon Weber<\/a>. The Complexity of Recognizing Geometric Hypergraphs<\/em><\/li>\n\n\n\n
  60. Peyman Afshani and Aniket Basu Roy<\/a>. Packing Fr\u00e9chet Balls<\/em><\/li>\n\n\n\n
  61. Ond\u0159ej Chwiedziuk, Barbora Dohnalov\u00e1 and Miroslav Horsk\u00fd. Non-convex position of lines in R3<\/em><\/li>\n\n\n\n
  62. Thijs van der Horst and Tim Ophelders. Computing Minimum Complexity 1D Curve Simplifications under the Fr\u00e9chet Distance<\/em><\/li>\n\n\n\n
  63. Vahideh Keikha. A Heuristic Algorithm for Maximal Contained Polyhedrons<\/em><\/li>\n\n\n\n
  64. Patricia Bachmann and Ignaz Rutter<\/a>. Crossing Optimization in Neighborhood Drawings<\/em><\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"

    The booklet of abstracts is available here.<\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"templates\/template-full-width.php","meta":{"footnotes":""},"class_list":["post-537","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/dccg.upc.edu\/eurocg23\/index.php\/wp-json\/wp\/v2\/pages\/537","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dccg.upc.edu\/eurocg23\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/dccg.upc.edu\/eurocg23\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/dccg.upc.edu\/eurocg23\/index.php\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/dccg.upc.edu\/eurocg23\/index.php\/wp-json\/wp\/v2\/comments?post=537"}],"version-history":[{"count":6,"href":"https:\/\/dccg.upc.edu\/eurocg23\/index.php\/wp-json\/wp\/v2\/pages\/537\/revisions"}],"predecessor-version":[{"id":883,"href":"https:\/\/dccg.upc.edu\/eurocg23\/index.php\/wp-json\/wp\/v2\/pages\/537\/revisions\/883"}],"wp:attachment":[{"href":"https:\/\/dccg.upc.edu\/eurocg23\/index.php\/wp-json\/wp\/v2\/media?parent=537"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}