Papers accepted at SoCG

15 June 2026, by Linda Kleist

Photo: pixabay

We are excited to announce that the following papers got accepted at the 42nd International Symposium on Computational Geometry (SoCG 2026) — the premier international forum for advances in Computational Geometry and its applications. Adding to this good news, since recently, this fact is reflected in a CORE rank of A*.

You are cordially invited to check out our new insights, which are already available and published.

Covering and Partitioning Complex Objects with Small Pieces
With Anders Aamand, Mikkel Abrahamsen, Reilly Browne, Mayank Goswami, Prahlad Narasimhan Kasthurirangan, Linda Kleist, Joseph S. B. Mitchell, Valentin Polishchuk, and Jack Stade.
https://doi.org/10.4230/LIPIcs.SoCG.2026.1

Disproving Two Conjectures on the Hamiltonicity of Venn Diagrams
Sofia Brenner, Linda Kleist, Torsten Mütze, Christian Rieck, and Francesco Verciani.
https://doi.org/10.4230/LIPIcs.SoCG.2026.22

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
Håvard Bakke Bjerkevik, Joseph Dorfer, Linda Kleist, Torsten Ueckerdt, and Birgit Vogtenhuber.
https://doi.org/10.4230/LIPIcs.SoCG.2026.16

Online Packing of Orthogonal Polygons
Tim Gerlach, Benjamin Hennies, and Linda Kleist.
https://doi.org/10.4230/LIPIcs.SoCG.2026.52

Latest articles

Foto of FLIPS Kickoff Meeting in Hamburg, June 2026

Photo: UHH/Kleist

08.06.2026|News

FLIPS Kickoff Meeting in Hamburg

Joining forces with a group of researchers from France, we aim for new insights on Flip Graphs on Point Sets, in particular for spanning trees and matchings. In the week of June 8, the French team came to the UHH to kick off our project with an intensive and productive research week. We were also...

talk at Bremen-Hamburg Workshop, May 2026

Photo: Linda Kleist

21.05.2026|News

Bremen–Hamburg-Workshop on Algorithms, Combinatorics, and Optimization

One of the first workshops held in the new House of Informatics was the latest edition of the Bremen–Hamburg-Workshop on Algorithms, Combinatorics, and Optimization, organized by Nathan Bowler and Linda Kleist. Researchers from UHH, TUHH, and the University of Bremen—joined by participants from Kiel...