Wettl Ferenc
honlapja




WF

Publications of Ferenc Wettl



ARTICLES

[1] Endre Boros, Tamás Szőnyi, and Ferenc Wettl. Sperner extension of affine spaces. Geom. Dedicata, 22(2):163-172, 1987.
[ bib | Zbl(ps) ]
[2] Ferenc Wettl. On the nuclei of a pointset of a finite projective plane. J. of Geom., 30(2):157-163, 1987.
[ bib | Zbl(ps) ]
[3] Tamás Szőnyi and Ferenc Wettl. On complexes in a finite abelian group I. Proc. Japan Acad. Ser. A Math. Sci., 64(7):245-248, 1988.
[ bib | Zbl(ps) ]
[4] Tamás Szőnyi and Ferenc Wettl. On complexes in a finite abelian group II. Proc. Japan Acad. Ser. A Math. Sci., 64(8):286-287, 1988.
[ bib | Zbl(ps) ]
[5] Ferenc Wettl. On parallelisms of odd dimensional finite projective spaces. Periodica Polytechnica, 19(1-2):111-116, 1991.
[ bib | Zbl(ps) ]
[6] Ferenc Wettl. Remarks on closed arcs. In Combinatorics'88, pages 307-310. Mediterranian Press, 1991.
[ bib ]
[7] Tibor Illés, Tamás Szőnyi, and Ferenc Wettl. Blocking sets and maximal strong representative systems in finite projective planes. Mitt. Math. Sem. Giessen, 201:97-107, 1991.
[ bib | Zbl(ps) ]
[8] Ferenc Wettl. Internal nuclei of k-sets in finite projective spaces of three dimensions. In Advences in Finite Geometries and Designs, pages 407-419. Oxford Science Publ., Oxford Univ. Press, New York, 1991.
[ bib ]
[9] István Babcsányi, Attila Nagy, and Ferenc Wettl. Indistinguishable state pairs in strongly connected moore-automata. Pure Math. Appl. Ser. A, 2(1-2):15-24, 1991.
[ bib ]
[10] Albrecht Beutelspacher and Ferenc Wettl. On 2-level secret sharing. Designs, Codes and Cryptography, 3:127-134, 1993.
[ bib | Zbl(ps) ]
[11] Ferenc Wettl. Nuclei in finite non-desarguesian projective planes. In F. de Clerck et al., editor, Finite Geometry and Combinatorics, pages 405-412. Cambridge University Press, 1993.
[ bib | Zbl(ps) ]
[12] András Ádám and Ferenc Wettl. On two realisability questions concerning strongly connected moore automata. Publ. Math. Debrecen, 43(1-2):9-21, 1993.
[ bib | Zbl(ps) ]
[13] Endre Boros, András Recski, and Ferenc Wettl. Unconstrained multilayer switchbox routing. Annals of Operations Research, 58:481-491, 1995.
[ bib ]
[14] Endre Boros, András Recski, Tibor Szkaliczki, and Ferenc Wettl. Polynomial time manhattan routing without doglegs - a generalization of gallai's algorithm. Computers and Artificial Intelligence, 18(4):403-413, 1999.
[ bib | ps ]
[15] Gyöngyi Bujdosó and Ferenc Wettl. On the localization of TeX in hungary. TUGBoat , 23(1):21--26, 2002.
[ bib | online pdf | pdf | ps | comments ]


BOOKS

[16] István Babcsányi, János Gyurmánczi, Lajos Szabó, and Ferenc Wettl. Matematikai feladatgyűjtemény I. Műegyetemi Kiadó, 1992.
[ bib ]
[17] István Babcsányi, János Gyurmánczi, Ferenc Wettl, and Endre Zibolen. Matematikai feladatgyűjtemény II. Műegyetemi Kiadó, 1993.
[ bib ]
[18] Győző Molnárka, Lajos Gergó, Ferenc Wettl, András Horváth, and Gábor Kallós. A Maple V és alkalmazásai. Springer-Verlag, 1996.
[ bib ]
[19] Ferenc Wettl, Gyula Mayer, and Csaba Sudár. LaTeX kezdőknek és haladóknak. Panem, 1998.
[ bib ]
[20] Ferenc Wettl. A varázslók titkai. In András Hraskó, editor, Új matematikai mozaik, 2002.
[ bib | pdf ]
[21] Ferenc Wettl, Gyula Mayer, and Péter Szabó. LaTeX kézikönyv. Panem, 2004.
[ bib ]

This file has been generated by bibtex2html 1.54




Valid XHTML 1.0 Strict Valid CSS!