Prati
Clément Dallard
Clément Dallard
Department of Informatics, University of Fribourg
Potvrđena adresa e-pošte na unifr.ch - Početna stranica
Naslov
Citirano
Citirano
Godina
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
C Dallard, M Milanič, K Štorgel
Journal of Combinatorial Theory, Series B 167, 338-391, 2024
272024
Computing tree decompositions with small independence number
C Dallard, FV Fomin, PA Golovach, T Korhonen, M Milanič
arXiv preprint arXiv:2207.09993, 2022
192022
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
172021
Treewidth versus clique number. II. Tree-independence number
C Dallard, M Milanič, K Štorgel
Journal of Combinatorial Theory, Series B 164, 404-442, 2024
15*2024
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
102020
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
Graphs without a partition into two proportionally dense subgraphs
C Bazgan, J Chlebíková, C Dallard
Information Processing Letters 155, 105877, 2020
62020
Treewidth versus clique number. III. tree-independence number of graphs with a forbidden structure. CoRR, abs/2206.15092
C Dallard, M Milanič, K Štorgel
arXiv preprint arXiv:2206.15092, 2022
52022
Treewidth versus clique number. II
C Dallard, M Milanič, K Štorgel
Tree-independence number. CoRR, abs/2111.04543, 2022
52022
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
42019
Graphs with two moplexes
C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič
Procedia Computer Science 195, 248-256, 2021
32021
Allocating indivisible items with minimum dissatisfaction on preference graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, N Pivač, ...
Algorithmic Decision Theory: 7th International Conference, ADT 2021 …, 2021
32021
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
3*2019
Detecting as an Induced Minor
C Dallard, M Dumas, C Hilaire, M Milanič, A Perez, N Trotignon
International Workshop on Combinatorial Algorithms, 151-164, 2024
22024
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
C Dallard, M Krnc, O Kwon, M Milanič, A Munaro, K Štorgel, ...
arXiv preprint arXiv:2402.11222, 2024
22024
Allocation of indivisible items with individual preference graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ...
Discrete Applied Mathematics 334, 45-62, 2023
22023
Complexity of scheduling for DARP with soft ride times
J Chlebíková, C Dallard, N Paulsen
Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome …, 2019
22019
Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems
J Chlebíková, C Dallard, N Paulsen
Theoretical Computer Science 960, 113923, 2023
12023
Conditions for minimally tough graphs
C Dallard, B Fernández, GY Katona, M Milanic, K Varga
arXiv preprint arXiv:2210.00383, 2022
12022
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20