| Publication | Date of Publication | Type |
|---|
| A conditional greedy algorithm for edge-coloring | 2017-06-14 | Paper |
| On degree-colorings of multigraphs | 2016-12-25 | Paper |
| Defining and Discovering Communities in Social Networks | 2012-09-27 | Paper |
| Embedding a forest in a graph | 2011-06-01 | Paper |
| Clusters in a multigraph with elevated density | 2007-03-12 | Paper |
| Discovering optimization algorithms through automated learning | 2006-06-29 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| A learning algorithm for the longest common subsequence problem | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046817 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801189 | 2003-04-07 | Paper |
| LINK: a system for graph computation | 2003-01-23 | Paper |
| On the Height of a Random Set of Points in a d-Dimensional Unit Cube | 2002-09-12 | Paper |
| Path optimization for graph partitioning problems | 1999-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886052 | 1996-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687251 | 1996-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871161 | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871154 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4842748 | 1995-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763329 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138896 | 1994-09-19 | Paper |
| An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size | 1993-10-14 | Paper |
| The set player system for symbolic computation on power sets | 1993-05-16 | Paper |
| A Machine-Tool Design | 1992-06-28 | Paper |
| A New Parallel Algorithm for the Maximal Independent Set Problem | 1989-01-01 | Paper |
| Constructing a Maximal Independent Set in Parallel | 1989-01-01 | Paper |
| Cutting a graph into two dissimilar halves | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3776655 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789609 | 1985-01-01 | Paper |
| Edge-coloring of multigraphs: Recoloring technique | 1984-01-01 | Paper |
| A non-factorial algorithm for canonical numbering of a graph | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3222860 | 1984-01-01 | Paper |
| A nonfactorial algorithm for testing isomorphism of two graphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731605 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663341 | 1982-01-01 | Paper |
| Construction of class two graphs with maximum vertex degree three | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4750687 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4180376 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206979 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048873 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103547 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4186337 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4056033 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5619124 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5576236 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5543322 | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5516082 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5541877 | 1965-01-01 | Paper |
