Pierre Kelsen

MaRDI QIDQ1198085zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Neighborhood graphs and distributed Δ+1-coloring Algorithm Theory — SWAT'96	2022-12-09	Paper
Algorithms for tractable compliance problems Frontiers of Computer Science	2018-12-19	Paper
Ranking and unranking trees using regular reductions STACS 96	2017-11-16	Paper
Detecting deontic conflicts in dynamic settings Deontic Logic and Normative Systems	2014-09-08	Paper
scientific article; zbMATH DE number 1956490 (Why is no real title available?)	2003-07-30	Paper
Approximate hypergraph coloring Algorithm Theory — SWAT'96	1998-05-04	Paper
scientific article; zbMATH DE number 1002208 (Why is no real title available?)	1997-09-07	Paper
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity Information Processing Letters	1997-02-27	Paper
Computing Minimal Spanning Subgraphs in Linear Time SIAM Journal on Computing	1996-07-14	Paper
scientific article; zbMATH DE number 742959 (Why is no real title available?)	1995-04-11	Paper
On Finding Minimal Two-Connected Subgraphs Journal of Algorithms	1995-04-09	Paper
An optimal parallel algorithm for maximal matching Information Processing Letters	1995-01-09	Paper
scientific article; zbMATH DE number 432818 (Why is no real title available?)	1993-10-20	Paper
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 Information Processing Letters	1993-01-16	Paper

Research outcomes over time

This page was built for person: Pierre Kelsen