We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
A toolkit for distributed hydrologic modeling at multiple scales using two independent models within a geographic information system is presented. This open-source, freely availab...
Scott N. Miller, Darius J. Semmens, David C. Goodr...
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...