H. Bodlaender

works on

fixed-parameter tractability 1 graph algorithms 1 graph parameters 1 outer k-planar graphs 1 parameterized complexity 1

From the 1 of 10 linked papers with an AI index.

collaborators

Showing cs.CCShow all

1 paper · 1 filter

cs.CC2025

XALP-completeness of Parameterized Problems on Planar Graphs

Hans L. Bodlaender, Krisztina SzilÃ¡gyi

The class XNLP consists of (parameterized) problems that can be solved nondeterministically in $f (k) n^{O (1)}$ time and $f (k) lo g n$ space, where $n$ is the size of the input instan…