Digraphs. Theory, algorithms and applications.
2nd ed. Zbl 1170.05002
Bang-Jensen, Jørgen; Gutin, Gregory |
|
2009
|
Digraphs. Theory, algorithms and applications. Zbl 0958.05002
Bang-Jensen, Jørgen; Gutin, Gregory |
|
2001
|
Digraphs. Theory, algorithms and applications.
Paperback ed. Zbl 1001.05002
Bang-Jensen, Jørgen; Gutin, Gregory |
|
2002
|
Locally semicomplete digraphs: A generalization of tournaments. Zbl 0703.05026
Bang-Jensen, Jørgen |
|
1990
|
Classes of directed graphs. Zbl 1398.05002
|
|
2018
|
Quasi-transitive digraphs. Zbl 0832.05048
Bang-Jensen, Jørgen; Huang, Jing |
|
1995
|
Alternating cycles and paths in edge-coloured multigraphs: A survey. Zbl 0876.05057
Bang-Jensen, Jørgen; Gutin, Gregory |
|
1997
|
Digraphs. Theory, algorithms and applications.
2nd ed. Zbl 1210.05001
Bang-Jensen, Jørgen; Gutin, Gregory Z. |
|
2010
|
The complexity of colouring by semicomplete digraphs. Zbl 0678.05018
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary |
|
1988
|
A classification of locally semicomplete digraphs. Zbl 0873.05072
Bang-Jensen, Jørgen; Guo, Yubao; Gutin, Gregory; Volkmann, Lutz |
|
1997
|
Generalizations of tournaments: A survey. Zbl 0920.05033
Bang-Jensen, Jørgen; Gutin, Gregory |
|
1998
|
A polynomial algorithm for the 2-path problem for semicomplete digraphs. Zbl 0759.05041
Bang-Jensen, Jørgen; Thomassen, Carsten |
|
1992
|
In-tournament digraphs. Zbl 0794.05033
Bang-Jensen, Jørgen; Huang, Jing; Prisner, Erich |
|
1993
|
Edge-disjoint in- and out-branchings in tournaments and related path problems. Zbl 0659.05052
Bang-Jensen, Jørgen |
|
1991
|
The effect of two cycles on the complexity of colourings by directed graphs. Zbl 0697.05029
Bang-Jensen, Jørgen; Hell, Pavol |
|
1990
|
Preserving and increasing local edge-connectivity in mixed graphs. Zbl 0835.05039
Bang-Jensen, Jørgen; Frank, András; Jackson, Bill |
|
1995
|
Sufficient conditions for a digraph to be supereulerian. Zbl 1312.05060
Bang-Jensen, Jørgen; Maddaloni, Alessandro |
|
2015
|
Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments. Zbl 1292.05119
Bang-Jensen, Jørgen; Bessy, Stéphane; Thomassé, Stéphan |
|
2014
|
Edge-connectivity augmentation with partition constraints. Zbl 0922.05034
Bang-Jensen, Jørgen; Gabow, Harold N.; Jordán, Tibor; Szigeti, Zoltán |
|
1999
|
Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs. Zbl 1064.05067
Bang-Jensen, Jörgen; Yeo, Anders |
|
2004
|
Local tournaments and proper circular arc graphs. Zbl 0819.68088
Hell, Pavol; Bang-Jensen, Jørgen; Huang, Jing |
|
1990
|
The structure of strong arc-locally semicomplete digraphs. Zbl 1048.05038
Bang-Jensen, Jørgen |
|
2004
|
Decomposing locally semicomplete digraphs into strong spanning subdigraphs. Zbl 1241.05039
Bang-Jensen, Jørgen; Huang, Jing |
|
2012
|
Tournaments and semicomplete digraphs. Zbl 1407.05102
Bang-Jensen, Jørgen; Havet, Frédéric |
|
2018
|
Arc-disjoint paths in decomposable digraphs. Zbl 1302.05063
Bang-Jensen, Jørgen; Maddaloni, Alessandro |
|
2014
|
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. Zbl 0916.05049
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
1998
|
Augmenting hypergraphs by edges of size two. Zbl 0935.05068
Bang-Jensen, Jørgen; Jackson, Bill |
|
1999
|
Sufficient conditions for a digraph to be hamiltonian. Zbl 0854.05067
Bang-Jensen, Jørgen; Gutin, Gregory; Li, Hao |
|
1996
|
Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs. Zbl 0956.05040
Bang-Jensen, Jørgen; Gutin, Gregory |
|
1998
|
Small degree out-branchings. Zbl 1018.05041
Bang-Jensen, Jørgen; Thomassé, Stéphan; Yeo, Anders |
|
2003
|
Paths, trees and cycles in tournaments. Zbl 0894.05032
Bang-Jensen, Jørgen; Gutin, Gregory |
|
1996
|
Strongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphs. Zbl 1029.05063
Bang-Jensen, Jørgen; Huang, Jing; Yeo, Anders |
|
2003
|
Arc-disjoint spanning sub(di)graphs in digraphs. Zbl 1247.68096
Bang-Jensen, Jørgen; Yeo, Anders |
|
2012
|
Longest path partitions in generalizations of tournaments. Zbl 1103.05036
Bang-Jensen, Jørgen; Nielsen, Morten Hegner; Yeo, Anders |
|
2006
|
Digraphs with the path-merging property. Zbl 0832.05047
Bang-Jensen, Jørgen |
|
1995
|
Hajós and Ore constructions for digraphs. Zbl 1435.05088
Bang-Jensen, Jørgen; Bellitto, Thomas; Schweser, Thomas; Stiebitz, Michael |
|
2020
|
On six problems posed by Jarik Nešetřil. Zbl 1116.05081
Bang-Jensen, Jørgen; Reed, Bruce; Schacht, Mathias; Šámal, Robert; Toft, Bjarne; Wagner, Uli |
|
2006
|
Hereditarily hard \(H\)-colouring problems. Zbl 0816.68090
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary |
|
1995
|
On the structure of locally semicomplete digraphs. Zbl 0759.05040
Bang-Jensen, Jørgen |
|
1992
|
When the greedy algorithm fails. Zbl 1087.90059
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
2004
|
Kings in quasi-transitive digraphs. Zbl 0955.05048
Bang-Jensen, Jørgen; Huang, Jing |
|
1998
|
On the 2-linkage problem for semicomplete digraphs. Zbl 0664.05034
Bang-Jensen, Jørgen |
|
1989
|
Disjoint directed and undirected paths and cycles in digraphs. Zbl 1176.68137
Bang-Jensen, Jørgen; Kriesell, Matthias |
|
2009
|
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. Zbl 1486.05239
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
2020
|
Completing orientations of partially oriented graphs. Zbl 1386.05121
Bang-Jensen, J.; Huang, J.; Zhu, X. |
|
2018
|
A note on vertex pancyclic oriented graphs. Zbl 0944.05061
Bang-Jensen, Jørgen; Guo, Yubao |
|
1999
|
Weakly Hamiltonian-connected ordinary multipartite tournaments. Zbl 0834.05027
Bang-Jensen, Jørgen; Gutin, Gregory; Huang, Jing |
|
1995
|
Edge-connectivity augmentation preserving simplicity. Zbl 0915.05079
Bang-Jensen, Jørgen; Jordán, Tibor |
|
1998
|
A new sufficient condition for a digraph to be Hamiltonian. Zbl 0933.05095
Bang-Jensen, Jørgen; Guo, Yubao; Yeo, Anders |
|
1999
|
A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs. Zbl 0749.68057
Bang-Jensen, Jørgen; Manoussakis, Yannis; Thomassen, Carsten |
|
1992
|
On the complexity of colouring by superdigraphs of bipartite graphs. Zbl 0783.05047
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary |
|
1992
|
On the problem of finding disjoint cycles and dicycles in a digraph. Zbl 1261.05047
Bang-Jensen, Jorgen; Kriesell, Matthias |
|
2011
|
The minimum spanning strong subdigraph problem is fixed parameter tractable. Zbl 1169.05327
Bang-Jensen, Jørgen; Yeo, Anders |
|
2008
|
Finding good 2-partitions of digraphs. I. Hereditary properties. Zbl 1342.68150
Bang-Jensen, J.; Havet, Frédéric |
|
2016
|
Finding good 2-partitions of digraphs. II. Enumerable properties. Zbl 1345.68168
Bang-Jensen, J.; Cohen, Nathann; Havet, Frédéric |
|
2016
|
(Arc-)disjoint flows in networks. Zbl 1290.90080
Bang-Jensen, Jørgen; Bessy, Stéphane |
|
2014
|
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. Zbl 0870.05046
Bang-Jensen, Jørgen; Gutin, Gregory; Huang, Jing |
|
1996
|
Paths and cycles in extended and decomposable digraphs. Zbl 0872.05028
Bang-Jensen, Jørgen; Gutin, Gregory |
|
1997
|
Efficient algorithms for real-life instances of the variable size bin packing problem. Zbl 1251.90004
Bang-Jensen, Jørgen; Larsen, Rune |
|
2012
|
Vertex coloring edge-weighted digraphs. Zbl 1330.05058
Bang-Jensen, Jørgen; Halldórsson, Magnús M. |
|
2015
|
Antistrong digraphs. Zbl 1350.05048
Bang-Jensen, Jørgen; Bessy, Stéphane; Jackson, Bill; Kriesell, Matthias |
|
2017
|
Properly coloured Hamiltonian paths in edge-coloured complete graphs. Zbl 0897.05037
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
1998
|
On chordal proper circular arc graphs. Zbl 0796.05080
Bang-Jensen, Jørgen; Hell, Pavol |
|
1994
|
On \(k\)-strong and \(k\)-cyclic digraphs. Zbl 0873.05047
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
1996
|
Algorithms and kernels for Feedback Set problems in generalizations of tournaments. Zbl 1350.68126
Bang-Jensen, Jørgen; Maddaloni, Alessandro; Saurabh, Saket |
|
2016
|
The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs. Zbl 1002.68110
Bang-Jensen, Jørgen; Yeo, Anders |
|
2001
|
Vertex-disjoint directed and undirected cycles in general digraphs. Zbl 1297.05095
Bang-Jensen, Jørgen; Kriesell, Matthias; Maddaloni, Alessandro; Simonsen, Sven |
|
2014
|
Finding a subdivision of a digraph. Zbl 1303.68064
Bang-Jensen, Jørgen; Havet, Frédéric; Karolinna Maia, A. |
|
2015
|
Arc-disjoint paths and trees in 2-regular digraphs. Zbl 1285.05075
Bang-Jensen, Jørgen; Simonsen, Sven |
|
2013
|
Convex-round graphs are circular-perfect. Zbl 1006.05054
Bang-Jensen, Jørgen; Huang, Jing |
|
2002
|
Finding an induced subdivision of a digraph. Zbl 1243.68190
Bang-Jensen, Jørgen; Havet, Frédéric; Trotignon, Nicolas |
|
2012
|
\(\chi\)-bounded families of oriented graphs. Zbl 1410.05173
Aboulker, P.; Bang-jensen, J.; Bousquet, N.; Charbit, P.; Havet, F.; Maffray, F.; Zamora, J. |
|
2018
|
Basic terminology, notation and results. Zbl 1407.05101
Bang-Jensen, Jørgen; Gutin, Gregory |
|
2018
|
The complexity of finding arc-disjoint branching flows. Zbl 1339.05371
Bang-Jensen, J.; Havet, Frédéric; Yeo, Anders |
|
2016
|
Weakly hamiltonian-connected vertices in bipartite tournaments. Zbl 0820.05027
Bang-Jensen, Jørgen; Manoussakis, Yannis |
|
1995
|
Vertex heaviest paths and cycles in quasi-transitive digraphs. Zbl 0876.05058
Bang-Jensen, Jørgen; Gutin, Gregory |
|
1997
|
Hamiltonian cycles avoiding prescribed arcs in tournaments. Zbl 0878.05036
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
1997
|
Convex-round and concave-round graphs. Zbl 0941.05056
Bang-Jensen, Jørgen; Huang, Jing; Yeo, Anders |
|
2000
|
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. Zbl 1522.05154
Bang-Jensen, Jørgen; Bessy, Stéphane; Havet, Frédéric; Yeo, Anders |
|
2022
|
Finding complementary cycles in locally semicomplete digraphs. Zbl 1055.05086
Bang-Jensen, Jørgen; Nielsen, Morten Hegner |
|
2005
|
Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments. Zbl 1448.05083
Bang-Jensen, Jørgen; Déprés, Hugues; Yeo, Anders |
|
2020
|
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. Zbl 1207.05067
Bang-Jensen, Jørgen |
|
2009
|
Spanning 2-strong tournaments in 3-strong semicomplete digraphs. Zbl 1221.05172
Bang-Jensen, Jørgen; Jordán, Tibor |
|
2010
|
Locally semicomplete digraphs and generalizations. Zbl 1407.05100
Bang-Jensen, Jørgen |
|
2018
|
Bipartite spanning sub(di)graphs induced by 2-partitions. Zbl 1425.05127
Bang-Jensen, J.; Bessy, S.; Havet, F.; Yeo, A. |
|
2019
|
Out-colourings of digraphs. Zbl 1495.05080
Alon, Noga; Bang-Jensen, Jørgen; Bessy, Stéphane |
|
2020
|
Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs. Zbl 1302.05062
Bang-Jensen, Jørgen; Huang, Jing |
|
2014
|
Weakly hamiltonian-connected locally semicomplete digraphs. Zbl 0845.05047
Bang-Jensen, Jørgen; Guo, Yubao; Volkmann, Lutz |
|
1996
|
Linkages in locally semicomplete digraphs and quasi-transitive digraphs. Zbl 0929.05036
Bang-Jensen, Jørgen |
|
1999
|
Adding and reversing arcs in semicomplete digraphs. Zbl 0892.05019
Bang-Jensen, Jørgen; Jordán, Tibor |
|
1998
|
Proper-walk connection number of graphs. Zbl 1521.05087
Bang-Jensen, Jørgen; Bellitto, Thomas; Yeo, Anders |
|
2021
|
Spanning \(k\)-arc-strong subdigraphs with few arcs in \(k\)-arc-strong tournaments. Zbl 1057.05039
Bang-Jensen, Jørgen; Huang, Jing; Yeo, Anders |
|
2004
|
Making a tournament \(k\)-arc-strong by reversing or deorienting arcs. Zbl 1035.05045
Bang-Jensen, Jørgen; Yeo, Anders |
|
2004
|
On the complexity of colouring by digraphs with at most one directed cycle. Zbl 0840.05022
Bang-Jensen, Jørgen; MacGillivray, Gary |
|
1993
|
Recognizing and representing proper interval graphs in parallel using merging and sorting. Zbl 1109.68079
Bang-Jensen, Jørgen; Huang, Jing; Ibarra, Louis |
|
2007
|
Parameterized algorithms for non-separating trees and branchings in digraphs. Zbl 1353.68106
Bang-Jensen, Jørgen; Saurabh, Saket; Simonsen, Sven |
|
2016
|
Quasi-hamiltonian paths in semicomplete multipartite digraphs. Zbl 1262.05095
Bang-Jensen, Jørgen; Maddaloni, Alessandro; Simonsen, Sven |
|
2013
|
DAG-width and circumference of digraphs. Zbl 1339.05156
Bang-Jensen, Jørgen; Larsen, Tilde My |
|
2016
|
Out-degree reducing partitions of digraphs. Zbl 1390.05184
Bang-Jensen, J.; Bessy, S.; Havet, F.; Yeo, A. |
|
2018
|
Disjoint paths in decomposable digraphs. Zbl 1365.05106
Bang-Jensen, Jørgen; Christiansen, Tilde My; Maddaloni, Alessandro |
|
2017
|
Arc-disjoint out-branchings and in-branchings in semicomplete digraphs. Zbl 1535.05121
Bang-Jensen, J.; Wang, Y. |
|
2024
|
Spanning Eulerian subdigraphs in semicomplete digraphs. Zbl 1522.05155
Bang-Jensen, Jørgen; Havet, Frédéric; Yeo, Anders |
|
2023
|
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. Zbl 1522.05154
Bang-Jensen, Jørgen; Bessy, Stéphane; Havet, Frédéric; Yeo, Anders |
|
2022
|
Digraphs and variable degeneracy. Zbl 1484.05081
Bang-Jensen, Jørgen; Schweser, Thomas; Stiebitz, Michael |
|
2022
|
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. Zbl 1522.05091
Bang-Jensen, J.; Havet, F.; Kriesell, M.; Yeo, A. |
|
2022
|
Good acyclic orientations of 4-regular 4-connected graphs. Zbl 1522.05244
Bang-Jensen, Jørgen; Kriesell, Matthias |
|
2022
|
Component order connectivity in directed graphs. Zbl 1533.68099
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders |
|
2022
|
Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked. Zbl 1486.05113
Bang-Jensen, Jørgen; Johansen, Kasper Skov |
|
2022
|
Proper-walk connection number of graphs. Zbl 1521.05087
Bang-Jensen, Jørgen; Bellitto, Thomas; Yeo, Anders |
|
2021
|
Good orientations of unions of edge-disjoint spanning trees. Zbl 1521.05053
Bang-Jensen, Jørgen; Bessy, Stéphane; Huang, Jing; Kriesell, Matthias |
|
2021
|
On supereulerian 2-edge-coloured graphs. Zbl 1479.05180
Bang-Jensen, Jørgen; Bellitto, Thomas; Yeo, Anders |
|
2021
|
Hajós and Ore constructions for digraphs. Zbl 1435.05088
Bang-Jensen, Jørgen; Bellitto, Thomas; Schweser, Thomas; Stiebitz, Michael |
|
2020
|
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. Zbl 1486.05239
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
2020
|
Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments. Zbl 1448.05083
Bang-Jensen, Jørgen; Déprés, Hugues; Yeo, Anders |
|
2020
|
Out-colourings of digraphs. Zbl 1495.05080
Alon, Noga; Bang-Jensen, Jørgen; Bessy, Stéphane |
|
2020
|
The directed 2-linkage problem with length constraints. Zbl 1445.68146
Bang-Jensen, J.; Bellitto, T.; Lochet, W.; Yeo, A. |
|
2020
|
Component order connectivity in directed graphs. Zbl 1533.68100
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders |
|
2020
|
Bipartite spanning sub(di)graphs induced by 2-partitions. Zbl 1425.05127
Bang-Jensen, J.; Bessy, S.; Havet, F.; Yeo, A. |
|
2019
|
Degree-constrained 2-partitions of graphs. Zbl 1427.68226
Bang-Jensen, Jørgen; Bessy, Stéphane |
|
2019
|
The parameterized complexity landscape of finding 2-partitions of digraphs. Zbl 1434.68205
Bang-Jensen, J.; Knudsen, Kristine V. K.; Saurabh, Saket; Zehavi, Meirav |
|
2019
|
Classes of directed graphs. Zbl 1398.05002
|
|
2018
|
Tournaments and semicomplete digraphs. Zbl 1407.05102
Bang-Jensen, Jørgen; Havet, Frédéric |
|
2018
|
Completing orientations of partially oriented graphs. Zbl 1386.05121
Bang-Jensen, J.; Huang, J.; Zhu, X. |
|
2018
|
\(\chi\)-bounded families of oriented graphs. Zbl 1410.05173
Aboulker, P.; Bang-jensen, J.; Bousquet, N.; Charbit, P.; Havet, F.; Maffray, F.; Zamora, J. |
|
2018
|
Basic terminology, notation and results. Zbl 1407.05101
Bang-Jensen, Jørgen; Gutin, Gregory |
|
2018
|
Locally semicomplete digraphs and generalizations. Zbl 1407.05100
Bang-Jensen, Jørgen |
|
2018
|
Out-degree reducing partitions of digraphs. Zbl 1390.05184
Bang-Jensen, J.; Bessy, S.; Havet, F.; Yeo, A. |
|
2018
|
Parameterized algorithms for survivable network design with uniform demands. Zbl 1403.90559
Bang-Jensen, Jørgen; Basavaraju, Manu; Vitting Klinkby, Kristine; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket; Zehavi, Meirav |
|
2018
|
Degree constrained 2-partitions of semicomplete digraphs. Zbl 1401.05129
Bang-Jensen, Jørgen; Christiansen, Tilde My |
|
2018
|
Antistrong digraphs. Zbl 1350.05048
Bang-Jensen, Jørgen; Bessy, Stéphane; Jackson, Bill; Kriesell, Matthias |
|
2017
|
Disjoint paths in decomposable digraphs. Zbl 1365.05106
Bang-Jensen, Jørgen; Christiansen, Tilde My; Maddaloni, Alessandro |
|
2017
|
Finding good 2-partitions of digraphs. I. Hereditary properties. Zbl 1342.68150
Bang-Jensen, J.; Havet, Frédéric |
|
2016
|
Finding good 2-partitions of digraphs. II. Enumerable properties. Zbl 1345.68168
Bang-Jensen, J.; Cohen, Nathann; Havet, Frédéric |
|
2016
|
Algorithms and kernels for Feedback Set problems in generalizations of tournaments. Zbl 1350.68126
Bang-Jensen, Jørgen; Maddaloni, Alessandro; Saurabh, Saket |
|
2016
|
The complexity of finding arc-disjoint branching flows. Zbl 1339.05371
Bang-Jensen, J.; Havet, Frédéric; Yeo, Anders |
|
2016
|
Parameterized algorithms for non-separating trees and branchings in digraphs. Zbl 1353.68106
Bang-Jensen, Jørgen; Saurabh, Saket; Simonsen, Sven |
|
2016
|
DAG-width and circumference of digraphs. Zbl 1339.05156
Bang-Jensen, Jørgen; Larsen, Tilde My |
|
2016
|
Arc-disjoint directed and undirected cycles in digraphs. Zbl 1350.05070
Bang-Jensen, Jørgen; Kriesell, Matthias; Maddaloni, Alessandro; Simonsen, Sven |
|
2016
|
Sufficient conditions for a digraph to be supereulerian. Zbl 1312.05060
Bang-Jensen, Jørgen; Maddaloni, Alessandro |
|
2015
|
Vertex coloring edge-weighted digraphs. Zbl 1330.05058
Bang-Jensen, Jørgen; Halldórsson, Magnús M. |
|
2015
|
Finding a subdivision of a digraph. Zbl 1303.68064
Bang-Jensen, Jørgen; Havet, Frédéric; Karolinna Maia, A. |
|
2015
|
Balanced branchings in digraphs. Zbl 1328.68082
Bang-Jensen, Jørgen; Yeo, A. |
|
2015
|
Restricted cycle factors and arc-decompositions of digraphs. Zbl 1317.05068
Bang-Jensen, Jørgen; Casselgren, Carl Johan |
|
2015
|
Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments. Zbl 1292.05119
Bang-Jensen, Jørgen; Bessy, Stéphane; Thomassé, Stéphan |
|
2014
|
Arc-disjoint paths in decomposable digraphs. Zbl 1302.05063
Bang-Jensen, Jørgen; Maddaloni, Alessandro |
|
2014
|
(Arc-)disjoint flows in networks. Zbl 1290.90080
Bang-Jensen, Jørgen; Bessy, Stéphane |
|
2014
|
Vertex-disjoint directed and undirected cycles in general digraphs. Zbl 1297.05095
Bang-Jensen, Jørgen; Kriesell, Matthias; Maddaloni, Alessandro; Simonsen, Sven |
|
2014
|
Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs. Zbl 1302.05062
Bang-Jensen, Jørgen; Huang, Jing |
|
2014
|
The complexity of multicut and mixed multicut problems in (di)graphs. Zbl 1352.05173
Bang-Jensen, Jørgen; Yeo, Anders |
|
2014
|
Arc-disjoint paths and trees in 2-regular digraphs. Zbl 1285.05075
Bang-Jensen, Jørgen; Simonsen, Sven |
|
2013
|
Quasi-hamiltonian paths in semicomplete multipartite digraphs. Zbl 1262.05095
Bang-Jensen, Jørgen; Maddaloni, Alessandro; Simonsen, Sven |
|
2013
|
Decomposing locally semicomplete digraphs into strong spanning subdigraphs. Zbl 1241.05039
Bang-Jensen, Jørgen; Huang, Jing |
|
2012
|
Arc-disjoint spanning sub(di)graphs in digraphs. Zbl 1247.68096
Bang-Jensen, Jørgen; Yeo, Anders |
|
2012
|
Efficient algorithms for real-life instances of the variable size bin packing problem. Zbl 1251.90004
Bang-Jensen, Jørgen; Larsen, Rune |
|
2012
|
Finding an induced subdivision of a digraph. Zbl 1243.68190
Bang-Jensen, Jørgen; Havet, Frédéric; Trotignon, Nicolas |
|
2012
|
On the problem of finding disjoint cycles and dicycles in a digraph. Zbl 1261.05047
Bang-Jensen, Jorgen; Kriesell, Matthias |
|
2011
|
Finding an induced subdivision of a digraph. Zbl 1268.05191
Bang-Jensen, Jørgen; Havet, Frédéric; Trotignon, Nicolas |
|
2011
|
A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles. Zbl 1317.05069
Bang-Jensen, Jørgen; MacGillivray, Gary; Swarts, Jacobus |
|
2011
|
Digraphs. Theory, algorithms and applications.
2nd ed. Zbl 1210.05001
Bang-Jensen, Jørgen; Gutin, Gregory Z. |
|
2010
|
Spanning 2-strong tournaments in 3-strong semicomplete digraphs. Zbl 1221.05172
Bang-Jensen, Jørgen; Jordán, Tibor |
|
2010
|
The complexity of colouring by locally semicomplete digraphs. Zbl 1221.05173
Bang-Jensen, Jørgen; MacGillivray, Gary; Swarts, Jacobus |
|
2010
|
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. Zbl 1214.68259
Bang-Jensen, Jørgen; Chiarandini, Marco; Morling, Peter |
|
2010
|
Out-branchings with extremal number of leaves. Zbl 1231.05108
Bang-Jensen, Jørgen; Gutin, Gregory |
|
2010
|
Digraphs. Theory, algorithms and applications.
2nd ed. Zbl 1170.05002
Bang-Jensen, Jørgen; Gutin, Gregory |
|
2009
|
Disjoint directed and undirected paths and cycles in digraphs. Zbl 1176.68137
Bang-Jensen, Jørgen; Kriesell, Matthias |
|
2009
|
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. Zbl 1207.05067
Bang-Jensen, Jørgen |
|
2009
|
Disjoint sub(di)graphs in digraphs. Zbl 1273.05083
Bang-Jensen, Jørgen; Kriesell, Matthias |
|
2009
|
\(k\)-strong spanning local tournaments in locally semicomplete digraphs. Zbl 1211.05050
Bang-Jensen, Jørgen |
|
2009
|
The minimum spanning strong subdigraph problem is fixed parameter tractable. Zbl 1169.05327
Bang-Jensen, Jørgen; Yeo, Anders |
|
2008
|
Minimum cycle factors in quasi-transitive digraphs. Zbl 1134.90045
Bang-Jensen, Jørgen; Nielsen, Morten Hegner |
|
2008
|
Recognizing and representing proper interval graphs in parallel using merging and sorting. Zbl 1109.68079
Bang-Jensen, Jørgen; Huang, Jing; Ibarra, Louis |
|
2007
|
Longest path partitions in generalizations of tournaments. Zbl 1103.05036
Bang-Jensen, Jørgen; Nielsen, Morten Hegner; Yeo, Anders |
|
2006
|
On six problems posed by Jarik Nešetřil. Zbl 1116.05081
Bang-Jensen, Jørgen; Reed, Bruce; Schacht, Mathias; Šámal, Robert; Toft, Bjarne; Wagner, Uli |
|
2006
|
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Zbl 1089.05028
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
2006
|
Finding complementary cycles in locally semicomplete digraphs. Zbl 1055.05086
Bang-Jensen, Jørgen; Nielsen, Morten Hegner |
|
2005
|
Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs. Zbl 1064.05067
Bang-Jensen, Jörgen; Yeo, Anders |
|
2004
|
The structure of strong arc-locally semicomplete digraphs. Zbl 1048.05038
Bang-Jensen, Jørgen |
|
2004
|
When the greedy algorithm fails. Zbl 1087.90059
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
2004
|
Spanning \(k\)-arc-strong subdigraphs with few arcs in \(k\)-arc-strong tournaments. Zbl 1057.05039
Bang-Jensen, Jørgen; Huang, Jing; Yeo, Anders |
|
2004
|
Making a tournament \(k\)-arc-strong by reversing or deorienting arcs. Zbl 1035.05045
Bang-Jensen, Jørgen; Yeo, Anders |
|
2004
|
Subgraphs in vertex neighborhoods of \(K_r\)-free graphs. Zbl 1059.05088
Bang-Jensen, Jørgen; Brandt, Stephan |
|
2004
|
Small degree out-branchings. Zbl 1018.05041
Bang-Jensen, Jørgen; Thomassé, Stéphan; Yeo, Anders |
|
2003
|
Strongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphs. Zbl 1029.05063
Bang-Jensen, Jørgen; Huang, Jing; Yeo, Anders |
|
2003
|
Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. Zbl 1031.05057
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
2003
|
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. Zbl 1022.05052
Bang-Jensen, Jørgen; Thomassé, Stéphan |
|
2003
|
Digraphs. Theory, algorithms and applications.
Paperback ed. Zbl 1001.05002
Bang-Jensen, Jørgen; Gutin, Gregory |
|
2002
|
Convex-round graphs are circular-perfect. Zbl 1006.05054
Bang-Jensen, Jørgen; Huang, Jing |
|
2002
|
Digraphs. Theory, algorithms and applications. Zbl 0958.05002
Bang-Jensen, Jørgen; Gutin, Gregory |
|
2001
|
The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs. Zbl 1002.68110
Bang-Jensen, Jørgen; Yeo, Anders |
|
2001
|
Convex-round and concave-round graphs. Zbl 0941.05056
Bang-Jensen, Jørgen; Huang, Jing; Yeo, Anders |
|
2000
|
Complementary cycles containing prescribed vertices in tournaments. Zbl 0945.05029
Bang-Jensen, Jørgen; Guo, Yubao; Yeo, Anders |
|
2000
|
Splitting off edges within a specified subset preserving the edge-connectivity of the graph. Zbl 0971.68117
Bang-Jensen, Jørgen; Jordán, Tibor |
|
2000
|
Edge-connectivity augmentation with partition constraints. Zbl 0922.05034
Bang-Jensen, Jørgen; Gabow, Harold N.; Jordán, Tibor; Szigeti, Zoltán |
|
1999
|
Augmenting hypergraphs by edges of size two. Zbl 0935.05068
Bang-Jensen, Jørgen; Jackson, Bill |
|
1999
|
A note on vertex pancyclic oriented graphs. Zbl 0944.05061
Bang-Jensen, Jørgen; Guo, Yubao |
|
1999
|
A new sufficient condition for a digraph to be Hamiltonian. Zbl 0933.05095
Bang-Jensen, Jørgen; Guo, Yubao; Yeo, Anders |
|
1999
|
Linkages in locally semicomplete digraphs and quasi-transitive digraphs. Zbl 0929.05036
Bang-Jensen, Jørgen |
|
1999
|
On the complexity of hamiltonian path and cycle problems in certain classes of digraphs. Zbl 0934.05082
Bang-Jensen, Jørgen; Gutin, Gregory |
|
1999
|
Generalizations of tournaments: A survey. Zbl 0920.05033
Bang-Jensen, Jørgen; Gutin, Gregory |
|
1998
|
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. Zbl 0916.05049
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders |
|
1998
|
...and 42 more Documents |