29 citations · 48 across the 20 of their papers we have counts for
6 papers · 1 filter
FPT Algorithms for Diverse Collections of Hitting Sets
Julien Baste, Lars Jaffke, Tomáš Masařík +2
In this work, we study the -Hitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of solutions of size at most each, which has…
Domination versus edge domination
Julien Baste, Maximilian Fürst, Michael A. Henning +2
We propose the conjecture that the domination number of a -regular graph with is always at most its edge domination number , which coincides with th…
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a fixed finite collection of graphs , the -M-DELETION problem asks, given an -vertex input graph for the minimum number of vertices that intersect a…
Bounding and approximating minimum maximal matchings in regular graphs
Julien Baste, Maximilian Fürst, Michael A. Henning +2
The edge domination number of a graph is the minimum size of a maximal matching in . It is well known that this parameter is computationally very hard, and several…
Composing dynamic programming tree-decomposition-based algorithms
Julien Baste
Given two integers and as well as graph classes , the problems $\mathsf{GraphPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell,…
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
Julien Baste, Michael R. Fellows, Lars Jaffke +4
When modeling an application of practical relevance as an instance of a combinatorial problem X, we are often interested not merely in finding one optimal solution for that instanc…