dblp.uni-trier.dewww.uni-trier.de

Jørgen Bang-Jensen Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
63EEJørgen Bang-Jensen: k-strong spanning local tournaments in locally semicomplete digraphs. Discrete Applied Mathematics 157(11): 2536-2540 (2009)
2008
62EEJørgen Bang-Jensen, Anders Yeo: The minimum spanning strong subdigraph problem is fixed parameter tractable. Discrete Applied Mathematics 156(15): 2924-2929 (2008)
61EEJørgen Bang-Jensen, Morten Hegner Nielsen: Minimum cycle factors in quasi-transitive digraphs. Discrete Optimization 5(1): 121-137 (2008)
60EEJørgen Bang-Jensen, Tibor Jordán: On persistent directed graphs. Networks 52(4): 271-276 (2008)
2007
59EEJørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen: Mixed Models for the Analysis of Local Search Components. SLS 2007: 91-105
58EEJørgen Bang-Jensen, Jing Huang, Louis Ibarra: Recognizing and representing proper interval graphs in parallel using merging and sorting. Discrete Applied Mathematics 155(4): 442-456 (2007)
57EEJørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz: Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. Discrete Optimization 4(3-4): 334-348 (2007)
2006
56EEJørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo: Longest path partitions in generalizations of tournaments. Discrete Mathematics 306(16): 1830-1839 (2006)
55EEJørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Discrete Optimization 3(1): 86-94 (2006)
2005
54 Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD 2005: 81-94
53EEJørgen Bang-Jensen, Morten Hegner Nielsen: Finding complementary cycles in locally semicomplete digraphs. Discrete Applied Mathematics 146(3): 245-256 (2005)
2004
52EEJørgen Bang-Jensen, Anders Yeo: Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. Combinatorica 24(3): 331-349 (2004)
51EEJørgen Bang-Jensen, Anders Yeo: Making a tournament k-arc-strong by reversing or deorienting arcs. Discrete Applied Mathematics 136(2-3): 161-171 (2004)
50EEJørgen Bang-Jensen, Tibor Jordán: Splitting off edges between two subsets preserving the edge-connectivity of the graph. Discrete Mathematics 276(1-3): 5-28 (2004)
49EEJørgen Bang-Jensen: The structure of strong arc-locally semicomplete digraphs. Discrete Mathematics 283(1-3): 1-6 (2004)
48EEJørgen Bang-Jensen, Gregory Gutin, Anders Yeo: When the greedy algorithm fails. Discrete Optimization 1(2): 121-127 (2004)
47EEJørgen Bang-Jensen, Jing Huang, Anders Yeo: Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments. Journal of Graph Theory 46(4): 265-284 (2004)
46EEJørgen Bang-Jensen, Stephan Brandt: Subgraphs in vertex neighborhoods of Kr-free graphs. Journal of Graph Theory 47(1): 29-38 (2004)
2003
45EEJørgen Bang-Jensen, Stéphan Thomassé: Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. Discrete Applied Mathematics 131(2): 555-559 (2003)
44EEJørgen Bang-Jensen, Jing Huang, Anders Yeo: Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. SIAM J. Discrete Math. 16(2): 335-343 (2003)
2001
43EEJørgen Bang-Jensen, Anders Yeo: Making a tournament k-arc-strong by reversing arcs. Electronic Notes in Discrete Mathematics 8: 2-5 (2001)
42 Jørgen Bang-Jensen, Anders Yeo: The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. J. Algorithms 41(1): 1-19 (2001)
2000
41EEJørgen Bang-Jensen, Yubao Guo, Anders Yeo: Complementary cycles containing prescribed vertices in tournaments. Discrete Mathematics 214(1-3): 77-87 (2000)
40EEJørgen Bang-Jensen: Problems concerning global connectivity of directed graphs. Electronic Notes in Discrete Mathematics 5: 15-18 (2000)
39 Jørgen Bang-Jensen, Tibor Jordán: Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. J. Algorithms 37(2): 326-343 (2000)
38EEJørgen Bang-Jensen, Jing Huang, Anders Yeo: Convex-Round and Concave-Round Graphs. SIAM J. Discrete Math. 13(2): 179-193 (2000)
1999
37EEJørgen Bang-Jensen, Gregory Gutin: On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs. Discrete Applied Mathematics 95(1-3): 41-60 (1999)
36EEJørgen Bang-Jensen, Yubao Guo, Anders Yeo: A New Sufficient Condition for a Digraph to Be Hamiltonian. Discrete Applied Mathematics 95(1-3): 61-72 (1999)
35EEJørgen Bang-Jensen: Linkages in locally semicomplete digraphs and quasi-transitive digraphs. Discrete Mathematics 196(1-3): 13-27 (1999)
34EEJørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti: Edge-Connectivity Augmentation with Partition Constraints. SIAM J. Discrete Math. 12(2): 160-207 (1999)
1998
33 Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti: Edge-Connectivity Augmentation with Partition Constraints. SODA 1998: 306-315
32 Jørgen Bang-Jensen, Tibor Jordán: Adding and Reversing Arcs in Semicomplete Digraphs. Combinatorics, Probability & Computing 7(1): 17-25 (1998)
31EEJørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. Discrete Applied Mathematics 82(1-3): 247-250 (1998)
30EEJørgen Bang-Jensen, Jing Huang: Kings in quasi-transitive digraphs. Discrete Mathematics 185(1-3): 19-27 (1998)
29EEJørgen Bang-Jensen, Gregory Gutin: Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discrete Mathematics 188(1-3): 61-72 (1998)
28EEJørgen Bang-Jensen, Tibor Jordán: Edge-Connectivity Augmentation Preserving Simplicity. SIAM J. Discrete Math. 11(4): 603-623 (1998)
1997
27EEJørgen Bang-Jensen, Tibor Jordán: Edge-Connectivity Augmentation Preserving Simplicity. FOCS 1997: 486-495
26 Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka: Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. Algorithmica 17(1): 67-87 (1997)
25 Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Combinatorics, Probability & Computing 6(3): 255-261 (1997)
24EEJørgen Bang-Jensen, Gregory Gutin: Vertex heaviest paths and cycles in quasi-transitive digraphs. Discrete Mathematics 163(1-3): 217-223 (1997)
23EEJørgen Bang-Jensen, Gregory Gutin: Paths and cycles in extended and decomposable digraphs, . Discrete Mathematics 164(1-3): 5-19 (1997)
22EEJørgen Bang-Jensen, Gregory Gutin: Alternating cycles and paths in edge-coloured multigraphs: A survey. Discrete Mathematics 165-166: 39-60 (1997)
21EEJørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann: A classification of locally semicomplete digraphs. Discrete Mathematics 167-168: 101-114 (1997)
1996
20EEJørgen Bang-Jensen, Gregory Gutin, Jing Huang: A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. Discrete Mathematics 161(1-3): 1-12 (1996)
19EEJørgen Bang-Jensen, Gregory Gutin, Anders Yeo: On k-strong and k-cyclic digraphs. Discrete Mathematics 162(1-3): 1-11 (1996)
1995
18EEJørgen Bang-Jensen, Gregory Gutin, Jing Huang: Weakly Hamiltonian-connected ordinary multipartite tournaments. Discrete Mathematics 138(1-3): 63-74 (1995)
17EEJørgen Bang-Jensen, Pavol Hell, Gary MacGillivray: Hereditarily hard H-colouring problems. Discrete Mathematics 138(1-3): 75-92 (1995)
16EEJørgen Bang-Jensen, Yannis Manoussakis: Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. J. Comb. Theory, Ser. B 63(2): 261-280 (1995)
15EEJørgen Bang-Jensen, András Frank, Bill Jackson: Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. SIAM J. Discrete Math. 8(2): 155-178 (1995)
1994
14 Jørgen Bang-Jensen, Yannis Manoussakis: Cycles Through k Vertices in Bipartite Tournaments. Combinatorica 14(2): 243-246 (1994)
13EEJørgen Bang-Jensen, Pavol Hell: On chordal proper circular arc graphs. Discrete Mathematics 128(1-3): 395-398 (1994)
1993
12EEJørgen Bang-Jensen, Pavol Hell: Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. Discrete Applied Mathematics 41(1): 75-79 (1993)
11EEJørgen Bang-Jensen, Jing Huang, Erich Prisner: In-Tournament Digraphs. J. Comb. Theory, Ser. B 59(2): 267-287 (1993)
1992
10EEJørgen Bang-Jensen: On the structure of locally semicomplete digraphs. Discrete Mathematics 100(1-3): 243-265 (1992)
9EEJørgen Bang-Jensen, Bjarne Toft: Unsolved problems presented at the Julius Petersen Graph Theory Conference. Discrete Mathematics 101(1-3): 351-360 (1992)
8EEJørgen Bang-Jensen, Pavol Hell, Gary MacGillivray: On the complexity of colouring by superdigraphs of bipartite graphs. Discrete Mathematics 109(1-3): 27-44 (1992)
7 Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen: A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms 13(1): 114-127 (1992)
6 Jørgen Bang-Jensen, Carsten Thomassen: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. SIAM J. Discrete Math. 5(3): 366-376 (1992)
1991
5 Jørgen Bang-Jensen, Svatopluk Poljak: Eulerian trails through a set of terminals in specific, unique and all orders. Graph Structure Theory 1991: 247-258
4EEJørgen Bang-Jensen: Edge-disjoint in- and out-branchings in tournaments and related path problems. J. Comb. Theory, Ser. B 51(1): 1-23 (1991)
1990
3EEPavol Hell, Jørgen Bang-Jensen, Jing Huang: Local Tournaments and Proper Circular Arc Gaphs. SIGAL International Symposium on Algorithms 1990: 101-108
2EEJørgen Bang-Jensen, Pavol Hell: The effect of two cycles on the complexity of colourings by directed graphs. Discrete Applied Mathematics 26(1): 1-23 (1990)
1988
1 Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray: The Complexity of Colouring by Semicomplete Digraphs. SIAM J. Discrete Math. 1(3): 281-298 (1988)

