The following pages link to Julien Baste (Q509891):
Displaying 33 items.
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Uniquely restricted matchings and edge colorings (Q1687907) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- Domination versus edge domination (Q2197443) (← links)
- Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier (Q2218644) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- Temporal matching (Q2285132) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
- A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth (Q5009462) (← links)
- (Q5111862) (← links)
- (Q5111863) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary (Q5146828) (← links)
- Upper bounds on the uniquely restricted chromatic index (Q5229533) (← links)
- On the number of labeled graphs of bounded treewidth (Q5915790) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)
- Minimum reload cost graph factors (Q5918369) (← links)
- Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree (Q6045404) (← links)
- Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
- Composing dynamic programming tree-decomposition-based algorithms (Q6606983) (← links)
- \( \gamma \)-clustering problems: classical and parametrized complexity (Q6615214) (← links)
