Julien Baste

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 56

Top Venues

University of Montpellier, France (PHD)

Education History

University of Montpellier, France

PHD

Publications

Julien Baste, Dimitri Watel
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theor. Comput. Sci. 990 (2024)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. 52 (4) (2023)
Julien Baste
The Leafed Induced Subtree in chordal and bounded treewidth graphs. CoRR (2023)
Corentin Juvigny, Julien Baste, Guillaume Lozenguez, Arnaud Doniec, Laetitia Jourdan
A Hybrid Genetic Approach for Bi-Level Flexible Job Shops Arising from Selective Deconstruction. CEC (2023)
Julien Baste, Dimitrios M. Thilikos
Contraction Bidimensionality of Geometric Intersection Graphs. CoRR (2022)
Julien Baste, Maximilian Fürst, Dieter Rautenbach
Acyclic matchings in graphs of bounded maximum degree. Discret. Math. 345 (7) (2022)
Corentin Juvigny, Julien Baste, Guillaume Lozenguez, Arnaud Doniec, Laetitia Jourdan
Towards hybridization of multi-agent simulation and metaheuristics applied to selective deconstruction. SSCI (2022)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303 (2022)
Antoine Castillon, Julien Baste, Hamida Seba, Mohammed Haddad
Quasi-Clique Mining for Graph Summarization. DEXA (2) (2022)
Julien Baste, Stefan Ehard, Dieter Rautenbach
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Julien Baste, Dimitrios M. Thilikos
Contraction Bidimensionality of Geometric Intersection Graphs. Algorithmica 84 (2) (2022)
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
Bounding and approximating minimum maximal matchings in regular graphs. Discret. Math. 344 (3) (2021)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR (2021)
Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad, Hamida Seba
A Neighborhood-preserving Graph Summarization. CoRR (2021)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR (2021)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. Theory Comput. Syst. 65 (5) (2021)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. 109 (2020)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. 814 (2020)
Julien Baste, Stefan Ehard, Dieter Rautenbach
Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree. CoRR (2020)
Julien Baste, Maximilian Fürst, Dieter Rautenbach
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. COCOON (2020)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. SODA (2020)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. 34 (3) (2020)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI (2020)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75 (3) (2020)
Julien Baste, Maximilian Fürst, Dieter Rautenbach
Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier. Discret. Optim. 38 (2020)
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
Domination versus edge domination. Discret. Appl. Math. 285 (2020)
Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
Temporal matching. Theor. Comput. Sci. 806 (2020)
Julien Baste
Composing dynamic programming tree-decomposition-based algorithms. CoRR (2019)
Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms 12 (12) (2019)
Julien Baste, Dieter Rautenbach, Ignasi Sau
Approximating maximum uniquely restricted matchings in bipartite graphs. Discret. Appl. Math. 267 (2019)
Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
FPT Algorithms for Diverse Collections of Hitting Sets. CoRR (2019)
Julien Baste, Dieter Rautenbach, Ignasi Sau
Upper bounds on the uniquely restricted chromatic index. J. Graph Theory 91 (3) (2019)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR (2019)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity in Combinatorial Optimization. CoRR (2019)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. SOFSEM (2019)
Julien Baste, Dieter Rautenbach
Degenerate matchings and edge colorings. Discret. Appl. Math. 239 (2018)
Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
Temporal Matching. CoRR (2018)
Júlio Araújo, Julien Baste, Ignasi Sau
Ruling out FPT algorithms for Weighted Coloring on forests. Theor. Comput. Sci. 729 (2018)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. IPEC (2018)
Julien Baste, Marc Noy, Ignasi Sau
On the number of labeled graphs of bounded treewidth. Eur. J. Comb. 71 (2018)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. CoRR (2018)
Julien Baste, Marc Noy, Ignasi Sau
On the Number of Labeled Graphs of Bounded Treewidth. WG (2017)
Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau
On the parameterized complexity of the Edge Monitoring problem. Inf. Process. Lett. 121 (2017)
Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. 61 (3) (2017)
Júlio Araújo, Julien Baste, Ignasi Sau
Ruling out FPT algorithms for Weighted Coloring on forests. CoRR (2017)
Julien Baste, Dimitrios M. Thilikos
Contraction-Bidimensionality of Geometric Intersection Graphs. IPEC (2017)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC (2017)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR (2017)
Júlio Araújo, Julien Baste, Ignasi Sau
Ruling out FPT algorithms for Weighted Coloring on forests. Electron. Notes Discret. Math. 62 (2017)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. I. General upper bounds. CoRR (2017)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. IPEC (2017)
Julien Baste, Dieter Rautenbach, Ignasi Sau
Uniquely Restricted Matchings and Edge Colorings. WG (2017)
Julien Baste, Marc Noy, Ignasi Sau
The number of labeled graphs of bounded treewidth. CoRR (2016)
Julien Baste, Dieter Rautenbach, Ignasi Sau
Uniquely restricted matchings and edge colorings. CoRR (2016)
Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR (2016)
Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM (2016)
Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion. CoRR (2015)
Julien Baste, Ignasi Sau
The role of planarity in connectivity problems parameterized by treewidth. Theor. Comput. Sci. 570 (2015)
Julien Baste, Ignasi Sau
The Role of Planarity in Connectivity Problems Parameterized by Treewidth. IPEC (2014)
Julien Baste, Ignasi Sau
The role of planarity in connectivity problems parameterized by treewidth. CoRR (2013)

Julien Baste.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Julien Baste