Andrea Munaro

Preprints

• Equistable claw-free graphs (with M. Milanič). In preparation.
• Layered tree-independence number and clique-based separators (with C. Dallard, M. Milanič and S. Yang). Submitted.
  pdf
• Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs (with E. Galby and S. Yang). Submitted.
  pdf
• Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star (with C. Dallard, M. Krnc, O-j. Kwon, M. Milanič, K. Štorgel and S. Wiederrecht). Submitted.
  pdf

Journal Publications

• Comparing width parameters on graph classes (with N. Brettell, D. Paulusma and S. Yang). European Journal of Combinatorics 127 (2025), article 104163.
  doi pdf
• Solving problems on generalized convex graphs via mim-width (with F. Bonomo-Braberman, N. Brettell and D. Paulusma). Journal of Computer and System Sciences 140 (2024), article 103493.
  doi pdf
• On algorithmic applications of sim-width and mim-width of (H₁, H₂)-free graphs (with S. Yang). Theoretical Computer Science 955 (2023), article 113825.
  doi pdf
• 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.
  doi pdf
• 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.
  doi pdf
• 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.
  doi pdf
• 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.
  doi pdf
• Sublinear longest path transversals (with J. A. Long and K. G. Milans). SIAM Journal on Discrete Mathematics 35(3) (2021), pp. 1673–1677.
  doi pdf
• CPG graphs: Some structural and hardness results (with N. Champseix, E. Galby and B. Ries). Discrete Applied Mathematics 290 (2021), pp. 17-35.
  doi pdf
• 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.
  doi pdf
• Triangle packings and transversals of some K₄-free graphs. Graphs and Combinatorics 34(4) (2018), pp. 647-668.
  doi pdf
• Boundary classes for graph problems involving non-local properties. Theoretical Computer Science 692 (2017), pp. 46-71.
  doi pdf
• Bounded clique cover of some sparse graphs. Discrete Mathematics 340(9) (2017), pp. 2208-2216.
  doi pdf
• On line graphs of subcubic triangle-free graphs. Discrete Mathematics 340(6) (2017), pp. 1210-1226.
  doi pdf
• The VC-dimension of graphs with respect to k-connected subgraphs. Discrete Applied Mathematics 211 (2016), pp. 163–174.
  doi pdf

Conference Publications

• Maximum list r-colorable induced subgraphs in kP₃-free graphs (with E. Galby, P. T. Lima and A. Nikabadi). In ESA 2025. To appear.
  doi pdf
• Non-crossing H-graphs: a generalization of proper interval graphs admitting FPT algorithms (with F. Bonomo-Braberman, N. Brettell and D. Paulusma). In WG 2025. To appear.
  doi pdf
• Polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-fragile graphs (with E. Galby and S. Yang). In SoCG 2023, Leibniz International Proceedings in Informatics, vol. 258, Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2023, pp. 34:1-34:15.
  doi pdf
• 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.
  doi pdf
• 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.
  doi pdf
• 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.
  doi pdf

Ph.D. Thesis

• On some classical and new hypergraph invariants. pdf

Ph.D. Students

Conference Activities

Lecture Notes

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

Teaching @ WVU