| Publication | Date of Publication | Type |
|---|
Tight upper bounds for the \(p\)-anionic Clar number of fullerenes
Ars Mathematica Contemporanea | 2026-01-09 | Paper |
Proving exact values for the \(2\)-limited broadcast domination number on grid graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
| Cordial forests | 2024-05-29 | Paper |
2-limited broadcast domination on grid graphs
Discrete Applied Mathematics | 2023-08-02 | Paper |
Properties, proved and conjectured, of Keller, Mycielski, and queen graphs
Ars Mathematica Contemporanea | 2018-02-26 | Paper |
A large set of torus obstructions and how they were discovered
The Electronic Journal of Combinatorics | 2018-02-22 | Paper |
| A complete resolution of the Keller maximum clique problem | 2017-09-29 | Paper |
A linear time algorithm for finding a maximum independent set of a fullerene
Journal of Combinatorics | 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
Information Processing Letters | 2016-06-09 | Paper |
Generation of Colourings and Distinguishing Colourings of Graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
| scientific article; zbMATH DE number 6472634 (Why is no real title available?) | 2015-08-14 | Paper |
Maximum independent sets of the 120-cell and other regular polyhedra
Ars Mathematica Contemporanea | 2014-05-14 | Paper |
| scientific article; zbMATH DE number 6180530 (Why is no real title available?) | 2013-06-25 | Paper |
Generating simple convex Venn diagrams
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Counterexamples to a proposed algorithm for fries structures of benzenoids
Journal of Mathematical Chemistry | 2013-01-11 | Paper |
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Computational determination of (3,11) and (4,7) cages
Journal of Discrete Algorithms | 2011-07-29 | Paper |
| A counterexample to Moorhouse's conjecture on the rank of nets | 2011-07-06 | Paper |
Errors in graph embedding algorithms
Journal of Computer and System Sciences | 2011-03-28 | Paper |
The obstructions for toroidal graphs with no \(K_{3,3}\)'s
Discrete Mathematics | 2009-06-19 | Paper |
| FuiGui: a graphical user interface for investigating conjectures about fullerenes | 2008-03-28 | Paper |
| Backtracking to compute the closed-shell independence number of a fullerene | 2008-03-28 | Paper |
The special cuts of the \(600\)-cell
Beiträge zur Algebra und Geometrie | 2008-02-28 | Paper |
The special cuts of the \(600\)-cell
Beiträge zur Algebra und Geometrie | 2008-02-28 | Paper |
The special cuts of the \(600\)-cell
Beiträge zur Algebra und Geometrie | 2008-02-28 | Paper |
Forbidden minors and subdivisions for toroidal graphs with no K3,3's
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Small latin squares, quasigroups, and loops
Journal of Combinatorial Designs | 2007-03-20 | Paper |
| A dynamic programming approach for timing and designing clique algorithms | 2006-06-29 | Paper |
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
| scientific article; zbMATH DE number 2192203 (Why is no real title available?) | 2005-08-04 | Paper |
Ovals and hyperovals in nets
Discrete Mathematics | 2005-06-23 | Paper |
The non-existence of maximal sets of four mutually orthogonal Latin squares of order 8
Designs, Codes and Cryptography | 2004-08-16 | Paper |
Nets of small degree without ovals
Designs, Codes and Cryptography | 2004-08-16 | Paper |
| scientific article; zbMATH DE number 2076917 (Why is no real title available?) | 2004-06-22 | Paper |
Ranking and unranking permutations in linear time
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1286747 (Why is no real title available?) | 2001-08-30 | Paper |
| scientific article; zbMATH DE number 1303556 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1305401 (Why is no real title available?) | 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
Journal of Algorithms | 1996-06-04 | Paper |
| scientific article; zbMATH DE number 867654 (Why is no real title available?) | 1996-04-22 | Paper |
Reliability polynomials can cross twice
Journal of the Franklin Institute | 1995-01-08 | Paper |
Countingk-component forests of a graph
Networks | 1993-01-17 | Paper |
The degree sequence is reconstructible from \(n-1\) cards
Discrete Mathematics | 1992-09-27 | Paper |
Uniformly-most reliable networks do not always exist
Networks | 1991-01-01 | Paper |
The ally-reconstruction number of a tree with five or more vertices is three
Journal of Graph Theory | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4154485 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4083346 (Why is no real title available?) | 1988-01-01 | Paper |
Bidegreed graphs are edge reconstructible
Journal of Graph Theory | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3950551 (Why is no real title available?) | 1986-01-01 | Paper |
Proving exact values for the $2$-limited broadcast domination number on grid graphs
(available as arXiv preprint) | N/A | Paper |
