Author:
Heydt Ozan,Kublenz Simeon,Ossona de Mendez Patrice,Siebertz Sebastian,Vigny Alexandre
Funder
European Research Council
Deutsche Forschungsgemeinschaft
Horizon 2020
Horizon 2020 Framework Programme
Subject
Discrete Mathematics and Combinatorics
Reference52 articles.
1. S. Akhoondian Amiri, P. Ossona de Mendez, R. Rabinovich, S. Siebertz, Distributed domination on graph classes of bounded expansion, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018, pp. 143–151.
2. S. Akhoondian Amiri, S. Schmid, S. Siebertz, A local constant factor MDS approximation for bounded genus graphs, in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016, pp. 227–233.
3. On distributed algorithms for minimum dominating set problem, from theory to application;Alipour,2020
4. S. Alipour, A. Jafari, A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, pp. 501–502.
5. S.A. Amiri, S. Schmid, Brief announcement: A log*-time local MDS approximation scheme for bounded genus graphs, in: Proc. DISC, 2016.