E-LIB Suche - Ergebnisse für: Dallard, Clément

1

Detecting $$K_{2,3}$$ as an Induced Minor:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Dallard, Clément ; Dumas, Maël ; Hilaire, Claire... - p. 151-164 , 2024

Link: https://doi.org/10.1007/..

2

Functionality of Box Intersection Graphs:

Dallard, Clément ; Lozin, Vadim ; Milanič, Martin..
Results in Mathematics. 79 (2024) 1 - p. , 2024

Link: https://doi.org/10.1007/..

3

Treewidth versus clique number. III. Tree-independence numb..:

Dallard, Clément ; Milanič, Martin ; Štorgel, Kenny
Journal of Combinatorial Theory, Series B. 167 (2024) - p. 338-391 , 2024

Link: https://doi.org/10.1016/..

4

Graphs with at most two moplexes:

Dallard, Clément ; Ganian, Robert ; Hatzel, Meike..
Journal of Graph Theory. 107 (2024) 1 - p. 38-69 , 2024

Link: https://doi.org/10.1002/..

5

Treewidth versus clique number. II. Tree-independence numbe:

Dallard, Clément ; Milanič, Martin ; Štorgel, Kenny
Journal of Combinatorial Theory, Series B. 164 (2024) - p. 404-442 , 2024

Link: https://doi.org/10.1016/..

6

Allocation of indivisible items with individual preference ..:

Chiarelli, Nina ; Dallard, Clément ; Darmann, Andreas...
Discrete Applied Mathematics. 334 (2023) - p. 45-62 , 2023

Link: https://doi.org/10.1016/..

7

Impact of soft ride time constraints on the complexity of s..:

Chlebíková, Janka ; Dallard, Clément ; Paulsen, Niklas
Theoretical Computer Science. 960 (2023) - p. 113923 , 2023

Link: https://doi.org/10.1016/..

8

Allocating Indivisible Items with Minimum Dissatisfaction o..:

, In: Algorithmic Decision Theory; Lecture Notes in Computer Science,

Chiarelli, Nina ; Dallard, Clément ; Darmann, Andreas... - p. 243-257 , 2021

Link: https://doi.org/10.1007/..

9

On Girth and the Parameterized Complexity of Token Sliding ..:

Bartier, Valentin ; Bousquet, Nicolas ; Dallard, Clément..
Algorithmica. 83 (2021) 9 - p. 2914-2951 , 2021

Link: https://doi.org/10.1007/..

10

Treewidth versus Clique Number. I. Graph Classes with a For..:

Dallard, Clément ; Milanič, Martin ; Štorgel, Kenny
SIAM Journal on Discrete Mathematics. 35 (2021) 4 - p. 2618-2646 , 2021

Link: https://doi.org/10.1137/..

11

Vertex Cover at Distance on H-Free Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Dallard, Clément ; Krbezlija, Mirza ; Milanič, Martin - p. 237-251 , 2021

Link: https://doi.org/10.1007/..

12

Colourful components in k-caterpillars and planar graphs:

Chlebíková, Janka ; Dallard, Clément
Theoretical Computer Science. 895 (2021) - p. 137-150 , 2021

Link: https://doi.org/10.1016/..

13

Graphs with Two Moplexes:

Dallard, Clément ; Ganian, Robert ; Hatzel, Meike..
Procedia Computer Science. 195 (2021) - p. 248-256 , 2021

Link: https://doi.org/10.1016/..

14

Graphs without a partition into two proportionally dense su..:

Bazgan, Cristina ; Chlebíková, Janka ; Dallard, Clément
Information Processing Letters. 155 (2020) - p. 105877 , 2020

Link: https://doi.org/10.1016/..

15

Treewidth Versus Clique Number in Graph Classes with a Forb..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Dallard, Clément ; Milanič, Martin ; Štorgel, Kenny - p. 92-105 , 2020

Link: https://doi.org/10.1007/..