1: Complexity of Manipulation with Partial Information in Voting
2: Elicitation for Preferences Single Peaked on Trees
3: On Dynamic Job Ordering and Slot Configurations for Minimizing the Makespan Of Multiple MapReduce Jobs
4: Self-Adaptive Consolidation of Virtual Machines For Energy-Efficiency in the Cloud
5: Preference Elicitation For Single Crossing Domain
6: Make Up Your Mind: The Price of Online Queries in Differential Privacy
7: Capacitated Dominating Set on Planar Graphs
8: h-Index Manipulation by Undoing Merges
9: A heuristic approach for dividing graphs into bi-connected components with a size constraint
10: An Initial Seed Selection Algorithm for K-means Clustering of Georeferenced Data to Improve Replicability of Cluster Assignments for Mapping Application
11: Impact of Knowledge on Election Time in Anonymous Networks
12: On Directed Steiner Trees with Multiple Roots
13: Online Dominating Set
14: Design of Dynamic Algorithms via Primal-Dual Method
15: Online Row Sampling
16: Demand Prediction and Placement Optimization for Electric Vehicle Charging Stations
17: Locating a Small Cluster Privately
18: Online Ad Assignment with an Ad Exchange
19: New Deterministic Approximation Algorithms for Fully Dynamic Matching
20: Almost All Even Yao-Yao Graphs Are Spanners
21: Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering
22: Practical combinations of repetition-aware data structures
23: A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion
24: Succinct Choice Dictionaries
25: Cuckoo Filter: Simplification and Analysis
26: Approximation Algorithm for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks
27: Data Structure Lower Bounds for Document Indexing Problems
28: Weighted domination number of cactus graphs