Seznam odborn˜ch a vˆdeck˜ch prac¡               12/06/2002


                   RNDr Ji©¡ Demel, CSc


A. Chronologicky ©azen˜ seznam
------------------------------

Demel, Grafy a jejich aplikace, Academia, Praha 2002, 
     ISBN 80-200-0990-6

Demel, Internet pro za‡ te‡n¡ka, Neklan, Praha 1996,
     2. p©eprac. vyd n¡, ISBN 80-901718-1-8.

Demel, Internet pro za‡ te‡n¡ka, Neklan, Praha 1995,
     ISBN 80-901718-0-X.

Demel, Demlov : On a NP-complete problem. Kybernetika 31
     (1995), Number 2, p. 207-211.

Ku‡erov  J., Klva¤a J., Demel J., Van¡‡ek T.:  P©¡klady
     z opera‡n¡ho v˜zkumu, skripta €VUT, Praha 1995,
     ISBN 80-01-01292-1.

Demel J., Hora V., S–ra M.: Information System for
     Registration of Local Sources of Pollution,
     In:  Environmental Monitoring and Adjacent Problems,
     (D. Proch zkov  ed.), Czech Ecological Institute,
     Praha 1993.

Demel J., Hora V., S–ra M., Zach L.: Knowledge-based System
     for Environmental Control in Civil Engineering, ve
     sborn¡ku Workshop 93, €VUT Praha, 1993, 39-40.

Teorie graf–. Skripta €VUT, 2. p©eprac. vyd n¡, Praha 1991.

Demel, S–ra: TASP - a Word Processor for Scientific and
     Technical Texts.  Technical Papers, Stavebn¡ fakulta
     €VUT Praha, E4/86, 197-222.

MV›T_XXXV - Grafy. (V¨. p©¡ru‡ka) SNTL Praha, 1988.

Demel, S–ra: Generov n¡ £loh - vrchol nebo za‡ tek?  Acta
     Polytechnica - pr ce €VUT v Praze, 6 (VI, 2), 1987.

Demel, S–ra: TASP - slovn¡ procesor pro vˆdeckotechnick‚
     texty, MAA 27 (1987), 221-226.

Demel, S–ra: Technicko-administrativn¡ slovn¡ procesor TASP.
     Zpravodaj sdru‘en¡ u‘ivatel– po‡¡ta‡– JSEP a SMEP 8/86
     (1986), 21-36.

Demel, S–ra: TASP:  slovn¡ procesor pro vˆdecko-technick‚
     texty. Ve sborn¡ku semin ©e u‘ivatel– po‡¡ta‡– ADT
     19.-21.2.1986, T bor.

Demel, Hora, Poljak, S–ra: The Generation of Problems for
     Teaching Specialized Subjects.  Technical Papers,
     Stavebn¡ fakulta €VUT Praha, E3/85 (1985), 175-185.

Pou‘it¡ generovan˜ch £loh p©i zkou¨en¡ a dal¨¡ v˜voj syst‚mu
      MUSTR". Ve sborn¡ku 12. konference Vyu‘it¡ v˜po‡etn¡
     techniky ve v˜uce, €eladn  4.-6.11.1985.

Demel, Demlov , Koubek: Fast Algorithms Constructing Minimal
     Subalgebras, Congruences, and Ideals in a Finite
     Algebra.  Theoretical Computer Science 36 (1985),
     203-216.

Demel, Hora, Poljak, S–ra: MUSTR - otev©n˜ multiu‘ivatelsk˜
     syst‚m generov n¡ u‡ebn¡ch £loh pro minipo‡¡ta‡e.  Ve
     sborn¡ku 11. semin ©e Vyu‘it¡ po‡¡ta‡e k racionalisaci
     v˜uky a diagnostiky vˆdomost¡, Jevany 25.-27.4.1984,
     175-182.

Generov n¡ £loh line rn¡ho programov n¡ a simulace ru‡n¡ho
     v˜po‡tu simplexovou metodou. Ve sborn¡ku 11.  semin ©e
     Vyu‘it¡ po‡¡ta‡e k racionalisaci v˜uky a diagnostiky
     vˆdomost¡, Jevany 25.-27.4.1984, 172-174.

Algoritmy pro vy¨et©ov n¡ kongruenc¡ kone‡n˜ch algeber.
     Leden 1984, kandid tsk  diserta‡n¡ pr ce, obh jena
     8/11/1984 na MFF UK Praha.

Fast Algorithms for Finding a Subdirect Decomposition and
     Interesting Congruences of Finite Algebras. Kybernetika
     18 (1982), 121-130.

Teorie graf–. Skripta €VUT, Praha 1982.

