| 2025 | GECCO | A Variational Quantum Algorithm for the Permutation Flow Shop Scheduling Problem. | Marco Baioletti, Fabrizio Fagiolo, Angelo Oddi, Riccardo Rasconi |
| 2024 | ECAI | An Empirical Study of Grounding PPDDL Plans for AI-Driven Robots in Social Environment. | Gloria Beraldo, Angelo Oddi, Riccardo Rasconi |
| 2023 | GECCO | Solving Scheduling Problems with Quantum Computing: a Study on Flexible Open Shop. | Marco Baioletti, Angelo Oddi, Riccardo Rasconi |
| 2022 | IWINAC | Compiling Single Round QCCP-X Quantum Circuits by Genetic Algorithm. | Lis Arufe, Riccardo Rasconi, Angelo Oddi, Ramiro Varela, Miguel ngel Gonzlez |
| 2020 | ECAI | Integrating Open-Ended Learning in the Sense-Plan-Act Robot Control Paradigm. | Angelo Oddi, Riccardo Rasconi, Vieri Giuliano Santucci, Gabriele Sartor, Emilio Cartoni, Francesco Mannella, Gianluca Baldassarre |
| 2019 | AAAI | An Innovative Genetic Algorithm for the Quantum Circuit Compilation Problem. | Riccardo Rasconi, Angelo Oddi |
| 2018 | CPAIOR | Greedy Randomized Search for Scalable Compilation of Quantum Circuits. | Angelo Oddi, Riccardo Rasconi |
| 2015 | ICTAI | A Multi-objective Large Neighborhood Search Methodology for Scheduling Problems with Energy Costs. | Angelo Oddi, Riccardo Rasconi, Amedeo Cesta |
| 2011 | IJCAI | Iterative Flattening Search for the Flexible Job Shop Scheduling Problem. | Angelo Oddi, Riccardo Rasconi, Amedeo Cesta, Stephen F. Smith |
| 2010 | CPAIOR | Job Shop Scheduling with Setup Times: Exploring the Applicability of a Constraint-based Iterative Sampling Approach. | Angelo Oddi, Riccardo Rasconi, Amedeo Cesta, Stephen F. Smith |
| 2010 | ECAI | Project Scheduling as a Disjunctive Temporal Problem. | Angelo Oddi, Riccardo Rasconi, Amedeo Cesta |
| 2009 | IAAI | Developing an End-to-End Planning Application from a Timeline Representation Framework. | Amedeo Cesta, Gabriella Cortellessa, Simone Fratini, Angelo Oddi |
| 2008 | CPAIOR | Hybrid Variants for Iterative Flattening Search. | Angelo Oddi, Amedeo Cesta, Nicola Policella, Stephen F. Smith |
| 2008 | ECAI | Continuous Plan Management Support for Space Missions: the RAXEM Case. | Amedeo Cesta, Gabriella Cortellessa, Michel Denis, Alessandro Donati, Simone Fratini, Angelo Oddi, Nicola Policella, Erhard Rabenau, Jonathan Schulster |
| 2006 | ECAI | Software Companion: The Mexar2 Support to Space Mission Planners. | Amedeo Cesta, Gabriella Cortellessa, Simone Fratini, Angelo Oddi, Nicola Policella |
| 2005 | AAAI | Exploiting Temporal Flexibility to Obtain High Quality Schedules. | Nicola Policella, Xiaofang Wang, Stephen F. Smith, Angelo Oddi |
| 2004 | CP | Generating Robust Partial Order Schedules. | Nicola Policella, Angelo Oddi, Stephen F. Smith, Amedeo Cesta |
| 2004 | ECAI | IPSS: A Hybrid Reasoner for Planning and Scheduling. | Mara Dolores Rodrguez-Moreno, Angelo Oddi, Daniel Borrajo, Amedeo Cesta, Daniel Meziat |
| 2003 | CP | Generating High Quality Schedules for a Spacecraft Memory Downlink Problem. | Angelo Oddi, Nicola Policella, Amedeo Cesta, Gabriella Cortellessa |
| 2000 | AAAI | Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. | Amedeo Cesta, Angelo Oddi, Stephen F. Smith |
| 2000 | ECAI | Incremental Forward Checking for the Disjunctive Temporal Problem. | Angelo Oddi, Amedeo Cesta |
| 1999 | IJCAI | An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows. | Amedeo Cesta, Angelo Oddi, Stephen F. Smith |
| 1998 | CP | Scheduling Multi-capacitated Resources Under Complex Temporal Constraints. | Amedeo Cesta, Angelo Oddi, Stephen F. Smith |
| 1998 | ECAI | Solving Multiple Capacitated Scheduling Problems with Tabu Search. | Angelo Oddi |
| 1997 | AAAI | Stochastic Procedures for Generating Feasible Schedules. | Angelo Oddi, Stephen F. Smith |
| 1996 | TIME | Gaining Efficiency and Flexibility in the Simple Temporal Problem. | Amedeo Cesta, Angelo Oddi |
| 1993 | ICTAI | Maintaining Consistency in a Quantitative Time Manager. | Roberto Cervoni, Amedeo Cesta, Angelo Oddi |