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
Min-Max Graph Partitioning and Small Set Expansion
Min-Max Latency Walks: Approximation Algorithms for Monitoring Vertex-Weighted Graphs
Minimax Trees in Linear Time
Minimizing a sum of submodular functions
Minimizing Flow Time in the Wireless Gathering Problem
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
Minimizing Unsatisfaction in Colourful Neighbourhoods
Minimum and maximum against k lies
Minimum Certificate Dispersal with Tree Structures
Minimum Covering with Travel Cost
Minimum Cuts in Near-Linear Time
Minimum Dissatisfaction Personnel Scheduling
Minimum Entropy Combinatorial Optimization Problems
Minimum Entropy Orientations
Minimum Latency Submodular Cover