| Treewidth versus clique number. II. Tree-independence number C Dallard, M Milanič, K Štorgel Journal of Combinatorial Theory, Series B 164, 404-442, 2024 | 61 | 2024 |
| 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 | 52 | 2024 |
| Computing tree decompositions with small independence number C Dallard, FV Fomin, PA Golovach, T Korhonen, M Milanič ACM Transactions on Algorithms 22 (1), 1-25, 2025 | 33 | 2025 |
| 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 | 31 | 2021 |
| 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 | 22 | 2020 |
| 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 | 18 | 2024 |
| 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 | 10 | 2024 |
| Treewidth versus clique number. II C Dallard, M Milanič, K Štorgel Tree-independence number. CoRR, abs/2111.04543, 2022 | 10 | 2022 |
| 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 | 9 | 2018 |
| Graphs without a partition into two proportionally dense subgraphs C Bazgan, J Chlebíková, C Dallard Information Processing Letters 155, 105877, 2020 | 8 | 2020 |
| 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 | 6 | 2019 |
| 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 | 6 | 2016 |
| 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 | 4 | 2022 |
| 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 | 3 | 2023 |
| 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 | 3 | 2021 |
| Vertex Cover at Distance on H-Free Graphs C Dallard, M Krbezlija, M Milanič International Workshop on Combinatorial Algorithms, 237-251, 2021 | 3 | 2021 |
| Graphs with two moplexes C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič Procedia Computer Science 195, 248-256, 2021 | 3 | 2021 |
| 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 |
| Induced minor models. I. Structural properties and algorithmic consequences N Bousquet, C Dallard, M Dumas, C Hilaire, M Milanič, A Perez, ... Journal of Computer and System Sciences, 103738, 2025 | 2 | 2025 |
| Sufficient conditions for polynomial-time detection of induced minors C Dallard, M Dumas, C Hilaire, A Perez International Conference on Current Trends in Theory and Practice of …, 2025 | 2 | 2025 |
Martin MilaničUniversity of Primorska, Koper, SloveniaVerified email at upr.si
