page 59823 / 60054 » publications |
178
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
232
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Universities and Institutions these days’ deals with issues related to with assessment of large number of students. Various evaluation methods have been adopted by examiners in ...
192
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
159
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
195
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...