| Bounding the mim‐width of hereditary graph classes N Brettell, J Horsfield, A Munaro, G Paesani, D Paulusma Journal of Graph Theory 99 (1), 117-151, 2022 | 26 | 2022 |
| On line graphs of subcubic triangle-free graphs A Munaro Discrete Mathematics 340 (6), 1210-1226, 2017 | 24 | 2017 |
| Semitotal domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width E Galby, A Munaro, B Ries Theoretical Computer Science 814, 28-48, 2020 | 22 | 2020 |
| Boundary classes for graph problems involving non-local properties A Munaro Theoretical Computer Science 692, 46-71, 2017 | 22 | 2017 |
| List k-colouring Pt-free graphs: A mim-width perspective N Brettell, J Horsfield, A Munaro, D Paulusma Information Processing Letters 173, 106168, 2022 | 13 | 2022 |
| Solving problems on generalized convex graphs via mim-width F Bonomo-Braberman, N Brettell, A Munaro, D Paulusma Workshop on Algorithms and Data Structures, 200-214, 2021 | 13* | 2021 |
| Bounded clique cover of some sparse graphs A Munaro Discrete Mathematics 340 (9), 2208-2216, 2017 | 10 | 2017 |
| On contact graphs of paths on a grid Z Deniz, E Galby, A Munaro, B Ries International Symposium on Graph Drawing and Network Visualization, 317-330, 2018 | 9 | 2018 |
| On some classical and new hypergraph invariants A Munaro Université Grenoble Alpes, 2016 | 7 | 2016 |
| On algorithmic applications of sim-width and mim-width of (H1, H2)-free graphs A Munaro, S Yang Theoretical Computer Science 955, 113825, 2023 | 5 | 2023 |
| The VC-dimension of graphs with respect to k-connected subgraphs A Munaro Discrete Applied Mathematics 211, 163-174, 2016 | 5 | 2016 |
| Sublinear longest path transversals JA Long Jr, KG Milans, A Munaro SIAM Journal on Discrete Mathematics 35 (3), 1673-1677, 2021 | 4 | 2021 |
| CPG graphs: Some structural and hardness results E Galby, A Munaro, B Ries arXiv preprint arXiv:1903.01805, 2019 | 4* | 2019 |
| Triangle Packings and Transversals of Some -Free Graphs A Munaro Graphs and Combinatorics 34, 647-668, 2018 | 4 | 2018 |
| Solving problems on generalized convex graphs via mim-width F Bonomo-Braberman, N Brettell, A Munaro, D Paulusma Journal of Computer and System Sciences 140, 103493, 2024 | 3 | 2024 |
| Comparing width parameters on graph classes N Brettell, A Munaro, D Paulusma, S Yang arXiv preprint arXiv:2308.05817, 2023 | 3 | 2023 |
| Sur quelques invariants classiques et nouveaux des hypergraphes A Munaro Université Grenoble Alpes (ComUE), 2016 | 3 | 2016 |
| 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 | 2 | 2024 |
| Polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-fragile graphs E Galby, A Munaro, S Yang arXiv preprint arXiv:2303.07444, 2023 | 2 | 2023 |
| List k-colouring Pt-free graphs with no induced 1-subdivision of K1, s: a mim-width perspective N Brettell, A Munaro, D Paulusma CoRR, abs/2008.01590, 2020 | 2 | 2020 |
Daniel PaulusmaDepartment of Computer Science, Durham University在 durham.ac.uk 的电子邮件经过验证
