Follow
Clément Dallard
Clément Dallard
FAMNIT, University of Primorska, Slovenia
Verified email at famnit.upr.si - Homepage
Title
Cited by
Cited by
Year
On girth and the parameterized complexity of token sliding and token jumping
V Bartier, N Bousquet, C Dallard, K Lomer, AE Mouawad
International Symposium on Algorithms and Computation 181, 44:1-44:17, 2020
82020
Scaffolding problems revisited: Complexity, approximation and fixed parameter tractable algorithms, and some special cases
M Weller, A Chateau, C Dallard, R Giroudeau
Algorithmica 80 (6), 1771-1803, 2018
82018
Treewidth versus clique number. II. Tree-independence number
C Dallard, M Milanič, K Štorgel
arXiv preprint arXiv:2111.04543, 2021
5*2021
Treewidth versus clique number. I. Graph classes with a forbidden structure
C Dallard, M Milanic, K Storgel
SIAM Journal on Discrete Mathematics 35 (4), 2618-2646, 2021
52021
Graphs without a partition into two proportionally dense subgraphs
C Bazgan, J Chlebíková, C Dallard
Information Processing Letters 155, 105877, 2020
52020
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding
C Dallard, M Weller, A Château, R Giroudeau
COCOA: Conference on Combinatorial Optimization and Applications, 2016
52016
Proportionally dense subgraph of maximum size: complexity and approximation
C Bazgan, J Chlebíková, C Dallard, T Pontoizeau
Discrete Applied Mathematics 270, 25-36, 2019
22019
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs
J Chlebíková, C Dallard
International Workshop on Combinatorial Algorithms, 136-147, 2019
22019
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
C Dallard, M Milanič, K Štorgel
arXiv preprint arXiv:2206.15092, 2022
12022
Allocating indivisible items with minimum dissatisfaction on preference graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, N Pivač, ...
International Conference on Algorithmic Decision Theory, 243-257, 2021
12021
Graphs with at most two moplexes
C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič
arXiv preprint arXiv:2106.10049, 2021
12021
Complexity of scheduling for DARP with soft ride times
J Chlebíková, C Dallard, N Paulsen
International Conference on Algorithms and Complexity, 149-160, 2019
12019
Une modélisation par Contrainte de graphe pour résoudre l’échafaudage de génome
É Bourreau, A Chateau, C Dallard, R Giroudeau
ROADEF, 2017
12017
Computing Tree Decompositions with Small Independence Number
C Dallard, FV Fomin, PA Golovach, T Korhonen, M Milanič
arXiv preprint arXiv:2207.09993, 2022
2022
Finding -community structures in special graph classes
N Baghirova, C Dallard, B Ries, D Schindl
arXiv preprint arXiv:2206.14738, 2022
2022
Allocation of Indivisible Items with Individual Preference Graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ...
arXiv preprint arXiv:2202.04465, 2022
2022
Colourful components in k-caterpillars and planar graphs
J Chlebíková, C Dallard
Theoretical Computer Science 895, 137-150, 2021
2021
Vertex Cover at Distance on H-Free Graphs
C Dallard, M Krbezlija, M Milanič
International Workshop on Combinatorial Algorithms, 237-251, 2021
2021
Graphs with Two Moplexes
C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič
Procedia Computer Science 195, 248-256, 2021
2021
Graph partitions with proportional density and colouring constraints
C Dallard
University of Portsmouth, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20