Andrea Munaro

activity

20182026

most citedTreewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star

2 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2025

Non-crossing $H$ -graphs: a generalization of proper interval graphs admitting FPT algorithms

Flavia Bonomo-Braberman, Nick Brettell, Noleen Köhler +2

We prove new parameterized complexity results for the FO Model Checking problem on a well-known generalization of interval and circular-arc graphs: the class of $H$ -graphs, for any…

cs.CC2018

Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width

Esther Galby, Andrea Munaro, Bernard Ries

A semitotal dominating set of a graph $G$ with no isolated vertex is a dominating set $D$ of $G$ such that every vertex in $D$ is within distance two of another vertex in $D$ . The…

Non-crossing H-graphs: a generalization of proper interval graphs admitting FPT algorithms

Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width

Non-crossing $H$ -graphs: a generalization of proper interval graphs admitting FPT algorithms