Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. - Clément Dallard; Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA, 2016)

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. - Mathias Weller; Annie Chateau; Clément Dallard; Rodolphe Giroudeau (Algorithmica, 2018)

Complexity of Scheduling for DARP with Soft Ride Times. - Janka Chlebíková; Clément Dallard; Niklas Paulsen (CIAC, 2019)

Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. - Janka Chlebíková; Clément Dallard (IWOCA, 2019)

Proportionally dense subgraph of maximum size: Complexity and approximation. - Cristina Bazgan; Janka Chlebíková; Clément Dallard; Thomas Pontoizeau (Discret. Appl. Math., 2019)

Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. - Clément Dallard; Martin Milanic; Kenny Storgel (WG, 2020)

Graphs without a partition into two proportionally dense subgraphs. - Cristina Bazgan; Janka Chlebíková; Clément Dallard (Inf. Process. Lett., 2020)

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Nevena Pivac; Ulrich Pferschy (ADT, 2021)

Vertex Cover at Distance on H-Free Graphs. - Clément Dallard; Mirza Krbezlija; Martin Milanic (IWOCA, 2021)

Graphs with Two Moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (LAGOS, 2021)

On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. - Valentin Bartier; Nicolas Bousquet 001; Clément Dallard; Kyle Lomer; Amer E. Mouawad (Algorithmica, 2021)

Tree decompositions with bounded independence number and their algorithmic applications. - Clément Dallard; Martin Milanic; Kenny Storgel (CoRR, 2021)

Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. - Clément Dallard; Martin Milanic; Kenny Storgel (SIAM J. Discret. Math., 2021)

Colourful components in k-caterpillars and planar graphs. - Janka Chlebíková; Clément Dallard (Theor. Comput. Sci., 2021)

On Constrained Intersection Representations of Graphs and Digraphs. - Ferdinando Cicalese; Clément Dallard; Martin Milanic (ISAAC, 2022)

Conditions for minimally tough graphs. - Clément Dallard; Blas Fernández; Gyula Y. Katona; Martin Milanic; Kitti Varga (CoRR, 2022)

Functionality of box intersection graphs. - Clément Dallard; Vadim V. Lozin; Martin Milanic; Kenny Storgel; Viktor Zamaraev (CoRR, 2023)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2023)

Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems. - Janka Chlebíková; Clément Dallard; Niklas Paulsen (Theor. Comput. Sci., 2023)

Allocation of indivisible items with individual preference graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy; Nevena Pivac (Discret. Appl. Math., 2023)

Computing Tree Decompositions with Small Independence Number. - Clément Dallard; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Martin Milanic (ICALP, 2024)

Detecting K2,3 as an Induced Minor. - Clément Dallard; Maël Dumas; Claire Hilaire; Martin Milanic; Anthony Perez 001; Nicolas Trotignon (IWOCA, 2024)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2024)

Detecting K2, 3 as an induced minor. - Clément Dallard; Maël Dumas; Claire Hilaire; Martin Milanic; Anthony Perez 001; Nicolas Trotignon (CoRR, 2024)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. - Clément Dallard; Matjaz Krnc; O-joung Kwon; Martin Milanic; Andrea Munaro; Kenny Storgel; Sebastian Wiederrecht (CoRR, 2024)

Finding k-community structures in special graph classes. - Narmina Baghirova; Clément Dallard; Bernard Ries; David Schindl (Discret. Appl. Math., 2024)

Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. - Clément Dallard; Martin Milanic; Kenny Storgel (J. Comb. Theory B, 2024)

Graphs with at most two moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (J. Graph Theory, 2024)

Treewidth versus clique number. II. Tree-independence number. - Clément Dallard; Martin Milanic; Kenny Storgel (J. Comb. Theory B, 2024)

Sufficient Conditions for Polynomial-Time Detection of Induced Minors. - Clément Dallard; Maël Dumas; Claire Hilaire; Anthony Perez 001 (SOFSEM (1), 2025)

Layered tree-independence number and clique-based separators. - Clément Dallard; Martin Milanic; Andrea Munaro; Shizhou Yang (CoRR, 2025)