Skip to content

Clément Dallard

  1. 2020
  2. Published

    Graphs without a partition into two proportionally dense subgraphs

    Cristina Bazgan, Dr Janka Chlebikova & Clément Dallard, Mar 2020, In : Information Processing Letters. 155, 5 p., 105877.

    Research output: Contribution to journalArticle

  3. 2019
  4. Published

    Proportionally dense subgraph of maximum size: complexity and approximation

    Cristina Bazgan, Dr Janka Chlebikova, Clément Dallard & Thomas Pontoizeau, 1 Nov 2019, In : Discrete Applied Mathematics. 270, p. 25-36 12 p.

    Research output: Contribution to journalArticle

  5. Published

    Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphs

    Dr Janka Chlebikova & Clément Dallard, 10 Jul 2019, Combinatorial Algorithms: 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings. Colbourn, C., Grossi, R. & Pisanti, N. (eds.). Springer, p. 136-147 12 p. (Lecture Notes in Computer Science; vol. 11638).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  6. Published

    Complexity of scheduling for DARP with soft ride times

    Dr Janka Chlebikova, Clément Dallard & Niklas Paulsen, 1 May 2019, Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings. Heggernes, P. (ed.). Springer, p. 149-160 12 p. (Lecture Notes in Computer Science; vol. 11485).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  7. 2018
  8. Early online

    Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases

    Mathias Weller, Annie Chateau, Clément Dallard & Rodolphe Giroudeau, 29 Jan 2018, In : Algorithmica. 80, 33 p.

    Research output: Contribution to journalArticle

ID: 8632118