| Publication | Date of Publication | Type |
|---|
Efficient union-find for planar graphs and other sparse graph classes (extended abstract)
| 2024-06-05 | Paper |
A compact data structure and parallel algorithms for permutation graphs
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Memory management for union-find algorithms
Lecture Notes in Computer Science | 2022-11-09 | Paper |
\texttt{Arbogast}: higher order automatic differentiation for special functions with Modular C
Optimization Methods & Software | 2018-10-09 | Paper |
scientific article; zbMATH DE number 6472575 (Why is no real title available?)
| 2015-08-14 | Paper |
Iterative computations with ordered read-write locks
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Efficient sampling of random permutations
Journal of Discrete Algorithms | 2008-11-18 | Paper |
Bounded Arboricity to Determine the Local Structure of Sparse Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
PRO: a model for the design and analysis of efficient and scalable parallel algorithms
| 2007-08-24 | Paper |
Portable list ranking
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Graph coloring on coarse grained multicomputers
Discrete Applied Mathematics | 2003-09-25 | Paper |
Weak-order extensions of an order.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1926662 (Why is no real title available?)
| 2003-06-11 | Paper |
scientific article; zbMATH DE number 1753166 (Why is no real title available?)
| 2002-09-26 | Paper |
scientific article; zbMATH DE number 1696533 (Why is no real title available?)
| 2002-07-22 | Paper |
Efficient and practical algorithms for sequential modular decomposition
Journal of Algorithms | 2002-07-08 | Paper |
scientific article; zbMATH DE number 1554934 (Why is no real title available?)
| 2001-01-21 | Paper |
Finiteness theorems for graphs and posets obtained by compositions
Order | 2000-07-05 | Paper |
Interval reductions and extensions of orders: Bijections to chains in lattices
Order | 1999-12-20 | Paper |
scientific article; zbMATH DE number 1303600 (Why is no real title available?)
| 1999-06-17 | Paper |
Efficient Union-Find for planar graphs and other sparse graph classes
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1107722 (Why is no real title available?)
| 1998-02-16 | Paper |
Two linear time Union--Find strategies for image processing
Theoretical Computer Science | 1997-02-28 | Paper |
Well quasi ordering finite posets and formal languages
Journal of Combinatorial Theory. Series B | 1996-01-15 | Paper |
Constructing colorings for diagrams
Discrete Applied Mathematics | 1995-01-26 | Paper |
On the pathwidth of chordal graphs
Discrete Applied Mathematics | 1994-10-31 | Paper |
scientific article; zbMATH DE number 475611 (Why is no real title available?)
| 1994-07-07 | Paper |
\(N\)-free orders and minimal interval extensions
Order | 1993-05-16 | Paper |
scientific article; zbMATH DE number 108280 (Why is no real title available?)
| 1993-01-23 | Paper |
