The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dieter Jungnickel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. K. T. Arasu, James A. Davis, Dieter Jungnickel, Alexander Pott
    Some nonexistence results on divisible difference sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:1, pp:1-8 [Journal]
  2. Endre Boros, Dieter Jungnickel, Scott A. Vanstone
    The existence of non-trivial hyperfactorization of K2n. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:1, pp:9-15 [Journal]
  3. Dieter Jungnickel
    Trace-Orthogonal Normal Bases. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:3, pp:233-249 [Journal]
  4. Dieter Jungnickel, Alexander Pott
    Perfect and Almost Perfect Sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:331-359 [Journal]
  5. Aart Blokhuis, James W. P. Hirschfeld, Dieter Jungnickel, Joseph A. Thas
    Finite Geometries. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:5- [Journal]
  6. Patrick Govaerts, Dieter Jungnickel, Leo Storme, Joseph A. Thas
    Some New Maximal Sets of Mutually Orthogonal Latin Squares. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:141-147 [Journal]
  7. Dieter Jungnickel, Marialuisa J. de Resmini, Scott A. Vanstone
    Codes Based on Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:8, n:1-2, pp:159-165 [Journal]
  8. Dieter Jungnickel
    Special Issue Dedicated to Hanfried Lenz - Preface. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:8, n:1-2, pp:7- [Journal]
  9. Dieter Jungnickel
    Special Issue #2 Dedicated to Hanfried Lenz - Preface. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:10, n:2, pp:107- [Journal]
  10. Dieter Jungnickel, Günter Pickert
    A Life's Work in Geometry: An Homage to Hanfried Lenz. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:8, n:1-2, pp:9-22 [Journal]
  11. Dieter Jungnickel, Jack H. van Lint
    Editorial. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:18, n:1/3, pp:5-6 [Journal]
  12. Dieter Jungnickel, Alexander Pott
    A New Class of Symmetric (nu, k, lambda)-Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1994, v:4, n:4, pp:319-325 [Journal]
  13. Dieter Jungnickel, Vladimir D. Tonchev
    Exponential Number of Quasi-Symmetric SDP Designs and Codes Meeting. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1991, v:1, n:3, pp:247-253 [Journal]
  14. Marialuisa J. de Resmini, Dina Ghinelli, Dieter Jungnickel
    Arcs and Ovals from Abelian Groups. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:26, n:1-3, pp:213-228 [Journal]
  15. Aart Blokhuis, James W. P. Hirschfeld, Dieter Jungnickel, Joseph A. Thas
    Finite Geometries, First Irsee Conference, 16-21 February, 2003. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:294, n:1-2, pp:1-0 [Journal]
  16. Dieter Jungnickel, Leo Storme
    Maximal partial spreads in PG(3, 4) and maximal sets of mutually orthogonal latin squares of order 16. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:361-371 [Journal]
  17. Marialuisa J. de Resmini, Dieter Jungnickel
    Two infinite families of failed symmetric designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:235-241 [Journal]
  18. K. T. Arasu, John F. Dillon, Dieter Jungnickel, Alexander Pott
    The Solution of the Waterloo Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:71, n:2, pp:316-331 [Journal]
  19. K. T. Arasu, Dieter Jungnickel
    Affine difference sets of even order. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:188-196 [Journal]
  20. K. T. Arasu, Dieter Jungnickel, Siu Lun Ma, Alexander Pott
    Strongly Regular Cayley Graphs with lambda - mu = -1. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:67, n:1, pp:116-125 [Journal]
  21. R. A. Bailey, Dieter Jungnickel
    Translation nets and fixed-point-free group automorphisms. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:55, n:1, pp:1-13 [Journal]
  22. Dieter Jungnickel
    Regular Hjelmslev Planes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:26, n:1, pp:20-37 [Journal]
  23. Dieter Jungnickel
    Two Remarks on Affine Designs with Classical Parameters. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:1, pp:105-109 [Journal]
  24. Dieter Jungnickel
    A new family of relative difference sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:301-303 [Journal]
  25. Dieter Jungnickel
    Maximal Partial Spreads and Transversal-Free Translation Nets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:62, n:1, pp:66-92 [Journal]
  26. Dieter Jungnickel, Hanfried Lenz
    Minimal linear spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:44, n:2, pp:229-240 [Journal]
  27. Dieter Jungnickel, Matthias Leclerc
    The 2-matching lattice of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:246-248 [Journal]
  28. Dieter Jungnickel, Vassili C. Mavron, T. P. McDonough
    The Geometry of Frequency Squares. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:96, n:2, pp:376-387 [Journal]
  29. Dieter Jungnickel, Leo Storme
    A note on maximal partial spreads with deficiency q+1, q even . [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:102, n:2, pp:443-446 [Journal]
  30. Dieter Jungnickel, Vladimir D. Tonchev
    On Symmetric and Quasi-Symmetric Designs with the Symmetric Difference Property and Their Codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:59, n:1, pp:40-50 [Journal]
  31. Dieter Jungnickel, Scott A. Vanstone
    On resolvable designs S3(3; 4, v). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:2, pp:334-337 [Journal]
  32. Christian Fremuth-Paeger, Dieter Jungnickel
    Balanced network flows. IV. Duality and structure theory. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:4, pp:194-201 [Journal]
  33. Christian Fremuth-Paeger, Dieter Jungnickel
    Balanced network flows. V. Cycle-canceling algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:4, pp:202-209 [Journal]
  34. Christian Fremuth-Paeger, Dieter Jungnickel
    Balanced network flows. VI. Polyhedral descriptions. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:4, pp:210-218 [Journal]
  35. Christian Fremuth-Paeger, Dieter Jungnickel
    Balanced network flows. VII. Primal-dual algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:1, pp:35-42 [Journal]
  36. Christian Fremuth-Paeger, Dieter Jungnickel
    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. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:3, pp:137-142 [Journal]
  37. Christian Fremuth-Paeger, Dieter Jungnickel
    Balanced network flows. I. A unifying framework for design and analysis of matching algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:1, pp:1-28 [Journal]
  38. Christian Fremuth-Paeger, Dieter Jungnickel
    Balanced network flows. II. Simple augmentation algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:1, pp:29-41 [Journal]
  39. Christian Fremuth-Paeger, Dieter Jungnickel
    Balanced network flows. III. Strongly polynomial augmentation algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:1, pp:43-56 [Journal]
  40. Michael M. Güntzer, Dieter Jungnickel
    Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:2, pp:55-66 [Journal]
  41. Albrecht Beutelspacher, Dieter Jungnickel, Paul C. van Oorschot, Scott A. Vanstone
    Pair-Splitting Sets in AG(m, q). [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:451-459 [Journal]
  42. Dieter Jungnickel, Scott A. Vanstone
    Graphical codes revisited. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:136-146 [Journal]
  43. Dina Ghinelli, Dieter Jungnickel
    A Non-Existence Result For Finite Projective Planes In Lenz-Barlotti Class I.4. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:163-166 [Journal]
  44. Dina Ghinelli, James W. P. Hirschfeld, Dieter Jungnickel
    Preface. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:44, n:1-3, pp:1-2 [Journal]
  45. Dieter Jungnickel, Gerhard Grams
    Maximal difference matrices of order <=10. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:2, pp:199-203 [Journal]
  46. Walter A. Deuber, D. M. Jackson, Dieter Jungnickel
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:1- [Journal]
  47. Dieter Jungnickel
    Some self-blocking block designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:77, n:1-3, pp:123-135 [Journal]
  48. Dieter Jungnickel, Scott A. Vanstone
    q-ary graphical codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:208, n:, pp:375-386 [Journal]
  49. Dieter Jungnickel
    On the existence of small quasimultiples of affine and projective planes of arbitrary order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:2, pp:177-189 [Journal]
  50. Dieter Jungnickel, Scott A. Vanstone
    Triple systems in PG(2, q). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:92, n:1-3, pp:131-135 [Journal]
  51. Dieter Jungnickel, Ronald C. Mullin, Scott A. Vanstone
    The spectrum of alpha-resolvable block designs with block size 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:97, n:1-3, pp:269-277 [Journal]
  52. K. T. Arasu, Dieter Jungnickel, Alexander Pott
    Symmetric divisible designs with k-lambda1 = 1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:97, n:1-3, pp:25-38 [Journal]
  53. Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:97, n:1-3, pp:1- [Journal]
  54. Dirk Hachenberger, Dieter Jungnickel
    Translation nets: a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:231-242 [Journal]
  55. K. T. Arasu, Dieter Jungnickel, Siu Lun Ma, Alexander Pott
    Relative difference sets with n = 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:1-17 [Journal]

  56. The isomorphism problem for abelian projective planes. [Citation Graph (, )][DBLP]


  57. The strong chromatic number of partial triple systems. [Citation Graph (, )][DBLP]


  58. Finite geometries. [Citation Graph (, )][DBLP]


  59. Polarities, quasi-symmetric designs, and Hamada's conjecture. [Citation Graph (, )][DBLP]


Search in 0.513secs, Finished in 0.516secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002