ParAI

Counting Vanishing Matrix-Vector Products

Cornelius Brand and Viktoriia Korchemna and Kirill Simonov and Michael Skotnica

Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)

Liana Khazaliya

Enumerating Minimal Solution Sets for Metric Graph Problems

Benjamin Bergougnoux and Oscar Defrain and Fionn Mc Inerney

Exact Algorithms for Clustered Planarity with Linear Saturators

Da Lozzo, Giordano, Robert Ganian, Gupta, Siddharth, Mohar, Bojan, Ordyniak, Sebastian, Zehavi, Meirav

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

Generating All Invertible Matrices by Row Operations

Phuc Hung Hoang

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

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms

Simon Wietheger

Non-Clashing Teaching Maps for Balls in Graphs

Jérémie Chalopin and Victor Chepoi and Fionn Mc Inerney and Sébastien Ratel