Jørgen Bang-Jensen

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 69

Top Venues

Publications

Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo
Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. 346 (2024)
Jørgen Bang-Jensen, Stéphane Bessy, Lucas Picasarri-Arrieta
Constrained flows in networks. Theor. Comput. Sci. 1010 (2024)
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory 102 (3) (2023)
Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. ESA (2023)
Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta
Constrained Flows in Networks. CoRR (2023)
Jørgen Bang-Jensen, Anders Yeo
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties. Theor. Comput. Sci. 949 (2023)
Jørgen Bang-Jensen, Kasper Skov Johansen, Anders Yeo
Making a tournament k $k$-strong. J. Graph Theory 103 (1) (2023)
Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. Theor. Comput. Sci. 973 (2023)
Jørgen Bang-Jensen, Kasper Skov Johansen
-linked. Discret. Math. 345 (6) (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta
Complexity of some arc-partition problems for digraphs. Theor. Comput. Sci. 928 (2022)
Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz
Digraphs and Variable Degeneracy. SIAM J. Discret. Math. 36 (1) (2022)
Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory 99 (4) (2022)
Jørgen Bang-Jensen, Matthias Kriesell
Good acyclic orientations of 4-regular 4-connected graphs. J. Graph Theory 100 (4) (2022)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. Algorithmica 84 (9) (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. J. Graph Theory 100 (2) (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. Graphs Comb. 38 (6) (2022)
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
On Supereulerian 2-Edge-Coloured Graphs. Graphs Comb. 37 (6) (2021)
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
Proper-walk connection number of graphs. J. Graph Theory 96 (1) (2021)
Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell
Good orientations of unions of edge-disjoint spanning trees. J. Graph Theory 96 (4) (2021)
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
On the inversion number of oriented graphs. Discret. Math. Theor. Comput. Sci. 23 (2) (2021)
Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh
k-Distinct Branchings Admits a Polynomial Kernel. ESA (2021)
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
On the inversion number of oriented graphs. CoRR (2021)
Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy
Out-colourings of digraphs. J. Graph Theory 93 (1) (2020)
Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
On the parameterized complexity of 2-partitions. Theor. Comput. Sci. 844 (2020)
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
On DP-coloring of digraphs. J. Graph Theory 95 (1) (2020)
Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
Non-separating spanning trees and out-branchings in digraphsof independence number 2. CoRR (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. CoRR (2020)
Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. Discret. Math. 343 (12) (2020)
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
Hajós and Ore Constructions for Digraphs. Electron. J. Comb. 27 (1) (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. IPEC (2020)
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
The directed 2-linkage problem with length constraints. Theor. Comput. Sci. 814 (2020)
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory 95 (2) (2020)
Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
On the parameterized complexity of 2-partitions. CoRR (2020)
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
Inversion number of an oriented graph and related parameters. ALGOS (2020)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Bipartite spanning sub(di)graphs induced by 2-partitions. J. Graph Theory 92 (2) (2019)
Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Anders Yeo
Safe sets in digraphs. CoRR (2019)
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. CoRR (2019)
Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh, Meirav Zehavi
The parameterized complexity landscape of finding 2-partitions of digraphs. Theor. Comput. Sci. 795 (2019)
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
The directed 2-linkage problem with length constraints. CoRR (2019)
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
Connecting edge-colouring. CoRR (2019)
Jørgen Bang-Jensen, Stéphane Bessy
Degree-constrained 2-partitions of graphs. Theor. Comput. Sci. 776 (2019)
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
Spanning eulerian subdigraphs in semicomplete digraphs. CoRR (2019)
Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA (2018)
Jørgen Bang-Jensen, Jing Huang, Xuding Zhu
Completing orientations of partially oriented graphs. J. Graph Theory 87 (3) (2018)
Jørgen Bang-Jensen, Stéphane Bessy
Degree-constrained 2-partitions of graphs. CoRR (2018)
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
χ-bounded families of oriented graphs. J. Graph Theory 89 (3) (2018)
Jørgen Bang-Jensen, Tilde My Christiansen
Degree constrained 2-partitions of semicomplete digraphs. Theor. Comput. Sci. 746 (2018)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Out-degree reducing partitions of digraphs. Theor. Comput. Sci. 719 (2018)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Out-degree reducing partitions of digraphs. CoRR (2017)
Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy
Out-colourings of Digraphs. CoRR (2017)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR (2017)
Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell
Antistrong digraphs. J. Comb. Theory, Ser. B 122 (2017)
Jørgen Bang-Jensen, Tilde My Christiansen, Alessandro Maddaloni
Disjoint Paths in Decomposable Digraphs. J. Graph Theory 85 (2) (2017)
Jørgen Bang-Jensen, Tilde My Larsen
DAG-Width and Circumference of Digraphs. J. Graph Theory 82 (2) (2016)
Jørgen Bang-Jensen, Alessandro Maddaloni, Saket Saurabh
Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments. Algorithmica 76 (2) (2016)
Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet
Finding good 2-partitions of digraphs II. Enumerable properties. Theor. Comput. Sci. 640 (2016)
Jørgen Bang-Jensen, Saket Saurabh, Sven Simonsen
Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs. Algorithmica 76 (1) (2016)
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen
Arc-Disjoint Directed and Undirected Cycles in Digraphs. J. Graph Theory 83 (4) (2016)
Jørgen Bang-Jensen, Frédéric Havet
Finding good 2-partitions of digraphs I. Hereditary properties. Theor. Comput. Sci. 636 (2016)
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
The complexity of finding arc-disjoint branching flows. Discret. Appl. Math. 209 (2016)
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
$χ$-bounded families of oriented graphs. CoRR (2016)
Jørgen Bang-Jensen, Carl Johan Casselgren
Restricted cycle factors and arc-decompositions of digraphs. Discret. Appl. Math. 193 (2015)
Jørgen Bang-Jensen, Magnús M. Halldórsson
Vertex coloring edge-weighted digraphs. Inf. Process. Lett. 115 (10) (2015)
Jørgen Bang-Jensen, Tilde My Larsen
DAG-width and circumference of digraphs. CoRR (2015)
Jørgen Bang-Jensen, Stéphane Bessy
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. J. Graph Theory 79 (4) (2015)
Jørgen Bang-Jensen, Alessandro Maddaloni
Sufficient Conditions for a Digraph to be Supereulerian. J. Graph Theory 79 (1) (2015)
Jørgen Bang-Jensen, Jing Huang, Xuding Zhu
Completing orientations of partially oriented graphs. CoRR (2015)
Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia
Finding a subdivision of a digraph. Theor. Comput. Sci. 562 (2015)
Jørgen Bang-Jensen, Anders Yeo
Balanced branchings in digraphs. Theor. Comput. Sci. 595 (2015)
Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. J. Graph Theory 75 (3) (2014)
Jørgen Bang-Jensen, Jing Huang
Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs. J. Graph Theory 77 (4) (2014)
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen
Vertex-disjoint directed and undirected cycles in general digraphs. J. Comb. Theory, Ser. B 106 (2014)
Jørgen Bang-Jensen, Anders Yeo
The complexity of multicut and mixed multicut problems in (di)graphs. Theor. Comput. Sci. 520 (2014)
Jørgen Bang-Jensen, Stéphane Bessy
(Arc-)disjoint flows in networks. Theor. Comput. Sci. 526 (2014)
Jørgen Bang-Jensen, Alessandro Maddaloni
Arc-Disjoint Paths in Decomposable Digraphs. J. Graph Theory 77 (2) (2014)
Jørgen Bang-Jensen, Sven Simonsen
Arc-disjoint paths and trees in 2-regular digraphs. Discret. Appl. Math. 161 (16-17) (2013)
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
Finding an induced subdivision of a digraph. CoRR (2013)
Jørgen Bang-Jensen, Daniel Gonçalves, Anders Yeo
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties. Theor. Comput. Sci. 475 (2013)
Jørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen
Quasi-hamiltonian paths in semicomplete multipartite digraphs. Discret. Appl. Math. 161 (7-8) (2013)
Jørgen Bang-Jensen, Anders Yeo
Arc-disjoint spanning sub(di)graphs in digraphs. Theor. Comput. Sci. 438 (2012)
Jørgen Bang-Jensen, Jing Huang
Decomposing locally semicomplete digraphs into strong spanning subdigraphs. J. Comb. Theory, Ser. B 102 (3) (2012)
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
Finding an induced subdivision of a digraph. Theor. Comput. Sci. 443 (2012)
Jørgen Bang-Jensen, Sven Simonsen
Arc-Disjoint Paths and Trees in 2-Regular Digraphs CoRR (2012)
Jørgen Bang-Jensen, Rune Larsen
Efficient algorithms for real-life instances of the variable size bin packing problem. Comput. Oper. Res. 39 (11) (2012)
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
Finding an induced subdivision of a digraph. Electron. Notes Discret. Math. 37 (2011)
Gary MacGillivray, Jacobus Swarts, Jørgen Bang-Jensen
A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles. Contributions Discret. Math. 6 (2) (2011)
Jørgen Bang-Jensen, Matthias Kriesell
On the problem of finding disjoint cycles and dicycles in a digraph. Comb. 31 (6) (2011)
Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts
The complexity of colouring by locally semicomplete digraphs. Discret. Math. 310 (20) (2010)
Jørgen Bang-Jensen, Tibor Jordán
Spanning 2-strong tournaments in 3-strong semicomplete digraphs. Discret. Math. 310 (9) (2010)
Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. Networks 55 (4) (2010)
Jørgen Bang-Jensen, Yury Nikulin
Heuristics for the central tree problem. J. Heuristics 16 (5) (2010)
Jørgen Bang-Jensen
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. Discret. Math. 309 (18) (2009)
Jørgen Bang-Jensen, Matthias Kriesell
Disjoint sub(di)graphs in digraphs. Electron. Notes Discret. Math. 34 (2009)
Jørgen Bang-Jensen, Matthias Kriesell
Disjoint directed and undirected paths and cycles in digraphs. Theor. Comput. Sci. 410 (47-49) (2009)
Jørgen Bang-Jensen
k-strong spanning local tournaments in locally semicomplete digraphs. Discret. Appl. Math. 157 (11) (2009)
Jørgen Bang-Jensen, Tibor Jordán
On persistent directed graphs. Networks 52 (4) (2008)
Jørgen Bang-Jensen, Morten Hegner Nielsen
Minimum cycle factors in quasi-transitive digraphs. Discret. Optim. 5 (1) (2008)
Jørgen Bang-Jensen, Anders Yeo
The minimum spanning strong subdigraph problem is fixed parameter tractable. Discret. Appl. Math. 156 (15) (2008)
Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen
Mixed Models for the Analysis of Local Search Components. SLS (2007)
Jørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. Discret. Optim. 4 (3-4) (2007)

Jørgen Bang-Jensen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jørgen Bang-Jensen