Fast Algorithms for Even/Odd Minimum Cuts and Generalizations. - András A. Benczúr; Ottilia Fülöp (ESA, 2000)

Note: On Directed Odd or Even Minimum (s, t)-Cut Problem and Generalizations. - Ottilia Fülöp (Ars Comb., 2002)

Sparse graph certificates for mixed connectivity. - Ottilia Fülöp (Discret. Math., 2005)

Special minimum cuts in directed graphs NOTE. - Ottilia Fülöp (Ars Comb., 2015)