The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jørgen Bang-Jensen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  54. The minimum spanning strong subdigraph problem is fixed parameter tractable. [Citation Graph (, )][DBLP]


  55. The effect of two cycles on the complexity of colourings by directed graphs. [Citation Graph (, )][DBLP]


  56. k-strong spanning local tournaments in locally semicomplete digraphs. [Citation Graph (, )][DBLP]


  57. Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. [Citation Graph (, )][DBLP]


  58. Spanning 2-strong tournaments in 3-strong semicomplete digraphs. [Citation Graph (, )][DBLP]


  59. The complexity of colouring by locally semicomplete digraphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002