The following pages link to Benoit Darties (Q516806):
Displaying 13 items.
- Completely independent spanning trees in some regular graphs (Q516807) (← links)
- Improved complexity for power edge set problem (Q1642691) (← links)
- (Q1693137) (redirect page) (← links)
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138) (← links)
- New insights for power edge set problem (Q1699780) (← links)
- Complexity and lowers bounds for power edge set problem (Q1711663) (← links)
- The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs (Q2180175) (← links)
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs (Q2301739) (← links)
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
- (Q2865876) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- Coupled-Tasks in Presence of Bipartite Compatibilities Graphs (Q3195325) (← links)
