1: Upward Planar Morphs
2: Queue Layouts of Planar 3-Trees
3: Collective fast delivery by energy-efficient agents
4: Exchange-Based Diffusion in Hb-Graphs: Highlighting Complex Relationships
5: Mining Frequent Patterns in Evolving Graphs
6: The Complexity Landscape of Decompositional Parameters for ILP
7: Convex optimization using quantum oracles
8: Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes
9: A comparative study of top-k high utility itemset mining methods
10: Treewidth of display graphs: bounds, brambles and applications
11: Faster Balanced Clusterings in High Dimension
12: Relaxed Voronoi: a Simple Framework for Terminal-Clustering Problems
13: Aesthetic Discrimination of Graph Layouts
14: Quantum algorithms and lower bounds for convex optimization
15: SOS lower bounds with hard constraints: think global, act local
16: Fast and Accurate Graph Stream Summarization
17: Power Flow Analysis Using Graph based Combination of Iterative Methods and Vertex Contraction Approach
18: Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach
19: Multi-finger binary search trees
20: Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets
21: Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT
22: Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
23: Approximation algorithms for stochastic clustering
24: Fast greedy algorithms for dictionary selection with generalized sparsity constraints
25: FRESH: Fr'echet Similarity with Hashing
26: Metric dimension reduction: A snapshot of the Ribe program
27: Top-k Overlapping Densest Subgraphs: Approximation and Complexity
28: Local Coloring and its Complexity
29: Streaming dictionary matching with mismatches