n-Level Graph Partitioning
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem
Narrow sieves for parameterized paths and packings
Near approximation of maximum weight matching through efficient weight reduction
Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs
Near-Optimal Column-Based Matrix Reconstruction
Near-Optimal Radio Use For Wireless Network Synchronization
Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model
Nearly Optimal Sparse Fourier Transform
Nearly Tight Low Stretch Spanning Trees
Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems
Negative Interactions in Irreversible Self-Assembly
Neighborhood-Based Topology Recognition in Sensor Networks
Networks become navigable as nodes move and forget
New Algorithmic Approaches for Computing Optimal Network Paths with Several Types of QoS Constraints
New Algorithms for Regular Expression Matching
New Algorithms on Wavelet Trees and Applications to Information Retrieval
New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs
New Constructive Aspects of the Lovasz Local Lemma
New Lower and Upper Bounds for Representing Sequences