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
Hilfe
Suche: Author="Jung, H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Longest cycles in tough graphs
H.A. Jung
,
P. Wittmann
Journal of Graph Theory
31
(2), 1999, pp. 107-127
Long paths and cycles in tough graphs
H.J. Broersma
,
J. van den Heuvel
,
H.A. Jung
,
H.J. Veldman
Graphs and Combinatorics
9
, 1993, pp. 3-17
Cycles containing all vertices of maximum degree
H.J. Broersma
,
J. van den Heuvel
,
H.A. Jung
,
H.J. Veldman
Journal of Graph Theory
17
(3), 1993, pp. 373-385
Finite separating sets in locally finite graphs
H.A. Jung
,
Mark E. Watkins
Journal of Combinatorial Theory Series B
59
(1), 1993, pp. 15-25
A parallel algorithm for two processors precedence constraint scheduling
H. Jung
,
M. Serna
,
P. Spirakis
Lecture Notes in Computer Science
510
, 1991, pp. 417-428
Efficient parallel computation of arrangements of hyperplanes in
d
dimensions
T. Hagerup
,
H. Jung
,
E. Welzl
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'90 (Island of Crete, Greece, July 2-6, 1990)
, 1990, pp. 290-297
Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays
H. Jung
,
L. Kirousis
,
P. Spirakis
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'89 (Santa Fe, New Mexico, June 18-21, 1989)
, 1989, pp. 254-264
The connectivities of locally finite primitive graphs
H.A. Jung
,
M.E. Watkins
Combinatorica
9
(3), 1989, pp. 261-267
Implementing abstract data structures in hardware
F. Bauernöppel
,
H. Jung
Lecture Notes in Computer Science
324
, 1988, pp. 171-179
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
H. Jung
,
K. Mehlhorn
Information Processing Letters
27
(5), 1988, April, pp. 227-236
Fast parallel vertex colouring
F. Bauernöppel
,
H. Jung
Lecture Notes in Computer Science
199
, 1985, pp. 28-35
Depth efficient transformations of arithmetic into Boolean circuits
H. Jung
Lecture Notes in Computer Science
199
, 1985, pp. 167-174
On probabilistic time and space
H. Jung
Lecture Notes in Computer Science
194
, 1985, pp. 310-317
On probabilistic tape complexity and fast circuits for matrix inversion problems
H. Jung
Lecture Notes in Computer Science
172
, 1984, pp. 281-291
On 3-skein isomorphisms of graphs
R.L. Hemminger
,
H.A. Jung
,
A.K. Kelmans
Combinatorica
2
, 1982, pp. 373-376
On
n
-Skein isomorphisms of graphs
R.L. Hemminger
,
H.A. Jung
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 103-111
A note on fragments of infinite graphs
H.A. Jung
Combinatorica
1
, 1981, pp. 285-288
Relationships between probabilistic and deterministic tape complexity
H. Jung
Lecture Notes in Computer Science
118
, 1981, pp. 339-346
On a class of posets and the corresponding comparability graphs
H.A. Jung
Journal of Combinatorial Theory Series B
24
(2), 1978, April, pp. 125-133
The square of a block is Hamiltonian connected
G. Chartrand
,
Arthur M. Hobbs
,
H.A. Jung
,
S.F. Kapoor
,
C.St.J.A. Nash-Williams
Journal of Combinatorial Theory Series B
16
, 1974, pp. 290-292