Szeged 2014 2 "Discovery consists of seeing what everybody has seen and thinking what nobody has thought."

István A. Kovács∗,1, 2, 3 Réka Mizsei, and Péter Csermely Wigner Research Centre, Institute for Solid State Physics and Optics, H-1525 Budapest, P.O.Box 49, Hungary Institute of Theoretical Physics, Szeged University, H-6720 Szeged, Hungary Center for Complex Networks Research and Department of Physics, Northeastern University, 110 Forsyth Street, 111 Dana Research Center, Boston, MA 02115, USA...

In the modern literature on game theory there are several versions of what is known as Zermelo’s theorem. It is shown that most of these modern statements of Zermelo’s theorem bear only a partial relationship to what Zermelo really did. We also give a short survey and discussion of the closely related but almost unknown work by König (1927, Acta Sci. Math. Szeged, 3, 121–130) and Kálmar (1928/2...

Complete List of Authors: Oláh, Attila; University of Debrecen, Department of Physiology Ambrus, Lídia; University of Debrecen, Department of Physiology Nicolussi, Simon; University of Bern, Institute of Biochemistry and Molecular Medicine, NCCR TransCure Gertsch, Jürg; University of Bern, Institute of Biochemistry and Molecular Medicine, NCCR TransCure Tubak, Vilmos; Creative Laboratory Ltd, K...

The aim of the study is to define those factors, which are relevant in forming weather and air quality conditions in Szeged, Hungary. The database consists of daily averages of 11 meteorological and 8 air pollution parameters for the summer and winter months for the five-year period 1997-2001. In order to explain the connections between the 19 variables, the multivariate statistical method of f...

The edge Szeged polynomial of a graph G is defined as Sze(G,x) = ( ) ( ) , u v m e m e e uv x = ∑ where mu(e) is the number of edges of G lying closer to u than to v and mv(e) is the number of edges of G lying closer to v than to u. In this paper the main properties of this newly proposed polynomial are investigated. We also compute this polynomial for some classes of well-known graphs. Finally...

Szeged 2004 " Computers are good at following instructions, but not at reading your mind. " — Donald E. Knuth