Kirill Simonov

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Finding Minimum Distance Preservers: A Parameterized Study

Kirill Simonov, Farehe Soheil, Shaily Verma

For a given graph $G$ and a subset of vertices $S$ , a \emph{distance preserver} is a subgraph of $G$ that preserves shortest paths between the vertices of $S$ . We distinguish betwe…

cs.DS2023

The $s t$ -Planar Edge Completion Problem is Fixed-Parameter Tractable

Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta +2

The problem of deciding whether a biconnected planar digraph $G = (V, E)$ can be augmented to become an $s t$ -planar graph by adding a set of oriented edges $E^{'} \subseteq V \times V$ i…

Finding Minimum Distance Preservers: A Parameterized Study

The st-Planar Edge Completion Problem is Fixed-Parameter Tractable

The $s t$ -Planar Edge Completion Problem is Fixed-Parameter Tractable