Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...