A Simple Randomized Parallel Algorithm for Maximal f-Matching. - Oscar Garrido; Stefan Jarominek; Andrzej Lingas; Wojciech Rytter (LATIN, 1992)

Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. - Krzysztof Diks; Oscar Garrido; Andrzej Lingas (Int. J. Found. Comput. Sci., 1993)

On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. - Anders Dessmark; Andrzej Lingas; Oscar Garrido (MFCS, 1994)

A Simple Randomized Parallel Algorithm for Maximal f-Matchings. - Oscar Garrido; Stefan Jarominek; Andrzej Lingas; Wojciech Rytter (Inf. Process. Lett., 1996)

A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity. - Oscar Garrido; Pierre Kelsen; Andrzej Lingas (Inf. Process. Lett., 1996)

A Note on Parallel Complexity of Maximum f-Matching. - Anders Dessmark; Oscar Garrido; Andrzej Lingas (Inf. Process. Lett., 1998)