The Complexity of Colouring by Semicomplete Digraphs. - Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray (SIAM J. Discret. Math., 1988)

Local Tournaments and Proper Circular Arc Gaphs. - Pavol Hell; Jørgen Bang-Jensen; Jing Huang 007 (SIGAL International Symposium on Algorithms, 1990)

The effect of two cycles on the complexity of colourings by directed graphs. - Jørgen Bang-Jensen; Pavol Hell (Discret. Appl. Math., 1990)

Locally semicomplete digraphs: A generalization of tournaments. - Jørgen Bang-Jensen (J. Graph Theory, 1990)

Eulerian trails through a set of terminals in specific, unique and all orders. - Jørgen Bang-Jensen; Svatopluk Poljak (Graph Structure Theory, 1991)

Edge-disjoint in- and out-branchings in tournaments and related path problems. - Jørgen Bang-Jensen (J. Comb. Theory B, 1991)

On the structure of locally semicomplete digraphs. - Jørgen Bang-Jensen (Discret. Math., 1992)

On the complexity of colouring by superdigraphs of bipartite graphs. - Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray (Discret. Math., 1992)

Unsolved problems presented at the Julius Petersen Graph Theory Conference. - Jørgen Bang-Jensen; Bjarne Toft (Discret. Math., 1992)

A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. - Jørgen Bang-Jensen; Yannis Manoussakis; Carsten Thomassen (J. Algorithms, 1992)

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. - Jørgen Bang-Jensen; Carsten Thomassen (SIAM J. Discret. Math., 1992)

Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. - Jørgen Bang-Jensen; Pavol Hell (Discret. Appl. Math., 1993)

In-Tournament Digraphs. - Jørgen Bang-Jensen; Jing Huang 007; Erich Prisner (J. Comb. Theory B, 1993)

Cycles Through k Vertices in Bipartite Tournaments. - Jørgen Bang-Jensen; Yannis Manoussakis (Comb., 1994)

On chordal proper circular arc graphs. - Jørgen Bang-Jensen; Pavol Hell (Discret. Math., 1994)

Weakly Hamiltonian-connected ordinary multipartite tournaments. - Jørgen Bang-Jensen; Gregory Z. Gutin; Jing Huang 007 (Discret. Math., 1995)

Hereditarily hard H-colouring problems. - Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray (Discret. Math., 1995)

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. - Jørgen Bang-Jensen; Yannis Manoussakis (J. Comb. Theory B, 1995)

Digraphs with the path-merging property. - Jørgen Bang-Jensen (J. Graph Theory, 1995)

Quasi-transitive digraphs. - Jørgen Bang-Jensen; Jing Huang 007 (J. Graph Theory, 1995)

Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. - Jørgen Bang-Jensen; András Frank; Bill Jackson (SIAM J. Discret. Math., 1995)

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. - Jørgen Bang-Jensen; Gregory Z. Gutin; Jing Huang 007 (Discret. Math., 1996)

On k-strong and k-cyclic digraphs. - Jørgen Bang-Jensen; Gregory Z. Gutin; Anders Yeo (Discret. Math., 1996)

Sufficient conditions for a digraph to be Hamiltonian. - Jørgen Bang-Jensen; Gregory Z. Gutin; Hao Li (J. Graph Theory, 1996)

Weakly Hamiltonian-connected locally semicomplete digraphs. - Jørgen Bang-Jensen; Yubao Guo; Lutz Volkmann (J. Graph Theory, 1996)

Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. - Jørgen Bang-Jensen; Mohamed El Haddad; Yannis Manoussakis; Teresa M. Przytycka (Algorithmica, 1997)

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. - Jørgen Bang-Jensen; Gregory Z. Gutin; Anders Yeo (Comb. Probab. Comput., 1997)

Vertex heaviest paths and cycles in quasi-transitive digraphs. - Jørgen Bang-Jensen; Gregory Z. Gutin (Discret. Math., 1997)

Paths and cycles in extended and decomposable digraphs, . - Jørgen Bang-Jensen; Gregory Z. Gutin (Discret. Math., 1997)