Demlov , Demel, Koubek: Simplicity of Algebras Requires to
     Investigate Almost All Operations. Comment. Math. Univ.
     Carolinae 23 (1982), 325-335.

Demel, Plachk˜: Vyu‘it¡ algoritmu pro nalezen¡ optim ln¡ho
     toku v s¡ti pro sn¡‘en¡ n rok– na dopravu polotovar–.
     Pozemn¡ stavby 29/2 (1981), 73-76.

Vl‡ek a kol.: P©¡klady projekt– automatizovan˜ch syst‚m–
     ©¡zen¡. Skripta €VUT, Praha 1981.

Demlov , Demel, Koubek: On Subdirectly Irreducible Automata.
     R.A.I.R.O. Inform,Th‚or. 15 (1981), 23-46.

Demlov , Demel, Koubek:  Several Algorithms for Finite
     Algebra. In: Fundamentals of Computation Theory 1979
     (L. Budach, ed.) Akademie-Verlag Berlin 1979, 99-104.

Plachk˜, Demel: Automatizovan‚ sestavov n¡ t˜denn¡ho pl nu
     v˜roby, dopravy a pokl dky obaovan˜ch ‘ivi‡n˜ch smˆs¡.
     In: Automatizace v˜robn¡ p©¡pravy a modern¡ zp–soby
     ©¡zen¡ stavebn¡ v˜roby, D–m techniky €SVTS Ostrava,
     duben 1979.

On Rotational Tournaments and their Output Tournaments.
     Colloquia Math. Soc. J nos Bolyai, Proc.  25 algebraic
     methods in graph theory, Szeged 1978, 69-84.

Maximal Frequencies of Equivalences with Small Classes.
     Discrete Mathematics 23 (1978), 67-71.

O rota‡n ch turnaj¡ch a jejich v˜stupech.  €ervenec 1975,
     rigorosn¡ pr ce.

Induktivn¡ dimense a dimense grafu.  Duben 1973, diplomov 
     pr ce na MFF UK Praha.

Souvislost vlastnost¡ turnaje s vlastnostmi jeho v˜stup–.
     Kvˆten 1972, £‡ast ve studentsk‚ vˆdeck‚ soutˆ‘i.


B. D¡l‡¡ seznamy dle druhu publikace
------------------------------------

                     €l nky v zahrani‡¡

Maximal Frequencies of Equivalences with Small Classes.
     Discrete Mathematics 23 (1978), 67-71.

Demlov , Demel, Koubek: On Subdirectly Irreducible Automata.
     R.A.I.R.O. Inform,Th‚or. 15 (1981), 23-46.

Demel, Demlov , Koubek: Fast Algorithms Constructing Minimal
     Subalgebras, Congruences, and Ideals in a Finite
     Algebra.  Theoretical Computer Science 36 (1985),
     203-216.


                      €l nky v tuzemsku

Demel, Plachk˜: Vyu‘it¡ algoritmu pro nalezen¡ optim ln¡ho
     toku v s¡ti pro sn¡‘en¡ n rok– na dopravu polotovar–.
     Pozemn¡ stavby 29/2 (1981), 73-76.

Demlov , Demel, Koubek: Simplicity of Algebras Requires to
     Investigate Almost All Operations. Comment. Math. Univ.
     Carolinae 23 (1982), 325-335.

Fast Algorithms for Finding a Subdirect Decomposition and
     Interesting Congruences of Finite Algebras. Kybernetika
     18 (1982), 121-130.

Demel, Hora, Poljak, S–ra: The Generation of Problems for
     Teaching Specialized Subjects.  Technical Papers,
     Stavebn¡ fakulta €VUT Praha, E3/85 (1985), 175-185.

Demel, S–ra:  Technicko-administrativn¡ slovn¡ procesor
     TASP.Zpravodaj sdru‘en¡ u‘ivatel– po‡¡ta‡– JSEP a SMEP
     8/86(1986), 21-36.

Demel, S–ra: TASP - slovn¡ procesor pro vˆdeckotechnick‚
     texty, MAA 27 (1987), 221-226.

Demel, S–ra: Generov n¡ £loh - vrchol nebo za‡ tek?  Acta
     Polytechnica - pr ce €VUT v Praze, 6 (VI, 2), 1987.

Demel, S–ra: TASP - a Word Processor for Scientific and
     Technical Texts.  Technical Papers, Stavebn¡ fakulta
     €VUT Praha, E4/86, 197-222.

Demel, Demlov : On a NP-complete problem. Kybernetika 31
     (1995), Number 2, p. 207-211.

               Sborn¡ky konferenc¡ v zahrani‡¡

On Rotational Tournaments and their Output Tournaments.
     Colloquia Math. Soc. J nos Bolyai, Proc.  25 algebraic
     methods in graph theory, Szeged 1978, 69-84.

