@article{MTMT:34845445,
	title = {Time-dependent frequent sequence mining-based survival analysis},
	url = {https://m2.mtmt.hu/api/publication/34845445},
	author = {Csalódi, Róbert and Bagyura, Zsolt and Fogarassyné Vathy, Ágnes and Abonyi, János},
	doi = {10.1016/j.knosys.2024.111885},
	journal-iso = {KNOWL-BASED SYST},
	journal = {KNOWLEDGE-BASED SYSTEMS},
	volume = {296},
	unique-id = {34845445},
	issn = {0950-7051},
	year = {2024},
	eissn = {1872-7409},
	orcid-numbers = {Csalódi, Róbert/0000-0001-9409-8886; Bagyura, Zsolt/0000-0001-8120-2322; Fogarassyné Vathy, Ágnes/0000-0002-5524-1675; Abonyi, János/0000-0001-8593-1493}
}

@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:34762966,
	title = {Generally Applicable Q-Table Compression Method and Its Application for Constrained Stochastic Graph Traversal Optimization Problems},
	url = {https://m2.mtmt.hu/api/publication/34762966},
	author = {Kegyes, Tamás and Kummer, Alex and Süle, Zoltán and Abonyi, János},
	doi = {10.3390/info15040193},
	journal-iso = {INFORMATION-BASEL},
	journal = {INFORMATION (BASEL)},
	volume = {15},
	unique-id = {34762966},
	abstract = {We analyzed a special class of graph traversal problems, where the distances are stochastic, and the agent is restricted to take a limited range in one go. We showed that both constrained shortest Hamiltonian pathfinding problems and disassembly line balancing problems belong to the class of constrained shortest pathfinding problems, which can be represented as mixed-integer optimization problems. Reinforcement learning (RL) methods have proven their efficiency in multiple complex problems. However, researchers concluded that the learning time increases radically by growing the state- and action spaces. In continuous cases, approximation techniques are used, but these methods have several limitations in mixed-integer searching spaces. We present the Q-table compression method as a multistep method with dimension reduction, state fusion, and space compression techniques that project a mixed-integer optimization problem into a discrete one. The RL agent is then trained using an extended Q-value-based method to deliver a human-interpretable model for optimal action selection. Our approach was tested in selected constrained stochastic graph traversal use cases, and comparative results are shown to the simple grid-based discretization method.},
	year = {2024},
	eissn = {2078-2489},
	pages = {193},
	orcid-numbers = {Kegyes, Tamás/0000-0002-9003-7776; Kummer, Alex/0000-0002-6550-5101; Süle, Zoltán/0000-0002-5589-2355; Abonyi, János/0000-0001-8593-1493}
}

@article{MTMT:34760346,
	title = {Connected Turán number of trees},
	url = {https://m2.mtmt.hu/api/publication/34760346},
	author = {Caro, Yair and Patkós, Balázs and Tuza, Zsolt},
	doi = {10.26493/1855-3974.3109.e4b},
	journal-iso = {ARS MATH CONTEMPOR},
	journal = {ARS MATHEMATICA CONTEMPORANEA},
	volume = {Manuscript Published 2023-10-03},
	unique-id = {34760346},
	issn = {1855-3966},
	abstract = {As a variant of the much studied Turán number, ex(n,F), the largest number of edges that an n-vertex F-free graph may contain, we introduce the connected Turán number exc(n,F), the largest number of edges that an n-vertex connected F-free graph may contain. We focus on the case where the forbidden graph is a tree. The celebrated conjecture of Erdős and Sós states that for any tree T, we have ex(n,T)≤(|T|−2)n2. We address the problem how much smaller exc(n,T) can be, what is the smallest possible ratio of exc(n,T) and (|T|−2)n2 as |T| grows. We also determine the exact value of exc(n,T) for small trees, in particular for all trees with at most six vertices. We introduce general constructions of connected T-free graphs based on graph parameters as longest path, matching number, branching number, etc.},
	year = {2024},
	eissn = {1855-3974},
	pages = {&},
	orcid-numbers = {Patkós, Balázs/0000-0002-1651-2487}
}

@article{MTMT:34728824,
	title = {Disassembly line optimization with reinforcement learning},
	url = {https://m2.mtmt.hu/api/publication/34728824},
	author = {Kegyes, Tamás and Süle, Zoltán and Abonyi, János},
	doi = {10.1007/s10100-024-00906-3},
	journal-iso = {CEJOR},
	journal = {CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH},
	volume = {2024},
	unique-id = {34728824},
	issn = {1435-246X},
	abstract = {As the environmental aspects become increasingly important, the disassembly problems have become the researcher’s focus. Multiple criteria do not enable finding a general optimization method for the topic, but some heuristics and classical formulations provide effective solutions. By highlighting that disassembly problems are not the straight inverses of assembly problems and the conditions are not standard, disassembly optimization solutions require human control and supervision. Considering that Reinforcement learning (RL) methods can successfully solve complex optimization problems, we developed an RL-based solution for a fully formalized disassembly problem. There were known successful implementations of RL-based optimizers. But we integrated a novel heuristic to target a dynamically pre-filtered action space for the RL agent ( dl O pt RL algorithm) and hence significantly raise the efficiency of the learning path. Our algorithm belongs to the Heuristically Accelerated Reinforcement Learning (HARL) method class. We demonstrated its applicability in two use cases, but our approach can also be easily adapted for other problem types. Our article gives a detailed overview of disassembly problems and their formulation, the general RL framework and especially Q-learning techniques, and a perfect example of extending RL learning with a built-in heuristic.},
	year = {2024},
	eissn = {1613-9178},
	pages = {1},
	orcid-numbers = {Kegyes, Tamás/0000-0002-9003-7776; Abonyi, János/0000-0001-8593-1493}
}

@article{MTMT:34570694,
	title = {Machine learning -based decision support framework for CBRN protection},
	url = {https://m2.mtmt.hu/api/publication/34570694},
	author = {Kegyes, Tamás and Süle, Zoltán and Abonyi, János},
	doi = {10.1016/j.heliyon.2024.e25946},
	journal-iso = {HELIYON},
	journal = {HELIYON},
	volume = {10},
	unique-id = {34570694},
	year = {2024},
	eissn = {2405-8440},
	orcid-numbers = {Kegyes, Tamás/0000-0002-9003-7776; Süle, Zoltán/0000-0002-5589-2355; Abonyi, János/0000-0001-8593-1493}
}

@article{MTMT:34555799,
	title = {Modeling of a Biomass-Based Energy Production Case Study Using Flexible Inputs with the P-Graph Framework},
	url = {https://m2.mtmt.hu/api/publication/34555799},
	author = {Éles, András and Heckl, István and Cabezas, Heriberto},
	doi = {10.3390/en17030687},
	journal-iso = {ENERGIES},
	journal = {ENERGIES},
	volume = {17},
	unique-id = {34555799},
	issn = {1996-1073},
	abstract = {In this work, a modeling technique utilizing the P-Graph framework was used for a case study involving biomass-based local energy production. In recent years, distributed energy systems gained attention. These systems aim to satisfy energy supply demands, support the local economy, decrease transportation needs and dependence on imports, and, in general, obtain a more sustainable energy production process. Designing such systems is a challenge, for which novel optimization approaches were developed to help decision making. Previous work used the P-Graph framework to optimize energy production in a small rural area, involving manure, intercrops, grass, and corn silage as inputs and fermenters. Biogas is produced in fermenters, and Combined Heat and Power (CHP) plants provide heat and electricity. A more recent result introduced the concept of operations with flexible inputs in the P-Graph framework. In this work, the concept of flexible inputs was applied to model fermenters in the original case study. A new implementation of the original decision problem was made both as a Mixed-Integer Linear Programming (MILP) model and as a purely P-Graph model by using the flexible input technique. Both approaches provided the same optimal solution, with a 31% larger profit than the fixed input model.},
	year = {2024},
	eissn = {1996-1073},
	pages = {687},
	orcid-numbers = {Cabezas, Heriberto/0000-0003-3178-2861}
}

@article{MTMT:34450611,
	title = {Algorithmic model generation for multi-site multi-period planning of clean processes by P-graphs},
	url = {https://m2.mtmt.hu/api/publication/34450611},
	author = {Kalauz, Károly and Frits, Márton and Bertók, Botond},
	doi = {10.1016/j.jclepro.2023.140192},
	journal-iso = {J CLEAN PROD},
	journal = {JOURNAL OF CLEANER PRODUCTION},
	volume = {434},
	unique-id = {34450611},
	issn = {0959-6526},
	year = {2024},
	eissn = {1879-1786},
	orcid-numbers = {Kalauz, Károly/0009-0007-5888-5541; Bertók, Botond/0000-0002-1297-9792}
}

@article{MTMT:34397551,
	title = {Spectrum of 3-uniform 6- and 9-cycle systems over K (3) v − I},
	url = {https://m2.mtmt.hu/api/publication/34397551},
	author = {Keszler, Anita and Tuza, Zsolt},
	doi = {10.1016/j.disc.2023.113782},
	journal-iso = {DISCRETE MATH},
	journal = {DISCRETE MATHEMATICS},
	volume = {347},
	unique-id = {34397551},
	issn = {0012-365X},
	year = {2024},
	eissn = {1872-681X}
}