| 0 | -- | 0 | Hiroshi Hirai 0001, Yuni Iwamasa, Kazuo Murota, Stanislav Zivny. A Tractable Class of Binary VCSPs via M-Convex Intersection |
| 0 | -- | 0 | Avrim Blum, Sariel Har-Peled, Benjamin Raichel. Sparse Approximation via Generating Point Sets |
| 0 | -- | 0 | David G. Harris. Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set |
| 0 | -- | 0 | Saeed Akhoondian Amiri, Stefan Schmid 0001, Sebastian Siebertz. Distributed Dominating Set Approximations beyond Planar Graphs |
| 0 | -- | 0 | Klaus Jansen, Marten Maack, Malin Rau. Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times |
| 0 | -- | 0 | Moni Naor, Eylon Yogev. Bloom Filters in Adversarial Environments |
| 0 | -- | 0 | Yeow Meng Chee, Johan Chrisnata, Han Mao Kiah, Tuan Thanh Nguyen. Deciding the Confusability of Words under Tandem Repeats in Linear Time |
| 0 | -- | 0 | Konstantinos Koiliaris, Chao Xu 0002. Faster Pseudopolynomial Time Algorithms for Subset Sum |
| 0 | -- | 0 | Zhiyi Huang 0002, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang. e with Random Arrivals |
| 0 | -- | 0 | Xiaohui Bei, Jugal Garg, Martin Hoefer. Ascending-Price Algorithms for Unknown Markets |
| 0 | -- | 0 | Niv Buchbinder, Moran Feldman, Roy Schwartz. Online Submodular Maximization with Preemption |
| 0 | -- | 0 | Sampath Kannan, Kevin Tian. Locating Errors in Faulty Formulas |
| 0 | -- | 0 | David G. Harris, Thomas Pensyl, Aravind Srinivasan, Khoa Trinh. A Lottery Model for Center-Type Problems With Outliers |
| 0 | -- | 0 | Deeparnab Chakrabarty, Maryam Negahbani. Generalized Center Problems with Outliers |
| 0 | -- | 0 | David Coudert, Guillaume Ducoffe , Alexandru Popa 0001. Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs |