| Publication | Date of Publication | Type |
|---|
| Failed zero forcing numbers of trees and circulant graphs | 2025-01-16 | Paper |
| Minimally non-asymmetric graphs and balanced incomplete block designs | 2025-01-02 | Paper |
| Classroom notes: real-world examples of applications of vertex coloring and edge betweenness centrality | 2024-09-27 | Paper |
| Realizing the asymmetric index of a graph | 2024-08-13 | Paper |
| Characterization of Graphs With Failed Skew Zero Forcing Number of 1 | 2022-09-19 | Paper |
| Characterizing Edge Betweenness-Uniform graphs | 2022-04-20 | Paper |
| All Graphs with a Failed Zero Forcing Number of Two | 2021-10-18 | Paper |
| Uniform edge betweenness centrality | 2021-09-06 | Paper |
| Infinite families of asymmetric graphs | 2021-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5119836 | 2020-09-01 | Paper |
| Edge-transitive graphs and combinatorial designs | 2020-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224845 | 2019-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376420 | 2018-09-17 | Paper |
| Efficiency of star-like graphs and the Atlanta subway network | 2018-09-11 | Paper |
| The Asymmetric Index of a Graph | 2018-08-30 | Paper |
| Intersecting geodesics and centrality in graphs | 2018-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636271 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4595231 | 2017-11-29 | Paper |
| A graph theoretic analysis of leverage centrality | 2017-11-17 | Paper |
| Greedy algorithms for generalized \(k\)-rankings of paths | 2017-11-03 | Paper |
| Leverage centrality of knight's graphs and Cartesian products of regular graphs and path powers | 2017-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2960954 | 2017-02-17 | Paper |
| Relationships Between Characteristic Path Length, Efficiency, Clustering Coefficients, and Graph Density | 2017-02-03 | Paper |
| Extrema property of the \(k\)-ranking of directed paths and cycles | 2016-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740935 | 2016-07-20 | Paper |
| Global efficiency of graphs | 2015-12-11 | Paper |
| Maximizing the number of edges in optimal \(k\)-rankings | 2015-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2948801 | 2015-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2948803 | 2015-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2948797 | 2015-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2948815 | 2015-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2948823 | 2015-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5500154 | 2015-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2931464 | 2014-11-25 | Paper |
| Preface | 2014-07-29 | Paper |
| Optimal monitoring of networks | 2014-01-03 | Paper |
| Minimal rankings of the Cartesian product \(K_n \square K_m\) | 2013-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4925705 | 2013-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4925718 | 2013-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4925714 | 2013-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4925715 | 2013-06-12 | Paper |
| Optimally routing data in fiber-optic networks with existing flow | 2012-10-06 | Paper |
| Max-optimal and sum-optimal labelings of graphs | 2012-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3089203 | 2011-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3089181 | 2011-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3015620 | 2011-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012459 | 2011-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999994 | 2011-05-18 | Paper |
| Minimal \(k\)-rankings for prism graphs | 2010-09-09 | Paper |
| Greedy rankings and arank numbers | 2010-08-20 | Paper |
| Representations for complete graphs minus a disjoint union of paths | 2010-06-17 | Paper |
| Minimal \(k\)-rankings and the rank number of \(P^2_n\) | 2010-06-16 | Paper |
| Maximum minimal rankings of oriented trees | 2009-11-13 | Paper |
| A classification of tournaments having an acyclic tournament as a minimum feedback arc set | 2009-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3636213 | 2009-06-30 | Paper |
| Powers of directed Hamiltonian paths as feedback arc sets | 2009-04-14 | Paper |
| Classroom Capsules | 2008-07-02 | Paper |
| On the reversing number of powers of directed Hamiltonian paths | 2008-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5443271 | 2008-02-20 | Paper |
| Representations of split graphs, their complements, stars, and hypercubes | 2007-02-16 | Paper |
| Minimal rankings and the arank number of a path | 2006-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4672137 | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826274 | 2004-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826138 | 2004-11-11 | Paper |
| Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set | 2004-02-03 | Paper |
| Fibonacci Determinants | 2003-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430856 | 2003-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430618 | 2003-10-12 | Paper |
| Tiling Large Rectangles | 2002-01-01 | Paper |
| The reversing number of a digraph; a disjoint union of directed stars | 2001-09-23 | Paper |
| Representations of graphs modulo \(n\) | 2000-12-03 | Paper |
