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

From the 1 of 1 linked paper with an AI index.

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2026

The Parameterized Complexity of Problems on Outer k-Planar Graphs

Xiaobin Ren, Hans L. Bodlaender

The paper investigates the parameterized complexity of many classic graph problems on outer k‑planar graphs, showing that most become fixed‑parameter tractable when k is the parame…