| 2026 | GECCO | Exploring the Parameterized Complexity of TSP Operators in Multi-Objective Optimization. | Narges Tavassoli Kejani, Julien Baste, Marie-Emilie Voge, Marie-Elonore Kessaci, Laetitia Jourdan |
| 2026 | STACS | A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths. | Julien Baste, Lucas de Meyer, Ugo Giocanti, tienne Objois, Timoth Picavet |
| 2023 | CEC | A Hybrid Genetic Approach for Bi-Level Flexible Job Shops Arising from Selective Deconstruction. | Corentin Juvigny, Julien Baste, Guillaume Lozenguez, Arnaud Doniec, Laetitia Jourdan |
| 2022 | DEXA | Quasi-Clique Mining for Graph Summarization. | Antoine Castillon, Julien Baste, Hamida Seba, Mohammed Haddad |
| 2020 | COCOON | Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. | Julien Baste, Maximilian Frst, Dieter Rautenbach |
| 2020 | IJCAI | Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. | Julien Baste, Michael R. Fellows, Lars Jaffke, Toms Masark, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond |
| 2020 | SODA | A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
| 2019 | SOFSEM | Minimum Reload Cost Graph Factors. | Julien Baste, Didem Gzpek, Mordechai Shalom, Dimitrios M. Thilikos |
| 2017 | WG | On the Number of Labeled Graphs of Bounded Treewidth. | Julien Baste, Marc Noy, Ignasi Sau |
| 2017 | WG | Uniquely Restricted Matchings and Edge Colorings. | Julien Baste, Dieter Rautenbach, Ignasi Sau |
| 2016 | AAIM | Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. | Julien Baste, Christophe Paul, Ignasi Sau, Cline Scornavacca |