Clément Dallard

Available identifiers

zbMath Open dallard.clementMaRDI QIDQ1635705

List of research outcomes

Publication	Date of Publication	Type
Finding \(k\)-community structures in special graph classes	2024-11-06	Paper
On constrained intersection representations of graphs and digraphs	2024-09-11	Paper
Graphs with at most two moplexes	2024-08-30	Paper
Treewidth versus clique number. II: Tree-independence number	2024-01-29	Paper
Functionality of box intersection graphs	2024-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q6087216	2023-11-14	Paper
Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems	2023-05-19	Paper
Allocation of indivisible items with individual preference graphs	2023-05-11	Paper
Allocating indivisible items with minimum dissatisfaction on preference graphs	2023-03-31	Paper
Treewidth versus clique number in graph classes with a forbidden structure	2022-12-21	Paper
On minimally tough chordal graphs	2022-10-01	Paper
Computing Tree Decompositions with Small Independence Number	2022-07-20	Paper
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure	2022-06-30	Paper
Finding $k$-community structures in special graph classes	2022-06-29	Paper
Vertex cover at distance on \(H\)-free graphs	2022-03-22	Paper
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure	2021-12-01	Paper
Colourful components in \(k\)-caterpillars and planar graphs	2021-11-18	Paper
On girth and the parameterized complexity of token sliding and Token Jumping	2021-09-02	Paper
Graphs with at most two moplexes	2021-06-18	Paper
Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs	2020-02-25	Paper
Complexity of scheduling for DARP with soft ride times	2020-02-06	Paper
Graphs without a partition into two proportionally dense subgraphs	2019-12-19	Paper
Proportionally dense subgraph of maximum size: complexity and approximation	2019-11-06	Paper
Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases	2018-06-01	Paper
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding	2017-02-01	Paper
Detecting $K_{2,3}$ as an induced minor	N/A	Paper
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star	N/A	Paper

Research outcomes over time

This page was built for person: Clément Dallard