Alternating cycles and paths in edge-coloured multigraphs: A survey. - Jørgen Bang-Jensen; Gregory Z. Gutin (Discret. Math., 1997)

A classification of locally semicomplete digraphs. - Jørgen Bang-Jensen; Yubao Guo; Gregory Z. Gutin; Lutz Volkmann (Discret. Math., 1997)

Adding and Reversing Arcs in Semicomplete Digraphs. - Jørgen Bang-Jensen; Tibor Jordán (Comb. Probab. Comput., 1998)

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. - Jørgen Bang-Jensen; Gregory Z. Gutin; Anders Yeo (Discret. Appl. Math., 1998)

Alternating cycles and trails in 2-edge-coloured complete multigraphs. - Jørgen Bang-Jensen; Gregory Z. Gutin (Discret. Math., 1998)

Kings in quasi-transitive digraphs. - Jørgen Bang-Jensen; Jing Huang 007 (Discret. Math., 1998)

Generalizations of tournaments: A survey. - Jørgen Bang-Jensen; Gregory Z. Gutin (J. Graph Theory, 1998)

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. - Jørgen Bang-Jensen; Gregory Z. Gutin; Anders Yeo (J. Graph Theory, 1998)

Edge-Connectivity Augmentation Preserving Simplicity. - Jørgen Bang-Jensen; Tibor Jordán (SIAM J. Discret. Math., 1998)

On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs. - Jørgen Bang-Jensen; Gregory Z. Gutin (Discret. Appl. Math., 1999)

A New Sufficient Condition for a Digraph to Be Hamiltonian. - Jørgen Bang-Jensen; Yubao Guo; Anders Yeo (Discret. Appl. Math., 1999)

Linkages in locally semicomplete digraphs and quasi-transitive digraphs. - Jørgen Bang-Jensen (Discret. Math., 1999)

A note on vertex pancyclic oriented graphs. - Jørgen Bang-Jensen; Yubao Guo (J. Graph Theory, 1999)

Augmenting hypergraphs by edges of size two. - Jørgen Bang-Jensen; Bill Jackson (Math. Program., 1999)

Edge-Connectivity Augmentation with Partition Constraints. - Jørgen Bang-Jensen; Harold N. Gabow; Tibor Jordán; Zoltán Szigeti (SIAM J. Discret. Math., 1999)

Complementary cycles containing prescribed vertices in tournaments. - Jørgen Bang-Jensen; Yubao Guo; Anders Yeo (Discret. Math., 2000)

Problems concerning global connectivity of directed graphs. - Jørgen Bang-Jensen (Electron. Notes Discret. Math., 2000)

Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. - Jørgen Bang-Jensen; Tibor Jordán (J. Algorithms, 2000)

Convex-Round and Concave-Round Graphs. - Jørgen Bang-Jensen; Jing Huang 007; Anders Yeo (SIAM J. Discret. Math., 2000)

Making a tournament k-arc-strong by reversing arcs. - Jørgen Bang-Jensen; Anders Yeo (Electron. Notes Discret. Math., 2001)

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. - Jørgen Bang-Jensen; Anders Yeo (J. Algorithms, 2001)

Digraphs - theory, algorithms and applications. - Jørgen Bang-Jensen; Gregory Z. Gutin (Springer, 2002)

Convex-round graphs are circular-perfect. - Jørgen Bang-Jensen; Jing Huang 007 (J. Graph Theory, 2002)

Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. - Jørgen Bang-Jensen; Stéphan Thomassé (Discret. Appl. Math., 2003)

Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. - Jørgen Bang-Jensen; Gregory Z. Gutin; Anders Yeo (J. Graph Theory, 2003)

Small degree out-branchings. - Jørgen Bang-Jensen; Stéphan Thomassé; Anders Yeo (J. Graph Theory, 2003)

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. - Jørgen Bang-Jensen; Jing Huang 007; Anders Yeo (SIAM J. Discret. Math., 2003)

Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. - Jørgen Bang-Jensen; Anders Yeo (Comb., 2004)

