Despite considerable progress in genome-and proteome-based high-throughput screening
methods and in rational drug design, the increase in approved drugs in the past decade did …

A certifying algorithm is an algorithm that produces, with each output, a certificate or witness
(easy-to-verify proof) that the particular output has not been compromised by a bug. A user …

Many practical computing problems concern large graphs. Standard examples include the
Web graph and various social networks. The scale of these graphs-in some cases billions of …

A comprehensive update of the leading algorithms text, with new material on matchings in
bipartite graphs, online algorithms, machine learning, and other topics. Some books on …

Motivated by the fast‐growing need to compute centrality indices on large, yet very sparse,
networks, new algorithms for betweenness are introduced in this paper. They require O (n+ …

This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

This is the newly revised and expanded edition of the popular introduction to the design and
implementation of geometry algorithms arising in areas such as computer graphics, robotics …

We present a simple dictionary with worst case constant lookup time, equaling the
theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et …

We describe a package of practical tools and libraries for manipulating graphs and their
drawings. Our design, which is aimed at facilitating the combination of the package …

Computational analysis and interactive visualization of biological networks and protein
structures are common tasks for gaining insight into biological processes. This protocol …