| Publication | Date of Publication | Type |
|---|
| Computing phylogenetic trees using topologically related minimum spanning trees | 2017-10-24 | Paper |
| Selecting optimal minimum spanning trees that share a topological correspondence with phylogenetic trees | 2017-01-10 | Paper |
| Hierarchical Bayes model for predicting effectiveness of HIV combination therapies | 2014-10-08 | Paper |
| Model Selection for Mixtures of Mutagenetic Trees | 2008-02-18 | Paper |
| Calculating the Statistical Significance of Changes in Pathway Activity From Gene Expression Data | 2005-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450463 | 2004-02-15 | Paper |
| Parallel `go with the winners' algorithms in distributed memory models. | 2003-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542535 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753918 | 2001-12-18 | Paper |
| Provably good global routing of integrated circuits | 2001-03-19 | Paper |
| Computing closely matching upper and lower bounds on textile nesting problems | 1999-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385521 | 1998-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718222 | 1997-04-10 | Paper |
| A simulated annealing approach to the nesting problem in the textile manufacturing industry | 1996-02-18 | Paper |
| The nesting problem in the leather manufacturing industry | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140427 | 1993-12-15 | Paper |
| Efficient decision procedures for graph properties on context-free graph languages | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037418 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036574 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3997942 | 1993-01-23 | Paper |
| The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems | 1992-06-28 | Paper |
| Hierarchical planarity testing algorithms | 1992-06-25 | Paper |
| The binary network flow problem is logspace complete for P | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830538 | 1988-01-01 | Paper |
| Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795251 | 1988-01-01 | Paper |
| Linear arrangement problems on recursively partitioned graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3759947 | 1987-01-01 | Paper |
| Efficient solutions of hierarchical systems of linear equations | 1987-01-01 | Paper |
| Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727874 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745297 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730016 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683537 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3684044 | 1985-01-01 | Paper |
| On the solution of inequality systems relevant to IC-layout | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3321485 | 1983-01-01 | Paper |
| Asymptotically tight bounds on time-space trade-offs in a pebble game | 1982-01-01 | Paper |
| Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3315011 | 1982-01-01 | Paper |
| Black-white pebbles and graph separation | 1981-01-01 | Paper |
| The space complexity of pebble games on trees | 1980-01-01 | Paper |
| The Pebbling Problem is Complete in Polynomial Space | 1980-01-01 | Paper |
| A fast algorithm for finding dominators in a flowgraph | 1979-01-01 | Paper |
