1

Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity
Proceedings of the 2027 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2027.
Note: to appear
bib Project Project
A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximization
Proceedings of the Metaheuristics International Conference – MIC 2026, 2026, Springer.
Note: To appear
PDF bib
A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs
Evolutionary Computation in Combinatorial Optimization (Martin S. Krejca, Nelishia Pillay, eds.), volume 16522 of LNCS, pages 133–149, 2026, Springer.
PDF bib DOI
A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problem
Machine Learning, Optimization, and Data Science – LOD 2025, volume 16467 of LNCS, pages 1–16, 2026, Springer.
bib DOI
A Fixed-Parameter Algorithm for Extending Upward Planar Drawings
34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib Project Project
A Parameterized-Complexity Framework for Finding Local Optima
17th Innovations in Theoretical Computer Science Conference, ITCS 2026, Bocconi University, Milan, Italy, January 27-30, 2026 (Shubhangi Saraf, ed.), volume 362 of LIPIcs, pages 66:1–66:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project Project DOI
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
2026 Symposium on Simplicity in Algorithms, SOSA 2026, Vancouver, BC, Canada, January 12-14, 2026 (Sepehr Assadi, Eva Rotenberg, eds.), pages 65–80, 2026, SIAM.
PDF bib Project Project Project DOI
A Reinforcement Learning Guided Large Neighborhood Search for the Dynamic Electric Autonomous Dial-a-Ride Problem
Machine Learning, Optimization, and Data Science – LOD 2025 (Giuseppe Nicosia, Varunand Giesselbach, Sven Ojha, M. Panos Pardalos, Renato Umeton, La Malfa Emanuele, La Malfa Gabriele, eds.), volume 16467 of LNCS, pages 425-439, 2026, Springer.
bib DOI
Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Design
Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026.
Note: To appear; preprint: CoRR abs/2603.08322, https://arxiv.org/abs/2603.08322
bib Project Project Project
Algorithm Selection with Zero Domain Knowledge via Text Embeddings
Proceedings of the International Conference on Automated Machine Learning, AutoML 2026, September 28 – October 1, 2026, Ljubljana, Slovenia, 2026.
Note: To appear; preprint: CoRR abs/2604.19753, https://arxiv.org/abs/2604.19753
bib Project Project