Jørgen Bang-Jensen

According to our database1, Jørgen Bang-Jensen authored at least 134 papers between 1988 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
The directed 2-linkage problem with length constraints.
Theor. Comput. Sci., 2020

On the parameterized complexity of 2-partitions.
Theor. Comput. Sci., 2020

Arc-disjoint strong spanning subdigraphs of semicomplete compositions.
J. Graph Theory, 2020

On DP-coloring of digraphs.
J. Graph Theory, 2020

Out-colourings of digraphs.
J. Graph Theory, 2020

Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments.
Discret. Math., 2020

Non-separating spanning trees and out-branchings in digraphsof independence number 2.
CoRR, 2020

Hajós and Ore Constructions for Digraphs.
Electron. J. Comb., 2020

Component Order Connectivity in Directed Graphs.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019
The parameterized complexity landscape of finding 2-partitions of digraphs.
Theor. Comput. Sci., 2019

Degree-constrained 2-partitions of graphs.
Theor. Comput. Sci., 2019

Bipartite spanning sub(di)graphs induced by 2-partitions.
J. Graph Theory, 2019

Safe sets in digraphs.
CoRR, 2019

Connecting edge-colouring.
CoRR, 2019

Spanning eulerian subdigraphs in semicomplete digraphs.
CoRR, 2019

2018
Degree constrained 2-partitions of semicomplete digraphs.
Theor. Comput. Sci., 2018

Out-degree reducing partitions of digraphs.
Theor. Comput. Sci., 2018

Completing orientations of partially oriented graphs.
J. Graph Theory, 2018

χ-bounded families of oriented graphs.
J. Graph Theory, 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Tournaments and Semicomplete Digraphs.
Proceedings of the Classes of Directed Graphs., 2018

Basic Terminology, Notation and Results.
Proceedings of the Classes of Directed Graphs., 2018

Locally Semicomplete Digraphs and Generalizations.
Proceedings of the Classes of Directed Graphs., 2018

2017
Disjoint Paths in Decomposable Digraphs.
J. Graph Theory, 2017

Antistrong digraphs.
J. Comb. Theory, Ser. B, 2017

2016
Finding good 2-partitions of digraphs I. Hereditary properties.
Theor. Comput. Sci., 2016

Finding good 2-partitions of digraphs II. Enumerable properties.
Theor. Comput. Sci., 2016

DAG-Width and Circumference of Digraphs.
J. Graph Theory, 2016

Arc-Disjoint Directed and Undirected Cycles in Digraphs.
J. Graph Theory, 2016

The complexity of finding arc-disjoint branching flows.
Discret. Appl. Math., 2016

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs.
Algorithmica, 2016

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments.
Algorithmica, 2016

2015
Balanced branchings in digraphs.
Theor. Comput. Sci., 2015

Finding a subdivision of a digraph.
Theor. Comput. Sci., 2015

Sufficient Conditions for a Digraph to be Supereulerian.
J. Graph Theory, 2015

Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles.
J. Graph Theory, 2015

Vertex coloring edge-weighted digraphs.
Inf. Process. Lett., 2015

Restricted cycle factors and arc-decompositions of digraphs.
Discret. Appl. Math., 2015

2014
The complexity of multicut and mixed multicut problems in (di)graphs.
Theor. Comput. Sci., 2014

(Arc-)disjoint flows in networks.
Theor. Comput. Sci., 2014

Arc-Disjoint Paths in Decomposable Digraphs.
J. Graph Theory, 2014

Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs.
J. Graph Theory, 2014

Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments.
J. Graph Theory, 2014

Vertex-disjoint directed and undirected cycles in general digraphs.
J. Comb. Theory, Ser. B, 2014

2013
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties.
Theor. Comput. Sci., 2013

Arc-disjoint paths and trees in 2-regular digraphs.
Discret. Appl. Math., 2013

Quasi-hamiltonian paths in semicomplete multipartite digraphs.
Discret. Appl. Math., 2013

2012
Arc-disjoint spanning sub(di)graphs in digraphs.
Theor. Comput. Sci., 2012

Decomposing locally semicomplete digraphs into strong spanning subdigraphs.
J. Comb. Theory, Ser. B, 2012

Efficient algorithms for real-life instances of the variable size bin packing problem.
Comput. Oper. Res., 2012

2011
Finding an induced subdivision of a digraph.
Electron. Notes Discret. Math., 2011

On the problem of finding disjoint cycles and dicycles in a digraph.
Comb., 2011

A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles.
Contributions Discret. Math., 2011

2010
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation.
Networks, 2010

Heuristics for the central tree problem.
J. Heuristics, 2010

The complexity of colouring by locally semicomplete digraphs.
Discret. Math., 2010

Spanning 2-strong tournaments in 3-strong semicomplete digraphs.
Discret. Math., 2010

2009
Disjoint directed and undirected paths and cycles in digraphs.
Theor. Comput. Sci., 2009

Disjoint sub(di)graphs in digraphs.
Electron. Notes Discret. Math., 2009

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs.
Discret. Math., 2009

k-strong spanning local tournaments in locally semicomplete digraphs.
Discret. Appl. Math., 2009

Digraphs - Theory, Algorithms and Applications, Second Edition.
Springer Monographs in Mathematics, Springer, ISBN: 978-1-84800-997-4, 2009

2008
On persistent directed graphs.
Networks, 2008

Minimum cycle factors in quasi-transitive digraphs.
Discret. Optim., 2008

The minimum spanning strong subdigraph problem is fixed parameter tractable.
Discret. Appl. Math., 2008

2007
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.
Discret. Optim., 2007

