| 2023 | Differentiable Discrete Optimization Using Dataless Neural Networks. | Sangram Kishor Jena, K. Subramani, Alvaro Velasquez |
| 2023 | The Bag-Based Search: A Meta-Algorithm to Construct Tractable Logical Circuits for Graphs Based on Tree Decomposition. | Masakazu Ishihata |
| 2023 | Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges. | Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni |
| 2023 | Improved Approximation for Broadcasting in k-Path Graphs. | Hovhannes A. Harutyunyan, Narek A. Hovhannisyan |
| 2023 | Online Facility Assignment for General Layout of Servers on a Line. | Tsubasa Harada, Toshiya Itoh |
| 2023 | Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs. | Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono |
| 2023 | Graph Clustering Through Users' Properties and Social Influence. | Jianxiong Guo, Zhehao Zhu, Yucen Gao, Xiaofeng Gao |
| 2023 | Algorithms for the Ridesharing with Profit Constraint Problem. | Qian-Ping Gu, Jiajian Leo Liang |
| 2023 | An Approximation Algorithm for Covering Vertices by 4 | Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang |
| 2023 | Highway Preferential Attachment Models for Geographic Routing. | Ofek Gila, Evrim Ozel, Michael T. Goodrich |
| 2023 | Popularity on the Roommate Diversity Problem. | Steven Ge, Toshiya Itoh |
| 2023 | Exactly k MSTs: How Many Vertices Suffice? | Apratim Dutta, Rahul Muthu, Anuj Tawari, V. Sunitha |
| 2023 | Machine Learning with Low-Resource Data from Psychiatric Clinics. | Hongmin W. Du, Neil De Chen, Xiao Li, Miklos A. Vasarhelyi |
| 2023 | Some Combinatorial Algorithms on the Dominating Number of Anti-rank k Hypergraphs. | Zhuo Diao, Zhongzheng Tang |
| 2023 | Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem. | Anthony Deschnes, Raphal Boudreault, Vanessa Simard, Jonathan Gaudreault, Claude-Guy Quimper |
| 2023 | Online Dominating Set and Coloring. | Minati De, Sambhav Khurana, Satyam Singh |
| 2023 | V-Words, Lyndon Words and Substring circ-UMFFs. | Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth |
| 2023 | Improved Scheduling with a Shared Resource. | Christoph Damerius, Peter Kling, Florian Schneider |
| 2023 | Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on Graphs Having Small Dominating Sets. | Maria Luza L. da Cruz, Raquel S. F. Bravo, Rodolfo A. Oliveira, Uverton S. Souza |
| 2023 | An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs. | Nathan Cordner, George Kollios |
| 2023 | Improved Lower Bound for Estimating the Number of Defective Items. | Nader H. Bshouty |
| 2023 | Computing Random r-Orthogonal Latin Squares. | Sergey Bereg |
| 2023 | The Fine-Grained Complexity of Approximately Counting Proper Connected Colorings (Extended Abstract). | Robert D. Barish, Tetsuo Shibuya |
| 2023 | An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line. | Stephen Arndt, Josh Ascher, Kirk Pruhs |
| 2023 | Earliest Deadline First Is a 2-Approximation for DARP with Time Windows. | Barbara M. Anthony, Christine Chung, Ananya Das, David S. Yuen |