@article{MTMT:34831192,
	title = {On the number of edges in a K5-minor-free graph of given girth},
	url = {https://m2.mtmt.hu/api/publication/34831192},
	author = {Barát, János},
	doi = {10.1016/j.disc.2024.114042},
	journal-iso = {DISCRETE MATH},
	journal = {DISCRETE MATHEMATICS},
	volume = {347},
	unique-id = {34831192},
	issn = {0012-365X},
	year = {2024},
	eissn = {1872-681X},
	pages = {114042},
	orcid-numbers = {Barát, János/0000-0002-8474-487X}
}

@{MTMT:34827161,
	title = {Az egocentrikus és exocentrikus távolságok kapcsolata az e-sporttal},
	url = {https://m2.mtmt.hu/api/publication/34827161},
	author = {Guzsvinecz, Tibor and Szűcs, Judit},
	booktitle = {II. PE ZEK E-Sport Szakmai Napok},
	unique-id = {34827161},
	year = {2024},
	pages = {8-8},
	orcid-numbers = {Guzsvinecz, Tibor/0000-0003-3273-313X; Szűcs, Judit/0000-0002-9828-3322}
}

@{MTMT:34827152,
	title = {Játsszunk? Mérjünk!},
	url = {https://m2.mtmt.hu/api/publication/34827152},
	author = {Németh, Krisztián and Szabó, Péter and Bella, Dániel and Szűcs, Judit},
	booktitle = {II. PE ZEK E-Sport Szakmai Napok},
	unique-id = {34827152},
	year = {2024},
	pages = {16-16},
	orcid-numbers = {Szűcs, Judit/0000-0002-9828-3322}
}

@book{MTMT:34827140,
	title = {II. PE ZEK E-Sport Szakmai Napok. Összefoglaló kiadvány},
	url = {https://m2.mtmt.hu/api/publication/34827140},
	isbn = {9786150206707},
	editor = {Gaál, Eszter and Szűcs, Judit and Guzsvinecz, Tibor},
	publisher = {Zalai Egyetemi Sportegyesület},
	unique-id = {34827140},
	year = {2024},
	orcid-numbers = {Szűcs, Judit/0000-0002-9828-3322; Guzsvinecz, Tibor/0000-0003-3273-313X}
}

@article{MTMT:34822769,
	title = {Generalizing the concept of bounded variation},
	url = {https://m2.mtmt.hu/api/publication/34822769},
	author = {Goswami, Angshuman Robin},
	doi = {10.1007/s00010-024-01050-8},
	journal-iso = {AEQUATIONES MATH},
	journal = {AEQUATIONES MATHEMATICAE},
	volume = {2024},
	unique-id = {34822769},
	issn = {0001-9054},
	abstract = {Let [a,b]\subseteq \mathbb {R} [ a , b ] ⊆ R be a non-empty and non singleton closed interval and P=\{a=x_0<\cdots <x_n=b\} P = { a = x 0 < ⋯ < x n = b } is a partition of it. Then f:I\rightarrow \mathbb {R} f : I → R is said to be a function of r -bounded variation, if the expression \sum \nolimits ^{n}_{i=1}|f(x_i)-f(x_{i-1})|^{r} ∑ i = 1 n | f ( x i ) - f ( x i - 1 ) | r is bounded for all possible partitions like P . One of the main results of the paper deals with the generalization of the classical Jordan decomposition theorem. We establish that for r\in ]0,1] r ∈ ] 0 , 1 ] , a function of r -bounded variation can be written as the difference of two monotone functions. While for r>1 r > 1 , under minimal assumptions such a function can be treated as an approximately monotone function which can be closely approximated by a nondecreasing majorant. We also prove that for 0<r_1<r_2 0 < r 1 < r 2 , the function class of r_1 r 1 -bounded variation is contained in the class of functions satisfying r_2 r 2 -bounded variations. We go through approximately monotone functions and present a possible decomposition for f:I(\subseteq \mathbb {R}_+)\rightarrow \mathbb {R} f : I ( ⊆ R + ) → R satisfying the functional inequality f(x)\le f(x)+(y-x)^{p}\quad (x,y\in I \text{ with } x<y \text{ and } p\in ]0,1[ ). f ( x ) ≤ f ( x ) + ( y - x ) p ( x , y ∈ I with x < y and p ∈ ] 0 , 1 [ ) . A generalized structural study has also been done in that specific section. On the other hand, for \ell [a,b]\ge d ℓ [ a , b ] ≥ d , a function satisfying the following monotonic condition under the given assumption will be termed as d -periodically increasing f(x)\le f(y)\quad \text{ for } \text{ all }\quad x,y\in I\quad \text{ with }\quad y-x\ge d. f ( x ) ≤ f ( y ) for all x , y ∈ I with y - x ≥ d . We establish that in a compact interval any function satisfying d -bounded variation can be decomposed as the difference of a monotone and a d -periodically increasing function. The core details related to past results, motivation, structure of each and every section are thoroughly discussed below.},
	year = {2024},
	eissn = {1420-8903}
}

@article{MTMT:34820138,
	title = {Optimal strategies in fractional games: vertex cover and domination},
	url = {https://m2.mtmt.hu/api/publication/34820138},
	author = {Bujtás, Csilla and Rote, Günter and Tuza, Zsolt},
	doi = {10.26493/1855-3974.2771.4df},
	journal-iso = {ARS MATH CONTEMPOR},
	journal = {ARS MATHEMATICA CONTEMPORANEA},
	volume = {2024},
	unique-id = {34820138},
	issn = {1855-3966},
	year = {2024},
	eissn = {1855-3974},
	orcid-numbers = {Bujtás, Csilla/0000-0002-0511-5291}
}

@article{MTMT:34818984,
	title = {Extremal Graph Theoretic Questions for q-Ary Vectors},
	url = {https://m2.mtmt.hu/api/publication/34818984},
	author = {Patkós, Balázs and Tuza, Zsolt and Vizer, Máté},
	doi = {10.1007/s00373-024-02787-4},
	journal-iso = {GRAPH COMBINATOR},
	journal = {GRAPHS AND COMBINATORICS},
	volume = {40},
	unique-id = {34818984},
	issn = {0911-0119},
	abstract = {A q -graph H on n vertices is a set of vectors of length n with all entries from \{0,1,\dots ,q\} { 0 , 1 , ⋯ , q } and every vector (that we call a q -edge) having exactly two non-zero entries. The support of a q -edge {\textbf{x}} x is the pair S_{\textbf{x}} S x of indices of non-zero entries. We say that H is an s -copy of an ordinary graph F if |H|=|E(F)| | H | = | E ( F ) | , F is isomorphic to the graph with edge set \{S_{\textbf{x}}:{\textbf{x}}\in H\} { S x : x ∈ H } , and whenever v\in e,e'\in E(F) v ∈ e , e ′ ∈ E ( F ) , the entries with index corresponding to v in the q -edges corresponding to e and e' e ′ sum up to at least s . E.g., the q -edges (1, 3, 0, 0, 0), (0, 1, 0, 0, 3), and (3, 0, 0, 0, 1) form a 4-triangle. The Turán number \mathop {}\!\textrm{ex}(n,F,q,s) ex ( n , F , q , s ) is the maximum number of q -edges that a q -graph H on n vertices can have if it does not contain any s -copies of F . In the present paper, we determine the asymptotics of \mathop {}\!\textrm{ex}(n,F,q,q+1) ex ( n , F , q , q + 1 ) for many graphs F .},
	year = {2024},
	eissn = {1435-5914},
	orcid-numbers = {Patkós, Balázs/0000-0002-1651-2487}
}

@article{MTMT:34798546,
	title = {Examination of Accurate Exocentric Distance Estimates in a Virtual Environment Using a Desktop Display and the Gear VR},
	url = {https://m2.mtmt.hu/api/publication/34798546},
	author = {Guzsvinecz, Tibor and Szűcs, Judit and Perge, Erika},
	doi = {10.3390/electronics13081536},
	journal = {ELECTRONICS (SWITZ)},
	volume = {13},
	unique-id = {34798546},
	abstract = {Spatial perception plays a critical role in virtual worlds and real environments, as it can impact navigation abilities. To understand this influence, the conducted study investigated the effects of human characteristics and immersion levels on the exocentric distance estimation process in virtual environments. As the first step, a virtual environment was implemented for both desktop and Gear VR head-mounted displays. Afterward, the exocentric distance estimation skills of 229 university students were examined. Out of these students, 157 used the desktop display, and 72 used the Gear VR. Using logistic regression analysis and linear regression analysis methods, their effects on the probabilities of accurate estimates and their estimation times were investigated. According to the results, gender, video game playtime per week, height, and display device had significant effects on the former, whereas dominant hand, video game playtime per week, height, and display device had significant effects on the latter. The results also show that by using the head-mounted display, the likelihood of the students estimating exocentric distances accurately significantly decreased; however, they were significantly faster with it. These findings can influence the development of more accessible and effective virtual environments in the future.},
	keywords = {Virtual reality; Distance measurement; Mérési módszerek; virtuális valóság; Human in the loop; Ember-Számítógép Interakció; immersive experience},
	year = {2024},
	eissn = {2079-9292},
	pages = {1-23},
	orcid-numbers = {Guzsvinecz, Tibor/0000-0003-3273-313X; Szűcs, Judit/0000-0002-9828-3322; Perge, Erika/0000-0003-1285-1374}
}

@inbook{MTMT:34797365,
	title = {Massively Parallel EEG Algorithms for Pre-exascale Architectures},
	url = {https://m2.mtmt.hu/api/publication/34797365},
	author = {Wang, Zeyu and Juhász, Zoltán},
	booktitle = {Euro-Par 2023: Parallel Processing Workshops},
	doi = {10.1007/978-3-031-48803-0_34},
	unique-id = {34797365},
	year = {2024},
	pages = {290-295},
	orcid-numbers = {Juhász, Zoltán/0000-0003-0677-8588}
}

@article{MTMT:34780182,
	title = {Characterization of shadowing for linear autonomous delay differential equations},
	url = {https://m2.mtmt.hu/api/publication/34780182},
	author = {Pituk, Mihály and Stavroulakis, John Ioannis},
	doi = {10.21136/CMJ.2024.0191-23},
	journal-iso = {CZECH MATH J},
	journal = {CZECHOSLOVAK MATHEMATICAL JOURNAL},
	volume = {2024},
	unique-id = {34780182},
	issn = {0011-4642},
	year = {2024},
	eissn = {1572-9141},
	pages = {1-8}
}