Kacper Kluk

activity

20242026

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2025

Faster diameter computation in graphs of bounded Euler genus

Kacper Kluk, Marcin Pilipczuk, Michał Pilipczuk +1

We show that for any fixed integer $k \geq 0$ , there exists an algorithm that computes the diameter and the eccentricies of all vertices of an input unweighted, undirected $n$ -vert…

cs.DS2024

Sparse induced subgraphs in $P_{7}$ -free graphs of bounded clique number

Maria Chudnovsky, Jadwiga Czyżewska, Kacper Kluk +2

Many natural computational problems, including e.g. Max Weight Independent Set, Feedback Vertex Set, or Vertex Planarization, can be unified under an umbrella of finding the larges…

Faster diameter computation in graphs of bounded Euler genus

Sparse induced subgraphs in P7​-free graphs of bounded clique number

Sparse induced subgraphs in $P_{7}$ -free graphs of bounded clique number