Maximizing the Total Resolution of Graphs
Maximum Betweenness Centrality: Approximability and Tractable Cases
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Maximum dispersion and geometric maximum weight cliques
Maximum flow is approximable by deterministic constant-time algorithm in sparse networks
Maximum gradient embeddings and monotone clustering
Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables
Maximum Matchings via Glauber Dynamics
Maximum Segment Sum, Monadically (distilled tutorial, with solutions)
Measured descent: A new embedding method for finite metrics
Memory Consistency Conditions for Self-Assembly Programming
Memory Hierarchy Sensitive Graph Layout
Mergeable Dictionaries
Method of the Multidimensional Sieve in the Practical Realization of some Combinatorial Algorithms
Methods for Accelerating Conway's Doomsday Algorithm (part 1)
Methods for Accelerating Conway's Doomsday Algorithm (part 2)
Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability
Min-Cost 2-Connected Subgraphs With k Terminals
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time
Min-Max Fine Heaps