| Publication | Date of Publication | Type |
|---|
| Digraph redicolouring | 2024-02-05 | Paper |
| Spanning eulerian subdigraphs in semicomplete digraphs | 2023-10-06 | Paper |
| Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties | 2023-10-05 | Paper |
| Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 | 2023-10-05 | Paper |
| Powers of paths in tournaments | 2023-03-30 | Paper |
| Overlaying a hypergraph with a graph with bounded maximum degree | 2022-08-04 | Paper |
| On the unavoidability of oriented trees | 2022-04-27 | Paper |
| On the Nash number and the diminishing Grundy number of a graph | 2022-04-20 | Paper |
| On the dichromatic number of surfaces | 2022-04-04 | Paper |
| On the unavoidability of oriented trees | 2021-09-16 | Paper |
| On the semi-proper orientations of graphs | 2021-04-20 | Paper |
| Overlaying a hypergraph with a graph with bounded maximum degree | 2020-07-21 | Paper |
| A variant of the Erdős‐Sós conjecture | 2020-05-21 | Paper |
| Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs | 2020-04-07 | Paper |
| Cooperative colorings of trees and of bipartite graphs | 2020-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207841 | 2020-01-13 | Paper |
| Bipartite spanning sub(di)graphs induced by 2‐partitions | 2019-10-31 | 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 |
| Tournaments and Semicomplete Digraphs | 2019-03-04 | Paper |
| Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem | 2019-01-18 | Paper |
| χ‐bounded families of oriented graphs | 2019-01-03 | Paper |
| Subdivisions of oriented cycles in digraphs with large chromatic number | 2019-01-03 | Paper |
| Minimum density of identifying codes of king grids | 2018-08-15 | 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 |
| Finding a subdivision of a prescribed digraph of order 4 | 2018-04-27 | Paper |
| Bispindle in strongly connected digraphs with large chromatic number | 2018-04-09 | Paper |
| Minimum density of identifying codes of king grids | 2018-04-09 | Paper |
| Out-degree reducing partitions of digraphs | 2018-03-12 | Paper |
| On the complexity of compressing two dimensional routing tables with order | 2018-02-28 | Paper |
| Coloring Graphs with Constraints on Connectivity | 2017-08-10 | Paper |
| Identifying codes for infinite triangular grids with a finite number of rows | 2017-05-10 | Paper |
| Minimum-Density Identifying Codes in Square Grids | 2016-11-09 | Paper |
| Compressing two-dimensional routing tables with order | 2016-10-18 | Paper |
| Finding good 2-partitions of digraphs. II. Enumerable properties | 2016-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816100 | 2016-07-01 | Paper |
| The complexity of finding arc-disjoint branching flows | 2016-06-21 | Paper |
| Finding good 2-partitions of digraphs. I. Hereditary properties | 2016-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173164 | 2015-02-09 | Paper |
| On the proper orientation number of bipartite graphs | 2015-01-06 | Paper |
| Design of fault-tolerant on-board networks with variable switch sizes | 2014-12-02 | Paper |
| Finding a subdivision of a digraph | 2014-12-02 | Paper |
| (Circular) backbone colouring: forest backbones in planar graphs | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5413904 | 2014-05-02 | Paper |
| Spanning galaxies in digraphs | 2013-10-10 | Paper |
| Acyclic edge-colouring of planar graphs. Extended abstract | 2013-10-10 | Paper |
| Finding an induced subdivision of a digraph | 2013-07-23 | Paper |
| Good edge-labelling of graphs | 2013-07-19 | Paper |
| The game Grundy number of graphs | 2013-06-13 | Paper |
| Enumerating the edge-colourings and total colourings of a regular graph | 2013-06-13 | Paper |
| On the Grundy and \(b\)-chromatic numbers of a graph | 2013-05-16 | Paper |
| On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems | 2013-05-16 | Paper |
| Oriented trees in digraphs | 2013-04-15 | Paper |
| Weighted improper colouring | 2013-01-18 | Paper |
| \(b\)-coloring of tight graphs | 2012-11-22 | Paper |
| Good edge-labelling of graphs | 2012-11-22 | Paper |
| New Bounds on the Grundy Number of Products of Graphs | 2012-09-12 | Paper |
| Griggs and Yeh's Conjecture and $L(p,1)$-labelings | 2012-08-22 | Paper |
| Finding an induced subdivision of a digraph | 2012-08-10 | Paper |
| On spanning galaxies in digraphs | 2012-05-11 | Paper |
| Linear and 2-frugal choosability of graphs of small maximum average degree | 2012-01-24 | Paper |
| Weighted Improper Colouring | 2012-01-13 | Paper |
| 5-Coloring Graphs with 4 Crossings | 2011-10-27 | Paper |
| Acyclic Edge-Coloring of Planar Graphs | 2011-10-27 | Paper |
| Exact algorithms for \(L(2,1)\)-labeling of graphs | 2011-03-02 | Paper |
| Facial non-repetitive edge-coloring of plane graphs | 2011-01-20 | Paper |
| IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS | 2010-12-15 | Paper |
| On the Grundy Number of a Graph | 2010-12-07 | Paper |
| Improper coloring of unit disk graphs | 2010-11-24 | Paper |
| \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) | 2010-11-05 | Paper |
| Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof | 2010-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579493 | 2010-08-06 | Paper |
| Corrigendum to ``\((p,1)\)-total labelling of graphs [Discrete math. 308 (2008) 496-513] | 2010-07-07 | Paper |
| Grundy number and products of graphs | 2010-05-05 | Paper |
| Complexity of (p,1)-total labelling | 2010-04-28 | Paper |
| Facial colorings using Hall's theorem | 2010-04-27 | Paper |
| WDM and Directed Star Arboricity | 2010-04-23 | Paper |
| Circular choosability | 2009-12-18 | Paper |
| Choosability of the square of planar subcubic graphs with large girth | 2009-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3614028 | 2009-03-16 | Paper |
| 3-Facial Coloring of Plane Graphs | 2009-03-16 | Paper |
| Bisimplicial vertices in even-hole-free graphs | 2008-12-08 | Paper |
| Hoàng-Reed conjecture holds for tournaments | 2008-07-11 | Paper |
| List Colouring Squares of Planar Graphs | 2008-06-05 | Paper |
| \((p,1)\)-total labelling of graphs | 2008-01-28 | Paper |
| Paths with two blocks in \(n\)-chromatic digraphs | 2007-06-08 | Paper |
| Improper Colourings of Unit Disk Graphs | 2007-05-29 | Paper |
| Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree | 2007-02-02 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Improper choosability of graphs and maximum average degree | 2006-09-06 | Paper |
| Fault tolerant on-board networks with priorities | 2006-03-24 | Paper |
| Stable set meeting every longest path | 2005-02-22 | Paper |
| Pancyclic arcs and connectivity in tournaments | 2005-02-16 | Paper |
| The Push Tree problem | 2005-01-12 | Paper |
| Trees with three leaves are (\(n+1\))-unavoidable | 2004-08-06 | Paper |
| On unavoidability of trees with \(k\) leaves | 2003-07-08 | Paper |
| Oriented Hamiltonian cycles in tournaments | 2002-12-10 | Paper |
| Trees in tournaments | 2002-10-24 | Paper |
| Finding a five bicolouring of a triangle-free subgraph of the triangular lattice | 2002-05-21 | Paper |
| Channel assignment and multicolouring of the induced subgraphs of the triangular lattice | 2002-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741508 | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4521493 | 2001-09-30 | Paper |
| Finding an Oriented Hamiltonian Path in a Tournament | 2000-08-27 | Paper |
| Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture | 2000-06-25 | Paper |
