1

Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes

Jan Niclas Dreier, Mählmann, Nikolas, Toru\ŉczyk, Szymon

GdMetriX - A NetworkX Extension For Graph Drawing Metrics

Martin Nöllenburg, Röder, Sebastian, Wallinger, Markus

Generating All Invertible Matrices by Row Operations

Phuc Hung Hoang

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL

Leroy Chew, Alexis De Colnet, Friedrich Slivovsky, Stefan Szeider

Hoop Diagrams: A Set Visualization Method

Rodgers, Peter, Chapman, Peter, Blake, Andrew, Martin Nöllenburg, Wallinger, Markus, Dobler, Alexander

Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem

Simon Wietheger

Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension

Valentin Bartier and Oscar Defrain and Fionn Mc Inerney

Introducing Fairness in Graph Visualization

Hong, Seok-Hee, Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Piselli, Tommaso

Introducing Fairness in Graph Visualization via Gradient Descent

Montecchiani, Fabrizio, Liotta, Giuseppe, Martin Nöllenburg, Hong, Seok-Hee, Piselli, Tommaso

Learning Small Decision Trees for Data of Low Rank-Width

Konrad Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider