| 1998 |
|---|
| 7 | EE | Anders Dessmark,
Oscar Garrido,
Andrzej Lingas:
A Note on Parallel Complexity of Maximum f-Matching.
Inf. Process. Lett. 65(2): 107-109 (1998) |
| 1996 |
|---|
| 6 | EE | Oscar Garrido,
Stefan Jarominek,
Andrzej Lingas,
Wojciech Rytter:
A Simple Randomized Parallel Algorithm for Maximal f-Matchings.
Inf. Process. Lett. 57(2): 83-87 (1996) |
| 5 | EE | Oscar Garrido,
Pierre Kelsen,
Andrzej Lingas:
A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity.
Inf. Process. Lett. 58(2): 55-58 (1996) |
| 1994 |
|---|
| 4 | | Anders Dessmark,
Andrzej Lingas,
Oscar Garrido:
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem.
MFCS 1994: 316-325 |
| 1993 |
|---|
| 3 | | Krzysztof Diks,
Oscar Garrido,
Andrzej Lingas:
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings.
Int. J. Found. Comput. Sci. 4(2): 179-192 (1993) |
| 1992 |
|---|
| 2 | | Oscar Garrido,
Stefan Jarominek,
Andrzej Lingas,
Wojciech Rytter:
A Simple Randomized Parallel Algorithm for Maximal f-Matching.
LATIN 1992: 165-176 |
| 1991 |
|---|
| 1 | | Krzysztof Diks,
Oscar Garrido,
Andrzej Lingas:
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings.
ISA 1991: 385-395 |
