papers
Publications (13)
math.CO2019
Domination versus edge domination
Julien Baste, Maximilian Fürst, Michael A. Henning +2
cs.DS2017
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Julien Baste, Didem Gözüpek, Christophe Paul +3
cs.CC2019
Minimum Reload Cost Graph Factors
Julien Baste, Didem Gözüpek, Mordechai Shalom +1
cs.DS2013
The role of planarity in connectivity problems parameterized by treewidth
Julien Baste, Ignasi Sau
math.CO2016
Uniquely restricted matchings and edge colorings
Julien Baste, Dieter Rautenbach, Ignasi Sau
cs.DS2019
Temporal Matching
Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
math.CO2017
Degenerate Matchings and Edge Colorings
Julien Baste, Dieter Rautenbach
math.CO2019
Bounding and approximating minimum maximal matchings in regular graphs
Julien Baste, Maximilian Fürst, Michael A. Henning +2
cs.DS2016
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Julien Baste, Christophe Paul, Ignasi Sau +1
math.CO2018
Linear programming based approximation for unweighted induced matchings --- breaking the $Î$ barrier
Julien Baste, Maximilian Fürst, Dieter Rautenbach
cs.DS2017
Ruling out FPT algorithms for Weighted Coloring on forests
Júlio Araújo, Julien Baste, Ignasi Sau
math.CO2016
The number of labeled graphs of bounded treewidth
Julien Baste, Marc Noy, Ignasi Sau
cs.DS2016
Parameterized complexity dichotomy for $(r,\ell)$-Vertex Deletion
Julien Baste, Luerbio Faria, Sulamita Klein +1