| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jørgen Bang-Jensen, Jing Huang |
Decomposing locally semicomplete digraphs into strong spanning subdigraphs.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Rune Larsen |
Efficient algorithms for real-life instances of the variable size bin packing problem. |
Computers & OR |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Sven Simonsen |
Arc-Disjoint Paths and Trees in 2-Regular Digraphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon |
Finding an induced subdivision of a digraph. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Matthias Kriesell |
On the problem of finding disjoint cycles and dicycles in a digraph. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts |
The complexity of colouring by locally semicomplete digraphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Tibor Jordán |
Spanning 2-strong tournaments in 3-strong semicomplete digraphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling |
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Yury Nikulin |
Heuristics for the central tree problem. |
J. Heuristics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Matthias Kriesell |
Disjoint sub(di)graphs in digraphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Matthias Kriesell |
Disjoint directed and undirected paths and cycles in digraphs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen |
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen |
k-strong spanning local tournaments in locally semicomplete digraphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Morten Hegner Nielsen |
Minimum cycle factors in quasi-transitive digraphs. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Tibor Jordán |
On persistent directed graphs. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Anders Yeo |
The minimum spanning strong subdigraph problem is fixed parameter tractable. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Jing Huang, Louis Ibarra |
Recognizing and representing proper interval graphs in parallel using merging and sorting. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen |
Mixed Models for the Analysis of Local Search Components. |
SLS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo |
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. |
Discrete Optimization |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo |
Longest path partitions in generalizations of tournaments. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Morten Hegner Nielsen |
Finding complementary cycles in locally semicomplete digraphs. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo |
Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. |
ACiD |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo |
When the greedy algorithm fails. |
Discrete Optimization |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Tibor Jordán |
Splitting off edges between two subsets preserving the edge-connectivity of the graph. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen |
The structure of strong arc-locally semicomplete digraphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Anders Yeo |
Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C20, 05C70, 05C38, 05C40 |
| 1 | Jørgen Bang-Jensen, Stephan Brandt |
Subgraphs in vertex neighborhoods of Kr-free graphs. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Anders Yeo |
Making a tournament k-arc-strong by reversing or deorienting arcs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Stéphan Thomassé |
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin |
Digraphs - theory, algorithms and applications. |
|
2002 |
RDF |
|
| 1 | Jørgen Bang-Jensen, Anders Yeo |
Making a tournament k-arc-strong by reversing arcs. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Anders Yeo |
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen |
Problems concerning global connectivity of directed graphs. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Yubao Guo, Anders Yeo |
Complementary cycles containing prescribed vertices in tournaments. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Tibor Jordán |
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. |
J. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Jing Huang, Anders Yeo |
Convex-Round and Concave-Round Graphs. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen |
Linkages in locally semicomplete digraphs and quasi-transitive digraphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti |
Edge-Connectivity Augmentation with Partition Constraints. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin |
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Yubao Guo, Anders Yeo |
A New Sufficient Condition for a Digraph to Be Hamiltonian. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin |
Alternating cycles and trails in 2-edge-coloured complete multigraphs. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Jing Huang |
Kings in quasi-transitive digraphs. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Tibor Jordán |
Adding and Reversing Arcs in Semicomplete Digraphs. |
Combinatorics, Probability & Computing |
1998 |
DBLP BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Tibor Jordán |
Edge-Connectivity Augmentation Preserving Simplicity. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo |
Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti |
Edge-Connectivity Augmentation with Partition Constraints. |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin |
Vertex heaviest paths and cycles in quasi-transitive digraphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin |
Paths and cycles in extended and decomposable digraphs, . |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin |
Alternating cycles and paths in edge-coloured multigraphs: A survey. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann |
A classification of locally semicomplete digraphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo |
Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. |
Combinatorics, Probability & Computing |
1997 |
DBLP BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Tibor Jordán |
Edge-Connectivity Augmentation Preserving Simplicity. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo |
On k-strong and k-cyclic digraphs. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin, Jing Huang |
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Yannis Manoussakis |
Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray |
Hereditarily hard H-colouring problems. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Gregory Gutin, Jing Huang |
Weakly Hamiltonian-connected ordinary multipartite tournaments. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, András Frank, Bill Jackson |
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. |
SIAM J. Discrete Math. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell |
On chordal proper circular arc graphs. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Yannis Manoussakis |
Cycles Through k Vertices in Bipartite Tournaments. |
Combinatorica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Jing Huang, Erich Prisner |
In-Tournament Digraphs. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell |
Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Bjarne Toft |
Unsolved problems presented at the Julius Petersen Graph Theory Conference. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray |
On the complexity of colouring by superdigraphs of bipartite graphs. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen |
On the structure of locally semicomplete digraphs. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen |
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. |
J. Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Carsten Thomassen |
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. |
SIAM J. Discrete Math. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen |
Edge-disjoint in- and out-branchings in tournaments and related path problems. |
J. Comb. Theory, Ser. B |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Svatopluk Poljak |
Eulerian trails through a set of terminals in specific, unique and all orders. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell |
The effect of two cycles on the complexity of colourings by directed graphs. |
Discrete Applied Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Jørgen Bang-Jensen, Jing Huang |
Local Tournaments and Proper Circular Arc Gaphs. |
SIGAL International Symposium on Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray |
The Complexity of Colouring by Semicomplete Digraphs. |
SIAM J. Discrete Math. |
1988 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")