MTA SZTAKIEU Centre of Excellence in Information Technology and AutomationMTA SZTAKI is a member of ERCIM - the European Research Consortium for Informatics and MathematicsMTA SZTAKI is a member of W3C - the World Wide Web ConsortiumISO 9001 Quality Management




NewsServicesThe InstituteContactIntrawebContentsSearchMagyarul


 
Laboratory of Mathematical Physics and Combinatorics

Group of Mathematical Physics

137-93
KAMIN, S. -- KERSNER, R.: Disappearence of interfaces in finite time.
Meccanica. 28 : 117-120. (1993)

138-93
VICSEK M. -- VICSEK T.: Fraktálok a fizikában. I. Bevezetés a törtdimenziós objektumok geometriájába.
Fizikai Szemle. 43 (2) : 41-47. (1993)

139-93
VICSEK M. -- VICSEK T.: Fraktálok a fizikában. II. Mintázatképződés növekedési jelenségekben.
Fizikai Szemle. 43 (2) : 96-103. (1993)

140-93
VICSEK M.: Fraktálok a természettudományban.
Informatikai Értesítő. 2 (1) : 1-3. (1993)

141-93
VICSEK M.: A fraktálok különleges világa.
Alaplap. 11 (6) : 9-12. (1993)

Graphs and Network Group

142-93
CSABA, L. -- FAUDREE, R. J. -- GYÁRFÁS, A. -- LEHEL, J. -- SCHELP, R. H.: Networks communicating for each pairing of terminals.
Networks. 22 (7) : 615-626. (1992)

143-93
FAUDREE, R. J. -- GYÁRFÁS, A. -- LEHEL, J.: Minimal path-pairable graphs.
Congressus Numerantium. 88 : 111-128. (1992)

144-93
FAUDREE, R. J. -- GYÁRFÁS, A. -- LESNIAK, L. -- SCHELP, R. H.: Rainbow coloring the cube.
Journal of Graph Theory. 17 (5) : 607-612. (1993)

145-93
GYÁRFÁS, A. -- KIRÁLY, Z. -- LEHEL, J.: On-line graph coloring and finite basis problems.
In: Combinatorics, Paul Erdős is eighty. Keszthely, 1993. Vol. 1. (Eds. D. Miklós, V. T. Sós, T. Szőnyi.)
Budapest, János Bolyai Mathematical Society, 1993. pp. 207-214.

146-93
JACOBSON, M. S. -- LEHEL, J. -- LESNIAK, L. M.: [phi]-threshold and [phi]-tolerance chain graphs.
Discrete Applied Mathetmatics. 44 (1-3) : 191-203. (1993)

147-93
KRATSCH, D. -- LEHEL, J. -- MÜLLER, H.: Toughness, hamiltonicity and split graphs.
Friederich-Schiller-Universit[Sinvcircumflex]t. Forschungsergebnisse der Fakult[Sinvcircumflex]t für Mathematik und Informatik. Math/93/5.
Jena, Friederich-Schiller-Universit[Sinvcircumflex]t, 1993. 11 p.

148-93
RUSZINKÓ, M.: On a 2- and 3-dimensional search problem.
In: Proceedings of the sixth joint Swedish-Russian workshop on information theory. Mölle, 1993.
Mölle, 1993. pp. 437-440.

Combinatorial Computer Science Group

149-93
BACSÓ, G. -- TUZA, Zs.: Domination properties and induced subgraphs.
Discrete Mathematics. 111 (1-3) : 37-40. (1993)

150-93
BLÁZSIK, Z. -- HUJTER, M. -- PLUHÁR, A. -- TUZA, Zs.: Graphs with no induced C4 and 2K2.
Discrete Mathematics. 115 (1-3) : 51-55. (1993)

151-93
CARO, Y. -- TUZA, Zs.: Bounded degrees and prescribed distances in graphs.
Discrete Mathematics. 111 (1-3) : 87-93. (1993)

152-93
CHANG, G. J. -- FARBER, M. -- TUZA, Zs.: Algorithmic aspects of neighborhood numbers.
SIAM Journal on Discrete Mathematics. 6 (1) : 24-29. (1993)

153-93
CSUHAJ-VARJÚ, E.- KELEMENOVÁ, A.: Descriptional complexity of context-free grammar forms.
Theoretical Computer Science. 112 (2) : 277-289. (1993)

