- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j84 |      | Jørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen: Quasi-hamiltonian paths in semicomplete multipartite digraphs. Discrete Applied Mathematics 161(7-8): 889-898 (2013) |
| j83 | | 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) |
| 2012 | ||
| j82 | | Jørgen Bang-Jensen, Rune Larsen: Efficient algorithms for real-life instances of the variable size bin packing problem. Computers & OR 39(11): 2848-2857 (2012) |
| j81 | | Jørgen Bang-Jensen, Jing Huang: Decomposing locally semicomplete digraphs into strong spanning subdigraphs. J. Comb. Theory, Ser. B 102(3): 701-714 (2012) |
| j80 | | Jørgen Bang-Jensen, Anders Yeo: Arc-disjoint spanning sub(di)graphs in digraphs. Theor. Comput. Sci. 438: 48-54 (2012) |
| j79 | | 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 | ||
| j78 | | 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 to Discrete Mathematics 6(2) (2011) |
| j77 | | Jørgen Bang-Jensen, Matthias Kriesell: On the problem of finding disjoint cycles and dicycles in a digraph. Combinatorica 31(6): 639-668 (2011) |
| j76 | | Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon: Finding an induced subdivision of a digraph. Electronic Notes in Discrete Mathematics 37: 9-14 (2011) |
| 2010 | ||
| j75 | | Jørgen Bang-Jensen, Tibor Jordán: Spanning 2-strong tournaments in 3-strong semicomplete digraphs. Discrete Mathematics 310(9): 1424-1428 (2010) |
| j74 | | Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts: The complexity of colouring by locally semicomplete digraphs. Discrete Mathematics 310(20): 2675-2684 (2010) |
| j73 | | Jørgen Bang-Jensen, Yury Nikulin: Heuristics for the central tree problem. J. Heuristics 16(5): 633-651 (2010) |
| j72 | | 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) |
| 2009 | ||
| j71 | | Jørgen Bang-Jensen: k-strong spanning local tournaments in locally semicomplete digraphs. Discrete Applied Mathematics 157(11): 2536-2540 (2009) |
| j70 | | Jørgen Bang-Jensen: Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. Discrete Mathematics 309(18): 5655-5667 (2009) |
| j69 | | Jørgen Bang-Jensen, Matthias Kriesell: Disjoint sub(di)graphs in digraphs. Electronic Notes in Discrete Mathematics 34: 179-183 (2009) |
| j68 | | 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 | ||
| j67 | | Jørgen Bang-Jensen, Anders Yeo: The minimum spanning strong subdigraph problem is fixed parameter tractable. Discrete Applied Mathematics 156(15): 2924-2929 (2008) |
| j66 | | Jørgen Bang-Jensen, Morten Hegner Nielsen: Minimum cycle factors in quasi-transitive digraphs. Discrete Optimization 5(1): 121-137 (2008) |
| j65 | | |
| 2007 | ||
| j64 | | Jø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) |
| j63 | | Jø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) |
| 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 | ||
| j62 | | Jø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) |
| j61 | | Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo: Longest path partitions in generalizations of tournaments. Discrete Mathematics 306(16): 1830-1839 (2006) |
| 2005 | ||
| j60 | | Jørgen Bang-Jensen, Morten Hegner Nielsen: Finding complementary cycles in locally semicomplete digraphs. Discrete Applied Mathematics 146(3): 245-256 (2005) |
| c5 |  | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD 2005: 81-94 |
| 2004 | ||
| j59 | | Jørgen Bang-Jensen, Anders Yeo: Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. Combinatorica 24(3): 331-349 (2004) |
| j58 | | Jø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) |
| j57 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: When the greedy algorithm fails. Discrete Optimization 1(2): 121-127 (2004) |
| j56 | | Jø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) |
| j55 | | Jørgen Bang-Jensen: The structure of strong arc-locally semicomplete digraphs. Discrete Mathematics 283(1-3): 1-6 (2004) |
| j54 | | Jø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) |
| j53 | | Jørgen Bang-Jensen, Stephan Brandt: Subgraphs in vertex neighborhoods of Kr-free graphs. Journal of Graph Theory 47(1): 29-38 (2004) |
| 2003 | ||
| j52 | | Jø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) |
| j51 | | Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo: Small degree out-branchings. Journal of Graph Theory 42(4): 297-307 (2003) |
| j50 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. Journal of Graph Theory 44(3): 193-207 (2003) |
| j49 | | Jø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) |
| 2002 | ||
| b1 | | Jørgen Bang-Jensen, Gregory Gutin: Digraphs - theory, algorithms and applications. Springer 2002, isbn 978-1-85233-611-0, pp. I-XXII, 1-754 |
| j48 | | Jørgen Bang-Jensen, Jing Huang: Convex-round graphs are circular-perfect. Journal of Graph Theory 40(3): 182-194 (2002) |
| 2001 | ||
| j47 | | Jørgen Bang-Jensen, Anders Yeo: Making a tournament k-arc-strong by reversing arcs. Electronic Notes in Discrete Mathematics 8: 2-5 (2001) |
| j46 | | 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 | ||
| j45 | | Jørgen Bang-Jensen, Yubao Guo, Anders Yeo: Complementary cycles containing prescribed vertices in tournaments. Discrete Mathematics 214(1-3): 77-87 (2000) |
| j44 | | Jørgen Bang-Jensen: Problems concerning global connectivity of directed graphs. Electronic Notes in Discrete Mathematics 5: 15-18 (2000) |
| j43 | | 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) |
| j42 | | Jørgen Bang-Jensen, Jing Huang, Anders Yeo: Convex-Round and Concave-Round Graphs. SIAM J. Discrete Math. 13(2): 179-193 (2000) |
| 1999 | ||
| j41 | | Jø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) |
| j40 | | Jø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) |
| j39 | | Jørgen Bang-Jensen: Linkages in locally semicomplete digraphs and quasi-transitive digraphs. Discrete Mathematics 196(1-3): 13-27 (1999) |
| j38 | | Jørgen Bang-Jensen, Yubao Guo: A note on vertex pancyclic oriented graphs. Journal of Graph Theory 31(4): 313-318 (1999) |
| j37 | | Jø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 | ||
| j36 | | Jørgen Bang-Jensen, Tibor Jordán: Adding and Reversing Arcs in Semicomplete Digraphs. Combinatorics, Probability & Computing 7(1): 17-25 (1998) |
| j35 | | Jø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) |
| j34 | | Jørgen Bang-Jensen, Jing Huang: Kings in quasi-transitive digraphs. Discrete Mathematics 185(1-3): 19-27 (1998) |
| j33 | | Jørgen Bang-Jensen, Gregory Gutin: Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discrete Mathematics 188(1-3): 61-72 (1998) |
| j32 | | Jørgen Bang-Jensen, Gregory Gutin: Generalizations of tournaments: A survey. Journal of Graph Theory 28(4): 171-202 (1998) |
| j31 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. Journal of Graph Theory 29(2): 111-132 (1998) |
| j30 | | Jørgen Bang-Jensen, Tibor Jordán: Edge-Connectivity Augmentation Preserving Simplicity. SIAM J. Discrete Math. 11(4): 603-623 (1998) |
| c4 | | Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti: Edge-Connectivity Augmentation with Partition Constraints. SODA 1998: 306-315 |
| 1997 | ||
| j29 | | 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) |
| j28 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Combinatorics, Probability & Computing 6(3): 255-261 (1997) |
| j27 | | Jørgen Bang-Jensen, Gregory Gutin: Vertex heaviest paths and cycles in quasi-transitive digraphs. Discrete Mathematics 163(1-3): 217-223 (1997) |
| j26 | | Jørgen Bang-Jensen, Gregory Gutin: Paths and cycles in extended and decomposable digraphs, . Discrete Mathematics 164(1-3): 5-19 (1997) |
| j25 | | Jørgen Bang-Jensen, Gregory Gutin: Alternating cycles and paths in edge-coloured multigraphs: A survey. Discrete Mathematics 165-166: 39-60 (1997) |
| j24 | | Jørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann: A classification of locally semicomplete digraphs. Discrete Mathematics 167-168: 101-114 (1997) |
| c3 | | Jørgen Bang-Jensen, Tibor Jordán: Edge-Connectivity Augmentation Preserving Simplicity. FOCS 1997: 486-495 |
| 1996 | ||
| j23 | | Jø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) |
| j22 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: On k-strong and k-cyclic digraphs. Discrete Mathematics 162(1-3): 1-11 (1996) |
| j21 | | Jørgen Bang-Jensen, Yubao Guo, Lutz Volkmann: Weakly Hamiltonian-connected locally semicomplete digraphs. Journal of Graph Theory 21(2): 163-172 (1996) |
| j20 | | Jørgen Bang-Jensen, Gregory Gutin, Hao Li: Sufficient conditions for a digraph to be Hamiltonian. Journal of Graph Theory 22(2): 181-187 (1996) |
| 1995 | ||
| j19 | | Jørgen Bang-Jensen, Gregory Gutin, Jing Huang: Weakly Hamiltonian-connected ordinary multipartite tournaments. Discrete Mathematics 138(1-3): 63-74 (1995) |
| j18 | | Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray: Hereditarily hard H-colouring problems. Discrete Mathematics 138(1-3): 75-92 (1995) |
| j17 | | Jørgen Bang-Jensen, Yannis Manoussakis: Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. J. Comb. Theory, Ser. B 63(2): 261-280 (1995) |
| j16 | | Jørgen Bang-Jensen, Jing Huang: Quasi-transitive digraphs. Journal of Graph Theory 20(2): 141-161 (1995) |
| j15 | | Jørgen Bang-Jensen: Digraphs with the path-merging property. Journal of Graph Theory 20(2): 255-265 (1995) |
| j14 | | Jø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 | ||
| j13 | | Jørgen Bang-Jensen, Yannis Manoussakis: Cycles Through k Vertices in Bipartite Tournaments. Combinatorica 14(2): 243-246 (1994) |
| j12 | | Jørgen Bang-Jensen, Pavol Hell: On chordal proper circular arc graphs. Discrete Mathematics 128(1-3): 395-398 (1994) |
| 1993 | ||
| j11 | | Jø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) |
| j10 | | Jørgen Bang-Jensen, Jing Huang, Erich Prisner: In-Tournament Digraphs. J. Comb. Theory, Ser. B 59(2): 267-287 (1993) |
| 1992 | ||
| j9 | | Jørgen Bang-Jensen: On the structure of locally semicomplete digraphs. Discrete Mathematics 100(1-3): 243-265 (1992) |
| j8 | | Jørgen Bang-Jensen, Bjarne Toft: Unsolved problems presented at the Julius Petersen Graph Theory Conference. Discrete Mathematics 101(1-3): 351-360 (1992) |
| j7 | | Jø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) |
| j6 | | Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen: A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms 13(1): 114-127 (1992) |
| j5 | | 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 | ||
| j4 | | Jø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) |
| c2 | | 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 |
| 1990 | ||
| j3 | | Jø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) |
| j2 | | Jørgen Bang-Jensen: Locally semicomplete digraphs: A generalization of tournaments. Journal of Graph Theory 14(3): 371-390 (1990) |
| c1 | | Pavol Hell, Jørgen Bang-Jensen, Jing Huang: Local Tournaments and Proper Circular Arc Gaphs. SIGAL International Symposium on Algorithms 1990: 101-108 |
| 1988 | ||
| j1 | | Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray: The Complexity of Colouring by Semicomplete Digraphs. SIAM J. Discrete Math. 1(3): 281-298 (1988) |
Colors in the list of coauthors
Last update Fri May 24 00:22:53 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page