Julien Baste

According to our database1, Julien Baste authored at least 32 papers between 2015 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Bounding and approximating minimum maximal matchings in regular graphs.
Discret. Math., 2021

A Neighborhood-preserving Graph Summarization.
CoRR, 2021

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms.
Theor. Comput. Sci., 2020

Temporal matching.
Theor. Comput. Sci., 2020

Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds.
SIAM J. Discret. Math., 2020

Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
Networks, 2020

Hitting minors on bounded treewidth graphs. III. Lower bounds.
J. Comput. Syst. Sci., 2020

Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier.
Discret. Optim., 2020

Domination versus edge domination.
Discret. Appl. Math., 2020

Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree.
CoRR, 2020

A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Upper bounds on the uniquely restricted chromatic index.
J. Graph Theory, 2019

Approximating maximum uniquely restricted matchings in bipartite graphs.
Discret. Appl. Math., 2019

Hitting minors on bounded treewidth graphs. IV. An optimal algorithm.
CoRR, 2019

Composing dynamic programming tree-decomposition-based algorithms.
CoRR, 2019

Diversity in Combinatorial Optimization.
CoRR, 2019

FPT Algorithms for Diverse Collections of Hitting Sets.
Algorithms, 2019

Minimum Reload Cost Graph Factors.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

On the number of labeled graphs of bounded treewidth.
Eur. J. Comb., 2018

Degenerate matchings and edge colorings.
Discret. Appl. Math., 2018

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Treewidth: algorithmic, combinatorial, and practical aspects. (Treewidth: aspects algorithmiques, combinatoires et pratiques).
PhD thesis, 2017

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion.
Theory Comput. Syst., 2017

On the parameterized complexity of the Edge Monitoring problem.
Inf. Process. Lett., 2017

Ruling out FPT algorithms for Weighted Coloring on forests.
Electron. Notes Discret. Math., 2017

Uniquely Restricted Matchings and Edge Colorings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Contraction-Bidimensionality of Geometric Intersection Graphs.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

The role of planarity in connectivity problems parameterized by treewidth.
Theor. Comput. Sci., 2015