The role of planarity in connectivity problems parameterized by treewidth. - Julien Baste; Ignasi Sau (Theor. Comput. Sci., 2015)

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. - Julien Baste; Christophe Paul; Ignasi Sau; Céline Scornavacca (AAIM, 2016)

Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (IPEC, 2017)

Uniquely Restricted Matchings and Edge Colorings. - Julien Baste; Dieter Rautenbach; Ignasi Sau (WG, 2017)

On the parameterized complexity of the Edge Monitoring problem. - Julien Baste; Fairouz Beggas; Hamamache Kheddouci; Ignasi Sau (Inf. Process. Lett., 2017)

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. - Julien Baste; Luérbio Faria; Sulamita Klein; Ignasi Sau (Theory Comput. Syst., 2017)

Treewidth: algorithmic, combinatorial, and practical aspects. (Treewidth: aspects algorithmiques, combinatoires et pratiques). - Julien Baste (2017)

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (IPEC, 2018)

Degenerate matchings and edge colorings. - Julien Baste; Dieter Rautenbach (Discret. Appl. Math., 2018)

On the number of labeled graphs of bounded treewidth. - Julien Baste; Marc Noy; Ignasi Sau (Eur. J. Comb., 2018)

Ruling out FPT algorithms for Weighted Coloring on forests. - Júlio Araújo 001; Julien Baste; Ignasi Sau (Theor. Comput. Sci., 2018)

FPT Algorithms for Diverse Collections of Hitting Sets. - Julien Baste; Lars Jaffke; Tomás Masarík; Geevarghese Philip; Günter Rote (Algorithms, 2019)

Diversity in Combinatorial Optimization. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (CoRR, 2019)

Approximating maximum uniquely restricted matchings in bipartite graphs. - Julien Baste; Dieter Rautenbach; Ignasi Sau (Discret. Appl. Math., 2019)

Upper bounds on the uniquely restricted chromatic index. - Julien Baste; Dieter Rautenbach; Ignasi Sau (J. Graph Theory, 2019)

Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. - Julien Baste; Maximilian Fürst; Dieter Rautenbach (COCOON, 2020)

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 (SODA, 2020)

Domination versus edge domination. - Julien Baste; Maximilian Fürst; Michael A. Henning; Elena Mohr; Dieter Rautenbach (Discret. Appl. Math., 2020)

Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier. - Julien Baste; Maximilian Fürst; Dieter Rautenbach (Discret. Optim., 2020)

Hitting minors on bounded treewidth graphs. III. Lower bounds. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2020)

Parameterized complexity of finding a spanning tree with minimum reload cost diameter. - Julien Baste; Didem Gözüpek; Christophe Paul; Ignasi Sau; Mordechai Shalom; Dimitrios M. Thilikos (Networks, 2020)

Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2020)

Temporal matching. - Julien Baste; Binh-Minh Bui-Xuan; Antoine Roux (Theor. Comput. Sci., 2020)

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (Theor. Comput. Sci., 2020)

A Neighborhood-preserving Graph Summarization. - Abd Errahmane Kiouche; Julien Baste; Mohammed Haddad 001; Hamida Seba (CoRR, 2021)

Bounding and approximating minimum maximal matchings in regular graphs. - Julien Baste; Maximilian Fürst; Michael A. Henning; Elena Mohr; Dieter Rautenbach (Discret. Math., 2021)

Minimum Reload Cost Graph Factors. - Julien Baste; Didem Gözüpek; Mordechai Shalom; Dimitrios M. Thilikos (Theory Comput. Syst., 2021)

Quasi-Clique Mining for Graph Summarization. - Antoine Castillon; Julien Baste; Hamida Seba; Mohammed Haddad 001 (DEXA (2), 2022)

Towards hybridization of multi-agent simulation and metaheuristics applied to selective deconstruction. - Corentin Juvigny; Julien Baste; Guillaume Lozenguez; Arnaud Doniec; Laetitia Jourdan (SSCI, 2022)

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (Artif. Intell., 2022)

Contraction Bidimensionality of Geometric Intersection Graphs. - Julien Baste; Dimitrios M. Thilikos (Algorithmica, 2022)

Acyclic matchings in graphs of bounded maximum degree. - Julien Baste; Maximilian Fürst; Dieter Rautenbach (Discret. Math., 2022)

Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree. - Julien Baste; Stefan Ehard; Dieter Rautenbach (Discret. Math. Theor. Comput. Sci., 2022)

A Hybrid Genetic Approach for Bi-Level Flexible Job Shops Arising from Selective Deconstruction. - Corentin Juvigny; Julien Baste; Guillaume Lozenguez; Arnaud Doniec; Laetitia Jourdan (CEC, 2023)

The Leafed Induced Subtree in chordal and bounded treewidth graphs. - Julien Baste (CoRR, 2023)

Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (SIAM J. Comput., 2023)

Composing dynamic programming tree-decomposition-based algorithms. - Julien Baste (Discret. Math. Theor. Comput. Sci., 2024)

γ-clustering problems: Classical and parametrized complexity. - Julien Baste; Antoine Castillon; Clarisse Dhaenens; Mohammed Haddad 001; Hamida Seba (Theor. Comput. Sci., 2024)

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. - Julien Baste; Dimitri Watel (Theor. Comput. Sci., 2024)

Neighborhood-Preserving Graph Sparsification. - Abd Errahmane Kiouche; Julien Baste; Mohammed Haddad 001; Hamida Seba; Angela Bonifati (Proc. VLDB Endow., 2024)