Cs-Ds
Compact Binary Relation Representations with Rich Functionality
I/O-Efficient Dynamic Planar Range Skyline Queries
Triadic Consensus: A Randomized Algorithm for Voting in a Crowd
Boolean Algebraic Programs as a Methodology for Symbolically Demonstrating Lower and Upper Bounds of Algorithms and Determinism
Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids
Average-case analysis of perfect sorting by reversals (Journal Version)
Approximate pattern matching with k-mismatches in packed text
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
