| Publication | Date of Publication | Type |
|---|
| Proving exact values for the \(2\)-limited broadcast domination number on grid graphs | 2024-09-06 | Paper |
| Cordial forests | 2024-05-29 | Paper |
| 2-limited broadcast domination on grid graphs | 2023-08-02 | Paper |
| Properties, proved and conjectured, of Keller, Mycielski, and queen graphs | 2018-02-26 | Paper |
| A large set of torus obstructions and how they were discovered | 2018-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365030 | 2017-09-29 | Paper |
| A linear time algorithm for finding a maximum independent set of a fullerene | 2017-07-25 | Paper |
| Simpler projective plane embedding | 2016-07-01 | Paper |
| A formula for the number of spanning trees of a multi-star related graph | 2016-06-09 | Paper |
| Generation of Colourings and Distinguishing Colourings of Graphs | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501836 | 2015-08-14 | Paper |
| Maximum independent sets of the 120-cell and other regular polytopes | 2014-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5298912 | 2013-06-25 | Paper |
| Generating simple convex Venn diagrams | 2013-01-18 | Paper |
| Counterexamples to a proposed algorithm for fries structures of benzenoids | 2013-01-11 | Paper |
| Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams | 2012-01-13 | Paper |
| Computational determination of (3,11) and (4,7) cages | 2011-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012461 | 2011-07-06 | Paper |
| Errors in graph embedding algorithms | 2011-03-28 | Paper |
| The obstructions for toroidal graphs with no \(K_{3,3}\)'s | 2009-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5454405 | 2008-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5454403 | 2008-03-28 | Paper |
| The special cuts of the \(600\)-cell | 2008-02-28 | Paper |
| Forbidden minors and subdivisions for toroidal graphs with no K3,3's | 2007-05-29 | Paper |
| Small latin squares, quasigroups, and loops | 2007-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477973 | 2006-06-29 | Paper |
| On the Cutting Edge: Simplified O(n) Planarity by Edge Addition | 2006-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463581 | 2005-08-04 | Paper |
| Ovals and hyperovals in nets | 2005-06-23 | Paper |
| The non-existence of maximal sets of four mutually orthogonal Latin squares of order 8 | 2004-08-16 | Paper |
| Nets of small degree without ovals | 2004-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470340 | 2004-06-22 | Paper |
| Ranking and unranking permutations in linear time | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4243054 | 2001-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250180 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252282 | 1999-06-17 | Paper |
| Maximizing spanning trees in almost complete graphs | 1997-10-26 | Paper |
| Maximizing spanning trees in almost complete graphs | 1997-09-21 | Paper |
| Two Algorithms for Unranking Arborescences | 1996-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873766 | 1996-04-22 | Paper |
| Reliability polynomials can cross twice | 1995-01-08 | Paper |
| Countingk-component forests of a graph | 1993-01-17 | Paper |
| The degree sequence is reconstructible from \(n-1\) cards | 1992-09-27 | Paper |
| Uniformly-most reliable networks do not always exist | 1991-01-01 | Paper |
| The ally-reconstruction number of a tree with five or more vertices is three | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3483308 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813587 | 1988-01-01 | Paper |
| Bidegreed graphs are edge reconstructible | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3720617 | 1986-01-01 | Paper |
| Proving exact values for the $2$-limited broadcast domination number on grid graphs | N/A | Paper |
