Titlebook: ;

Aerophagia

integral

Parameterized Complexity of Generalized Domination Problems,or every . ∉ .. This concept, introduced by Telle in 1990’s, generalizes and unifies several variants of graph domination studied separately before. We study the parameterized complexity of (.,.)-domination in this general setting. Among other results we show that existence of a (.,.)-dominating set

使显得不重要

愤世嫉俗者

aneurysm

notice

火光在摇曳

Local Algorithms for Edge Colorings in UDGs,sor networks as they can be used to model link scheduling problems in such networks. It is well known that both problems are NP-complete, and approximation algorithms for them have been extensively studied under the centralized model of computation. Centralized algorithms, however, are not suitable

阴郁

诗集

https://doi.org/10.1007/978-1-349-05843-3performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm depends on the special properties of the graph constructed in this way. We survey the art gallery problem, partition into rectangles, minimum-diameter clustering, rectilinear cartogram construction, mesh stripificat

Malleable