Assistant Professor, University of Parma

I did my Ph.D. at Laboratoire G-SCOP, Univ. Grenoble Alpes supervised by András Sebő and Matěj Stehlík.

After that I was in Ulm, Koper, Fribourg, Morgantown and Belfast.

Department of Mathematical, Physical and Computer Sciences, University of Parma

andrea.munaro at unipr.it

https://orcid.org/0000-0003-1509-8832

- Equistable claw-free graphs (with M. Milanič).
*In preparation.* - Equivalence of width parameters on graph classes (with N. Brettell, D. Paulusma and S. Yang).
*In preparation.*

- On algorithmic applications of sim-width and mim-width of (H
_{1}, H_{2})-free graphs (with S. Yang).*Theoretical Computer Science*955 (2023), article 113825. - Non-empty intersection of longest paths in H-free graphs (with J. A. Long and K. G. Milans).
*The Electronic Journal of Combinatorics*30(1) (2023), article P1.32. - Bounding the mim-width of hereditary graph classes (with N. Brettell, J. Horsfield, G. Paesani and D. Paulusma).
*Journal of Graph Theory*99(1) (2022), pp. 117-151. - List k-Colouring P
_{t}-free graphs: A mim-width perspective (with N. Brettell, J. Horsfield and D. Paulusma).*Information Processing Letters*173 (2022), article 106168. - Jones' Conjecture in subcubic graphs (with M. Bonamy, F. Dross, T. Masařík, W. Nadara, Ma. Pilipczuk and Mi. Pilipczuk).
*The Electronic Journal of Combinatorics*28(4) (2021), article P4.5. - Sublinear longest path transversals (with J. A. Long and K. G. Milans).
*SIAM Journal on Discrete Mathematics*35(3) (2021), pp. 1673–1677. - CPG graphs: Some structural and hardness results (with N. Champseix, E. Galby and B. Ries).
*Discrete Applied Mathematics*290 (2021), pp. 17-35. - Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width (with E. Galby and B. Ries).
*Theoretical Computer Science*814 (2020), pp. 28-48. - Triangle packings and transversals of some K
_{4}-free graphs.*Graphs and Combinatorics*34(4) (2018), pp. 647-668. - Boundary classes for graph problems involving non-local properties.
*Theoretical Computer Science*692 (2017), pp. 46-71. - Bounded clique cover of some sparse graphs.
*Discrete Mathematics*340(9) (2017), pp. 2208-2216. - On line graphs of subcubic triangle-free graphs.
*Discrete Mathematics*340(6) (2017), pp. 1210-1226. - The VC-dimension of graphs with respect to k-connected subgraphs.
*Discrete Applied Mathematics*211 (2016), pp. 163–174.

- Polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-fragile graphs (with E. Galby and S. Yang). In
*SoCG 2023. Accepted.* - Solving problems on generalized convex graphs via mim-width (with F. Bonomo-Braberman, N. Brettell and D. Paulusma). In
*WADS 2021*, Lecture Notes in Computer Science, vol. 12808, Springer, 2021, pp. 200-214. - Bounding the mim-width of hereditary graph classes (with N. Brettell, J. Horsfield, G. Paesani and D. Paulusma). In
*IPEC 2020*, Leibniz International Proceedings in Informatics, vol. 180, Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2020, pp. 6:1-6:18. - On contact graphs of paths on a grid (with Z. Deniz, E. Galby and B. Ries). In
*GD 2018*, Lecture Notes in Computer Science, vol. 11282, Springer, 2018, pp. 317-330.

- On some classical and new hypergraph invariants. pdf

- Notes for SOR1020 "Introduction to Probability & Statistics" at Queen's University Belfast.
- Notes for SOR3012 "Stochastic Processes & Risk" at Queen's University Belfast.
- Notes for the introductory topology part of "Analysis III - Functions of many variables" at University of Primorska.

ARM-D 422

MTWF 10.30am-11.20am

NRC-E 127

MTWF 1pm-1.50pm

NRC-E 127

MTWF 2pm-2.50pm

ARM-D 315

TTh 8.30am-9.45am

Materials
Syllabus
Practice Problems 01/22
Homework Assignment 1 (due on 01/31)
Solutions to Practice Problems 01/22
Practice Problems 02/14
Homework Assignment 2 (due on 02/26)
Homework Assignment 3 (due on 03/19)
Solutions to Practice Problems 02/14
Practice Problems 03/22
Homework Assignment 4 (due on 04/04)
Homework Assignment 5 (due on 04/18)
Practice Problems 04/12