Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bang-Jensen, J{\o}rgen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Disjoint 3-cycles in tournaments: A proof of the Bermond-Thomassen conjecture for tournaments
Jrgen Bang-Jensen
,
Stéphane Bessy
,
Stéphan Thomassé
Journal of Graph Theory
75
(3), 2014, pp. 284-302
(Arc-)disjoint flows in networks
Jrgen Bang-Jensen
,
Stéphane Bessy
Theoretical Computer Science
526
, 2014, pp. 28-40
Finding a subdivision of a digraph
Jrgen Bang-Jensen
,
Frédéric Havet
,
A. Karolinna Maia
Theoretical Computer Science
562
, 2014, pp. 283-303
Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs
Jrgen Bang-Jensen
,
Jing Huang
Journal of Graph Theory
77
(4), 2014, pp. 278-298
Vertex-disjoint directed and undirected cycles in general digraphs
Jrgen Bang-Jensen
,
Matthias Kriesell
,
Alessandro Maddaloni
,
Sven Simonsen
Journal of Combinatorial Theory Series B
106
, 2014, pp. 1-14
Arc-disjoint paths in decomposable digraphs
Jrgen Bang-Jensen
,
Alessandro Maddaloni
Journal of Graph Theory
77
(2), 2014, pp. 89-110
The complexity of multicut and mixed multicut problems in (di)graphs
Jrgen Bang-Jensen
,
Anders Yeo
Theoretical Computer Science
520
, 2014, pp. 87-96
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties
Jrgen Bang-Jensen
,
Daniel Gonçalves
,
Anders Yeo
Theoretical Computer Science
475
, 2013, pp. 13-20
Finding an induced subdivision of a digraph
Jrgen Bang-Jensen
,
Frédéric Havet
,
Nicolas Trotignon
Theoretical Computer Science
443
, 2012, pp. 10-24
Decomposing locally semicomplete digraphs into strong spanning subdigraphs
Jrgen Bang-Jensen
,
Jing Huang
Journal of Combinatorial Theory Series B
102
(3), 2012, pp. 701-714
Arc-disjoint spanning sub(di)graphs in digraphs
Jrgen Bang-Jensen
,
Anders Yeo
Theoretical Computer Science
438
, 2012, pp. 48-54
On the problem of finding disjoint cycles and dicycles in a digraph
Jrgen Bang-Jensen
,
Matthias Kriesell
Combinatorica
31
(6), 2011, pp. 639-668
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
Jrgen Bang-Jensen
,
Marco Chiarandini
,
Peter Morling
Networks
55
(4), 2010, pp. 299-325
Disjoint directed and undirected paths and cycles in digraphs
Jrgen Bang-Jensen
,
Matthias Kriesell
Theoretical Computer Science
410
(47-49), 2009, pp. 5138-5144
Subgraphs in vertex neighborhoods of
K_r
-free graphs
Jrgen Bang-Jensen
,
Stephan Brandt
Journal of Graph Theory
47
(1), 2004, pp. 29-38
Spanning
k
-arc-strong subdigraphs with few arcs in
k
-arc-strong tournaments
Jrgen Bang-Jensen
,
Jing Huang
,
Anders Yeo
Journal of Graph Theory
46
(4), 2004, pp. 265-284
Decomposing
k
-arc-strong tournaments into strong spanning subdigraphs
Jrgen Bang-Jensen
,
Anders Yeo
Combinatorica
24
(3), 2004, pp. 331-349
Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
Jrgen Bang-Jensen
,
Gregory Gutin
,
Anders Yeo
Journal of Graph Theory
44
(3), 2003, pp. 193-207
Strongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphs
Jrgen Bang-Jensen
,
Jing Huang
,
Anders Yeo
SIAM Journal on Discrete Mathematics
16
(2), 2003, pp. 335-343
Small degree out-branchings
Jrgen Bang-Jensen
,
Stéphan Thomassé
,
Anders Yeo
Journal of Graph Theory
42
(4), 2003, pp. 297-307
Convex-round graphs are circular-perfect
Jrgen Bang-Jensen
,
Jing Huang
Journal of Graph Theory
40
(3), 2002, pp. 182-194
The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
Jrgen Bang-Jensen
,
Anders Yeo
Journal of Algorithms
41
(1), 2001, pp. 1-19
Convex-round and concave-round graphs
Jrgen Bang-Jensen
,
Jing Huang
,
Anders Yeo
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 179-193
Splitting off edges within a specified subset preserving the edge-connectivity of the graph
Jrgen Bang-Jensen
,
Tibor Jordán
Journal of Algorithms
37
(2), 2000, pp. 326-343
Edge-connectivity augmentation with partition constraints
Jrgen Bang-Jensen
,
Harold N. Gabow
,
Tibor Jordán
,
Zoltán Szigeti
SIAM Journal on Discrete Mathematics
12
(2), 1999, pp. 160-207
Seiten 1
2
>