1: Domination in graphs with bounded propagation: algorithms, formulations and hardness results
2: Choice numbers of graphs
3: Set Covering Problems with General Objective Functions
4: Digraph Decompositions and Monotonicity in Digraph Searching
5: Compressed Counting
6: Improved Approximations for Multiprocessor Scheduling Under Uncertainty
7: Min-Cost 2-Connected Subgraphs With k Terminals
8: On Subgraph Isomorphism
9: The complexity of planar graph choosability
10: The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
11: Efficient Minimization of DFAs with Partial Transition Functions
12: Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
13: Understanding maximal repetitions in strings
14: Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental
15: Trimmed Moebius Inversion and Graphs of Bounded Degree
16: Minimizing Flow Time in the Wireless Gathering Problem
17: Factoring Polynomials over Finite Fields using Balance Test
18: Stackelberg Network Pricing Games
19: Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
20: Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
21: Geodesic Fr'echet Distance Inside a Simple Polygon
22: On Dynamic Breadth-First Search in External-Memory
23: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
24: An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines
25: Tight Bounds for Blind Search on the Integers
26: Trimming of Graphs, with Application to Point Labeling
27: Computing Minimum Spanning Trees with Uncertainty
28: Convergence Thresholds of Newton’s Method for Monotone Polynomial Equations
29: Lower bounds for adaptive linearity tests
30: On Geometric Spanners of Euclidean and Unit Disk Graphs
31: Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees