| Publication | Date of Publication | Type |
|---|
| Computing the well-founded semantics faster | 2022-08-30 | Paper |
| Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service | 2019-09-11 | Paper |
| Why locally-fair maximal flows in client-server networks perform well | 2011-12-15 | Paper |
| Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well | 2009-07-23 | Paper |
| Locating Servers for Reliability and Affine Embeddings | 2008-08-13 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Broadcasting in unstructured peer-to-peer overlay networks | 2006-04-28 | Paper |
| Verifiable broadcasting and gossiping in communication networks | 2002-06-24 | Paper |
| Directional Routing via Generalized st-Numberings | 2000-07-20 | Paper |
| Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem | 1999-06-07 | Paper |
| Generalized bicycles | 1998-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5689807 | 1997-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5283984 | 1997-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863421 | 1996-03-07 | Paper |
| Unique satisfiability of Horn sets can be solved in nearly linear time | 1995-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139522 | 1994-06-08 | Paper |
| The bounded chromatic number for graphs of genus \(g\) | 1993-03-10 | Paper |
| Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033782 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3496795 | 1990-01-01 | Paper |
| A Counterexample to the Conjecture of Woess on Simple Random Walks on Trees | 1989-01-01 | Paper |
| A 4-Color Theorem for Surfaces of Genus g | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3791716 | 1988-01-01 | Paper |
| Balanced vertex weightings and arborescences | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818345 | 1987-01-01 | Paper |
| Bicycles and Spanning Trees | 1986-01-01 | Paper |
| Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory | 1986-01-01 | Paper |
| Telephone Problems with Failures | 1986-01-01 | Paper |
| Parity results on connected f-factors | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781121 | 1986-01-01 | Paper |
| A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean | 1984-01-01 | Paper |
| Proof of a conjecture of Haeggkvist on cycles and independent edges | 1983-01-01 | Paper |
| Leaky Electricity: 1-Chain Formulas for the Current and Voltage | 1983-01-01 | Paper |
| Matchings and spanning trees in boolean weighted graphs | 1981-01-01 | Paper |
| Three-colourings of planar 4-valent maps | 1981-01-01 | Paper |
| A Proof of Tuite’s Trinity Theorem and a New Determinant Formula | 1980-01-01 | Paper |
| A note on coloured quadrangulations | 1980-01-01 | Paper |
| A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons | 1980-01-01 | Paper |
| Spanning arborescences, ingraphs, and outgraphs | 1979-01-01 | Paper |
| Full 4-colorings of 4-regular maps | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3861428 | 1979-01-01 | Paper |
| Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths | 1978-01-01 | Paper |
| Directed faces in planar digraphs and unicoloured faces in edge 2- coloured planar Eulerian maps | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192082 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4193499 | 1977-01-01 | Paper |
