Jörgen Bang-Jensen

From MaRDI portal
Person:558237

Available identifiers

zbMath Open bang-jensen.jorgenWikidataQ60554845 ScholiaQ60554845MaRDI QIDQ558237

List of research outcomes

PublicationDate of PublicationType
Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs2024-03-25Paper
Safe sets and in-dominating sets in digraphs2024-02-14Paper
https://portal.mardi4nfdi.de/entity/Q60682362023-11-13Paper
Making a tournament k $k$‐strong2023-10-09Paper
Spanning eulerian subdigraphs in semicomplete digraphs2023-10-06Paper
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties2023-10-05Paper
Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 22023-10-05Paper
Good acyclic orientations of 4‐regular 4‐connected graphs2023-10-05Paper
Proper‐walk connection number of graphs2023-09-29Paper
Good orientations of unions of edge‐disjoint spanning trees2023-09-29Paper
https://portal.mardi4nfdi.de/entity/Q60758952023-09-20Paper
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations2023-09-07Paper
Non-separating spanning trees and out-branchings in digraphs of independence number 22022-11-29Paper
Complexity of some arc-partition problems for digraphs2022-10-07Paper
Component order connectivity in directed graphs2022-08-18Paper
Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked2022-04-11Paper
On DP‐coloring of digraphs2022-03-31Paper
Arc‐disjoint strong spanning subdigraphs of semicomplete compositions2022-03-31Paper
Digraphs and Variable Degeneracy2022-03-15Paper
On supereulerian 2-edge-coloured graphs2021-11-30Paper
Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments2020-10-08Paper
Out‐colourings of digraphs2020-05-21Paper
Hajós and Ore constructions for digraphs2020-03-30Paper
The directed 2-linkage problem with length constraints2020-03-12Paper
Bipartite spanning sub(di)graphs induced by 2‐partitions2019-10-31Paper
The parameterized complexity landscape of finding 2-partitions of digraphs2019-10-18Paper
Safe sets in digraphs2019-08-19Paper
Branching in digraphs with many and few leaves: structural and algorithmic results2019-07-25Paper
Proper-walk connection number of graphs2019-06-30Paper
Degree-constrained 2-partitions of graphs2019-05-29Paper
Good orientations of 2T-graphs2019-03-25Paper
Basic Terminology, Notation and Results2019-03-04Paper
Tournaments and Semicomplete Digraphs2019-03-04Paper
Locally Semicomplete Digraphs and Generalizations2019-03-04Paper
χ‐bounded families of oriented graphs2019-01-03Paper
On DP-Coloring of Digraphs2018-12-23Paper
Degree constrained 2-partitions of semicomplete digraphs2018-09-27Paper
Completing orientations of partially oriented graphs2018-04-27Paper
https://portal.mardi4nfdi.de/entity/Q46080762018-03-15Paper
Out-degree reducing partitions of digraphs2018-03-12Paper
Disjoint Paths in Decomposable Digraphs2017-07-05Paper
Antistrong digraphs2016-11-25Paper
Arc-Disjoint Directed and Undirected Cycles in Digraphs2016-11-17Paper
Parameterized algorithms for non-separating trees and branchings in digraphs2016-11-01Paper
Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments2016-10-21Paper
Finding good 2-partitions of digraphs. II. Enumerable properties2016-07-05Paper
https://portal.mardi4nfdi.de/entity/Q28160102016-07-01Paper
https://portal.mardi4nfdi.de/entity/Q28160562016-07-01Paper
The complexity of finding arc-disjoint branching flows2016-06-21Paper
DAG-Width and Circumference of Digraphs2016-06-10Paper
Finding good 2-partitions of digraphs. I. Hereditary properties2016-06-01Paper
https://portal.mardi4nfdi.de/entity/Q54999192015-08-05Paper
Restricted cycle factors and arc-decompositions of digraphs2015-07-24Paper
Balanced branchings in digraphs2015-07-24Paper
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles2015-07-23Paper
Vertex coloring edge-weighted digraphs2015-06-15Paper
Sufficient Conditions for a Digraph to be Supereulerian2015-05-22Paper
Finding a subdivision of a digraph2014-12-02Paper
Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs2014-11-17Paper
Arc-Disjoint Paths in Decomposable Digraphs2014-10-09Paper
Vertex-disjoint directed and undirected cycles in general digraphs2014-08-28Paper
Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments2014-05-22Paper
Arc-disjoint paths and trees in 2-regular digraphs2014-04-10Paper
(Arc-)disjoint flows in networks2014-03-13Paper
The complexity of multicut and mixed multicut problems in (di)graphs2014-01-13Paper
Disjoint sub(di)graphs in digraphs2013-10-10Paper
Finding an induced subdivision of a digraph2013-07-23Paper
Quasi-hamiltonian paths in semicomplete multipartite digraphs2013-04-25Paper
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties2013-03-04Paper
Efficient algorithms for real-life instances of the variable size bin packing problem2012-11-15Paper
Finding an induced subdivision of a digraph2012-08-10Paper
Arc-disjoint spanning sub(di)graphs in digraphs2012-08-08Paper
Decomposing locally semicomplete digraphs into strong spanning subdigraphs2012-05-11Paper
On the problem of finding disjoint cycles and dicycles in a digraph2012-04-26Paper
https://portal.mardi4nfdi.de/entity/Q30123932011-07-06Paper
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation2010-11-24Paper
The complexity of colouring by locally semicomplete digraphs2010-10-18Paper
Spectral Theory and Analysis2010-09-13Paper
Spanning 2-strong tournaments in 3-strong semicomplete digraphs2010-05-05Paper
\(k\)-strong spanning local tournaments in locally semicomplete digraphs2010-04-28Paper
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs2009-12-15Paper
Disjoint directed and undirected paths and cycles in digraphs2009-11-06Paper
The minimum spanning strong subdigraph problem is fixed parameter tractable2009-03-09Paper
Digraphs2009-01-12Paper
On persistent directed graphs2008-12-17Paper
Minimum cycle factors in quasi-transitive digraphs2008-05-16Paper
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs2008-05-14Paper
Mixed Models for the Analysis of Local Search Components2007-11-29Paper
Recognizing and representing proper interval graphs in parallel using merging and sorting2007-03-08Paper
https://portal.mardi4nfdi.de/entity/Q34249002007-03-05Paper
Longest path partitions in generalizations of tournaments2006-09-14Paper
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs2006-06-30Paper
When the greedy algorithm fails2005-08-22Paper
Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs2005-07-05Paper
Finding complementary cycles in locally semicomplete digraphs2005-02-22Paper
Subgraphs in vertex neighborhoods ofKr-free graphs2005-01-12Paper
Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments2004-08-16Paper
The structure of strong arc-locally semicomplete digraphs2004-08-06Paper
Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.2004-03-14Paper
Splitting off edges between two subsets preserving the edge-connectivity of the graph.2004-02-14Paper
Steiner type problems for digraphs that are locally semicomplete or extended semicomplete2004-02-03Paper
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs2004-01-08Paper
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs2003-10-14Paper
Small degree out‐branchings2003-05-11Paper
Convex-round graphs are circular-perfect2003-03-09Paper
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs2002-08-01Paper
https://portal.mardi4nfdi.de/entity/Q45395162002-07-09Paper
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph2001-11-01Paper
Kings in quasi-transitive digraphs2000-11-02Paper
Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q42501962000-10-17Paper
https://portal.mardi4nfdi.de/entity/Q42611872000-09-15Paper
https://portal.mardi4nfdi.de/entity/Q45009162000-08-31Paper
Convex-Round and Concave-Round Graphs2000-07-20Paper
Complementary cycles containing prescribed vertices in tournaments2000-06-22Paper
On the complexity of hamiltonian path and cycle problems in certain classes of digraphs2000-04-09Paper
A new sufficient condition for a digraph to be Hamiltonian2000-04-09Paper
Linkages in locally semicomplete digraphs and quasi-transitive digraphs2000-01-11Paper
Augmenting hypergraphs by edges of size two1999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42429371999-09-10Paper
https://portal.mardi4nfdi.de/entity/Q42429161999-07-07Paper
Edge-Connectivity Augmentation with Partition Constraints1999-06-27Paper
Properly coloured Hamiltonian paths in edge-coloured complete graphs1998-10-19Paper
Edge-Connectivity Augmentation Preserving Simplicity1998-09-21Paper
https://portal.mardi4nfdi.de/entity/Q43906051998-08-31Paper
Adding and Reversing Arcs in Semicomplete Digraphs1998-04-02Paper
Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments1997-12-01Paper
Vertex heaviest paths and cycles in quasi-transitive digraphs1997-11-25Paper
Alternating cycles and paths in edge-coloured multigraphs: A survey1997-11-25Paper
Paths and cycles in extended and decomposable digraphs1997-10-07Paper
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian1997-09-17Paper
On \(k\)-strong and \(k\)-cyclic digraphs1997-06-10Paper
A classification of locally semicomplete digraphs1997-06-09Paper
https://portal.mardi4nfdi.de/entity/Q48881111996-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48634191996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48737911996-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48736841996-04-17Paper
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs1996-04-08Paper
Weakly Hamiltonian-connected ordinary multipartite tournaments1996-03-10Paper
https://portal.mardi4nfdi.de/entity/Q48655241996-02-25Paper
Digraphs with the path‐merging property1996-02-20Paper
Quasi‐transitive digraphs1996-02-08Paper
Hereditarily hard \(H\)-colouring problems1995-07-19Paper
Weakly hamiltonian-connected vertices in bipartite tournaments1995-07-02Paper
In-tournament digraphs1994-08-17Paper
Cycles through \(k\) vertices in bipartite tournaments1994-08-11Paper
On chordal proper circular arc graphs1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q42738481994-01-06Paper
On the complexity of colouring by superdigraphs of bipartite graphs1993-10-14Paper
https://portal.mardi4nfdi.de/entity/Q42019321993-09-06Paper
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs1993-05-16Paper
Unsolved problems presented at the Julius Petersen graph theory conference1993-01-16Paper
On the structure of locally semicomplete digraphs1993-01-16Paper
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39870411992-06-28Paper
A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs1992-06-28Paper
Edge-disjoint in- and out-branchings in tournaments and related path problems1991-01-01Paper
The effect of two cycles on the complexity of colourings by directed graphs1990-01-01Paper
Locally semicomplete digraphs: A generalization of tournaments1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38153281989-01-01Paper
The Complexity of Colouring by Semicomplete Digraphs1988-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jörgen Bang-Jensen