Making a tournament k-arc-strong by reversing or deorienting arcs. - Jørgen Bang-Jensen; Anders Yeo (Discret. Appl. Math., 2004)

When the greedy algorithm fails. - Jørgen Bang-Jensen; Gregory Z. Gutin; Anders Yeo (Discret. Optim., 2004)

The structure of strong arc-locally semicomplete digraphs. - Jørgen Bang-Jensen (Discret. Math., 2004)

Splitting off edges between two subsets preserving the edge-connectivity of the graph. - Jørgen Bang-Jensen; Tibor Jordán (Discret. Math., 2004)

Subgraphs in vertex neighborhoods of Kr-free graphs. - Jørgen Bang-Jensen; Stephan Brandt (J. Graph Theory, 2004)

Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments. - Jørgen Bang-Jensen; Jing Huang 007; Anders Yeo (J. Graph Theory, 2004)

Finding complementary cycles in locally semicomplete digraphs. - Jørgen Bang-Jensen; Morten Hegner Nielsen (Discret. Appl. Math., 2005)

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. - Jørgen Bang-Jensen; Gregory Z. Gutin; Anders Yeo (Discret. Optim., 2006)

Longest path partitions in generalizations of tournaments. - Jørgen Bang-Jensen; Morten Hegner Nielsen; Anders Yeo (Discret. Math., 2006)

Mixed Models for the Analysis of Local Search Components. - Jørgen Bang-Jensen; Marco Chiarandini; Yuri Goegebeur; Bent Jørgensen (SLS, 2007)

Recognizing and representing proper interval graphs in parallel using merging and sorting. - Jørgen Bang-Jensen; Jing Huang 007; Louis Ibarra (Discret. Appl. Math., 2007)

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. - Jørgen Bang-Jensen; Daniel Gonçalves 001; Inge Li Gørtz (Discret. Optim., 2007)

The minimum spanning strong subdigraph problem is fixed parameter tractable. - Jørgen Bang-Jensen; Anders Yeo (Discret. Appl. Math., 2008)

Minimum cycle factors in quasi-transitive digraphs. - Jørgen Bang-Jensen; Morten Hegner Nielsen (Discret. Optim., 2008)

On persistent directed graphs. - Jørgen Bang-Jensen; Tibor Jordán (Networks, 2008)

Digraphs - Theory, Algorithms and Applications, Second Edition. - Jørgen Bang-Jensen; Gregory Z. Gutin (Springer, 2009)

k-strong spanning local tournaments in locally semicomplete digraphs. - Jørgen Bang-Jensen (Discret. Appl. Math., 2009)

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. - Jørgen Bang-Jensen (Discret. Math., 2009)

Disjoint sub(di)graphs in digraphs. - Jørgen Bang-Jensen; Matthias Kriesell (Electron. Notes Discret. Math., 2009)

Disjoint directed and undirected paths and cycles in digraphs. - Jørgen Bang-Jensen; Matthias Kriesell (Theor. Comput. Sci., 2009)

Spanning 2-strong tournaments in 3-strong semicomplete digraphs. - Jørgen Bang-Jensen; Tibor Jordán (Discret. Math., 2010)

The complexity of colouring by locally semicomplete digraphs. - Jørgen Bang-Jensen; Gary MacGillivray; Jacobus Swarts (Discret. Math., 2010)

Heuristics for the central tree problem. - Jørgen Bang-Jensen; Yury Nikulin (J. Heuristics, 2010)

A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. - Jørgen Bang-Jensen; Marco Chiarandini; Peter Morling (Networks, 2010)

A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles. - Gary MacGillivray; Jacobus Swarts; Jørgen Bang-Jensen (Contributions Discret. Math., 2011)

On the problem of finding disjoint cycles and dicycles in a digraph. - Jørgen Bang-Jensen; Matthias Kriesell (Comb., 2011)

Efficient algorithms for real-life instances of the variable size bin packing problem. - Jørgen Bang-Jensen; Rune Larsen 003 (Comput. Oper. Res., 2012)

