Dieter Jungnickel
Orcid: 0000-0001-5615-6934Affiliations:
- University of Augsburg, Mathematical Institute, Germany
According to our database1,
Dieter Jungnickel
authored at least 98 papers
between 1978 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2023
Finite Fields Their Appl., December, 2023
Adv. Math. Commun., 2023
2019
J. Comb. Theory A, 2019
Des. Codes Cryptogr., 2019
Des. Codes Cryptogr., 2019
2018
Finite Fields Their Appl., 2018
Des. Codes Cryptogr., 2018
2017
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017
2016
Comb., 2016
2015
2014
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
Des. Codes Cryptogr., 2012
2011
J. Comb. Theory A, 2011
2010
Des. Codes Cryptogr., 2010
2009
Des. Codes Cryptogr., 2009
2008
Appl. Algebra Eng. Commun. Comput., 2008
2007
Comb., 2007
2005
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
J. Comb. Theory A, 2003
Maximal partial spreads in PG(3, 4) and maximal sets of mutually orthogonal latin squares of order 16.
Discret. Math., 2003
Des. Codes Cryptogr., 2003
2002
Arcs and Ovals from Abelian Groups.
Des. Codes Cryptogr., 2002
2001
Electron. Notes Discret. Math., 2001
2000
Oper. Res. Lett., 2000
1999
Networks, 1999
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms.
Networks, 1999
Optimierungsmethoden - eine Einführung.
Springer-Lehrbuch, Springer, ISBN: 978-3-540-66057-6, 1999
1998
Eur. J. Oper. Res., 1998
1997
Special Issue #2 Dedicated to Hanfried Lenz - Preface.
Des. Codes Cryptogr., 1997
1996
Special Issue Dedicated to Hanfried Lenz - Preface.
Des. Codes Cryptogr., 1996
1995
The Solution of the Waterloo Problem.
J. Comb. Theory A, 1995
1994
Strongly Regular Cayley Graphs with lambda - mu = -1.
J. Comb. Theory A, 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 A, 1993
1992
On Symmetric and Quasi-Symmetric Designs with the Symmetric Difference Property and Their Codes.
J. Comb. Theory A, 1992
1991
Discret. Math., 1991
Des. Codes Cryptogr., 1991
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
1988
1987
1986
1985
1984
1979
1978
Discret. Math., 1978