| Publication | Date of Publication | Type |
|---|
| On the isomorphism of graphs with few P4s | 2024-02-28 | Paper |
| Asteroidal triple-free graphs | 2024-01-05 | Paper |
| On domination elimination orderings and domination graphs | 2024-01-05 | Paper |
| Time-optimal tree computations on sparse meshes | 2024-01-05 | Paper |
| Efficient list ranking on the reconfigurable mesh, with applications | 2023-01-25 | Paper |
| Computing a dominating pair in an asteroidal triple-free graph in linear time | 2022-12-16 | Paper |
| Optimal parallel algorithms for proximate points, with applications | 2022-08-19 | Paper |
| Linear time algorithms for dominating pairs in asteroidal triple-free graphs | 2019-01-10 | Paper |
| An optimal hardware-algorithm for sorting using a fixed-size parallel sorting device | 2018-07-09 | Paper |
| Toward Efficient Task Management in Wireless Sensor Networks | 2017-07-27 | Paper |
| Toward Adaptive Sleep Schedules for Balancing Energy Consumption in Wireless Sensor Networks | 2017-07-12 | Paper |
| The LBFS Structure and Recognition of Interval Graphs | 2010-12-03 | Paper |
| On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs | 2009-07-28 | Paper |
| On the L(h,k)-Labeling of Co-comparability Graphs | 2009-03-03 | Paper |
| Efficient corona training protocols for sensor networks | 2008-08-14 | Paper |
| The set of prime extensions of a graph: the finite and the infinite case | 2007-05-29 | Paper |
| All minimal prime extensions of hereditary classes of graphs | 2007-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494194 | 2006-10-17 | Paper |
| Linear Orderings of Subfamilies of AT‐Free Graphs | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692755 | 2005-09-28 | Paper |
| Single-row transformation of complete graphs | 2005-05-24 | Paper |
| AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS | 2004-10-06 | Paper |
| A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗ | 2004-10-06 | Paper |
| The hierarchical cliques interconnection network | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472511 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448763 | 2004-02-18 | Paper |
| A time-optimal solution for the path cover problem on cographs. | 2003-08-17 | Paper |
| Some observations on using meta-heuristics for efficient location management in mobile computing networks. | 2003-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3153068 | 2002-11-04 | Paper |
| Fault-tolerant recursive least-squares computations on a mesh-connected parallel processor | 2002-10-16 | Paper |
| Enhanced simulated annealing technique for the single-row routing problem | 2002-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4534294 | 2002-06-06 | Paper |
| Efficient algorithms for graphs with few \(P_4\)'s | 2001-07-18 | Paper |
| Upper bounds to the clique width of graphs | 2001-03-30 | Paper |
| On the dynamic initialization of parallel computers | 2000-05-10 | Paper |
| Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles | 2000-01-01 | Paper |
| On the \(p\)-connectedness of graphs---a survey | 1999-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253357 | 1999-11-02 | Paper |
| Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250178 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252390 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232800 | 1999-04-26 | Paper |
| Time-optimal proximity graph computations on enhanced meshes | 1999-03-30 | Paper |
| On the structure of graphs with few \(P_4\)s | 1998-10-18 | Paper |
| A fast parallel algorithm to recognize P4-sparse graphs | 1998-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373667 | 1998-02-16 | Paper |
| Asteroidal Triple-Free Graphs | 1998-02-09 | Paper |
| Time-optimal tree computations on sparse meshes | 1997-12-17 | Paper |
| Simple linear time recognition of unit interval graphs | 1997-02-28 | Paper |
| A linear time algorithm to compute a dominating path in an AT-free graph | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4893409 | 1996-11-20 | Paper |
| Interval Graph Problems on Reconfigurable Meshes | 1996-10-20 | Paper |
| Linear time optimization algorithms for \(P_ 4\)-sparse graphs | 1996-02-06 | Paper |
| P-Components and the Homogeneous Decomposition of Graphs | 1995-10-10 | Paper |
| Constant-time convexity problems on reconfigurable meshes | 1995-09-24 | Paper |
| Reconstructing a binary tree from its traversals in doubly logarithmic CREW time | 1995-09-24 | Paper |
| Optimal parallel colouring algorithms for totally decomposable graphs | 1995-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302974 | 1994-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281643 | 1994-06-12 | Paper |
| A NEW CHARACTERIZATION OF UNBREAKABLE GRAPHS | 1994-03-27 | Paper |
| Selection on rectangular meshes with multiple broadcasting | 1993-08-23 | Paper |
| Optimal greedy algorithms for indifference graphs | 1993-06-29 | Paper |
| Quasi-brittle graphs, a new class of perfectly orderable graphs | 1993-06-29 | Paper |
| Applications of reconfigurable meshes to constant-time computations | 1993-05-16 | Paper |
| The morphology of convex polygons | 1993-04-01 | Paper |
| A constant-time channel-assignment algorithm on reconfigurable meshes | 1993-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4021770 | 1993-01-17 | Paper |
| OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES | 1993-01-16 | Paper |
| A charming class of perfectly orderable graphs | 1992-09-27 | Paper |
| An nc algorithm to recognize hhd-free graphs | 1992-09-27 | Paper |
| An optimal parallel algorithm to construct a deap | 1992-06-28 | Paper |
| Merging heaps in parallel | 1992-06-28 | Paper |
| Recognizing $P_4 $-Sparse Graphs in Linear Time | 1992-06-28 | Paper |
| A faster optimal algorithm for the measure problem | 1992-06-26 | Paper |
| An efficient parallel algorithm for multiselection | 1992-06-26 | Paper |
| On the structure of unbreakable graphs | 1992-06-26 | Paper |
| Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs) | 1992-06-25 | Paper |
| A generalization of Chvátal's star-cutset lemma | 1992-06-25 | Paper |
| On the homogeneous representation of interval graphs | 1992-06-25 | Paper |
| An optimal greedy heuristic to color interval graphs | 1991-01-01 | Paper |
| On the closure of triangle-free graphs under substitution | 1990-01-01 | Paper |
| Wings and perfect graphs | 1990-01-01 | Paper |
| A simple linear-time algorithm for computing the center of an interval graph | 1990-01-01 | Paper |
| Constructing bimodal convex hexagons | 1990-01-01 | Paper |
| The strong perfect graph conjecture for pan-free graphs | 1989-01-01 | Paper |
| Weak bipolarizable graphs | 1989-01-01 | Paper |
| A simple linear-time algorithm for computing the ring and MST of unimodal polygons | 1989-01-01 | Paper |
| A decomposition for strongly perfect graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809836 | 1989-01-01 | Paper |
| A simple nc algorithm to recognize weakly triangulated graphs | 1989-01-01 | Paper |
| No antitwins in minimal imperfect graphs | 1988-01-01 | Paper |
| Paw-free graphs | 1988-01-01 | Paper |
| On the unimodality of convex polygons | 1988-01-01 | Paper |
| All variations on perfectly orderable graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809824 | 1988-01-01 | Paper |
| On the strong perfect graph conjecture | 1988-01-01 | Paper |