Decomposing locally semicomplete digraphs into strong spanning subdigraphs. - Jørgen Bang-Jensen; Jing Huang 007 (J. Comb. Theory B, 2012)

Finding an induced subdivision of a digraph. - Jørgen Bang-Jensen; Frédéric Havet; Nicolas Trotignon (Theor. Comput. Sci., 2012)

Arc-disjoint spanning sub(di)graphs in digraphs. - Jørgen Bang-Jensen; Anders Yeo (Theor. Comput. Sci., 2012)

Quasi-hamiltonian paths in semicomplete multipartite digraphs. - Jørgen Bang-Jensen; Alessandro Maddaloni; Sven Simonsen (Discret. Appl. Math., 2013)

Arc-disjoint paths and trees in 2-regular digraphs. - Jørgen Bang-Jensen; Sven Simonsen (Discret. Appl. Math., 2013)

Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties. - Jørgen Bang-Jensen; Daniel Gonçalves 001; Anders Yeo (Theor. Comput. Sci., 2013)

Vertex-disjoint directed and undirected cycles in general digraphs. - Jørgen Bang-Jensen; Matthias Kriesell; Alessandro Maddaloni; Sven Simonsen (J. Comb. Theory B, 2014)

Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. - Jørgen Bang-Jensen; Stéphane Bessy; Stéphan Thomassé (J. Graph Theory, 2014)

Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs. - Jørgen Bang-Jensen; Jing Huang 007 (J. Graph Theory, 2014)

Arc-Disjoint Paths in Decomposable Digraphs. - Jørgen Bang-Jensen; Alessandro Maddaloni (J. Graph Theory, 2014)

(Arc-)disjoint flows in networks. - Jørgen Bang-Jensen; Stéphane Bessy (Theor. Comput. Sci., 2014)

The complexity of multicut and mixed multicut problems in (di)graphs. - Jørgen Bang-Jensen; Anders Yeo (Theor. Comput. Sci., 2014)

Restricted cycle factors and arc-decompositions of digraphs. - Jørgen Bang-Jensen; Carl Johan Casselgren (Discret. Appl. Math., 2015)

Vertex coloring edge-weighted digraphs. - Jørgen Bang-Jensen; Magnús M. Halldórsson (Inf. Process. Lett., 2015)

Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. - Jørgen Bang-Jensen; Stéphane Bessy (J. Graph Theory, 2015)

Sufficient Conditions for a Digraph to be Supereulerian. - Jørgen Bang-Jensen; Alessandro Maddaloni (J. Graph Theory, 2015)

Finding a subdivision of a digraph. - Jørgen Bang-Jensen; Frédéric Havet; Ana Karolinna Maia (Theor. Comput. Sci., 2015)

Balanced branchings in digraphs. - Jørgen Bang-Jensen; Anders Yeo (Theor. Comput. Sci., 2015)

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments. - Jørgen Bang-Jensen; Alessandro Maddaloni; Saket Saurabh 001 (Algorithmica, 2016)

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs. - Jørgen Bang-Jensen; Saket Saurabh 001; Sven Simonsen (Algorithmica, 2016)

The complexity of finding arc-disjoint branching flows. - Jørgen Bang-Jensen; Frédéric Havet; Anders Yeo (Discret. Appl. Math., 2016)

Arc-Disjoint Directed and Undirected Cycles in Digraphs. - Jørgen Bang-Jensen; Matthias Kriesell; Alessandro Maddaloni; Sven Simonsen (J. Graph Theory, 2016)

DAG-Width and Circumference of Digraphs. - Jørgen Bang-Jensen; Tilde My Larsen (J. Graph Theory, 2016)

Finding good 2-partitions of digraphs II. Enumerable properties. - Jørgen Bang-Jensen; Nathann Cohen; Frédéric Havet (Theor. Comput. Sci., 2016)

Finding good 2-partitions of digraphs I. Hereditary properties. - Jørgen Bang-Jensen; Frédéric Havet (Theor. Comput. Sci., 2016)

