1 citations · 2 across the 11 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
Constant round distributed domination on graph classes with bounded expansion
Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny
We show that the dominating set problem admits a constant factor approximation in a constant number of rounds in the LOCAL model of distributed computing on graph classes with boun…
cs.LO2020★ 1 cited
Dynamic Query Evaluation Over Structures with Low Degree
Alexandre Vigny
We consider the evaluation of first-order queries over classes of databases that have bounded degree and low degree. More precisely, given a query and a database, we want to effici…
cs.DM2020
Elimination distance to bounded degree on planar graphs
Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny
We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian and Dawar in their study of the parameterized complexity of the graph isomorphis…