The VC-dimension of graphs with respect to k-connected subgraphs. - Andrea Munaro (CTW, 2013)

On line graphs of subcubic triangle-free graphs. - Andrea Munaro (Discret. Math., 2017)

Bounded clique cover of some sparse graphs. - Andrea Munaro (Discret. Math., 2017)

Boundary classes for graph problems involving non-local properties. - Andrea Munaro (Theor. Comput. Sci., 2017)

On Contact Graphs of Paths on a Grid. - Zakir Deniz; Esther Galby; Andrea Munaro; Bernard Ries (GD, 2018)

Triangle Packings and Transversals of Some K4 -Free Graphs. - Andrea Munaro (Graphs Comb., 2018)

CPG graphs: Some structural and hardness results. - Esther Galby; Andrea Munaro; Bernard Ries (CoRR, 2019)

Bounding the Mim-Width of Hereditary Graph Classes. - Nick Brettell; Jake Horsfield; Andrea Munaro; Giacomo Paesani; Daniël Paulusma (IPEC, 2020)

Approximating Independent Set and Dominating Set on VPG graphs. - Esther Galby; Andrea Munaro (CoRR, 2020)

Sublinear Longest Path Transversals and Gallai Families. - James A. Long Jr.; Kevin G. Milans; Andrea Munaro (CoRR, 2020)

List k-Colouring Pt-Free Graphs with No Induced 1-Subdivision of K1, s: a Mim-width Perspective. - Nick Brettell; Andrea Munaro; Daniël Paulusma (CoRR, 2020)

Solving problems on generalized convex graphs via mim-width. - Nick Brettell; Andrea Munaro; Daniël Paulusma (CoRR, 2020)

Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. - Esther Galby; Andrea Munaro; Bernard Ries (Theor. Comput. Sci., 2020)

Solving Problems on Generalized Convex Graphs via Mim-Width. - Flavia Bonomo-Braberman; Nick Brettell; Andrea Munaro; Daniël Paulusma (WADS, 2021)

Jones' Conjecture in Subcubic Graphs. - Marthe Bonamy; François Dross; Tomás Masarík; Andrea Munaro; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk (Electron. J. Comb., 2021)

CPG graphs: Some structural and hardness results. - Nicolas Champseix; Esther Galby; Andrea Munaro; Bernard Ries (Discret. Appl. Math., 2021)

Sublinear Longest Path Transversals. - James A. Long Jr.; Kevin G. Milans; Andrea Munaro (SIAM J. Discret. Math., 2021)

On algorithmic applications of sim-width and mim-width of (H1, H2)-free graphs. - Andrea Munaro; Shizhou Yang (CoRR, 2022)

List k-colouring Pt-free graphs: A Mim-width perspective. - Nick Brettell; Jake Horsfield; Andrea Munaro; Daniël Paulusma (Inf. Process. Lett., 2022)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. - Esther Galby; Andrea Munaro; Shizhou Yang (SoCG, 2023)

Non-Empty Intersection of Longest Paths in $H$-Free Graphs. - James A. Long Jr.; Kevin G. Milans; Andrea Munaro (Electron. J. Comb., 2023)

On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs. - Andrea Munaro; Shizhou Yang (Theor. Comput. Sci., 2023)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. - Clément Dallard; Matjaz Krnc; O-joung Kwon; Martin Milanic; Andrea Munaro; Kenny Storgel; Sebastian Wiederrecht (CoRR, 2024)

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs. - Esther Galby; Andrea Munaro; Shizhou Yang (CoRR, 2024)

Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs. - Esther Galby; Paloma T. Lima; Andrea Munaro; Amir Nikabadi (ESA, 2025)

Comparing width parameters on graph classes. - Nick Brettell; Andrea Munaro; Daniël Paulusma; Shizhou Yang (Eur. J. Comb., 2025)

Non-crossing H-graphs: a generalization of proper interval graphs admitting FPT algorithms. - Flavia Bonomo-Braberman; Nick Brettell; Andrea Munaro; Daniël Paulusma (CoRR, 2025)

Maximum list r-colorable induced subgraphs in kP3-free graphs. - Esther Galby; Paloma T. Lima; Andrea Munaro; Amir Nikabadi (CoRR, 2025)

Layered tree-independence number and clique-based separators. - Clément Dallard; Martin Milanic; Andrea Munaro; Shizhou Yang (CoRR, 2025)