The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …

The maximum clique problem (MCP) is to determine in a graph a clique (ie, a complete
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Algorithmica Page 1 DOI: 10.1007/s004530010050 Algorithmica (2001) 29: 410–421
Algorithmica © 2001 Springer-Verlag New York Inc. The Dense k-Subgraph Problem1 U …

This paper considers the sparse eigenvalue problem, which is to extract dominant (largest)
sparse eigenvectors with at most k non-zero components. We propose a simple yet effective …

Understanding user intent is key to designing an effective ranking system in a search
engine. In the absence of any explicit knowledge of user intent, search engines want to …

The original edition of The Geometry of Musical Rhythm was the first book to provide a
systematic and accessible computational geometric analysis of the musical rhythms of the …

This paper introduces and studies the maximum k-plex problem, which arises in social
network analysis and has wider applicability in several important areas employing graph …

Analogies have been central to creative problem-solving throughout the history of science
and technology. As the number of scientific articles continues to increase exponentially …

Convex optimization problems arising in applications, possibly as approximations of
intractable problems, are often structured and large scale. When the data are noisy, it is of …