154-93
CSUHAJ-VARJÚ, E. -- DASSOW, J. -- PAUN, G.: Dinamically controlled cooperating/distributed grammar systems.
Information Sciences. 69 (1-2) : 1-25. (1993)

155-93
CSUHAJ-VARJÚ, E. -- PAUN, G.: Limiting the team size in cooperating grammar systems.
Bulletin of the EATCS. 51 : 198-202. (1993)

156-93
CSUHAJ-VARJÚ, E. -- ABO ALEZ, R.: Multi-agent systems in natural language processing.
In: TWLT 6. Natural language parsing. Methods and formalisms. ACL/SIGPARSE workshop. Proceedings of the sixth Twente workshop on language technology. Enschede, 1993. (Eds. K. Sikkel, A. Nijholt.)
Enschede, University of Twente, 1993. pp. 129-137.

157-93
CSUHAJ-VARJÚ, E. -- DASSOW, J.: A note on cooperating grammars with terminal productions.
Computers and Artificial Intelligence. 12 (1) : 99-104. (1993)

158-93
CSUHAJ-VARJÚ, E.: On grammars with local and global context conditions.
International Journal of Computer Mathematics. 47 : 17-27. (1993)

159-93
CSUHAJ-VARJÚ, E. -- DASSOW, J. -- KELEMEN, J. -- PAUN, G.: Stratified grammar systems.
In: Grammar systems and colonies III. Comenius University. Faculty of Mathematics and Physics. Computer science preprint CS1-93.
Bratislava, Comenius University, 1993. pp. 5-19.

160-93
ERDőS, P. -- TUZA, Zs.: Rainbow subgraphs in edge-colorings of complete graphs.
In: Quo vadis, graph theory? International conference on the future of graph theory. Fairbanks, 1990. (Eds. J. Gimbel, J. W. Kennedy, L. V. Quintas.)
Amsterdam, North-Holland, 1993. pp. 81-88.
(Annals of discrete mathematics 55.)

161-93
FARBER, M. -- HUJTER, M. -- TUZA, Zs.: An upper bound on the number of cliques in a graph.
Networks. 23 (3) : 207-210. (1993)

162-93
HARARY, F. -- TUZA, Zs.: Two graph-colouring games.
Bulletin of the Australian Mathematical Society. 48 (1) : 141-149. (1993)

163-93
HUJTER, M. -- TUZA, Zs.: The number of maximal independent sets in triangle-free graphs.
SIAM Journal on Discrete Mathematics. 6 (2) : 284-288. (1993)

164-93
HUJTER, M. -- TUZA, Zs.: Precoloring extension. II. Graph classes related to perfect graphs.
Acta Mathematicae Universitatis Comenianae. 62 (1) : 1-11. (1993)

165-93
KELEMENOVÁ, A. -- CSUHAJ-VARJÚ, E.: Languages of colonies.
In: Grammar systems and colonies III. Comenius University. Faculty of Mathematics and Physics. Computer science preprint CS1-93.
Bratislava, Comenius University, 1993. pp. 37-50.

166-93
KRATOCHVÍL, J. -- SAVICKY, P. -- TUZA, Zs.: One more occurrence of variables makes satisfiability jump from trivial to NP-complete.
SIAM Journal on Computing. 22 (1) : 203-210. (1993)

167-93
PYBER, L. -- TUZA, Zs.: Menger-type theorems with restrictions on path lengths.
Discrete Mathematics. 120 (1-3) : 161-174.(1993)

168-93
RADOSAVLJEVIC, Z. -- SIMIC, S. -- TUZA, Zs.: Complementary pairs of graphs orientable to line digraphs.
Journal of Combinatorial Mathematics and Combinatorial Computing. 13 : 65-75. (1993)

169-93
TUZA, Zs.: Helly property in finite set systems.
Journal of Combinatorial Theory. Ser. A. 62 (1) : 1-14. (1993)

170-93
TUZA, Zs.: Multipartite Turán problem for connected graphs and hypergraphs.
Discrete Mathematics. 112 (1-3) : 199-206. (1993)

171-93
TUZA, Zs.: Theorem proving through depth-first test.
Acta Universitatis Carolinae -- Mathematica et Physica. 33 (2) : 135-141. (1992)


 
 

wwwold.sztaki.hu
copyright (c) 2000 mta sztakiwebmaster