Coauthor Index

1Stephan Brandt [46]
2Marco Chiarandini [59]
3András Frank [15]
4Harold N. Gabow [33] [34]
5Yuri Goegebeur [59]
6Daniel Gonçalves [57]
7Inge Li Gørtz [57]
8Yubao Guo [21] [36] [41]
9Gregory Gutin [18] [19] [20] [21] [22] [23] [24] [25] [29] [31] [37] [48] [54] [55]
10Mohamed El Haddad [26]
11Pavol Hell [1] [2] [3] [8] [12] [13] [17]
12Jing Huang [3] [11] [18] [20] [30] [38] [44] [47] [58]
13Louis Ibarra [58]
14Bill Jackson [15]
15Tibor Jordán [27] [28] [32] [33] [34] [39] [50] [60]
16Bent Jørgensen [59]
17Gary MacGillivray [1] [8] [17]
18Yannis Manoussakis [7] [14] [16] [26]
19Morten Hegner Nielsen [53] [56] [61]
20Svatopluk Poljak [5]
21Erich Prisner [11]
22Teresa M. Przytycka [26]
23Zoltán Szigeti [33] [34]
24Stéphan Thomassé [45]
25Carsten Thomassen [6] [7]
26Bjarne Toft [9]
27Lutz Volkmann [21]
28Anders Yeo [19] [25] [31] [36] [38] [41] [42] [43] [44] [47] [48] [51] [52] [54] [55] [56] [62]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)