| 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 | 12 | 2020 |
| Treewidth versus clique number. II. Tree-independence number C Dallard, M Milanič, K Štorgel arXiv preprint arXiv:2111.04543, 2021 | 9* | 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 | 8 | 2021 |
| 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 | 8 | 2018 |
| 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 | 5 | 2022 |
| Graphs without a partition into two proportionally dense subgraphs C Bazgan, J Chlebíková, C Dallard Information Processing Letters 155, 105877, 2020 | 5 | 2020 |
| 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 | 5 | 2016 |
| Computing Tree Decompositions with Small Independence Number C Dallard, FV Fomin, PA Golovach, T Korhonen, M Milanič arXiv preprint arXiv:2207.09993, 2022 | 4 | 2022 |
| 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 | 4 | 2019 |
| 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 | 2 | 2019 |
| 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 | 2 | 2019 |
| Conditions for minimally tough graphs C Dallard, B Fernández, GY Katona, M Milanič, K Varga arXiv preprint arXiv:2210.00383, 2022 | 1 | 2022 |
| Graphs with at most two moplexes C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič arXiv preprint arXiv:2106.10049, 2021 | 1 | 2021 |
| Graphs with two moplexes C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič Procedia Computer Science 195, 248-256, 2021 | 1 | 2021 |
| 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 | 1 | 2021 |
| Une modélisation par Contrainte de graphe pour résoudre l’échafaudage de génome É Bourreau, A Chateau, C Dallard, R Giroudeau ROADEF, 2017 | 1 | 2017 |
| 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 | | 2023 |
| 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, 113923, 2023 | | 2023 |
| Functionality of box intersection graphs C Dallard, V Lozin, M Milanič, K Štorgel, V Zamaraev arXiv preprint arXiv:2301.09493, 2023 | | 2023 |
| Finding -community structures in special graph classes N Baghirova, C Dallard, B Ries, D Schindl arXiv preprint arXiv:2206.14738, 2022 | | 2022 |
Martin MilaničUniversity of Primorska, Koper, SloveniaVerified email at upr.si
