Dieter Jungnickel

Orcid: 0000-0001-5615-6934

Affiliations:
  • University of Augsburg, Mathematical Institute, Germany


According to our database1, Dieter Jungnickel authored at least 98 papers between 1978 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Partitioned difference families and harmonious linear spaces.
Finite Fields Their Appl., December, 2023

Partitioned difference families: The storm has not yet passed.
Adv. Math. Commun., 2023

2019
Counting Steiner triple systems with classical parameters and prescribed rank.
J. Comb. Theory, Ser. A, 2019

The classification of Steiner triple systems on 27 points with 3-rank 24.
Des. Codes Cryptogr., 2019

Partitioned difference families versus zero-difference balanced functions.
Des. Codes Cryptogr., 2019

2018
The classification of antipodal two-weight linear codes.
Finite Fields Their Appl., 2018

Extension sets, affine designs, and Hamada's conjecture.
Des. Codes Cryptogr., 2018

On Bonisoli's theorem and the block codes of Steiner triple systems.
Des. Codes Cryptogr., 2018

2017
On Classifying Steiner Triple Systems by Their 3-Rank.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016
A note on the k-minimum spanning tree problem on circles.
Oper. Res. Lett., 2016

Editorial for the 25th anniversary issue.
Des. Codes Cryptogr., 2016

Editorial: finite geometries.
Des. Codes Cryptogr., 2016

The characterization problem for designs with the parameters of AGd(n, q).
Comb., 2016

2015
Blocking sets of the classical unital.
Finite Fields Their Appl., 2015

Maximal arcs and quasi-symmetric designs.
Des. Codes Cryptogr., 2015

2014
Remarks on polarity designs.
Des. Codes Cryptogr., 2014

2013
New invariants for incidence structures.
Des. Codes Cryptogr., 2013

Obituary: Hanfried Lenz (1916-2013).
Des. Codes Cryptogr., 2013

Obituary: Marialuisa J. de Resmini (1939-2012).
Des. Codes Cryptogr., 2013

Editorial: Finite geometries.
Des. Codes Cryptogr., 2013

Obituary: Daniel R. Hughes (1927-2012).
Des. Codes Cryptogr., 2013

Incidence Structures, Codes, and Galois Geometries.
Proceedings of the Finite Fields and Their Applications - Character Sums and Polynomials., 2013

Matrices over finite fields.
Proceedings of the Handbook of Finite Fields., 2013

Duality theory of bases.
Proceedings of the Handbook of Finite Fields., 2013

2012
A Hamada type characterization of the classical geometric designs.
Des. Codes Cryptogr., 2012

2011
Characterizing geometric designs, II.
J. Comb. Theory, Ser. A, 2011

Affine geometry designs, polarities, and Hamada's conjecture.
J. Comb. Theory, Ser. A, 2011

2010
The number of designs with geometric parameters grows exponentially.
Des. Codes Cryptogr., 2010

2009
Polarities, quasi-symmetric designs, and Hamada's conjecture.
Des. Codes Cryptogr., 2009

2008
The isomorphism problem for abelian projective planes.
Appl. Algebra Eng. Commun. Comput., 2008

2007
Preface.
Des. Codes Cryptogr., 2007

A Non-Existence Result For Finite Projective Planes In Lenz-Barlotti Class I.4.
Comb., 2007

2005
Finite Geometries, First Irsee Conference, 16-21 February, 2003.
Discret. Math., 2005

2003
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem.
Networks, 2003

A note on maximal partial spreads with deficiency q+1, q even .
J. Comb. Theory, Ser. A, 2003

Two infinite families of failed symmetric designs.
Discret. Math., 2003

Maximal partial spreads in PG(3, 4) and maximal sets of mutually orthogonal latin squares of order 16.
Discret. Math., 2003

Some New Maximal Sets of Mutually Orthogonal Latin Squares.
Des. Codes Cryptogr., 2003

Finite Geometries.
Des. Codes Cryptogr., 2003

2002
Balanced network flows. VII. Primal-dual algorithms.
Networks, 2002

Arcs and Ovals from Abelian Groups.
Des. Codes Cryptogr., 2002

2001
Balanced network flows. VI. Polyhedral descriptions.
Networks, 2001

Balanced network flows. V. Cycle-canceling algorithms.
Networks, 2001

Balanced network flows. IV. Duality and structure theory.
Networks, 2001

The Geometry of Frequency Squares.
J. Comb. Theory, Ser. A, 2001

Perfect Codes and Balanced Generalized Weighing Matrices, II.
Electron. Notes Discret. Math., 2001

2000
Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem.
Oper. Res. Lett., 2000

1999
Balanced network flows. III. Strongly polynomial augmentation algorithms.
Networks, 1999

