7 citations · 8 across the 6 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2019
Parameterized Distributed Complexity Theory: A logical approach
Sebastian Siebertz, Alexandre Vigny
Parameterized complexity theory offers a framework for a refined analysis of hard algorithmic problems. Instead of expressing the running time of an algorithm as a function of the…
cs.DC2016
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-kn…