| 2025 | Branching Programs with Extended Memory: New Insights. | Suryajith Chillara, Nithish Raja |
| 2025 | Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement. | Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh, Sanjukta Roy |
| 2025 | Structural Parameterization of Locating-Dominating Set and Test Cover. | Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale |
| 2025 | Realizing Graphs with Cut Constraints. | Vtor Gomes Chagas, Samuel Plaa de Paula, Greis Yvet Oropeza Quesqun, Lucas de Oliveira Silva, Uverton dos Santos Souza |
| 2025 | Online Range Assignment Problems. | Paz Carmi, Matthew J. Katz, Idan Tomer |
| 2025 | On Exact Learning of d-Monotone Functions. | Nader H. Bshouty |
| 2025 | Improved Bounds for Group Testing in Arbitrary Hypergraphs. | Annalisa De Bonis |
| 2025 | Efficient Certifying Algorithms for Linear Classification. | Vincenzo Bonifaci, Sara Galatro |
| 2025 | Atoms Versus Avoiding Simplicial Vertices. | Karl Boddy, Konrad K. Dabrowski, Danil Paulusma |
| 2025 | A Parameterized Perspective of All-Colors. | Vclav Blazej, Satyabrata Jana, Peter Strulo |
| 2025 | Almost-Catalytic Computation. | Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma |
| 2025 | Improved Sublinear-Time Moment Estimation Using Weighted Sampling. | Anup Bhattacharya, Pinki Pradhan |
| 2025 | Dynamic Filter and Retrieval with One Access to Modifiable Memory. | Ioana O. Bercea, Guy Even, Tomer Even, Gabriel Marques Domingues |
| 2025 | On the Computational Complexity of Graph Reconstruction. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer |
| 2025 | On the Hardness of the Drone Delivery Problem. | Simon Bartlmae, Andreas Hene, Kelin Luo |
| 2025 | Degree Realization by Bipartite Cactus Graphs. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Yingli Ran, Dror Rawitz |
| 2025 | Packing Dimers to Maximum Occupancy Under Soft-Core Constraints. | Robert D. Barish, Tetsuo Shibuya |
| 2025 | Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs. | Yuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano, Yudai Oka |
| 2025 | Burning Path-Like and Clique-Like Graphs. | Radhika Aggarwal, Pradeesha Ashok, Dhairya Gupta |
| 2023 | Communication-Efficient Distributed Graph Clustering and Sparsification Under Duplication Models. | Chun Jiang Zhu |
| 2023 | Efficiently Enumerating All Spanning Trees of a Plane 3-Tree - (Extended Abstract). | Muhammad Nur Yanhaona, Asswad Sarker Nomaan, Md. Saidur Rahman |
| 2023 | Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models. | Paul G. Spirakis, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos |
| 2023 | On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. | Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach |
| 2023 | The Complexity of Secure RAMs. | Giuseppe Persiano |
| 2023 | Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues. | Victor Y. Pan, Soo Go, Qi Luan, Liang Zhao |