| Publication | Date of Publication | Type |
|---|
| Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs | 2024-03-25 | Paper |
| Safe sets and in-dominating sets in digraphs | 2024-02-14 | Paper |
| Component order connectivity in directed graphs | 2023-11-13 | Paper |
| Making a tournament k $k$‐strong | 2023-10-09 | 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 |
| Good acyclic orientations of 4‐regular 4‐connected graphs | 2023-10-05 | Paper |
| Constrained Flows in Networks | 2023-10-02 | Paper |
| Proper‐walk connection number of graphs | 2023-09-29 | Paper |
| Good orientations of unions of edge‐disjoint spanning trees | 2023-09-29 | Paper |
| K-distinct branchings admits a polynomial kernel | 2023-09-20 | Paper |
| Strong arc decompositions of split digraphs | 2023-09-13 | Paper |
| Complexity of (arc)-connectivity problems involving arc-reversals or deorientations | 2023-09-07 | Paper |
| Arc-disjoint out- and in-branchings in compositions of digraphs | 2023-02-16 | Paper |
| Non-separating spanning trees and out-branchings in digraphs of independence number 2 | 2022-11-29 | Paper |
| Complexity of some arc-partition problems for digraphs | 2022-10-07 | Paper |
| Component order connectivity in directed graphs | 2022-08-18 | Paper |
| Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked | 2022-04-11 | Paper |
| On DP‐coloring of digraphs | 2022-03-31 | Paper |
| Arc‐disjoint strong spanning subdigraphs of semicomplete compositions | 2022-03-31 | Paper |
| Digraphs and Variable Degeneracy | 2022-03-15 | Paper |
| On supereulerian 2-edge-coloured graphs | 2021-11-30 | Paper |
| Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments | 2020-10-08 | Paper |
| Out‐colourings of digraphs | 2020-05-21 | Paper |
| Hajós and Ore constructions for digraphs | 2020-03-30 | Paper |
| The directed 2-linkage problem with length constraints | 2020-03-12 | Paper |
| Bipartite spanning sub(di)graphs induced by 2‐partitions | 2019-10-31 | Paper |
| The parameterized complexity landscape of finding 2-partitions of digraphs | 2019-10-18 | Paper |
| Safe sets in digraphs | 2019-08-19 | Paper |
| Branching in digraphs with many and few leaves: structural and algorithmic results | 2019-07-25 | Paper |
| Proper-walk connection number of graphs | 2019-06-30 | Paper |
| Degree-constrained 2-partitions of graphs | 2019-05-29 | Paper |
| Good orientations of 2T-graphs | 2019-03-25 | Paper |
| Basic Terminology, Notation and Results | 2019-03-04 | Paper |
| Tournaments and Semicomplete Digraphs | 2019-03-04 | Paper |
| Locally Semicomplete Digraphs and Generalizations | 2019-03-04 | Paper |
| χ‐bounded families of oriented graphs | 2019-01-03 | Paper |
| On DP-Coloring of Digraphs | 2018-12-23 | Paper |
| Degree constrained 2-partitions of semicomplete digraphs | 2018-09-27 | Paper |
| Completing orientations of partially oriented graphs | 2018-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608076 | 2018-03-15 | Paper |
| Out-degree reducing partitions of digraphs | 2018-03-12 | Paper |
| Disjoint Paths in Decomposable Digraphs | 2017-07-05 | Paper |
| Antistrong digraphs | 2016-11-25 | Paper |
| Arc-Disjoint Directed and Undirected Cycles in Digraphs | 2016-11-17 | Paper |
| Parameterized algorithms for non-separating trees and branchings in digraphs | 2016-11-01 | Paper |
| Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments | 2016-10-21 | Paper |
| Finding good 2-partitions of digraphs. II. Enumerable properties | 2016-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816010 | 2016-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816056 | 2016-07-01 | Paper |
| The complexity of finding arc-disjoint branching flows | 2016-06-21 | Paper |
| DAG-Width and Circumference of Digraphs | 2016-06-10 | Paper |
| Finding good 2-partitions of digraphs. I. Hereditary properties | 2016-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5499919 | 2015-08-05 | Paper |
| Restricted cycle factors and arc-decompositions of digraphs | 2015-07-24 | Paper |
| Balanced branchings in digraphs | 2015-07-24 | Paper |
| Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles | 2015-07-23 | Paper |
| Vertex coloring edge-weighted digraphs | 2015-06-15 | Paper |
| Sufficient Conditions for a Digraph to be Supereulerian | 2015-05-22 | Paper |
| Finding a subdivision of a digraph | 2014-12-02 | Paper |
| Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs | 2014-11-17 | Paper |
| Arc-Disjoint Paths in Decomposable Digraphs | 2014-10-09 | Paper |
| Vertex-disjoint directed and undirected cycles in general digraphs | 2014-08-28 | Paper |
| Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments | 2014-05-22 | Paper |
| Arc-disjoint paths and trees in 2-regular digraphs | 2014-04-10 | Paper |
| (Arc-)disjoint flows in networks | 2014-03-13 | Paper |
| The complexity of multicut and mixed multicut problems in (di)graphs | 2014-01-13 | Paper |
| Disjoint sub(di)graphs in digraphs | 2013-10-10 | Paper |
| Finding an induced subdivision of a digraph | 2013-07-23 | Paper |
| Quasi-hamiltonian paths in semicomplete multipartite digraphs | 2013-04-25 | Paper |
| Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties | 2013-03-04 | Paper |
| Efficient algorithms for real-life instances of the variable size bin packing problem | 2012-11-15 | Paper |
| Finding an induced subdivision of a digraph | 2012-08-10 | Paper |
| Arc-disjoint spanning sub(di)graphs in digraphs | 2012-08-08 | Paper |
| Decomposing locally semicomplete digraphs into strong spanning subdigraphs | 2012-05-11 | Paper |
| On the problem of finding disjoint cycles and dicycles in a digraph | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012393 | 2011-07-06 | Paper |
| A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation | 2010-11-24 | Paper |
| The complexity of colouring by locally semicomplete digraphs | 2010-10-18 | Paper |
| Spectral Theory and Analysis | 2010-09-13 | Paper |
| Spanning 2-strong tournaments in 3-strong semicomplete digraphs | 2010-05-05 | Paper |
| \(k\)-strong spanning local tournaments in locally semicomplete digraphs | 2010-04-28 | Paper |
| Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs | 2009-12-15 | Paper |
| Disjoint directed and undirected paths and cycles in digraphs | 2009-11-06 | Paper |
| The minimum spanning strong subdigraph problem is fixed parameter tractable | 2009-03-09 | Paper |
| Digraphs | 2009-01-12 | Paper |
| On persistent directed graphs | 2008-12-17 | Paper |
| Minimum cycle factors in quasi-transitive digraphs | 2008-05-16 | Paper |
| Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs | 2008-05-14 | Paper |
| Mixed Models for the Analysis of Local Search Components | 2007-11-29 | Paper |
| Recognizing and representing proper interval graphs in parallel using merging and sorting | 2007-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424900 | 2007-03-05 | Paper |
| Longest path partitions in generalizations of tournaments | 2006-09-14 | Paper |
| Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs | 2006-06-30 | Paper |
| When the greedy algorithm fails | 2005-08-22 | Paper |
| Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs | 2005-07-05 | Paper |
| Finding complementary cycles in locally semicomplete digraphs | 2005-02-22 | Paper |
| Subgraphs in vertex neighborhoods ofKr-free graphs | 2005-01-12 | Paper |
| Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments | 2004-08-16 | Paper |
| The structure of strong arc-locally semicomplete digraphs | 2004-08-06 | Paper |
| Making a tournament \(k\)-arc-strong by reversing or deorienting arcs. | 2004-03-14 | Paper |
| Splitting off edges between two subsets preserving the edge-connectivity of the graph. | 2004-02-14 | Paper |
| Steiner type problems for digraphs that are locally semicomplete or extended semicomplete | 2004-02-03 | Paper |
| Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs | 2004-01-08 | Paper |
| Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs | 2003-10-14 | Paper |
| Small degree out‐branchings | 2003-05-11 | Paper |
| Convex-round graphs are circular-perfect | 2003-03-09 | Paper |
| The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539516 | 2002-07-09 | Paper |
| Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph | 2001-11-01 | Paper |
| Kings in quasi-transitive digraphs | 2000-11-02 | Paper |
| Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250196 | 2000-10-17 | Paper |
| A note on vertex pancyclic oriented graphs | 2000-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500916 | 2000-08-31 | Paper |
| Convex-Round and Concave-Round Graphs | 2000-07-20 | Paper |
| Complementary cycles containing prescribed vertices in tournaments | 2000-06-22 | Paper |
| On the complexity of hamiltonian path and cycle problems in certain classes of digraphs | 2000-04-09 | Paper |
| A new sufficient condition for a digraph to be Hamiltonian | 2000-04-09 | Paper |
| Linkages in locally semicomplete digraphs and quasi-transitive digraphs | 2000-01-11 | Paper |
| Augmenting hypergraphs by edges of size two | 1999-11-23 | Paper |
| Generalizations of tournaments: A survey | 1999-09-10 | Paper |
| A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs | 1999-07-07 | Paper |
| Edge-Connectivity Augmentation with Partition Constraints | 1999-06-27 | Paper |
| Properly coloured Hamiltonian paths in edge-coloured complete graphs | 1998-10-19 | Paper |
| Edge-Connectivity Augmentation Preserving Simplicity | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390605 | 1998-08-31 | Paper |
| Adding and Reversing Arcs in Semicomplete Digraphs | 1998-04-02 | Paper |
| Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments | 1997-12-01 | Paper |
| Vertex heaviest paths and cycles in quasi-transitive digraphs | 1997-11-25 | Paper |
| Alternating cycles and paths in edge-coloured multigraphs: A survey | 1997-11-25 | Paper |
| Paths and cycles in extended and decomposable digraphs | 1997-10-07 | Paper |
| A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian | 1997-09-17 | Paper |
| On \(k\)-strong and \(k\)-cyclic digraphs | 1997-06-10 | Paper |
| A classification of locally semicomplete digraphs | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888111 | 1996-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863419 | 1996-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873791 | 1996-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873684 | 1996-04-17 | Paper |
| Preserving and Increasing Local Edge-Connectivity in Mixed Graphs | 1996-04-08 | Paper |
| Weakly Hamiltonian-connected ordinary multipartite tournaments | 1996-03-10 | Paper |
| Weakly Hamiltonian-connected locally semicomplete digraphs | 1996-02-25 | Paper |
| Digraphs with the path‐merging property | 1996-02-20 | Paper |
| Quasi‐transitive digraphs | 1996-02-08 | Paper |
| Hereditarily hard \(H\)-colouring problems | 1995-07-19 | Paper |
| Weakly hamiltonian-connected vertices in bipartite tournaments | 1995-07-02 | Paper |
| In-tournament digraphs | 1994-08-17 | Paper |
| Cycles through \(k\) vertices in bipartite tournaments | 1994-08-11 | Paper |
| On chordal proper circular arc graphs | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273848 | 1994-01-06 | Paper |
| On the complexity of colouring by superdigraphs of bipartite graphs | 1993-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201932 | 1993-09-06 | Paper |
| Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs | 1993-05-16 | Paper |
| Unsolved problems presented at the Julius Petersen graph theory conference | 1993-01-16 | Paper |
| On the structure of locally semicomplete digraphs | 1993-01-16 | Paper |
| A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3987041 | 1992-06-28 | Paper |
| A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs | 1992-06-28 | Paper |
| Edge-disjoint in- and out-branchings in tournaments and related path problems | 1991-01-01 | Paper |
| The effect of two cycles on the complexity of colourings by directed graphs | 1990-01-01 | Paper |
| Locally semicomplete digraphs: A generalization of tournaments | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815328 | 1989-01-01 | Paper |
| The Complexity of Colouring by Semicomplete Digraphs | 1988-01-01 | Paper |
