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="Jungnickel, Dieter"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Affine geometry designs, polarities, and Hamada's conjecture
David Clark
,
Dieter Jungnickel
,
Vladimir D. Tonchev
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 231-239
Characterizing geometric designs, II
Dieter Jungnickel
Journal of Combinatorial Theory Series A
118
(2), 2011, pp. 623-633
A non-existence result for finite projective planes in Lenz-Barlotti class I.4
Dina Ghinelli
,
Dieter Jungnickel
Combinatorica
27
(2), 2007, pp. 163-166
Balanced network flows - VIII. A revised theory of phase-ordered algorithms and the
O(\sqrt nm \log(n^2/m) /log n)
bound for the nonbipartite cardinaltiy matching problem
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
41
(3), 2003, pp. 137-142
A note on maximal partial spreads with deficiency
q+1, q
even
Dieter Jungnickel
,
Leo Storme
Journal of Combinatorial Theory Series A
102
(2), 2003, pp. 443-446
Balanced network flows - VII: Primal-dual algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
39
(1), 2002, pp. 35-42
Balanced network flows - IV. Duality and structure theory
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
37
(4), 2001, pp. 194-201
Balanced network flows - V. Cycle-canceling algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
37
(4), 2001, pp. 202-209
Balanced network flows - VI. Polyhedral descriptions
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
37
(4), 2001, pp. 210-218
The geometry of frequency squares
Dieter Jungnickel
,
V.C. Mavron
,
T.P. McDonough
Journal of Combinatorial Theory Series A
96
(2), 2001, pp. 376-387
Balanced network flows - I. A unifying framework for design and analysis of matching algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
33
(1), 1999, pp. 1-28
Balanced network flows - II. Simple augmentation algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
33
(1), 1999, pp. 29-41
Balanced network flows - III. Strongly polynomial augmentation algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
33
(1), 1999, pp. 43-56
Perfect and almost perfect sequences
Dieter Jungnickel
,
Alexander Pott
Discrete Applied Mathematics
95
(1-3), 1999, pp. 331-359
The solution of the Waterloo problem
K.T. Arasu
,
John F. Dillon
,
Dieter Jungnickel
,
Alexander Pott
Journal of Combinatorial Theory Series A
71
(2), 1995, pp. 316-331
Trace-orthogonal normal bases
Dieter Jungnickel
Discrete Applied Mathematics
47
, 1993, pp. 233-249
Maximal partial spreads and transversal-free translation nets
Dieter Jungnickel
Journal of Combinatorial Theory Series A
62
(1), 1993, pp. 66-92
On symmetric and quasi-symmetric designs with the symmetric difference property and their codes
Dieter Jungnickel
,
Vladimir D. Tonchev
Journal of Combinatorial Theory Series A
59
, 1992, pp. 40-50
Some nonexistence results on divisible difference sets
K.T. Arasu
,
James Davis
,
Dieter Jungnickel
,
Alexander Pott
Combinatorica
11
, 1991, pp. 1-8
The Mann test for divisible difference sets
K.T. Arasu
,
Dieter Jungnickel
,
Alexander Pott
Graphs and Combinatorics
7
, 1991, pp. 209-217
The existence of non-trivial hyperfactorizations of
K_{2n}
Endre Boros
,
Dieter Jungnickel
,
Scott A. Vanstone
Combinatorica
11
, 1991, pp. 9-16
Affine difference sets of even order
K.T. Arasu
,
Dieter Jungnickel
Journal of Combinatorial Theory Series A
52
, 1989, pp. 188-196
The 2-matching lattice of a graph
Dieter Jungnickel
,
Matthias Leclerc
Journal of Combinatorial Theory Series B
46
, 1989, pp. 246-248
A new family of relative difference sets
Dieter Jungnickel
Journal of Combinatorial Theory Series A
52
, 1989, pp. 301-303
The strong chromatic number of partial triple systems
Charles J. Colbourn
,
Dieter Jungnickel
,
Alexander Rosa
Discrete Applied Mathematics
20
, 1988, pp. 31-38
Seiten 1
2
>