Antistrong digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Bill Jackson; Matthias Kriesell (J. Comb. Theory B, 2017)

Disjoint Paths in Decomposable Digraphs. - Jørgen Bang-Jensen; Tilde My Christiansen; Alessandro Maddaloni (J. Graph Theory, 2017)

Locally Semicomplete Digraphs and Generalizations. - Jørgen Bang-Jensen (Classes of Directed Graphs, 2018)

Basic Terminology, Notation and Results. - Jørgen Bang-Jensen; Gregory Z. Gutin (Classes of Directed Graphs, 2018)

Tournaments and Semicomplete Digraphs. - Jørgen Bang-Jensen; Frédéric Havet (Classes of Directed Graphs, 2018)

Parameterized Algorithms for Survivable Network Design with Uniform Demands. - Jørgen Bang-Jensen; Manu Basavaraju; Kristine Vitting Klinkby; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2018)

χ-bounded families of oriented graphs. - Pierre Aboulker; Jørgen Bang-Jensen; Nicolas Bousquet 001; Pierre Charbit; Frédéric Havet; Frédéric Maffray; José Zamora (J. Graph Theory, 2018)

Completing orientations of partially oriented graphs. - Jørgen Bang-Jensen; Jing Huang 007; Xuding Zhu (J. Graph Theory, 2018)

Out-degree reducing partitions of digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Frédéric Havet; Anders Yeo (Theor. Comput. Sci., 2018)

Degree constrained 2-partitions of semicomplete digraphs. - Jørgen Bang-Jensen; Tilde My Christiansen (Theor. Comput. Sci., 2018)

Connecting edge-colouring. - Jørgen Bang-Jensen; Thomas Bellitto; Anders Yeo (CoRR, 2019)

Safe sets in digraphs. - Yandong Bai; Jørgen Bang-Jensen; Shinya Fujita 001; Anders Yeo (CoRR, 2019)

Bipartite spanning sub(di)graphs induced by 2-partitions. - Jørgen Bang-Jensen; Stéphane Bessy; Frédéric Havet; Anders Yeo (J. Graph Theory, 2019)

Degree-constrained 2-partitions of graphs. - Jørgen Bang-Jensen; Stéphane Bessy (Theor. Comput. Sci., 2019)

The parameterized complexity landscape of finding 2-partitions of digraphs. - Jørgen Bang-Jensen; Kristine Vitting Klinkby; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2019)

Inversion number of an oriented graph and related parameters. - Jørgen Bang-Jensen; Jonas Costa Ferreira da Silva; Frédéric Havet (ALGOS, 2020)

Hajós and Ore Constructions for Digraphs. - Jørgen Bang-Jensen; Thomas Bellitto; Thomas Schweser; Michael Stiebitz (Electron. J. Comb., 2020)

Non-separating spanning trees and out-branchings in digraphsof independence number 2. - Jørgen Bang-Jensen; Stéphane Bessy; Anders Yeo (CoRR, 2020)

Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. - Jørgen Bang-Jensen; Hugues Déprés; Anders Yeo (Discret. Math., 2020)

Out-colourings of digraphs. - Noga Alon; Jørgen Bang-Jensen; Stéphane Bessy (J. Graph Theory, 2020)

On DP-coloring of digraphs. - Jørgen Bang-Jensen; Thomas Bellitto; Thomas Schweser; Michael Stiebitz (J. Graph Theory, 2020)

Arc-disjoint strong spanning subdigraphs of semicomplete compositions. - Jørgen Bang-Jensen; Gregory Z. Gutin; Anders Yeo (J. Graph Theory, 2020)

On the parameterized complexity of 2-partitions. - Jonas Bamse Andersen; Jørgen Bang-Jensen; Anders Yeo (Theor. Comput. Sci., 2020)

The directed 2-linkage problem with length constraints. - Jørgen Bang-Jensen; Thomas Bellitto; William Lochet; Anders Yeo (Theor. Comput. Sci., 2020)

