Program Size and Temperature in Self-Assembly
Animal Testing
Cutting out Polygons with a Circular Saw
Dominating Induced Matchings for P7-Free Graphs in Linear Time
Improved Approximations for Buy-at-bulk and Shallow-Light $k$-Steiner Trees and $(k,2)$-Subgraph
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
Treemaps with Bounded Aspect Ratio
A new algorithm for the characteristic string problem under loose similarity criteria
Online Linear Optimization over Permutations
On the Best Possible Competitive Ratio for Multislope Ski Rental
Hamiltonian paths in the square of a tree
Two Fixed-Parameter algorithms for the cocoloring problem
Dynamic Range Majority Data Structures
Dynamic Range Selection in Linear Space
Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
Closest Periodic Vectors in Lp Spaces
Minimizing interference in ad-hoc networks with bounded communication radius
Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
Contraction-based Steiner Tree Approximations in Practice
Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments
Lower bounds for myopic DPLL algorithms with a cut heuristic
Improved Collaborative Filtering
Efficient Algorithms for the Weighted k-Center Problem on a Real Line
Input-Thrifty Extrema Testing
Fully Retroactive Approximate Range and Nearest Neighbor Searching
Angle-Restricted Steiner Arborescences for Flow Map Layout
Parameterized algorithms for inclusion of linear matchings
Broadcasting in Heterogeneous Tree Networks with Uncertainty
Optimal File Distribution in Peer-to-Peer Networks
Computing the visibility polygon using few variables
Improved Approximation Algorithms for Routing Shop Scheduling
Asymptotic Modularity of some Graph Classes
Encoding 2-D Range Maximum Queries
Space-Efficient Data-Analysis Queries on Grids
Outlier Respecting Points Approximation
A Nearly-Quadratic Gap Between Adaptive and Non-Adaptive Property Testers
External Memory Multimaps
Robustness of Minimum Cost Arborescences
Fast Fréchet Queries
Algorithms for Building Consensus MUL-trees
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
Adaptive Phenotype Testing for AND/OR Items
Finding Maximum Sum Segments in Sequences with Uncertainty
An Index Structure for Spaced Seed Search
Range LCP
On Power-Law Distributed Balls in Bins and its Applications to View Size Estimation
The Parameterized Complexity of Local Search for TSP, More Refined
On the Parameterized Complexity of Consensus Clustering
Sorting, Searching, and Simulation in the MapReduce Framework
Compact Representation of Posets
A Randomized Algorithm for Finding Frequent Elements in Streams Using O(log log N) Space
Computing Knapsack Solutions with Cardinality Robustness
Linear-Time Algorithms for Proportional Contact Graph Representations
Edit Distance to Monotonicity in Sliding Windows
External Memory Orthogonal Range Reporting with Fast Updates
Path Queries in Weighted Trees
Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem
Folding Equilateral Plane Graphs
Covering and Piercing Disks with Two Centers
Succinct Indexes for Circular Patterns
An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
Simultaneous Embedding of Embedded Planar Graphs
Packing-Based Approximation Algorithm for the k-Set Cover Problem
Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions
The School Bus Problem on Trees
Generating Realistic Roofs over a Rectilinear Polygon
Capacitated Domination: Constant Factor Approximations for Planar Graphs
Max-Throughput for (Conservative) k-of-n Testing
Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
Parameterized complexity of the firefighter problem
Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs
Recognizing polar planar graphs using new results for monopolarity
Explicit array-based compact data structures for triangulations
Faster Approximate Pattern Matching in Compressed Repetitive Texts
A polynomial kernel for Feedback Arc Set on Bipartite Tournaments