Degree-Doubling Graph Families. - János Körner; Irene Muzi (SIAM J. Discret. Math., 2013)

Half-Integral Linkages in Highly Connected Directed Graphs. - Katherine Edwards; Irene Muzi; Paul Wollan (ESA, 2017)

Being Even Slightly Shallow Makes Life Hard. - Irene Muzi; Michael P. O'Brien; Felix Reidl; Blair D. Sullivan (MFCS, 2017)

Packing Directed Circuits Quarter-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (ESA, 2019)

Algorithmic Properties of Sparse Digraphs. - Stephan Kreutzer; Irene Muzi; Patrice Ossona de Mendez; Roman Rabinovich 001; Sebastian Siebertz (STACS, 2019)

Optimal Discretization is Fixed-parameter Tractable. - Stefan Kratsch; Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Manuel Sorge (SODA, 2021)

Kernelization and hardness of harmless sets in sparse classes. - Pål Grønås Drange; Irene Muzi; Felix Reidl (CoRR, 2021)

Harmless Sets in Sparse Classes. - Pål Grønås Drange; Irene Muzi; Felix Reidl (IWOCA, 2022)

Packing Directed Cycles Quarter- and Half-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (Comb., 2022)

Computing Complexity Measures of Degenerate Graphs. - Pål Grønås Drange; Patrick Greaves; Irene Muzi; Felix Reidl (IPEC, 2023)

Decomposition of (infinite) digraphs along directed 1-separations. - Nathan J. Bowler; Florian Gut; Meike Hatzel; Ken-ichi Kawarabayashi; Irene Muzi; Florian Reich (CoRR, 2023)

Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation. - Chun-Hung Liu; Irene Muzi (J. Comb. Theory B, 2023)

Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. - Meike Hatzel; Stephan Kreutzer; Marcelo Garlet Milani; Irene Muzi (FOCS, 2024)