About

I am a postdoc at the Faculty of Mathematics, Informatics and Natural Sciences at University of Primorska, Koper, Slovenia. I completed my PhD in September 2019 at the University of Portsmouth, UK.

My research interests mostly lie within the fields of structural and algorithmic graph theory.

Publications

2021

  • Tree decompositions with bounded independence number and their algorithmic applications.”
    C. Dallard, M. Milanič, and K. Štorgel.
    Available on arXiv only.
  • Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure.”
    C. Dallard, M. Milanič, and K. Štorgel.
    SIAM Journal on Discrete Mathematics, vol. 35, no. 4, pp. 2618–2646

  • Colourful components in $k$-caterpillars and planar graphs.”
    J. Chlebíková and C. Dallard.
    Theoretical Computer Science, vol. 895, pp. 137–150

  • Allocating indivisible items with minimum dissatisfaction on preference graphs.”
    N. Chiarelli, C. Dallard, A. Darmann, S. Lendl, M. Milanič, P. Muršič, N. Pivač, and U. Pferschy.
    in 7th International Conference on Algorithmic Decision Theory

  • Vertex cover at distance on H-free graphs.”
    C. Dallard, M. Krbezlija, and M. Milanič.
    in International Workshop on Combinatorial Algorithms, pp. 237–251

  • Graphs with at most two moplexes.”
    C. Dallard, R. Ganian, M. Hatzel, M. Krnc, and M. Milanič.
    Available on arXiv only.
  • Graphs with two moplexes.”
    C. Dallard, R. Ganian, M. Hatzel, M. Krnc, and M. Milanič.
    in XI Latin and American Algorithms, Graphs and Optimization Symposium

  • On girth and the parameterized complexity of Token Sliding and Token Jumping.”
    V. Bartier, N. Bousquet, C. Dallard, K. Lomer, and A. E. Mouawad.
    Algorithmica, vol. 83, no. 9, pp. 2914–2951

2020

  • On girth and the parameterized complexity of token sliding and token jumping.”
    V. Bartier, N. Bousquet, C. Dallard, K. Lomer, and A. E. Mouawad.
    in 31st International Symposium on Algorithms and Computation, vol. 181, pp. 44:1–44:17

  • Treewidth versus clique number in graph classes with a forbidden structure.”
    C. Dallard, M. Milanič, and K. Štorgel.
    in Graph-Theoretic Concepts in Computer Science, pp. 92–105

  • Graphs without a partition into two proportionally dense subgraphs.”
    C. Bazgan, J. Chlebíková, and C. Dallard.
    Information Processing Letters, vol. 155, pp. 105877, 5

2019

  • Proportionally dense subgraph of maximum size: complexity and approximation.”
    C. Bazgan, J. Chlebíková, C. Dallard, and T. Pontoizeau.
    Discrete Applied Mathematics, vol. 270, pp. 25–36

  • Towards a complexity dichotomy for colourful components problems on $k$-caterpillars and small-degree planar graphs.”
    J. Chlebíková and C. Dallard.
    in Combinatorial algorithms, vol. 11638, Springer, Cham, pp. 136–147

  • Complexity of scheduling for DARP with soft ride times.”
    J. Chlebíková, C. Dallard, and N. Paulsen.
    in Algorithms and complexity, vol. 11485, Springer, Cham, pp. 149–160

2018

  • Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases.”
    M. Weller, A. Chateau, C. Dallard, and R. Giroudeau.
    Algorithmica, vol. 80, no. 6, pp. 1771–1803

2016

  • Instance guaranteed ratio on greedy heuristic for genome scaffolding.”
    C. Dallard, M. Weller, A. Chateau, and R. Giroudeau.
    in Combinatorial optimization and applications, vol. 10043, Springer, Cham, pp. 294–308

Courses recently taught

  • Lectures and tutorials : Graph Theory and Optimization Methods (3rd year students)
  • Tutorials: Discrete Mathematics (1st and 2nd year students)