default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJørgen Bang-Jensen
Person information
- affiliation: University of Southern Denmark, Odense, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j140]Yandong Bai
, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo:
Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. 346: 215-227 (2024)- [j139]Jørgen Bang-Jensen, Y. Wang:
Arc-disjoint out- and in-branchings in compositions of digraphs. Eur. J. Comb. 120: 103981 (2024) - [j138]Jørgen Bang-Jensen, Stéphane Bessy, Lucas Picasarri-Arrieta:
Constrained flows in networks. Theor. Comput. Sci. 1010: 114702 (2024) - 2023
- [j137]Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo:
Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory 102(3): 578-606 (2023) - [j136]Jørgen Bang-Jensen, Kasper Skov Johansen, Anders Yeo:
Making a tournament k $k$-strong. J. Graph Theory 103(1): 5-11 (2023) - [j135]Jørgen Bang-Jensen, Anders Yeo:
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties. Theor. Comput. Sci. 949: 113758 (2023) - [j134]Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell:
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. Theor. Comput. Sci. 973: 114097 (2023) - [c11]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: 13:1-13:15 - [i19]Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta:
Constrained Flows in Networks. CoRR abs/2310.01042 (2023) - 2022
- [j133]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. Algorithmica 84(9): 2767-2784 (2022) - [j132]Jørgen Bang-Jensen, Kasper Skov Johansen:
Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked. Discret. Math. 345(6): 112831 (2022) - [j131]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): 187 (2022) - [j130]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): 615-636 (2022) - [j129]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): 294-314 (2022) - [j128]Jørgen Bang-Jensen, Matthias Kriesell:
Good acyclic orientations of 4-regular 4-connected graphs. J. Graph Theory 100(4): 698-720 (2022) - [j127]Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz:
Digraphs and Variable Degeneracy. SIAM J. Discret. Math. 36(1): 578-595 (2022) - [j126]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: 167-182 (2022) - 2021
- [j125]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) - [j124]Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
On Supereulerian 2-Edge-Coloured Graphs. Graphs Comb. 37(6): 2601-2620 (2021) - [j123]Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
Proper-walk connection number of graphs. J. Graph Theory 96(1): 137-159 (2021) - [j122]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): 594-618 (2021) - [c10]Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh:
k-Distinct Branchings Admits a Polynomial Kernel. ESA 2021: 11:1-11:15 - [i18]Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet:
On the inversion number of oriented graphs. CoRR abs/2105.04137 (2021) - 2020
- [j121]Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz:
Hajós and Ore Constructions for Digraphs. Electron. J. Comb. 27(1): 1 (2020) - [j120]Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo:
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. Discret. Math. 343(12): 112129 (2020) - [j119]Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy:
Out-colourings of digraphs. J. Graph Theory 93(1): 88-112 (2020) - [j118]Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz:
On DP-coloring of digraphs. J. Graph Theory 95(1): 76-98 (2020) - [j117]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory 95(2): 267-289 (2020) - [j116]Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo:
The directed 2-linkage problem with length constraints. Theor. Comput. Sci. 814: 69-73 (2020) - [j115]Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo:
On the parameterized complexity of 2-partitions. Theor. Comput. Sci. 844: 97-105 (2020) - [c9]Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet:
Inversion number of an oriented graph and related parameters. ALGOS 2020: 101-121 - [c8]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. IPEC 2020: 2:1-2:16 - [i17]Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo:
On the parameterized complexity of 2-partitions. CoRR abs/2003.07190 (2020) - [i16]Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo:
Non-separating spanning trees and out-branchings in digraphsof independence number 2. CoRR abs/2007.02834 (2020) - [i15]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. CoRR abs/2007.06896 (2020)
2010 – 2019
- 2019
- [j114]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): 130-151 (2019) - [j113]Jørgen Bang-Jensen, Stéphane Bessy:
Degree-constrained 2-partitions of graphs. Theor. Comput. Sci. 776: 64-74 (2019) - [j112]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: 108-114 (2019) - [i14]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. CoRR abs/1903.12225 (2019) - [i13]Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo:
Spanning eulerian subdigraphs in semicomplete digraphs. CoRR abs/1905.11019 (2019) - [i12]Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
Connecting edge-colouring. CoRR abs/1907.00428 (2019) - [i11]Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo:
The directed 2-linkage problem with length constraints. CoRR abs/1907.00817 (2019) - [i10]Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Anders Yeo:
Safe sets in digraphs. CoRR abs/1908.06664 (2019) - 2018
- [j111]Jørgen Bang-Jensen, Jing Huang, Xuding Zhu:
Completing orientations of partially oriented graphs. J. Graph Theory 87(3): 285-304 (2018) - [j110]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): 304-326 (2018) - [j109]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Out-degree reducing partitions of digraphs. Theor. Comput. Sci. 719: 64-72 (2018) - [j108]Jørgen Bang-Jensen, Tilde My Christiansen:
Degree constrained 2-partitions of semicomplete digraphs. Theor. Comput. Sci. 746: 112-123 (2018) - [c7]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: 2838-2850 - [p3]Jørgen Bang-Jensen, Gregory Z. Gutin:
Basic Terminology, Notation and Results. Classes of Directed Graphs 2018: 1-34 - [p2]Jørgen Bang-Jensen, Frédéric Havet:
Tournaments and Semicomplete Digraphs. Classes of Directed Graphs 2018: 35-124 - [p1]Jørgen Bang-Jensen:
Locally Semicomplete Digraphs and Generalizations. Classes of Directed Graphs 2018: 245-296 - [e1]Jørgen Bang-Jensen, Gregory Z. Gutin:
Classes of Directed Graphs. Springer Monographs in Mathematics, Springer 2018, ISBN 978-3-319-71839-2 [contents] - [i9]Jørgen Bang-Jensen, Stéphane Bessy:
Degree-constrained 2-partitions of graphs. CoRR abs/1801.06216 (2018) - 2017
- [j107]Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell:
Antistrong digraphs. J. Comb. Theory B 122: 68-90 (2017) - [j106]Jørgen Bang-Jensen, Tilde My Christiansen, Alessandro Maddaloni:
Disjoint Paths in Decomposable Digraphs. J. Graph Theory 85(2): 545-567 (2017) - [i8]Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy:
Out-colourings of Digraphs. CoRR abs/1706.06441 (2017) - [i7]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Out-degree reducing partitions of digraphs. CoRR abs/1707.09349 (2017) - [i6]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR abs/1707.09400 (2017) - 2016
- [j105]Jørgen Bang-Jensen, Saket Saurabh, Sven Simonsen:
Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs. Algorithmica 76(1): 279-296 (2016) - [j104]Jørgen Bang-Jensen, Alessandro Maddaloni, Saket Saurabh:
Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments. Algorithmica 76(2): 320-343 (2016) - [j103]Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo:
The complexity of finding arc-disjoint branching flows. Discret. Appl. Math. 209: 16-26 (2016) - [j102]Jørgen Bang-Jensen, Tilde My Larsen:
DAG-Width and Circumference of Digraphs. J. Graph Theory 82(2): 194-206 (2016) - [j101]Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen:
Arc-Disjoint Directed and Undirected Cycles in Digraphs. J. Graph Theory 83(4): 406-420 (2016) - [j100]Jørgen Bang-Jensen, Frédéric Havet:
Finding good 2-partitions of digraphs I. Hereditary properties. Theor. Comput. Sci. 636: 85-94 (2016) - [j99]Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet:
Finding good 2-partitions of digraphs II. Enumerable properties. Theor. Comput. Sci. 640: 1-19 (2016) - [i5]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 abs/1605.07411 (2016) - 2015
- [j98]Jørgen Bang-Jensen, Carl Johan Casselgren:
Restricted cycle factors and arc-decompositions of digraphs. Discret. Appl. Math. 193: 80-93 (2015) - [j97]Jørgen Bang-Jensen, Magnús M. Halldórsson:
Vertex coloring edge-weighted digraphs. Inf. Process. Lett. 115(10): 791-796 (2015) - [j96]Jørgen Bang-Jensen, Alessandro Maddaloni:
Sufficient Conditions for a Digraph to be Supereulerian. J. Graph Theory 79(1): 8-20 (2015) - [j95]Jørgen Bang-Jensen, Stéphane Bessy:
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. J. Graph Theory 79(4): 249-266 (2015) - [j94]Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia:
Finding a subdivision of a digraph. Theor. Comput. Sci. 562: 283-303 (2015) - [j93]Jørgen Bang-Jensen, Anders Yeo:
Balanced branchings in digraphs. Theor. Comput. Sci. 595: 107-119 (2015) - [i4]Jørgen Bang-Jensen, Tilde My Larsen:
DAG-width and circumference of digraphs. CoRR abs/1502.03241 (2015) - [i3]Jørgen Bang-Jensen, Jing Huang, Xuding Zhu:
Completing orientations of partially oriented graphs. CoRR abs/1509.01301 (2015) - 2014
- [j92]Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen:
Vertex-disjoint directed and undirected cycles in general digraphs. J. Comb. Theory B 106: 1-14 (2014) - [j91]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): 284-302 (2014) - [j90]Jørgen Bang-Jensen, Alessandro Maddaloni:
Arc-Disjoint Paths in Decomposable Digraphs. J. Graph Theory 77(2): 89-110 (2014) - [j89]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): 278-298 (2014) - [j88]Jørgen Bang-Jensen, Anders Yeo:
The complexity of multicut and mixed multicut problems in (di)graphs. Theor. Comput. Sci. 520: 87-96 (2014) - [j87]Jørgen Bang-Jensen, Stéphane Bessy:
(Arc-)disjoint flows in networks. Theor. Comput. Sci. 526: 28-40 (2014) - 2013
- [j86]Jørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen:
Quasi-hamiltonian paths in semicomplete multipartite digraphs. Discret. Appl. Math. 161(7-8): 889-898 (2013) - [j85]Jørgen Bang-Jensen, Sven Simonsen:
Arc-disjoint paths and trees in 2-regular digraphs. Discret. Appl. Math. 161(16-17): 2724-2730 (2013) - [j84]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: 13-20 (2013) - [i2]Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon:
Finding an induced subdivision of a digraph. CoRR abs/1309.1553 (2013) - 2012
- [j83]Jørgen Bang-Jensen, Rune Larsen:
Efficient algorithms for real-life instances of the variable size bin packing problem. Comput. Oper. Res. 39(11): 2848-2857 (2012) - [j82]Jørgen Bang-Jensen, Jing Huang:
Decomposing locally semicomplete digraphs into strong spanning subdigraphs. J. Comb. Theory B 102(3): 701-714 (2012) - [j81]Jørgen Bang-Jensen, Anders Yeo:
Arc-disjoint spanning sub(di)graphs in digraphs. Theor. Comput. Sci. 438: 48-54 (2012) - [j80]Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon:
Finding an induced subdivision of a digraph. Theor. Comput. Sci. 443: 10-24 (2012) - [i1]Jørgen Bang-Jensen, Sven Simonsen:
Arc-Disjoint Paths and Trees in 2-Regular Digraphs. CoRR abs/1203.4705 (2012) - 2011
- [j79]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) - [j78]Jørgen Bang-Jensen, Matthias Kriesell:
On the problem of finding disjoint cycles and dicycles in a digraph. Comb. 31(6): 639-668 (2011) - [j77]Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon:
Finding an induced subdivision of a digraph. Electron. Notes Discret. Math. 37: 9-14 (2011) - 2010
- [j76]Jørgen Bang-Jensen, Tibor Jordán:
Spanning 2-strong tournaments in 3-strong semicomplete digraphs. Discret. Math. 310(9): 1424-1428 (2010) - [j75]Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts:
The complexity of colouring by locally semicomplete digraphs. Discret. Math. 310(20): 2675-2684 (2010) - [j74]Jørgen Bang-Jensen, Yury Nikulin:
Heuristics for the central tree problem. J. Heuristics 16(5): 633-651 (2010) - [j73]Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling:
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. Networks 55(4): 299-325 (2010)
2000 – 2009
- 2009
- [b2]Jørgen Bang-Jensen, Gregory Z. Gutin:
Digraphs - Theory, Algorithms and Applications, Second Edition. Springer Monographs in Mathematics, Springer 2009, ISBN 978-1-84800-997-4, pp. I-XXII, 1-795 - [j72]Jørgen Bang-Jensen:
k-strong spanning local tournaments in locally semicomplete digraphs. Discret. Appl. Math. 157(11): 2536-2540 (2009) - [j71]Jørgen Bang-Jensen:
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. Discret. Math. 309(18): 5655-5667 (2009) - [j70]Jørgen Bang-Jensen, Matthias Kriesell:
Disjoint sub(di)graphs in digraphs. Electron. Notes Discret. Math. 34: 179-183 (2009) - [j69]Jørgen Bang-Jensen, Matthias Kriesell:
Disjoint directed and undirected paths and cycles in digraphs. Theor. Comput. Sci. 410(47-49): 5138-5144 (2009) - 2008
- [j68]Jørgen Bang-Jensen, Anders Yeo:
The minimum spanning strong subdigraph problem is fixed parameter tractable. Discret. Appl. Math. 156(15): 2924-2929 (2008) - [j67]Jørgen Bang-Jensen, Morten Hegner Nielsen:
Minimum cycle factors in quasi-transitive digraphs. Discret. Optim. 5(1): 121-137 (2008) - [j66]Jørgen Bang-Jensen, Tibor Jordán:
On persistent directed graphs. Networks 52(4): 271-276 (2008) - 2007
- [j65]Jørgen Bang-Jensen, Jing Huang, Louis Ibarra:
Recognizing and representing proper interval graphs in parallel using merging and sorting. Discret. Appl. Math. 155(4): 442-456 (2007) - [j64]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): 334-348 (2007) - [c6]Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen:
Mixed Models for the Analysis of Local Search Components. SLS 2007: 91-105 - 2006
- [j63]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Discret. Optim. 3(1): 86-94 (2006) - [j62]Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo:
Longest path partitions in generalizations of tournaments. Discret. Math. 306(16): 1830-1839 (2006) - 2005
- [j61]Jørgen Bang-Jensen, Morten Hegner Nielsen:
Finding complementary cycles in locally semicomplete digraphs. Discret. Appl. Math. 146(3): 245-256 (2005) - [c5]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD 2005: 81-94 - 2004
- [j60]Jørgen Bang-Jensen, Anders Yeo:
Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. Comb. 24(3): 331-349 (2004) - [j59]Jørgen Bang-Jensen, Anders Yeo:
Making a tournament k-arc-strong by reversing or deorienting arcs. Discret. Appl. Math. 136(2-3): 161-171 (2004) - [j58]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
When the greedy algorithm fails. Discret. Optim. 1(2): 121-127 (2004) - [j57]Jørgen Bang-Jensen, Tibor Jordán:
Splitting off edges between two subsets preserving the edge-connectivity of the graph. Discret. Math. 276(1-3): 5-28 (2004) - [j56]Jørgen Bang-Jensen:
The structure of strong arc-locally semicomplete digraphs. Discret. Math. 283(1-3): 1-6 (2004) - [j55]Jørgen Bang-Jensen, Jing Huang, Anders Yeo:
Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments. J. Graph Theory 46(4): 265-284 (2004) - [j54]Jørgen Bang-Jensen