Andrea Munaro

According to our database, Andrea Munaro authored at least 25 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Solving problems on generalized convex graphs via mim-width.

Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma

J. Comput. Syst. Sci., March, 2024

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs.

Esther Galby, Andrea Munaro, Shizhou Yang

CoRR, 2024

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

2023

On algorithmic applications of sim-width and mim-width of (<i>H</i>₁,<i>H</i>₂)-free graphs.

Andrea Munaro, Shizhou Yang

Theor. Comput. Sci., April, 2023

Comparing Width Parameters on Graph Classes.

Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang

CoRR, 2023

Non-Empty Intersection of Longest Paths in $H$-Free Graphs.

James A. Long Jr., Kevin G. Milans, Andrea Munaro

Electron. J. Comb., 2023

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs.

Esther Galby, Andrea Munaro, Shizhou Yang

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Bounding the mim-width of hereditary graph classes.

Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma

J. Graph Theory, 2022

List <i>k</i>-colouring <i>P</i>_<i>t</i>-free graphs: A Mim-width perspective.

Nick Brettell, Jake Horsfield, Andrea Munaro, Daniël Paulusma

Inf. Process. Lett., 2022

On algorithmic applications of sim-width and mim-width of (H₁, H₂)-free graphs.

Andrea Munaro, Shizhou Yang

CoRR, 2022

2021

Sublinear Longest Path Transversals.

James A. Long Jr., Kevin G. Milans, Andrea Munaro

SIAM J. Discret. Math., 2021

CPG graphs: Some structural and hardness results.

Nicolas Champseix, Esther Galby, Andrea Munaro, Bernard Ries

Discret. Appl. Math., 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

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.

Nick Brettell, Andrea Munaro, Daniël Paulusma

CoRR, 2020

List k-Colouring P_t-Free Graphs with No Induced 1-Subdivision of K_{1, s}: a Mim-width Perspective.

Nick Brettell, Andrea Munaro, Daniël Paulusma

CoRR, 2020

Sublinear Longest Path Transversals and Gallai Families.

James A. Long Jr., Kevin G. Milans, Andrea Munaro

CoRR, 2020

Approximating Independent Set and Dominating Set on VPG graphs.

Esther Galby, Andrea Munaro

CoRR, 2020

2019

CPG graphs: Some structural and hardness results.

Esther Galby, Andrea Munaro, Bernard Ries

CoRR, 2019

2018

Triangle Packings and Transversals of Some K₄ -Free Graphs.

Andrea Munaro

Graphs Comb., 2018

On Contact Graphs of Paths on a Grid.

Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

Boundary classes for graph problems involving non-local properties.

Andrea Munaro

Theor. Comput. Sci., 2017

Bounded clique cover of some sparse graphs.

Andrea Munaro

Discret. Math., 2017

On line graphs of subcubic triangle-free graphs.

Andrea Munaro

Discret. Math., 2017

2016

The VC-dimension of graphs with respect to k-connected subgraphs.

Andrea Munaro

Discret. Appl. Math., 2016