Cs-Ds
Strong Bounds for Evolution in Undirected Graphs
Differential Privacy for the Analyst via Private Equilibrium Computation
Processor Allocation for Optimistic Parallelization of Irregular Programs
An Efficient Algorithm to Calculate the Center of the Biggest Inscribed Circle in an Irregular Polygon
Approximation algorithms for energy, reliability and makespan optimization problems
Online Multi-Commodity Flow with High Demands
Compression and Sieve: Reducing Communication in Parallel Breadth First Search on Distributed Memory Systems
Linear Kernels on Graphs Excluding Topological Minors
Grammar-Based Construction of Indexes for Binary Jumbled Pattern Matching
Nonuniform Vote Aggregation Algorithms
Clustering to Maximize the Ratio of Split to Diameter
Proximal Newton-type methods for minimizing composite functions
Improved Balas and Mazzola Linearization for Quadratic 0-1 Programs with Application in a New Cutting Plane Algorithm
In-place associative permutation sort
Fast Packed String Matching for Short Patterns
Characterizing Properties for Q-Clustering
Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms
A space efficient streaming algorithm for triangle counting using the birthday paradox
Conflict Anticipation in the Search for Graph Automorphisms
Protein Inference and Protein Quantification: Two Sides of the Same Coin
Single pass sparsification in the streaming model with edge deletions
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
