Jørgen Bang-Jensen
Orcid: 0000-0001-5783-7125Affiliations:
- University of Southern Denmark, Odense, Denmark
According to our database1,
Jørgen Bang-Jensen
authored at least 155 papers
between 1988 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
2025
0
1
2
3
4
5
6
7
8
9
10
3
1
3
4
8
4
8
5
4
2
7
6
6
3
4
2
4
4
3
2
2
1
7
4
1
2
4
6
7
6
4
6
2
2
5
1
2
1
1
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on imada.sdu.dk
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2025
2024
2023
Theor. Comput. Sci., September, 2023
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties.
Theor. Comput. Sci., March, 2023
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.
J. Graph Theory, 2022
J. Graph Theory, 2022
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2.
Graphs Comb., 2022
Every (13<i>k</i> - 6)-strong tournament with minimum out-degree at least 28<i>k</i> - 13 is <i>k</i>-linked.
Discret. Math., 2022
2021
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020
J. Graph Theory, 2020
Discret. Math., 2020
Non-separating spanning trees and out-branchings in digraphsof independence number 2.
CoRR, 2020
Proceedings of the First International Conference "Algebras, graphs and ordered sets", 2020
2019
Theor. Comput. Sci., 2019
2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Classes of Directed Graphs., 2018
Proceedings of the Classes of Directed Graphs., 2018
Proceedings of the Classes of Directed Graphs., 2018
2017
2016
Theor. Comput. Sci., 2016
Theor. Comput. Sci., 2016
Algorithmica, 2016
Algorithmica, 2016
2015
J. Graph Theory, 2015
Discret. Appl. Math., 2015
2014
Theor. Comput. Sci., 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
J. Comb. Theory 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
Discret. Appl. Math., 2013
2012
J. Comb. Theory B, 2012
Efficient algorithms for real-life instances of the variable size bin packing problem.
Comput. Oper. Res., 2012
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
Discret. Math., 2010
2009
Theor. Comput. Sci., 2009
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs.
Discret. Math., 2009
Discret. Appl. Math., 2009
Digraphs - Theory, Algorithms and Applications, Second Edition.
Springer Monographs in Mathematics, Springer, ISBN: 978-1-84800-997-4, 2009
2008
Discret. Appl. Math., 2008
2007
Discret. Optim., 2007
Recognizing and representing proper interval graphs in parallel using merging and sorting.
Discret. Appl. Math., 2007
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
2006
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs.
Discret. Optim., 2006
2005
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
J. Graph Theory, 2004
Splitting off edges between two subsets preserving the edge-connectivity of the graph.
Discret. Math., 2004
Discret. Appl. Math., 2004
2003
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs.
SIAM J. Discret. Math., 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
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
Electron. Notes Discret. Math., 2001
2000
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph.
J. Algorithms, 2000
Electron. Notes Discret. Math., 2000
Discret. Math., 2000
1999
SIAM J. Discret. Math., 1999
Discret. Math., 1999
Discret. Appl. Math., 1999
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.
Discret. Appl. Math., 1999
1998
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs.
J. Graph Theory, 1998
Discret. Math., 1998
Discret. Appl. Math., 1998
1997
Discret. Math., 1997
Discret. Math., 1997
Comb. Probab. Comput., 1997
Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.
Algorithmica, 1997
1996
Discret. Math., 1996
1995
SIAM J. Discret. Math., 1995
J. Comb. Theory B, 1995
1994
1993
Discret. Appl. Math., 1993
1992
SIAM J. Discret. Math., 1992
J. Algorithms, 1992
Discret. Math., 1992
Discret. Math., 1992
1991
J. Comb. Theory B, 1991
Eulerian trails through a set of terminals in specific, unique and all orders.
Proceedings of the Graph Structure Theory, 1991
1990
J. Graph Theory, 1990
Discret. Appl. Math., 1990
1988