k-Distinct Branchings Admits a Polynomial Kernel. - Jørgen Bang-Jensen; Kristine Vitting Klinkby; Saket Saurabh 001 (ESA, 2021)

On the inversion number of oriented graphs. - Jørgen Bang-Jensen; Jonas Costa Ferreira da Silva; Frédéric Havet (Discret. Math. Theor. Comput. Sci., 2021)

On Supereulerian 2-Edge-Coloured Graphs. - Jørgen Bang-Jensen; Thomas Bellitto; Anders Yeo (Graphs Comb., 2021)

Good orientations of unions of edge-disjoint spanning trees. - Jørgen Bang-Jensen; Stéphane Bessy; Jing Huang 007; Matthias Kriesell (J. Graph Theory, 2021)

Proper-walk connection number of graphs. - Jørgen Bang-Jensen; Thomas Bellitto; Anders Yeo (J. Graph Theory, 2021)

Component Order Connectivity in Directed Graphs. - Jørgen Bang-Jensen; Eduard Eiben; Gregory Z. Gutin; Magnus Wahlström; Anders Yeo (Algorithmica, 2022)

Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked. - Jørgen Bang-Jensen; Kasper Skov Johansen (Discret. Math., 2022)

Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. - Jørgen Bang-Jensen; Stéphane Bessy; Anders Yeo (Graphs Comb., 2022)

Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. - Jørgen Bang-Jensen; Stéphane Bessy; Frédéric Havet; Anders Yeo (J. Graph Theory, 2022)

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. - Jørgen Bang-Jensen; Frédéric Havet; Matthias Kriesell; Anders Yeo (J. Graph Theory, 2022)

Good acyclic orientations of 4-regular 4-connected graphs. - Jørgen Bang-Jensen; Matthias Kriesell (J. Graph Theory, 2022)

Digraphs and Variable Degeneracy. - Jørgen Bang-Jensen; Thomas Schweser; Michael Stiebitz (SIAM J. Discret. Math., 2022)

Complexity of some arc-partition problems for digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Daniel Gonçalves 001; Lucas Picasarri-Arrieta (Theor. Comput. Sci., 2022)

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. - Jørgen Bang-Jensen; Kristine Vitting Klinkby; Pranabendu Misra; Saket Saurabh 001 (ESA, 2023)

Spanning eulerian subdigraphs in semicomplete digraphs. - Jørgen Bang-Jensen; Frédéric Havet; Anders Yeo (J. Graph Theory, 2023)

The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties. - Jørgen Bang-Jensen; Anders Yeo (Theor. Comput. Sci., 2023)

Making a tournament k $k$-strong. - Jørgen Bang-Jensen; Kasper Skov Johansen; Anders Yeo (J. Graph Theory, 2023)

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. - Jørgen Bang-Jensen; Florian Hörsch; Matthias Kriesell (Theor. Comput. Sci., 2023)

Safe sets and in-dominating sets in digraphs. - Yandong Bai; Jørgen Bang-Jensen; Shinya Fujita 001; Hirotaka Ono 001; Anders Yeo (Discret. Appl. Math., 2024)

Arc-disjoint out- and in-branchings in compositions of digraphs. - Jørgen Bang-Jensen; Yun Wang (Eur. J. Comb., 2024)

Arc-disjoint out-branchings and in-branchings in semicomplete digraphs. - Jørgen Bang-Jensen; Yun Wang (J. Graph Theory, 2024)

Constrained flows in networks. - Jørgen Bang-Jensen; Stéphane Bessy; Lucas Picasarri-Arrieta (Theor. Comput. Sci., 2024)

Strong arc decompositions of split digraphs. - Jørgen Bang-Jensen; Yun Wang (J. Graph Theory, 2025)

Edge-arc-disjoint paths in semicomplete mixed graphs. - Jørgen Bang-Jensen; Yun Wang (J. Graph Theory, 2025)

On the k-linkage problem for generalizations of semicomplete digraphs. - Jia Zhou; Jørgen Bang-Jensen; Jin Yan (Discret. Math., 2026)