| 2021 | On Singleton Congestion Games with Resilience Against Collusion. | Bugra askurlu, zgn Ekici, Fatih Erdem Kizilkaya |
| 2021 | A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. | Ben Cameron, Aaron Grubb, Joe Sawada |
| 2021 | The Secretary Problem with Reservation Costs. | Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith |
| 2021 | Symmetric Norm Estimation and Regression on Sliding Windows. | Vladimir Braverman, Viska Wei, Samson Zhou |
| 2021 | Consistent Simplification of Polyline Tree Bundles. | Yannick Bosch, Peter Schfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink |
| 2021 | Sublinear-Space Approximation Algorithms for Max r-SAT. | Arindam Biswas, Venkatesh Raman |
| 2021 | Constrained Hitting Set Problem with Intervals. | Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit |
| 2021 | Minimum Color Spanning Circle in Imprecise Setup. | Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Lffler, Maria Saumell |
| 2020 | Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality Constraint. | Hongxiang Zhang, Dachuan Xu, Longkun Guo, Jingjing Tan |
| 2020 | Approximation Algorithms for General Cluster Routing Problem. | Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun |
| 2020 | An Improved Bregman k-means++ Algorithm via Local Search. | Xiaoyun Tian, Dachuan Xu, Longkun Guo, Dan Wu |
| 2020 | Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families. | Vipin Singh Sehrawat, Yvo Desmedt |
| 2020 | New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem. | Khadija Hadj Salem, Yann Kieffer |
| 2020 | Bounded-Degree Spanners in the Presence of Polygonal Obstacles. | Andr van Renssen, Gladys Wong |
| 2020 | Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. | Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski |
| 2020 | Quantum Speedup for the Minimum Steiner Tree Problem. | Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise, Franois Le Gall |
| 2020 | Imbalance Parameterized by Twin Cover Revisited. | Neeldhara Misra, Harshil Mittal |
| 2020 | Tight Approximation for the Minimum Bottleneck Generalized Matching Problem. | Julin Mestre, Nicols E. Stier Moses |
| 2020 | Election Control Through Social Influence with Unknown Preferences. | Mohammad Abouei Mehrizi, Federico Cor, Emilio Cruciani, Gianlorenzo D'Angelo |
| 2020 | Approximation Algorithms for Car-Sharing Problems. | Kelin Luo, Frits C. R. Spieksma |
| 2020 | On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs. | Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati |
| 2020 | How Hard Is Completeness Reasoning for Conjunctive Queries? | Xianmin Liu, Jianzhong Li, Yingshu Li |
| 2020 | Even Better Fixed-Parameter Algorithms for Bicluster Editing. | Manuel Lafond |
| 2020 | Constructing Independent Spanning Trees in Alternating Group Networks. | Jie-Fu Huang, Sun-Yuan Hsieh |
| 2020 | Path-Monotonic Upward Drawings of Graphs. | Seok-Hee Hong, Hiroshi Nagamochi |