default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGyula Y. Katona
Person information
- affiliation: Budapest University of Technology and Economics, Department of Computer Science and Information Theory, Hungary
- affiliation (PhD 1997): Hungarian Academy of Sciences, Mathematical Institute, Budapest, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Gyula Y. Katona
, Humara Khan:
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth. Graphs Comb. 40(5): 100 (2024)- [j41]Levon Aslanyan, Gyula Y. Katona, Hasmik Sahakyan:
Shadow Minimization Boolean Function Reconstruction. Informatica 35(1): 1-20 (2024) - 2023
- [j40]Gyula Y. Katona, Kitti Varga:
Strengthening some complexity results on toughness of graphs. Discuss. Math. Graph Theory 43(2): 401-419 (2023) - 2022
- [i5]Gyula Y. Katona, Humara Khan:
Minimally tough chordal graphs with toughness at most 1/2. CoRR abs/2209.00376 (2022) - [i4]Clément Dallard, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga:
Conditions for minimally tough graphs. CoRR abs/2210.00383 (2022) - 2021
- [j39]Gyula Y. Katona, István Kovács, Kitti Varga:
The complexity of recognizing minimally tough graphs. Discret. Appl. Math. 294: 55-84 (2021) - 2020
- [j38]Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal Pebbling Number of the Square Grid. Graphs Comb. 36(3): 803-829 (2020)
2010 – 2019
- 2019
- [j37]Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp:
Optimal pebbling number of graphs with given minimum degree. Discret. Appl. Math. 260: 117-130 (2019) - [j36]Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal pebbling and rubbling of graphs with given diameter. Discret. Appl. Math. 266: 340-345 (2019) - [j35]Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins:
The optimal pebbling number of staircase graphs. Discret. Math. 342(7): 2148-2157 (2019) - [i3]Gyula Y. Katona, Kitti Varga:
Strengthening some complexity results on toughness of graphs. CoRR abs/1910.08752 (2019) - 2018
- [j34]Gyula Y. Katona, Daniel Soltész, Kitti Varga:
Properties of minimally t-tough graphs. Discret. Math. 341(1): 221-231 (2018) - [j33]Mikio Kano, Gyula Y. Katona, Kitti Varga:
Decomposition of a Graph into Two Disjoint Odd Subgraphs. Graphs Comb. 34(6): 1581-1588 (2018) - 2017
- [j32]Hassan Charaf, Gábor Harsányi, András Poppe, Sándor Imre, Bálint Kiss, Tamás Dabóczi, Gyula Y. Katona, Lajos Nagy, Gábor Magyar, István Kiss:
BME VIK Annual Research Report on Electrical Engineering and Computer Science 2016. Period. Polytech. Electr. Eng. Comput. Sci. 61(2): 83-115 (2017) - [j31]Ervin Györi, Gyula Y. Katona, László F. Papp:
Constructions for the Optimal Pebbling of Grids. Period. Polytech. Electr. Eng. Comput. Sci. 61(2): 217-223 (2017) - [i2]Gyula Y. Katona, István Kovács, Kitti Varga:
The complexity of recognizing minimally tough graphs. CoRR abs/1705.10570 (2017) - 2016
- [j30]Gyula Y. Katona, László F. Papp:
The optimal rubbling number of ladders, prisms and Möbius-ladders. Discret. Appl. Math. 209: 227-246 (2016) - [j29]Gyula Y. Katona, Péter G. N. Szabó:
Bounds on the number of edges in hypertrees. Discret. Math. 339(7): 1884-1891 (2016) - [j28]Ervin Györi, Gyula Y. Katona, Nathan Lemons:
Hypergraph extensions of the Erdős-Gallai Theorem. Eur. J. Comb. 58: 238-246 (2016) - 2015
- [i1]Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal pebbling of grids. CTW 2015: 213-216 - 2014
- [j27]Ali Reza Ashrafi, Morteza Faghani, Gyula Y. Katona:
Centrosymmetric graphs and a lower bound for graph energy of fullerenes. Discuss. Math. Graph Theory 34(4): 751-768 (2014) - [j26]Gyula Y. Katona:
Extension of paths and cycles for hypergraphs. Electron. Notes Discret. Math. 45: 3-7 (2014) - 2013
- [j25]Gyula Y. Katona, Nándor Sieben:
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs. Graphs Comb. 29(3): 535-551 (2013) - 2012
- [j24]Gyula O. H. Katona, Gyula Y. Katona, Zsolt Katona:
Most Probably Intersecting Families of Subsets. Comb. Probab. Comput. 21(1-2): 219-227 (2012) - 2011
- [j23]Illés Horváth, Gyula Y. Katona:
Extremal P4-stable graphs. Discret. Appl. Math. 159(16): 1786-1792 (2011) - [j22]Gyula Y. Katona, Nándor Sieben:
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs. Electron. Notes Discret. Math. 38: 487-492 (2011) - 2010
- [j21]Aneta Dudek, Andrzej Zak, Gyula Y. Katona:
Hamilton-chain saturated hypergraphs. Discret. Math. 310(6-7): 1172-1176 (2010) - [j20]Ervin Györi, Gyula Y. Katona, Nathan Lemons:
Hypergraph Extensions of the Erdos-Gallai Theorem. Electron. Notes Discret. Math. 36: 655-662 (2010)
2000 – 2009
- 2009
- [j19]László A. Zahoránszky, Gyula Y. Katona, Péter Hári, András Málnási-Csizmadia, Katharina Anna Zweig, Gergely Zahoránszky-Köhalmi:
Breaking the hierarchy - a new cluster selection mechanism for hierarchical clustering methods. Algorithms Mol. Biol. 4: 12 (2009) - [j18]Mikio Kano, Gyula Y. Katona, Jácint Szabó:
Elementary Graphs with Respect to f-Parity Factors. Graphs Comb. 25(5): 717-726 (2009) - [c1]Gyula Y. Katona, Illés Horváth:
Extremal Stable Graphs. CTW 2009: 149-152 - 2008
- [j17]Peter Frankl, Gyula Y. Katona:
Extremal k-edge-hamiltonian hypergraphs. Discret. Math. 308(8): 1415-1424 (2008) - 2007
- [j16]Mikio Kano, Gyula Y. Katona:
Structure theorem and algorithm on (1, f)-odd subgraph. Discret. Math. 307(11-12): 1404-1417 (2007) - [j15]Frank Göring, Gyula Y. Katona:
Local Topological Toughness and Local Factors. Graphs Comb. 23(4): 387-399 (2007) - 2006
- [j14]Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda:
Hamiltonian path saturated graphs with small size. Discret. Appl. Math. 154(9): 1372-1379 (2006) - [j13]Gyula Y. Katona:
Hamiltonian Chains in Hypergraphs. Electron. Notes Discret. Math. 25: 81-87 (2006) - 2004
- [j12]Mikio Kano, Gyula Y. Katona, Zoltán Király:
Packing paths of length at least two. Discret. Math. 283(1-3): 129-135 (2004) - 2003
- [j11]Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda:
m_Path Cover Saturated Graphs. Electron. Notes Discret. Math. 13: 41-44 (2003) - 2002
- [j10]Mikio Kano, Gyula Y. Katona:
Odd subgraphs and matchings. Discret. Math. 250(1-3): 265-272 (2002) - 2001
- [j9]Gyula Y. Katona:
A large set of non-Hamiltonian graphs. Discret. Appl. Math. 115(1-3): 99-115 (2001) - [j8]Peter Frankl, Gyula Y. Katona:
Extremal k-edge-hamiltonian Hypergraphs. Electron. Notes Discret. Math. 10: 109-112 (2001) - 2000
- [j7]Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman:
Chordality and 2-factors in Tough Graphs. Discret. Appl. Math. 99(1-3): 323-329 (2000) - [j6]Peter Frankl, Gyula Y. Katona:
Extremal k-edge-hamiltonian Hypergraphs. Electron. Notes Discret. Math. 5: 130-133 (2000)
1990 – 1999
- 1999
- [j5]Gyula Y. Katona:
Properties of Edge-Tough Graphs. Graphs Comb. 15(3): 315-325 (1999) - [j4]Gyula Y. Katona, Hal A. Kierstead:
Hamiltonian chains in hypergraphs. J. Graph Theory 30(3): 205-212 (1999) - 1997
- [j3]Gyula Y. Katona:
Edge Disjoint Polyp Packing. Discret. Appl. Math. 78(1-3): 133-152 (1997) - [j2]Gyula Y. Katona:
Toughness and edge-toughness. Discret. Math. 164(1-3): 187-196 (1997) - 1992
- [j1]Gyula Y. Katona:
Searching for f-Hamiltonian circuits. Comb. 12(2): 241-246 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
