Benoit Darties

Available identifiers

zbMath Open darties.benoitMaRDI QIDQ516806

List of research outcomes

Publication	Date of Publication	Type
Complexity and inapproximability results for balanced connected subgraph problem	2021-10-06	Paper
The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs	2020-05-13	Paper
Power Edge Set and Zero Forcing Set remain difficult in cubic graphs	2020-02-25	Paper
Complexity and lowers bounds for power edge set problem	2019-01-18	Paper
Improved complexity for power edge set problem	2018-06-15	Paper
New insights for power edge set problem	2018-02-26	Paper
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees	2018-01-11	Paper
Completely independent spanning trees in some regular graphs	2017-03-15	Paper
Some complexity and approximation results for coupled-tasks scheduling problem according to topology	2017-01-12	Paper
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs	2015-10-16	Paper
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor	2014-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q2865876	2013-12-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Benoit Darties