1: Approximation Algorithms for Rectangle Packing Problems (PhD Thesis)
2: Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
3: Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy
4: First-order methods for constrained convex programming based on linearized augmented Lagrangian function
5: The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern
6: Parameter Estimation in Gaussian Mixture Models with Malicious Noise, without Balanced Mixing Coefficients
7: Compressed Indexing with Signature Grammars
8: A Generic Framework for Engineering Graph Canonization Algorithms
9: Identifying user habits through data mining on call data records
10: Relief-Based Feature Selection: Introduction and Review
11: On Computing Min-Degree Elimination Orderings
12: Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations
13: Deterministic parallel algorithms for bilinear objective functions
14: Calibration for the (Computationally-Identifiable) Masses
15: Interpolating between $k$-Median and $k$-Center: Approximation Algorithms for Ordered $k$-Median
16: Practical Hash Functions for Similarity Estimation and Dimensionality Reduction
17: Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes
18: Clustering Semi-Random Mixtures of Gaussians
19: Recovering tree-child networks from shortest inter-taxa distance information
20: On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
21: Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning
22: Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter
23: SHIP: A Scalable High-performance IPv6 Lookup Algorithm that Exploits Prefix Characteristics
24: A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition
25: (Biased) Majority Rule Cellular Automata
26: Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
27: Online Facility Location on Semi-Random Streams
28: A Multi Objective Reliable Location-Inventory Capacitated Disruption Facility Problem with Penalty Cost Solve with Efficient Meta Historic Algorithms
29: Approximating the Permanent of a Random Matrix with Vanishing Mean
30: AUPCR Maximizing Matchings : Towards a Pragmatic Notion of Optimality for One-Sided Preference Matchings
31: Frameworks for Designing In-place Graph Algorithms
32: On the Approximability of Related Machine Scheduling under Arbitrary Precedence
33: Active Regression via Linear-Sample Sparsification
34: Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set
35: Adapting Local Sequential Algorithms to the Distributed Setting
36: On Structural Parameterizations of Firefighting