![]() | ![]() |
2005 | ||
---|---|---|
3 | EE | Ottilia Fülöp: Sparse graph certificates for mixed connectivity. Discrete Mathematics 294(3): 285-290 (2005) |
2002 | ||
2 | Ottilia Fülöp: Note: On Directed Odd or Even Minimum (s, t)-Cut Problem and Generalizations. Ars Comb. 65: (2002) | |
2000 | ||
1 | András A. Benczúr, Ottilia Fülöp: Fast Algorithms for Even/Odd Minimum Cuts and Generalizations. ESA 2000: 88-99 |
1 | András A. Benczúr | [1] |