Recognizing and representing proper interval graphs in parallel using merging and sorting.
Discret. Appl. Math., 2007

Mixed Models for the Analysis of Local Search Components.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

2006
Longest path partitions in generalizations of tournaments.
Discret. Math., 2006

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs.
Discret. Optim., 2006

2005
Finding complementary cycles in locally semicomplete digraphs.
Discret. Appl. Math., 2005

2004
Spanning <i>k</i>-arc-strong subdigraphs with few arcs in <i>k</i>-arc-strong tournaments.
J. Graph Theory, 2004

Subgraphs in vertex neighborhoods of <i>K<sub>r</sub></i>-free graphs.
J. Graph Theory, 2004

Splitting off edges between two subsets preserving the edge-connectivity of the graph.
Discret. Math., 2004

The structure of strong arc-locally semicomplete digraphs.
Discret. Math., 2004

When the greedy algorithm fails.
Discret. Optim., 2004

Making a tournament k-arc-strong by reversing or deorienting arcs.
Discret. Appl. Math., 2004

Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs.
Comb., 2004

2003
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs.
SIAM J. Discret. Math., 2003

Small degree out-branchings.
J. Graph Theory, 2003

Steiner type problems for digraphs that are locally semicomplete or extended semicomplete.
J. Graph Theory, 2003

Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs.
Discret. Appl. Math., 2003

2002
Convex-round graphs are circular-perfect.
J. Graph Theory, 2002

Digraphs - theory, algorithms and applications.
Springer, ISBN: 978-1-85233-611-0, 2002

2001
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.
J. Algorithms, 2001

Making a tournament k-arc-strong by reversing arcs.
Electron. Notes Discret. Math., 2001

2000
Convex-Round and Concave-Round Graphs.
SIAM J. Discret. Math., 2000

Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph.
J. Algorithms, 2000

Problems concerning global connectivity of directed graphs.
Electron. Notes Discret. Math., 2000

Complementary cycles containing prescribed vertices in tournaments.
Discret. Math., 2000

1999
Edge-Connectivity Augmentation with Partition Constraints.
SIAM J. Discret. Math., 1999

Augmenting hypergraphs by edges of size two.
Math. Program., 1999

A note on vertex pancyclic oriented graphs.
J. Graph Theory, 1999

Linkages in locally semicomplete digraphs and quasi-transitive digraphs.
Discret. Math., 1999

A New Sufficient Condition for a Digraph to Be Hamiltonian.
Discret. Appl. Math., 1999

On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.
Discret. Appl. Math., 1999

1998
Edge-Connectivity Augmentation Preserving Simplicity.
SIAM J. Discret. Math., 1998

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs.
J. Graph Theory, 1998

Generalizations of tournaments: A survey.
J. Graph Theory, 1998

Kings in quasi-transitive digraphs.
Discret. Math., 1998

Alternating cycles and trails in 2-edge-coloured complete multigraphs.
Discret. Math., 1998

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs.
Discret. Appl. Math., 1998

Adding and Reversing Arcs in Semicomplete Digraphs.
Comb. Probab. Comput., 1998

1997
A classification of locally semicomplete digraphs.
Discret. Math., 1997

Alternating cycles and paths in edge-coloured multigraphs: A survey.
Discret. Math., 1997

Paths and cycles in extended and decomposable digraphs<sup>, </sup>.
Discret. Math., 1997

Vertex heaviest paths and cycles in quasi-transitive digraphs.
Discret. Math., 1997

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments.
Comb. Probab. Comput., 1997

Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.
Algorithmica, 1997

1996
Weakly Hamiltonian-connected locally semicomplete digraphs.
J. Graph Theory, 1996

Sufficient conditions for a digraph to be Hamiltonian.
J. Graph Theory, 1996

On k-strong and k-cyclic digraphs.
Discret. Math., 1996

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian.
Discret. Math., 1996

1995
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs.
SIAM J. Discret. Math., 1995

Quasi-transitive digraphs.
J. Graph Theory, 1995

Digraphs with the path-merging property.
J. Graph Theory, 1995

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.
J. Comb. Theory, Ser. B, 1995

Hereditarily hard H-colouring problems.
Discret. Math., 1995

Weakly Hamiltonian-connected ordinary multipartite tournaments.
Discret. Math., 1995

1994
On chordal proper circular arc graphs.
Discret. Math., 1994

Cycles Through <i>k</i> Vertices in Bipartite Tournaments.
Comb., 1994

1993
In-Tournament Digraphs.
J. Comb. Theory, Ser. B, 1993

Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs.
Discret. Appl. Math., 1993

1992
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs.
SIAM J. Discret. Math., 1992

A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.
J. Algorithms, 1992

Unsolved problems presented at the Julius Petersen Graph Theory Conference.
Discret. Math., 1992

On the complexity of colouring by superdigraphs of bipartite graphs.
Discret. Math., 1992

On the structure of locally semicomplete digraphs.
Discret. Math., 1992

1991
Edge-disjoint in- and out-branchings in tournaments and related path problems.
J. Comb. Theory, Ser. B, 1991

Eulerian trails through a set of terminals in specific, unique and all orders.
Proceedings of the Graph Structure Theory, 1991

1990
Locally semicomplete digraphs: A generalization of tournaments.
J. Graph Theory, 1990

The effect of two cycles on the complexity of colourings by directed graphs.
Discret. Appl. Math., 1990

Local Tournaments and Proper Circular Arc Gaphs.
Proceedings of the Algorithms, 1990

1988
The Complexity of Colouring by Semicomplete Digraphs.
SIAM J. Discret. Math., 1988


  Loading...