1 citations · 1 across the 13 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Parameterized Spanning Tree Congestion
Michael Lampis, Valia Mitsou, Edouard Nemery +3
In this paper we study the Spanning Tree Congestion problem, where we are given a graph and are asked to find a spanning tree of minimum maximum congestion. Here, the…
cs.DS2024
Parameterized Maximum Node-Disjoint Paths
Michael Lampis, Manolis Vasilakis
We revisit the Maximum Node-Disjoint Paths problem, the natural optimization version of Node-Disjoint Paths, where we are given a graph , pairs of vertices and…
cs.DS2024
Parameterized Vertex Integrity Revisited
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis +1
Vertex integrity is a graph parameter that measures the connectivity of a graph. Informally, its meaning is that a graph has small vertex integrity if it has a small separator whos…