Statistics of RUP

Bibliography of the person, including all types of documents, not only theses.

MSc theses (2)

1. Mirza Krbezlija: A complexitystudy of distance variants of covering and domination problems in H-free graphs
2. Mirza Redžić: Classes of graphs with tree-independence number at most two

Other documents (11)

1. Cristina Bazgan, Janka Chlebíková, Clément Jean Dallard, Thomas Pontoizeau: Proportionally dense subgraph of maximum size
2. Mathias Weller, Annie Chateau, Clément Jean Dallard, Rodolphe Giroudeau: Scaffolding problems revisited
3. Janka Chlebíková, Clément Jean Dallard: Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphs
4. Valentin Bartier, Nicolas Bousquet, Clément Jean Dallard, Kyle Lomer, Amer E. Mouawad: On girth and the parameterized complexity of token sliding and token jumping
5. Valentin Bartier, Nicolas Bousquet, Clément Jean Dallard, Kyle Lomer, Amer E. Mouawad: On girth and the parameterized complexity of token sliding and token jumping
6. Clément Jean Dallard, Mirza Krbezlija, Martin Milanič: Vertex cover at distance on H-free graphs
7. Clément Jean Dallard, Martin Milanič, Kenny Štorgel: Treewidth versus clique number in graph classes with a forbidden structure
8. Janka Chlebíková, Clément Jean Dallard: Colourful components in k-caterpillars and planar graphs
9. Clément Jean Dallard: Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648.
10. Nina Chiarelli, Clément Jean Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Nevena Pivač, Ulrich Pferschy: Allocating indivisible items with minimum dissatisfaction on preference graphs
11. Clément Jean Dallard, Martin Milanič, Kenny Štorgel: Treewidth versus clique number. I. graph classes with a forbidden structure