Jørgen Bang-Jensen

183 papers A* 3A 2B 1Journal 166Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On the k-linkage problem for generalizations of semicomplete digraphs. Discret. Math. Jia Zhou, Jørgen Bang-Jensen, Jin Yan
2025	J	`jnl`	Acyclic dichromatic number of oriented graphs. CoRR Jørgen Bang-Jensen, Lucas Picasarri-Arrieta, Anders Yeo
2025	J	`jnl`	Edge-arc-disjoint paths in semicomplete mixed graphs. J. Graph Theory Jørgen Bang-Jensen, Yun Wang
2025	J	`jnl`	Generalized paths and cycles in semicomplete multipartite digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Yun Wang, Anders Yeo
2025	J	`jnl`	Making an oriented graph acyclic using inversions of bounded or prescribed size. CoRR Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch, Clément Rambaud, Amadeus Reinald, Caroline Silva
2025	J	`jnl`	Strong arc decompositions of split digraphs. J. Graph Theory Jørgen Bang-Jensen, Yun Wang
2024	J	`jnl`	Arc-disjoint out- and in-branchings in compositions of digraphs. Eur. J. Comb. Jørgen Bang-Jensen, Yun Wang
2024	J	`jnl`	Arc-disjoint out-branchings and in-branchings in semicomplete digraphs. J. Graph Theory Jørgen Bang-Jensen, Yun Wang
2024	J	`jnl`	Constrained flows in networks. Theor. Comput. Sci. Jørgen Bang-Jensen, Stéphane Bessy, Lucas Picasarri-Arrieta
2024	J	`jnl`	Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo
2023	A	`conf`	A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. ESA Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh
2023	J	`jnl`	Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. Theor. Comput. Sci. Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell
2023	J	`jnl`	Constrained Flows in Networks. CoRR Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta
2023	J	`jnl`	Making a tournament k $k$-strong. J. Graph Theory Jørgen Bang-Jensen, Kasper Skov Johansen, Anders Yeo
2023	J	`jnl`	Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
2023	J	`jnl`	The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties. Theor. Comput. Sci. Jørgen Bang-Jensen, Anders Yeo
2022	J	`jnl`	Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. J. Graph Theory Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2022	J	`jnl`	Complexity of some arc-partition problems for digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta
2022	J	`jnl`	Component Order Connectivity in Directed Graphs. Algorithmica Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2022	J	`jnl`	Digraphs and Variable Degeneracy. SIAM J. Discret. Math. Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz
2022	J	`jnl`	Every (13 Discret. Math. Jørgen Bang-Jensen, Kasper Skov Johansen
2022	J	`jnl`	Good acyclic orientations of 4-regular 4-connected graphs. J. Graph Theory Jørgen Bang-Jensen, Matthias Kriesell
2022	J	`jnl`	Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo
2022	J	`jnl`	Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. Graphs Comb. Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
2021	J	`jnl`	Good orientations of unions of edge-disjoint spanning trees. J. Graph Theory Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell
2021	J	`jnl`	On Supereulerian 2-Edge-Coloured Graphs. Graphs Comb. Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
2021	J	`jnl`	On the inversion number of oriented graphs. CoRR Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
2021	J	`jnl`	On the inversion number of oriented graphs. Discret. Math. Theor. Comput. Sci. Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
2021	J	`jnl`	Proper-walk connection number of graphs. J. Graph Theory Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
2021	A	`conf`	k-Distinct Branchings Admits a Polynomial Kernel. ESA Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh
2020	J	`jnl`	Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2020	B	`conf`	Component Order Connectivity in Directed Graphs. IPEC Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	J	`jnl`	Component Order Connectivity in Directed Graphs. CoRR Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	J	`jnl`	Hajós and Ore Constructions for Digraphs. Electron. J. Comb. Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
2020	—	`conf`	Inversion number of an oriented graph and related parameters. ALGOS Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
2020	J	`jnl`	Non-separating spanning trees and out-branchings in digraphsof independence number 2. CoRR Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
2020	J	`jnl`	On DP-coloring of digraphs. J. Graph Theory Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
2020	J	`jnl`	On the parameterized complexity of 2-partitions. CoRR Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
2020	J	`jnl`	On the parameterized complexity of 2-partitions. Theor. Comput. Sci. Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
2020	J	`jnl`	Out-colourings of digraphs. J. Graph Theory Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy
2020	J	`jnl`	Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. Discret. Math. Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo
2020	J	`jnl`	The directed 2-linkage problem with length constraints. Theor. Comput. Sci. Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
2019	J	`jnl`	Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. CoRR Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2019	J	`jnl`	Bipartite spanning sub(di)graphs induced by 2-partitions. J. Graph Theory Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2019	J	`jnl`	Connecting edge-colouring. CoRR Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
2019	J	`jnl`	Degree-constrained 2-partitions of graphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Stéphane Bessy
2019	J	`jnl`	Safe sets in digraphs. CoRR Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Anders Yeo
2019	J	`jnl`	Spanning eulerian subdigraphs in semicomplete digraphs. CoRR Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
2019	J	`jnl`	The directed 2-linkage problem with length constraints. CoRR Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
2019	J	`jnl`	The parameterized complexity landscape of finding 2-partitions of digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh, Meirav Zehavi
2018	—	`ch.`	Basic Terminology, Notation and Results. Classes of Directed Graphs Jørgen Bang-Jensen, Gregory Z. Gutin
2018	—	`book`	Classes of Directed Graphs. Jørgen Bang-Jensen, Gregory Z. Gutin
2018	J	`jnl`	Completing orientations of partially oriented graphs. J. Graph Theory Jørgen Bang-Jensen, Jing Huang, Xuding Zhu
2018	J	`jnl`	Degree constrained 2-partitions of semicomplete digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Tilde My Christiansen
2018	J	`jnl`	Degree-constrained 2-partitions of graphs. CoRR Jørgen Bang-Jensen, Stéphane Bessy
2018	—	`ch.`	Locally Semicomplete Digraphs and Generalizations. Classes of Directed Graphs Jørgen Bang-Jensen
2018	J	`jnl`	Out-degree reducing partitions of digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2018	A*	`conf`	Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	—	`ch.`	Tournaments and Semicomplete Digraphs. Classes of Directed Graphs Jørgen Bang-Jensen, Frédéric Havet
2018	J	`jnl`	χ-bounded families of oriented graphs. J. Graph Theory Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
2017	J	`jnl`	Antistrong digraphs. J. Comb. Theory B Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell
2017	J	`jnl`	Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2017	J	`jnl`	Disjoint Paths in Decomposable Digraphs. J. Graph Theory Jørgen Bang-Jensen, Tilde My Christiansen, Alessandro Maddaloni
2017	J	`jnl`	Out-colourings of Digraphs. CoRR Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy
2017	J	`jnl`	Out-degree reducing partitions of digraphs. CoRR Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2016	J	`jnl`	$χ$-bounded families of oriented graphs. CoRR Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
2016	J	`jnl`	Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments. Algorithmica Jørgen Bang-Jensen, Alessandro Maddaloni, Saket Saurabh
2016	J	`jnl`	Arc-Disjoint Directed and Undirected Cycles in Digraphs. J. Graph Theory Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen
2016	J	`jnl`	DAG-Width and Circumference of Digraphs. J. Graph Theory Jørgen Bang-Jensen, Tilde My Larsen
2016	J	`jnl`	Finding good 2-partitions of digraphs I. Hereditary properties. Theor. Comput. Sci. Jørgen Bang-Jensen, Frédéric Havet
2016	J	`jnl`	Finding good 2-partitions of digraphs II. Enumerable properties. Theor. Comput. Sci. Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet
2016	J	`jnl`	Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs. Algorithmica Jørgen Bang-Jensen, Saket Saurabh, Sven Simonsen
2016	J	`jnl`	The complexity of finding arc-disjoint branching flows. Discret. Appl. Math. Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
2015	J	`jnl`	Balanced branchings in digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Anders Yeo
2015	J	`jnl`	Completing orientations of partially oriented graphs. CoRR Jørgen Bang-Jensen, Jing Huang, Xuding Zhu
2015	J	`jnl`	Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. J. Graph Theory Jørgen Bang-Jensen, Stéphane Bessy
2015	J	`jnl`	DAG-width and circumference of digraphs. CoRR Jørgen Bang-Jensen, Tilde My Larsen
2015	J	`jnl`	Finding a subdivision of a digraph. Theor. Comput. Sci. Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia
2015	J	`jnl`	Restricted cycle factors and arc-decompositions of digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Carl Johan Casselgren
2015	J	`jnl`	Sufficient Conditions for a Digraph to be Supereulerian. J. Graph Theory Jørgen Bang-Jensen, Alessandro Maddaloni
2015	J	`jnl`	Vertex coloring edge-weighted digraphs. Inf. Process. Lett. Jørgen Bang-Jensen, Magnús M. Halldórsson
2014	J	`jnl`	(Arc-)disjoint flows in networks. Theor. Comput. Sci. Jørgen Bang-Jensen, Stéphane Bessy
2014	J	`jnl`	Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs. J. Graph Theory Jørgen Bang-Jensen, Jing Huang
2014	J	`jnl`	Arc-Disjoint Paths in Decomposable Digraphs. J. Graph Theory Jørgen Bang-Jensen, Alessandro Maddaloni
2014	J	`jnl`	Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. J. Graph Theory Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé
2014	J	`jnl`	The complexity of multicut and mixed multicut problems in (di)graphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Anders Yeo
2014	J	`jnl`	Vertex-disjoint directed and undirected cycles in general digraphs. J. Comb. Theory B Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen
2013	J	`jnl`	Arc-disjoint paths and trees in 2-regular digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Sven Simonsen
2013	J	`jnl`	Finding an induced subdivision of a digraph. CoRR Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
2013	J	`jnl`	Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties. Theor. Comput. Sci. Jørgen Bang-Jensen, Daniel Gonçalves, Anders Yeo
2013	J	`jnl`	Quasi-hamiltonian paths in semicomplete multipartite digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen
2012	J	`jnl`	Arc-Disjoint Paths and Trees in 2-Regular Digraphs CoRR Jørgen Bang-Jensen, Sven Simonsen
2012	J	`jnl`	Arc-disjoint spanning sub(di)graphs in digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Anders Yeo
2012	J	`jnl`	Decomposing locally semicomplete digraphs into strong spanning subdigraphs. J. Comb. Theory B Jørgen Bang-Jensen, Jing Huang
2012	J	`jnl`	Efficient algorithms for real-life instances of the variable size bin packing problem. Comput. Oper. Res. Jørgen Bang-Jensen, Rune Larsen
2012	J	`jnl`	Finding an induced subdivision of a digraph. Theor. Comput. Sci. Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
2011	J	`jnl`	A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles. Contributions Discret. Math. Gary MacGillivray, Jacobus Swarts, Jørgen Bang-Jensen
2011	J	`jnl`	Finding an induced subdivision of a digraph. Electron. Notes Discret. Math. Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
2011	J	`jnl`	On the problem of finding disjoint cycles and dicycles in a digraph. Comb. Jørgen Bang-Jensen, Matthias Kriesell
2010	J	`jnl`	A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. Networks Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling
2010	J	`jnl`	Heuristics for the central tree problem. J. Heuristics Jørgen Bang-Jensen, Yury Nikulin
2010	J	`jnl`	Spanning 2-strong tournaments in 3-strong semicomplete digraphs. Discret. Math. Jørgen Bang-Jensen, Tibor Jordán
2010	J	`jnl`	The complexity of colouring by locally semicomplete digraphs. Discret. Math. Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts
2009	—	`book`	Digraphs - Theory, Algorithms and Applications, Second Edition. Jørgen Bang-Jensen, Gregory Z. Gutin
2009	J	`jnl`	Disjoint directed and undirected paths and cycles in digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Matthias Kriesell
2009	J	`jnl`	Disjoint sub(di)graphs in digraphs. Electron. Notes Discret. Math. Jørgen Bang-Jensen, Matthias Kriesell
2009	J	`jnl`	Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. Discret. Math. Jørgen Bang-Jensen
2009	J	`jnl`	k-strong spanning local tournaments in locally semicomplete digraphs. Discret. Appl. Math. Jørgen Bang-Jensen
2008	J	`jnl`	Minimum cycle factors in quasi-transitive digraphs. Discret. Optim. Jørgen Bang-Jensen, Morten Hegner Nielsen
2008	J	`jnl`	On persistent directed graphs. Networks Jørgen Bang-Jensen, Tibor Jordán
2008	J	`jnl`	The minimum spanning strong subdigraph problem is fixed parameter tractable. Discret. Appl. Math. Jørgen Bang-Jensen, Anders Yeo
2007	J	`jnl`	Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. Discret. Optim. Jørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz
2007	—	`conf`	Mixed Models for the Analysis of Local Search Components. SLS Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen
2007	J	`jnl`	Recognizing and representing proper interval graphs in parallel using merging and sorting. Discret. Appl. Math. Jørgen Bang-Jensen, Jing Huang, Louis Ibarra
2006	J	`jnl`	Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Discret. Optim. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2006	J	`jnl`	Longest path partitions in generalizations of tournaments. Discret. Math. Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo
2005	—	`conf`	Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2005	J	`jnl`	Finding complementary cycles in locally semicomplete digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Morten Hegner Nielsen
2004	J	`jnl`	Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. Comb. Jørgen Bang-Jensen, Anders Yeo
2004	J	`jnl`	Making a tournament k-arc-strong by reversing or deorienting arcs. Discret. Appl. Math. Jørgen Bang-Jensen, Anders Yeo
2004	J	`jnl`	Spanning J. Graph Theory Jørgen Bang-Jensen, Jing Huang, Anders Yeo
2004	J	`jnl`	Splitting off edges between two subsets preserving the edge-connectivity of the graph. Discret. Math. Jørgen Bang-Jensen, Tibor Jordán
2004	J	`jnl`	Subgraphs in vertex neighborhoods of J. Graph Theory Jørgen Bang-Jensen, Stephan Brandt
2004	J	`jnl`	The structure of strong arc-locally semicomplete digraphs. Discret. Math. Jørgen Bang-Jensen
2004	J	`jnl`	When the greedy algorithm fails. Discret. Optim. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2003	J	`jnl`	Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Stéphan Thomassé
2003	J	`jnl`	Small degree out-branchings. J. Graph Theory Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo
2003	J	`jnl`	Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2003	J	`jnl`	Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, Jing Huang, Anders Yeo
2002	J	`jnl`	Convex-round graphs are circular-perfect. J. Graph Theory Jørgen Bang-Jensen, Jing Huang
2002	—	`book`	Digraphs - theory, algorithms and applications. Jørgen Bang-Jensen, Gregory Z. Gutin
2001	J	`jnl`	Making a tournament k-arc-strong by reversing arcs. Electron. Notes Discret. Math. Jørgen Bang-Jensen, Anders Yeo
2001	J	`jnl`	The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. J. Algorithms Jørgen Bang-Jensen, Anders Yeo
2000	J	`jnl`	Complementary cycles containing prescribed vertices in tournaments. Discret. Math. Jørgen Bang-Jensen, Yubao Guo, Anders Yeo
2000	J	`jnl`	Convex-Round and Concave-Round Graphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, Jing Huang, Anders Yeo
2000	J	`jnl`	Problems concerning global connectivity of directed graphs. Electron. Notes Discret. Math. Jørgen Bang-Jensen
2000	J	`jnl`	Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. J. Algorithms Jørgen Bang-Jensen, Tibor Jordán
1999	J	`jnl`	A New Sufficient Condition for a Digraph to Be Hamiltonian. Discret. Appl. Math. Jørgen Bang-Jensen, Yubao Guo, Anders Yeo
1999	J	`jnl`	A note on vertex pancyclic oriented graphs. J. Graph Theory Jørgen Bang-Jensen, Yubao Guo
1999	J	`jnl`	Augmenting hypergraphs by edges of size two. Math. Program. Jørgen Bang-Jensen, Bill Jackson
1999	J	`jnl`	Edge-Connectivity Augmentation with Partition Constraints. SIAM J. Discret. Math. Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
1999	J	`jnl`	Linkages in locally semicomplete digraphs and quasi-transitive digraphs. Discret. Math. Jørgen Bang-Jensen
1999	J	`jnl`	On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1998	J	`jnl`	A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1998	J	`jnl`	Adding and Reversing Arcs in Semicomplete Digraphs. Comb. Probab. Comput. Jørgen Bang-Jensen, Tibor Jordán
1998	J	`jnl`	Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1998	J	`jnl`	Edge-Connectivity Augmentation Preserving Simplicity. SIAM J. Discret. Math. Jørgen Bang-Jensen, Tibor Jordán
1998	A*	`conf`	Edge-Connectivity Augmentation with Partition Constraints. SODA Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
1998	J	`jnl`	Generalizations of tournaments: A survey. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin
1998	J	`jnl`	Kings in quasi-transitive digraphs. Discret. Math. Jørgen Bang-Jensen, Jing Huang
1998	J	`jnl`	Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. Discret. Appl. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1997	J	`jnl`	A classification of locally semicomplete digraphs. Discret. Math. Jørgen Bang-Jensen, Yubao Guo, Gregory Z. Gutin, Lutz Volkmann
1997	J	`jnl`	Alternating cycles and paths in edge-coloured multigraphs: A survey. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1997	A*	`conf`	Edge-Connectivity Augmentation Preserving Simplicity. FOCS Jørgen Bang-Jensen, Tibor Jordán
1997	J	`jnl`	Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Comb. Probab. Comput. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1997	J	`jnl`	Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. Algorithmica Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka
1997	J	`jnl`	Paths and cycles in extended and decomposable digraphs Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1997	J	`jnl`	Vertex heaviest paths and cycles in quasi-transitive digraphs. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1996	J	`jnl`	A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang
1996	J	`jnl`	On k-strong and k-cyclic digraphs. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1996	J	`jnl`	Sufficient conditions for a digraph to be Hamiltonian. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Hao Li
1996	J	`jnl`	Weakly Hamiltonian-connected locally semicomplete digraphs. J. Graph Theory Jørgen Bang-Jensen, Yubao Guo, Lutz Volkmann
1995	J	`jnl`	Digraphs with the path-merging property. J. Graph Theory Jørgen Bang-Jensen
1995	J	`jnl`	Hereditarily hard H-colouring problems. Discret. Math. Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray
1995	J	`jnl`	Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, András Frank, Bill Jackson
1995	J	`jnl`	Quasi-transitive digraphs. J. Graph Theory Jørgen Bang-Jensen, Jing Huang
1995	J	`jnl`	Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. J. Comb. Theory B Jørgen Bang-Jensen, Yannis Manoussakis
1995	J	`jnl`	Weakly Hamiltonian-connected ordinary multipartite tournaments. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang
1994	J	`jnl`	Cycles Through Comb. Jørgen Bang-Jensen, Yannis Manoussakis
1994	J	`jnl`	On chordal proper circular arc graphs. Discret. Math. Jørgen Bang-Jensen, Pavol Hell
1993	J	`jnl`	Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Pavol Hell
1993	J	`jnl`	In-Tournament Digraphs. J. Comb. Theory B Jørgen Bang-Jensen, Jing Huang, Erich Prisner
1992	J	`jnl`	A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen
1992	J	`jnl`	A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, Carsten Thomassen
1992	J	`jnl`	On the complexity of colouring by superdigraphs of bipartite graphs. Discret. Math. Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray
1992	J	`jnl`	On the structure of locally semicomplete digraphs. Discret. Math. Jørgen Bang-Jensen
1992	J	`jnl`	Unsolved problems presented at the Julius Petersen Graph Theory Conference. Discret. Math. Jørgen Bang-Jensen, Bjarne Toft
1991	J	`jnl`	Edge-disjoint in- and out-branchings in tournaments and related path problems. J. Comb. Theory B Jørgen Bang-Jensen
1991	—	`conf`	Eulerian trails through a set of terminals in specific, unique and all orders. Graph Structure Theory Jørgen Bang-Jensen, Svatopluk Poljak
1990	—	`conf`	Local Tournaments and Proper Circular Arc Gaphs. SIGAL International Symposium on Algorithms Pavol Hell, Jørgen Bang-Jensen, Jing Huang
1990	J	`jnl`	Locally semicomplete digraphs: A generalization of tournaments. J. Graph Theory Jørgen Bang-Jensen
1990	J	`jnl`	The effect of two cycles on the complexity of colourings by directed graphs. Discret. Appl. Math. Jørgen Bang-Jensen, Pavol Hell
1988	J	`jnl`	The Complexity of Colouring by Semicomplete Digraphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray