1

The Peculiarities of Extending Queue Layouts

Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg

Training One-Dimensional Graph Neural Networks is NP-Hard

Mathis Teva Rocton

Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach

Visualizing Treewidth

Chiu, Alvin, Thomas Depian, Eppstein, David, Goodrich, Michael T., Martin Nöllenburg

A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem

Reixach, Jaume, Blum, Christian, Djukanović, Marko, Günther Raidl

A Simulated Annealing Based Approach for the Roman Domination Problem

Greilhuber, Jakob, Schober, Sophia, Enrico Iurlano, Günther Raidl

A Tight Subexponential-Time Algorithm for Two-Page Book Embedding

ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP

Chew, Leroy, De Colnet, Alexis, Stefan Szeider

Boundary Labeling in a Circular Orbit

Bonerath, Annika, Martin Nöllenburg, Terziadis, Soeren, Wallinger, Markus, Wulms, Jules

Bundling-Aware Graph Drawing

Archambault, Daniel, Liotta, Giuseppe, Martin Nöllenburg, Piselli, Tommaso, Tappini, Alessandra, Wallinger, Markus