Balanced network flows. II. Simple augmentation algorithms.
Networks, 1999

Balanced network flows. I. A unifying framework for design and analysis of matching algorithms.
Networks, 1999

q-ary graphical codes.
Discret. Math., 1999

Editorial.
Des. Codes Cryptogr., 1999

Perfect and Almost Perfect Sequences.
Discret. Appl. Math., 1999

Optimierungsmethoden - eine Einführung.
Springer-Lehrbuch, Springer, ISBN: 978-3-540-66057-6, 1999

1998
Efficient algorithms for the clearing of interbank payments.
Eur. J. Oper. Res., 1998

1997
Graphical codes revisited.
IEEE Trans. Inf. Theory, 1997

Special Issue #2 Dedicated to Hanfried Lenz - Preface.
Des. Codes Cryptogr., 1997

1996
Book reviews.
Math. Methods Oper. Res., 1996

Codes Based on Complete Graphs.
Des. Codes Cryptogr., 1996

A Life's Work in Geometry: An Homage to Hanfried Lenz.
Des. Codes Cryptogr., 1996

Special Issue Dedicated to Hanfried Lenz - Preface.
Des. Codes Cryptogr., 1996

1995
The Solution of the Waterloo Problem.
J. Comb. Theory, Ser. A, 1995

Relative difference sets with n = 2.
Discret. Math., 1995

1994
Strongly Regular Cayley Graphs with lambda - mu = -1.
J. Comb. Theory, Ser. A, 1994

Erratum.
Graphs Comb., 1994

A New Class of Symmetric (nu, k, lambda)-Designs.
Des. Codes Cryptogr., 1994

Graphen, Netzwerke und Algorithmen, 3. Auflage.
BI-Wissenschaftsverlag, ISBN: 978-3-411-14263-7, 1994

1993
Maximal Partial Spreads and Transversal-Free Translation Nets.
J. Comb. Theory, Ser. A, 1993

Trace-Orthogonal Normal Bases.
Discret. Appl. Math., 1993

1992
Pair-Splitting Sets in <i>AG(m, q)</i>.
SIAM J. Discret. Math., 1992

On Symmetric and Quasi-Symmetric Designs with the Symmetric Difference Property and Their Codes.
J. Comb. Theory, Ser. A, 1992

Translation nets: a survey.
Discret. Math., 1992

1991
The mann test for divisible difference sets.
Graphs Comb., 1991

Triple systems in PG(2, q).
Discret. Math., 1991

The spectrum of alpha-resolvable block designs with block size 3.
Discret. Math., 1991

Preface.
Discret. Math., 1991

Symmetric divisible designs with k-lambda<sub>1</sub> = 1.
Discret. Math., 1991

Exponential Number of Quasi-Symmetric SDP Designs and Codes Meeting.
Des. Codes Cryptogr., 1991

The existence of non-trivial hyperfactorization of K<sub>2n</sub>.
Comb., 1991

Some nonexistence results on divisible difference sets.
Comb., 1991

1990
Translation nets and fixed-point-free group automorphisms.
J. Comb. Theory, Ser. A, 1990

A Note on Intersection Numbers of Difference Sets.
Eur. J. Comb., 1990

On the existence of small quasimultiples of affine and projective planes of arbitrary order.
Discret. Math., 1990

Graphen, Netzwerke und Algorithmen, 2. Auflage.
BI-Wissenschaftsverlag, ISBN: 978-3-411-14262-0, 1990

1989
The 2-matching lattice of a graph.
J. Comb. Theory, Ser. B, 1989

A new family of relative difference sets.
J. Comb. Theory, Ser. A, 1989

Affine difference sets of even order.
J. Comb. Theory, Ser. A, 1989

Some self-blocking block designs.
Discret. Math., 1989

Preface.
Discret. Math., 1989

1988
The strong chromatic number of partial triple systems.
Discret. Appl. Math., 1988

1987
Minimal linear spaces.
J. Comb. Theory, Ser. A, 1987

On a theorem of Ganley.
Graphs Comb., 1987

1986
On resolvable designs <i>S</i><sub>3</sub>(3; 4, <i>v</i>).
J. Comb. Theory, Ser. A, 1986

Maximal difference matrices of order <=10.
Discret. Math., 1986

1985
Two Remarks on Affine Designs with Classical Parameters.
J. Comb. Theory, Ser. A, 1985

1984
On the Geometry of Planar Difference Sets.
Eur. J. Comb., 1984

1979
Regular Hjelmslev Planes.
J. Comb. Theory, Ser. A, 1979

1978
Composition theorems for difference families and regular planes.
Discret. Math., 1978


  Loading...