Pierre Kelsen

Available identifiers

zbMath Open kelsen.pierreMaRDI QIDQ1198085

List of research outcomes

Publication	Date of Publication	Type
Neighborhood graphs and distributed Δ+1-coloring	2022-12-09	Paper
Algorithms for tractable compliance problems	2018-12-19	Paper
Ranking and unranking trees using regular reductions	2017-11-16	Paper
Detecting Deontic Conflicts in Dynamic Settings	2014-09-08	Paper
https://portal.mardi4nfdi.de/entity/Q4417834	2003-07-30	Paper
Approximate hypergraph coloring	1998-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q3129926	1997-09-07	Paper
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity	1997-02-27	Paper
Computing Minimal Spanning Subgraphs in Linear Time	1996-07-14	Paper
https://portal.mardi4nfdi.de/entity/Q4763401	1995-04-11	Paper
On Finding Minimal Two-Connected Subgraphs	1995-04-09	Paper
An optimal parallel algorithm for maximal matching	1995-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q3138952	1993-10-20	Paper
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3	1993-01-16	Paper

Research outcomes over time

This page was built for person: Pierre Kelsen