Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kelsen, Pierre"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simple
NC
-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
Oscar Garrido
,
Pierre Kelsen
,
Andrzej Lingas
Information Processing Letters
58
(2), 1996, pp. 55-58
Approximate hypergraph coloring
Pierre Kelsen
,
Sanjeev Mahajan
,
Hariharan Ramesh
Lecture Notes in Computer Science
1097
, 1996, pp. 41-52
Ranking and unranking trees using regular reductions
Pierre Kelsen
Lecture Notes in Computer Science
1046
, 1996, pp. 581-592
Neighborhood graphs and distributed
\delta+1
-coloring
Pierre Kelsen
Lecture Notes in Computer Science
1097
, 1996, pp. 223-233
Computing minimal spanning subgraphs in linear time
Xiaofeng Han
,
Pierre Kelsen
,
Yijaya Ramachandran
,
Robert Tarjan
SIAM Journal on Computing
24
(6), 1995, pp. 1322-1358
On finding minimal two-connected subgraphs
Pierre Kelsen
,
Vijaya Ramachandran
Journal of Algorithms
18
(1), 1995, pp. 1-49
An optimal parallel algorithm for maximal matching
Pierre Kelsen
Information Processing Letters
52
, 1994, pp. 223-228
Fast parallel matching in expander graphs
Pierre Kelsen
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'93 (Velen, Germany, June 30 - July 2, 1993)
, 1993, pp. 293-299
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
Elias Dahlhaus
,
Marek Karpinski
,
Pierre Kelsen
Information Processing Letters
42
, 1992, pp. 309-313
Computing minimal spanning subgraphs in linear time
Xiaofeng Han
,
Pierre Kelsen
,
Vijaya Ramachandran
,
Robert Tarjan
Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92 (Orlando, Florida, January 27-29, 1992)
, 1992, pp. 146-156
On the parallel complexity of computing a maximal independent set in a hypergraph
Pierre Kelsen
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 339-350
On finding minimal 2-connected subgraphs
Pierre Kelsen
,
Vijaya Ramachandran
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91 (San Francisco, California, January 28-30, 1991)
, 1991, pp. 178-187
On finding minimal 2-connected subgraphs
Pierre Kelsen
,
Vijaya Ramachandran
Technical Report (TR-90-16), 1990, June