| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5089305 | 2022-07-18 | Paper |
| Interest clustering coefficient: a new metric for directed networks like Twitter | 2022-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136239 | 2020-11-25 | Paper |
| Not all partial cubes are \(\Theta \)-graceful | 2020-08-12 | Paper |
| Study of a combinatorial game in graphs through linear programming | 2020-04-09 | Paper |
| Subdivisions in digraphs of large out-degree or large dichromatic number | 2019-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5226846 | 2019-08-01 | Paper |
| Computational Mathematics with SageMath | 2019-04-09 | Paper |
| Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem | 2019-01-18 | Paper |
| Subdivisions of oriented cycles in digraphs with large chromatic number | 2019-01-03 | Paper |
| Safe sets in graphs: graph classes and structural parameters | 2018-12-06 | Paper |
| Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem | 2018-06-15 | Paper |
| Bispindles in strongly connected digraphs with large chromatic number | 2018-06-14 | Paper |
| On the minimum size of an identifying code over all orientations of a graph | 2018-05-25 | Paper |
| Spy-game on graphs: complexity and simple topologies | 2018-05-15 | Paper |
| Bispindle in strongly connected digraphs with large chromatic number | 2018-04-09 | Paper |
| A polynomial-time algorithm for outerplanar diameter improvement | 2017-09-07 | Paper |
| Applying clique-decomposition for computing Gromov hyperbolicity | 2017-08-24 | Paper |
| Implementing Brouwer's database of strongly regular graphs | 2017-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282808 | 2017-07-17 | Paper |
| Graphs with maximal irregularity | 2017-04-11 | Paper |
| Bin Packing with Colocations | 2017-04-04 | Paper |
| Safe Sets in Graphs: Graph Classes and Structural Parameters | 2017-02-01 | Paper |
| Equitable orientations of sparse uniform hypergraphs | 2016-12-06 | Paper |
| On computing the Gromov hyperbolicity | 2016-10-24 | Paper |
| Connected tropical subgraphs in vertex-colored graphs | 2016-08-23 | Paper |
| A doubling construction for 3-uniform friendship hypergraphs with the universal pairs property | 2016-08-22 | Paper |
| Finding good 2-partitions of digraphs. II. Enumerable properties | 2016-07-05 | Paper |
| A Polynomial-Time Algorithm for Outerplanar Diameter Improvement | 2015-10-20 | Paper |
| From edge-coloring to strong edge-coloring | 2015-04-22 | Paper |
| Induced Decompositions of Highly Dense Graphs | 2015-01-21 | Paper |
| On the proper orientation number of bipartite graphs | 2015-01-06 | Paper |
| Acyclic edge-colouring of planar graphs (extended abstract) | 2013-10-10 | Paper |
| Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles | 2013-08-12 | Paper |
| Good edge-labelling of graphs | 2013-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4903403 | 2013-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3144348 | 2012-12-07 | Paper |
| Good edge-labelling of graphs | 2012-11-22 | Paper |
| Bounds and Computation of Irregularity of a Graph | 2012-07-19 | Paper |
| A note on Zagreb indices inequality for trees and unicyclic graphs | 2012-06-18 | Paper |
| Linear and 2-frugal choosability of graphs of small maximum average degree | 2012-01-24 | Paper |
| Acyclic Edge-Coloring of Planar Graphs | 2011-10-27 | Paper |
| The α-Arboricity of Complete Uniform Hypergraphs | 2011-10-27 | Paper |
| Tradeoffs in process strategy games with application in the WDM reconfiguration problem | 2011-09-12 | Paper |
| Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof | 2010-10-19 | Paper |
