default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZoltán Király
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j29]Dehia Ait-Ferhat, Zoltán Király
, András Sebö, Gautier Stauffer:
How many matchings cover the nodes of a graph? Math. Program. 203(1): 271-284 (2024)- 2023
- [j28]Zoltán Füredi, András Gyárfás, Zoltán Király:
Problems and results on 1-cross-intersecting set pair systems. Comb. Probab. Comput. 32(4): 691-702 (2023) - 2022
- [j27]Endre Csóka, Zoltán L. Blázsik, Zoltán Király, Dániel Lenger:
Upper bounds for the necklace folding problems. J. Comb. Theory B 157: 123-143 (2022) - 2021
- [j26]Vladimir Tadic, Ákos Odry, Ervin Burkus, István Kecskés, Zoltán Király, Zoltán Vizvári, Attila Tóth, Péter Odry:
Application of the ZED Depth Sensor for Painting Robot Vision System Development. IEEE Access 9: 117845-117859 (2021) - 2020
- [j25]Alija Pasic, Péter Babarczi, János Tapolcai, Erika R. Bérczi-Kovács, Zoltán Király, Lajos Rónyai:
Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding. IEEE/ACM Trans. Netw. 28(1): 289-300 (2020) - 2019
- [j24]Kristóf Bérczi, Zoltán Király, Changshuo Liu, István Miklós:
Packing tree degree sequences. Informatica (Slovenia) 43(1) (2019) - 2018
- [j23]Zoltán Király:
Spanning tree with lower bound on the degrees. Discret. Appl. Math. 242: 82-88 (2018) - [j22]Erika R. Bérczi-Kovács, Zoltán Király:
Optimal and heuristic network coding algorithms for multi-layered video broadcast. Networks 71(1): 51-59 (2018) - 2017
- [j21]Zoltán Király, Lilla Tóthmérész:
On Ryser's Conjecture for $t$-Intersecting and Degree-Bounded Hypergraphs. Electron. J. Comb. 24(4): 4 (2017) - [j20]András Gyárfás, Zoltán Király:
Covering complete partite hypergraphs by monochromatic components. Discret. Math. 340(12): 2753-2761 (2017) - 2015
- [j19]Attila Bernáth, Zoltán Király:
On the tractability of some natural packing, covering and partitioning problems. Discret. Appl. Math. 180: 25-35 (2015) - [j18]Zoltán Király, Erika R. Kovács:
Randomized and deterministic algorithms for network coding problems in wireless networks. Inf. Process. Lett. 115(4): 507-511 (2015) - 2014
- [j17]Zoltán Király:
Monochromatic components in edge-colored complete uniform hypergraphs. Eur. J. Comb. 35: 374-376 (2014) - 2013
- [j16]Zoltán Király:
Linear Time Local Approximation Algorithm for Maximum Stable Marriage. Algorithms 6(3): 471-484 (2013) - [j15]Péter L. Erdös, Zoltán Király, István Miklós:
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. Comb. Probab. Comput. 22(3): 366-383 (2013) - 2012
- [j14]Zoltán Király, Zoltán Lóránt Nagy, Dömötör Pálvölgyi, Mirkó Visontai:
On Families of Weakly Cross-intersecting Set-pairs. Fundam. Informaticae 117(1-4): 189-198 (2012) - 2011
- [j13]Zoltán Király:
Better and Simpler Approximation Algorithms for the Stable Marriage Problem. Algorithmica 60(1): 3-20 (2011) - [j12]Zoltán Király:
Monochromatic components in edge-colored complete uniform hypergraphs. Electron. Notes Discret. Math. 38: 517-521 (2011) - 2010
- [j11]Zoltán Király, Ben Cosh, Bill Jackson:
Local edge-connectivity augmentation in hypergraphs is NP-complete. Discret. Appl. Math. 158(6): 723-727 (2010) - [j10]Zoltán Király, Jácint Szabó:
Induced Graph Packing Problems. Graphs Comb. 26(2): 243-257 (2010) - 2008
- [j9]Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti:
Recent results on well-balanced orientations. Discret. Optim. 5(4): 663-676 (2008) - 2007
- [j8]András Frank, Zoltán Király, Balázs Kotnyek:
An algorithm for node-capacitated ring routing. Oper. Res. Lett. 35(3): 385-391 (2007) - 2006
- [j7]Zoltán Király, Zoltán Szigeti:
Simultaneous well-balanced orientations of graphs. J. Comb. Theory B 96(5): 684-692 (2006) - 2004
- [j6]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
- [j5]András Frank, Tamás Király, Zoltán Király:
On the orientation of graphs and hypergraphs. Discret. Appl. Math. 131(2): 385-400 (2003) - 2002
- [j4]András Frank, Zoltán Király:
Graph Orientations with Edge-connection and Parity Constraints. Comb. 22(1): 47-70 (2002) - 1999
- [j3]András Gyárfás, Zoltán Király, Jenö Lehel:
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. SIAM J. Discret. Math. 12(3): 385-411 (1999) - 1998
- [j2]Barry Guiduli, Zoltán Király:
On intersecting hypergraphs. Discret. Math. 182(1-3): 139-151 (1998) - 1997
- [j1]András Gyárfás, Zoltán Király, Jenö Lehel:
On-line 3-chromatic graphs - II critical graphs. Discret. Math. 177(1-3): 99-122 (1997)
Conference and Workshop Papers
- 2021
- [c11]Ferenc Leitold, Krisztina Gyorffyné Holló, Zoltán Király:
Quantitative metrics characterizing malicious samples. CyberSA 2021: 1-2 - 2018
- [c10]Vladimir Tadic, Zoltán Király, Zeljen Trpovski, Tatjana Loncar-Turukalo, Péter Odry:
Fuzzified Gabor Filter for Text Recognition in Images. SISY 2018: 221-226 - 2015
- [c9]Alija Pasic, János Tapolcai, Péter Babarczi, Erika R. Bérczi-Kovács, Zoltán Király, Lajos Rónyai:
Survivable routing meets diversity coding. Networking 2015: 1-9 - 2014
- [c8]Zoltán Király:
Shortest Paths in Nearly Conservative Digraphs. IPEC 2014: 234-245 - 2012
- [c7]Zoltán Király, Erika Renata Kovács:
Deterministic network coding algorithms and applications for wireless networks. NetCod 2012: 103-107 - 2008
- [c6]Zoltán Király:
Better and Simpler Approximation Algorithms for the Stable Marriage Problem. ESA 2008: 623-634 - 2005
- [c5]András Frank, Zoltán Király, Balázs Kotnyek:
An Algorithm for Node-Capacitated Ring Routing. ESA 2005: 249-258 - [c4]Vince Grolmusz, Zoltán Király:
Generalized Secure Routerless Routing. ICN (2) 2005: 454-462 - 2004
- [c3]Vince Grolmusz, Zoltán Király:
Secure routerless routing. FDNA@SIGCOMM 2004: 21-27 - 1999
- [c2]András A. Benczúr, Jörg Förster, Zoltán Király:
Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis. ESA 1999: 498-509 - [c1]András Frank, Zoltán Király:
Parity Constrained k-Edge-Connected Orientations. IPCO 1999: 191-201
Reference Works
- 2016
- [r1]Zoltán Király:
Simpler Approximation for Stable Marriage. Encyclopedia of Algorithms 2016: 1986-1988
Informal and Other Publications
- 2018
- [i8]Zoltán Király, Dömötör Pálvölgyi:
Acyclic orientations with degree constraints. CoRR abs/1806.03426 (2018) - [i7]Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer:
How many matchings cover the nodes of a graph? CoRR abs/1811.07327 (2018) - 2017
- [i6]Erika R. Bérczi-Kovács, Zoltán Király:
Network Coding Algorithms for Multi-Layered Video Broadcast. CoRR abs/1712.06435 (2017) - 2014
- [i5]Attila Bernáth, Zoltán Király:
On the tractability of some natural packing, covering and partitioning problems. CoRR abs/1407.4999 (2014) - [i4]Zoltán Király:
Shortest Paths in Nearly Conservative Digraphs. CoRR abs/1409.7033 (2014) - [i3]Zoltán Király, Sándor Kisfaludi-Bak:
Notes on dual-critical graphs. CoRR abs/1410.1653 (2014) - 2012
- [i2]Péter L. Erdös, Zoltán Király, István Miklós:
On the swap-distances of different realizations of a graphical degree sequence. CoRR abs/1205.2842 (2012) - [i1]Zoltán Király, Péter Kovács:
Efficient implementations of minimum-cost flow algorithms. CoRR abs/1207.6381 (2012)
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-06-10 21:20 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:
