13 citations · 14 across the 8 of their papers we have counts for
15 papers
Hitting minors on bounded treewidth graphs. III. Lower bounds
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a finite collection of graphs , the -M-DELETION problem consists in, given a graph and an integer , decide whether there exists wi…
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a finite collection of graphs , the -M-DELETION (resp. -TM-DELETION) problem consists in, given a graph and an integer , decide whether the…
A Neighborhood-preserving Graph Summarization
Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad +1
We introduce in this paper a new summarization method for large graphs. Our summarization approach retains only a user-specified proportion of the neighbors of each node in the gra…
Acyclic matchings in graphs of bounded maximum degree
Julien Baste, Maximilian Fürst, Dieter Rautenbach
A matching in a graph is acyclic if the subgraph of induced by the set of vertices that are incident to an edge in is a forest. We prove that every graph with v…
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…