×

zbMATH — the first resource for mathematics

Kelsen, Pierre

Compute Distance To:
Author ID: kelsen.pierre Recent zbMATH articles by "Kelsen, Pierre"
Published as: Kelsen, Pierre
Documents Indexed: 13 Publications since 1991

Publications by Year

Citations contained in zbMATH

9 Publications have been cited 23 times in 20 Documents Cited by Year
An optimal parallel algorithm for maximal matching. Zbl 0823.68040
Kelsen, Pierre
8
1994
Coloring 2-colorable hypergraphs with a sublinear number of colors. Zbl 0870.68112
Alon, Noga; Kelsen, Pierre; Mahajan, Sanjeev; Ramesh, Hariharan
3
1996
Computing minimal spanning subgraphs in linear time. Zbl 0829.68093
Han, Xiaofeng; Kelsen, Pierre; Ramachandran, Vijaya; Tarjan, Robert
3
1992
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3. Zbl 0764.68048
Dahlhaus, Elias; Karpinski, Marek; Kelsen, Pierre
3
1992
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity. Zbl 0900.68237
Garrido, Oscar; Kelsen, Pierre; Lingas, Andrzej
2
1996
Ranking and unranking trees using regular reductions. Zbl 1379.68248
Kelsen, Pierre
1
1996
Approximate hypergraph coloring. Zbl 0886.05091
Kelsen, Pierre; Mahajan, Sanjeev; Ramesh, Hariharan
1
1996
Computing minimal spanning subgraphs in linear time. Zbl 0841.05084
Han, Xiaofeng; Kelsen, Pierre; Ramachandran, Vijaya; Tarjan, Robert
1
1995
On finding minimal 2-connected subgraphs. Zbl 0800.68632
Kelsen, Pierre; Ramachandran, Vijaya
1
1991
Coloring 2-colorable hypergraphs with a sublinear number of colors. Zbl 0870.68112
Alon, Noga; Kelsen, Pierre; Mahajan, Sanjeev; Ramesh, Hariharan
3
1996
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity. Zbl 0900.68237
Garrido, Oscar; Kelsen, Pierre; Lingas, Andrzej
2
1996
Ranking and unranking trees using regular reductions. Zbl 1379.68248
Kelsen, Pierre
1
1996
Approximate hypergraph coloring. Zbl 0886.05091
Kelsen, Pierre; Mahajan, Sanjeev; Ramesh, Hariharan
1
1996
Computing minimal spanning subgraphs in linear time. Zbl 0841.05084
Han, Xiaofeng; Kelsen, Pierre; Ramachandran, Vijaya; Tarjan, Robert
1
1995
An optimal parallel algorithm for maximal matching. Zbl 0823.68040
Kelsen, Pierre
8
1994
Computing minimal spanning subgraphs in linear time. Zbl 0829.68093
Han, Xiaofeng; Kelsen, Pierre; Ramachandran, Vijaya; Tarjan, Robert
3
1992
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3. Zbl 0764.68048
Dahlhaus, Elias; Karpinski, Marek; Kelsen, Pierre
3
1992
On finding minimal 2-connected subgraphs. Zbl 0800.68632
Kelsen, Pierre; Ramachandran, Vijaya
1
1991

Citations by Year