Pierre Le Bodic
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
22
Venues
10
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
22 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CP | Modelling and Optimizing HVAC Systems for Early-Stage Building Design. | Victor Calixto, Camilo Cruz Gambardella, Amin Karimi, Pierre Le Bodic, Allen Z. Zhong |
| 2025 | AAAI | Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities. | Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey |
| 2024 | AISTATS | Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles. | Fan Yang, Pierre Le Bodic, Michael Kamp, Mario Boley |
| 2024 | CPAIOR | Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model. | Gioni Mexi, Somayeh Shamsi, Mathieu Besanon, Pierre Le Bodic |
| 2024 | ICAPS | Planning and Execution in Multi-Agent Path Finding: Models and Algorithms. | Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey |
| 2024 | SoCS | Optimal Unlabeled Pebble Motion on Trees. | Pierre Le Bodic, Edward Lam |
| 2024 | SoCS | Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract). | Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey |
| 2023 | SoCS | Efficient Multi Agent Path Finding with Turn Actions. | Yue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey |
| 2022 | IPCO | An Abstract Model for Branch-and-Cut. | Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan |
| 2022 | SoCS | Dual Euclidean Shortest Path Search (Extended Abstract). | Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor |
| 2021 | AAAI | f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search. | Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey, Sven Koenig |
| 2021 | CP | Optimising Training for Service Delivery. | Ilankaikone Senthooran, Pierre Le Bodic, Peter J. Stuckey |
| 2021 | SDM | Better Short than Greedy: Interpretable Models through Optimal Rule Boosting. | Mario Boley, Simon Teshuva, Pierre Le Bodic, Geoffrey I. Webb |
| 2021 | SoCS | Further Improved Heuristics For Conflict-Based Search. | Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2021 | SoCS | Multi-Target Search in Euclidean Space with Ray Shooting. | Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic |
| 2020 | CP | Computing Optimal Decision Sets with SAT. | Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic |
| 2020 | SoCS | F-Cardinal Conflicts in Conflict-Based Search. | Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner |
| 2019 | AAAI | Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation. | Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel |
| 2019 | IJCAI | Branch-and-Cut-and-Price for Multi-Agent Pathfinding. | Edward Lam, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey |
| 2017 | IJCAI | Estimating the size of search trees by sampling with domain knowledge. | Gleb Belov, Samuel Esler, Dylan Fernando, Pierre Le Bodic, George L. Nemhauser |
| 2016 | AAAI | Learning to Branch in Mixed Integer Programming. | Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, Bistra Dilkina |
| 2009 | ICDAR | Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming. | Pierre Le Bodic, Herv Locteau, Sbastien Adam, Pierre Hroux, Yves Lecourtier, Arnaud Knippel |