• Stochastic systems research group
• Group of mathematical physics
• Group of discrete structures

Stochastic systems research group

150-98
GERENCSÉR, L. - KOZMANN, Gy. - VÁGÓ, Zs.: SPSA for non-smooth optimization with application in ECG analysis.
In: Proceedings of the 37th IEEE conference on decision and control. CDC’98. Tampa, 1998.
Piscataway, IEEE, 1998. pp. 3907- 3908. 

151-98
GERENCSÉR, L. - MICHALETZKY, Gy. - VÁGÓ, Zs.: Risk-sensitive identification of ARMA processes.
In: Proceedings of the 37th IEEE conference on decision and control. CDC'98. Tampa, 1998.
Piscataway, IEEE, 1998. pp. 215-216.

152-98
GERENCSÉR, L.: SPSA with state-dependent noise - a tool for direct adaptive control.
In: Proceedings of the 37th IEEE conference on decision and control. CDC’98. Tampa, 1998.
Piscataway, IEEE, 1998. pp. 3451-3456.

153-98
SÁNDORNÉ KMECS, I.: Markov-láncok. 
Technical report of the Applied Mathematics Laboratory (1998. december)
Budapest, MTA SZTAKI, 1998. 13 p.

Group of mathematical physics

154-98
BEREZOVSKIJ, A. A. - KERSNER, R.: O stabilizacii  i  prostranstvennoj lokalizacii diffuzionno-reakcionnykh processov.
In: Nelinejnye kraevye zadachi matematicheskoj fiziki i ikh prilozhenija. Sbornik nauchnykh trudov.
Kiev, Inst. Mat. NAN Ukrainy, 1998. pp. 21-24. N

155-98
KERSNER R.: A matematika tanításáról.
Magyar Tudomány. 18 (10) : 1247-1251. (1998)

Group of discrete structures

156-98
CHEN, G. - GYÁRFÁS, A. - SCHELP, R. H.: Vertex colorings with a distance restriction. 
Discrete Mathematics. 191 (1-3) : 65-82. (1998) N 0.231

157-98
CHEN, G. - JACOBSON, M. S. - KÉZDY, A. E. - LEHEL, J.: Tough enough chordal graphs are Hamiltonian. 
Networks. 31 : 29-38. (1998) N 0.271

158-98
CHEN, G. - LEHEL, J. - JACOBSON, M. S. - SHREVE, W. E.: Note on graphs without repeated cycle lengths. 
Journal of Graph Theory. 29 (1) : 11-15. (1998) N 0.375

159-98
ERDŐS, P. - GYÁRFÁS, A.: A variant of the classical Ramsey problem.
Combinatorica. 17 (4) : 459-467. (1997) 0.396

160-98
FÜREDI, Z. - RUSZINKÓ, M.: An improved upper bound of the rate of Euclidean superimposed codes.
In: 1998 IEEE international symposium on information theory. Proceedings. Cambridge, 1998.
Piscataway, IEEE, 1998. pp. 467.

161-98
GUIDULI, B. - GYÁRFÁS, A. - THOMASSÉ, S. - WEIDL, P.: 2-partition-transitive tournaments. 
Journal of Combinatorial Theory. Ser. B. 72 (2) : 181-196. (1998) N 0.689

162-98
GYÁRFÁS, A. - JAGOTA, A. - SCHELP, R. H.: Monochromatic path covers in nearly complete graphs.
Journal of Combinatorial Mathematics and Combinatorial Computing. 25 : 129-144. (1997) N

163-98
GYÁRFÁS, A. - SCHELP, R. H.: A communication problem and directed triple systems. 
Discrete Applied Mathematics. 85 (2) : 139-147. (1998) N 0.339

164-98
GYÁRFÁS, A.: Generalized split graphs and Ramsey numbers. 
Journal of Combinatorial Theory. Ser. A. 81 (2) : 255-261. (1998) 0.406

165-98
GYÁRFÁS, A.: Nonsymmetric party problems. 
Journal of Graph Theory. 28 (1) : 43-47. (1998) 0.375

166-98
JACOBSON, M. S. - KÉZDY, A. E. - LEHEL, J.: Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. 
Networks. 31 : 1-10. (1998) N 0.271

167-98
JACOBSON, M. S. - KÉZDY, A. E. - LEHEL, J.: Scenic graphs I: traceable graphs. 
Ars Combinatoria. 49 : 79-96. (1998) N 0.092

168-98
JACOBSON, M. S. - KÉZDY, A. E. - LEHEL, J.: Recognizing intersection graphs of linear uniform hypergraphs. 
Graphs and Combinatorics. 13 (4) : 359-367. (1997) N 0.183