Demlov , Demel, Koubek:  Several Algorithms for Finite
     Algebra. In: Fundamentals of Computation Theory 1979
     (L. Budach, ed.) Akademie-Verlag Berlin 1979, 99-104.


                    Konference v tuzemsku

Plachk˜, Demel: Automatizovan‚ sestavov n¡ t˜denn¡ho pl nu
     v˜roby, dopravy a pokl dky obaovan˜ch ‘ivi‡n˜ch smˆs¡.
     In: Automatizace v˜robn¡ p©¡pravy a modern¡ zp–soby
     ©¡zen¡ stavebn¡ v˜roby, D–m techniky €SVTS Ostrava,
     duben 1979.

Generov n¡ £loh line rn¡ho programov n¡ a simulace ru‡n¡ho
     v˜po‡tu simplexovou metodou. Ve sborn¡ku 11.  semin ©e
     Vyu‘it¡ po‡¡ta‡e k racionalisaci v˜uky a diagnostiky
     vˆdomost¡, Jevany 25.-27.4.1984, 172-174.

Demel, Hora, Poljak, S–ra: MUSTR - otev©n˜ multiu‘ivatelsk˜
     syst‚m generov n¡ u‡ebn¡ch £loh pro minipo‡¡ta‡e.  Ve
     sborn¡ku 11. semin ©e Vyu‘it¡ po‡¡ta‡e k racionalisaci
     v˜uky a diagnostiky vˆdomost¡, Jevany 25.-27.4.1984,
     175-182.

Pou‘it¡ generovan˜ch £loh p©i zkou¨en¡ a dal¨¡ v˜voj syst‚mu
      MUSTR". Ve sborn¡ku 12. konference Vyu‘it¡ v˜po‡etn¡
     techniky ve v˜uce, €eladn  4.-6.11.1985.

Demel, S–ra: TASP:  slovn¡ procesor pro vˆdecko-technick‚
     texty. Ve sborn¡ku semin ©e u‘ivatel– po‡¡ta‡– ADT
     19.-21.2.1986, T bor.

Demel J., HoraV., S–ra M., Zach L.: Knowledge-based System
     for Environmental Control in Civil Engineering, ve
     sborn¡ku Workshop 93, €VUT Praha, 1993, 39-40.

Demel J., Hora V., S–ra M., Zach L.: Knowledge-based
     Systemfor Environmental Control in Civil Engineering,
     ve sborn¡ku Workshop 93, €VUT Praha, 1993, 39-40.

Demel J., Hora V., S–ra M.: Information System for
     Registration of Local Sources of Pollution,
     In:  Environmental Monitoring and Adjacent Problems,
     (D. Proch zkov  ed.), Czech Ecological Institute,
     Praha 1993.

                Skripta, v¨. p©¡ru‡ky, knihy

Vl‡ek a kol.: P©¡klady projekt– automatizovan˜ch syst‚m–
     ©¡zen¡. Skripta €VUT, Praha 1981.

Teorie graf–. Skripta €VUT, Praha 1982.

MV›T_XXXV - Grafy. (V¨. p©¡ru‡ka) SNTL Praha, 1988.

Teorie graf–. Skripta €VUT, 2. p©eprac. vyd n¡, Praha 1991.

Ku‡erov  J., Klva¤a J., Demel J., Van¡‡ek T.:  P©¡klady
     z opera‡n¡ho v˜zkumu, skripta €VUT, Praha 1995,
     ISBN 80-01-01292-1.

Demel, Internet pro za‡ te‡n¡ka, Neklan, Praha 1995,
     ISBN 80-901718-0-X.

Demel, Internet pro za‡ te‡n¡ka, Neklan, Praha 1996,
     2. p©eprac. vyd n¡, ISBN 80-901718-1-8.

Demel, Grafy a jejich aplikace, Academia, Praha 2002, 
     ISBN 80-200-0990-6



                     Nepublikovan‚ pr ce

Souvislost vlastnost¡ turnaje s vlastnostmi jeho v˜stup–.
     Kvˆten 1972, £‡ast ve studentsk‚ vˆdeck‚ soutˆ‘i.

Induktivn¡ dimense a dimense grafu.  Duben 1973, diplomov 
     pr ce na MFF UK Praha.

O rota‡n ch turnaj¡ch a jejich v˜stupech.  €ervenec 1975,
     rigorosn¡ pr ce.

Algoritmy pro vy¨et©ov n¡ kongruenc¡ kone‡n˜ch algeber.
     Leden 1984, kandid tsk  diserta‡n¡ pr ce, obh jena
     8/11/1984 na MFF UK Praha.