1: Efficient Convex Optimization with Membership Oracles
2: Optimal General Matchings
3: Parameterized Approximation Algorithms for some Location Problems in Graphs
4: Clustering with Noisy Queries
5: A $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
6: Testing Piecewise Functions
7: Query Complexity of Clustering with Side Information
8: The Optimal Route and Stops for a Group of Users in a Road Network
9: A practical fpt algorithm for Flow Decomposition and transcript assembly
10: Sparsity-Based STAP Design Based on Alternating Direction Method with Gain/Phase Errors
11: Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity
12: Steiner Point Removal with Distortion $O(\log k)$
13: An adaptive prefix-assignment technique for symmetry reduction
14: Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers
15: Semidefinite Programming and Nash Equilibria in Bimatrix Games
16: Simulation optimization: A review of algorithms and applications
17: Domain reduction techniques for global NLP and MINLP optimization
18: Fast and robust tensor decomposition with applications to dictionary learning
19: Typical Approximation Performance for Maximum Coverage Problem
20: Accelerations for Graph Isomorphism
21: Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs
22: On the complexity of finding internally vertex-disjoint long directed paths
23: Dispersion on Trees