Zoltán Király

49 papers A 3B 3Misc 1Journal 37Unranked 4
YearRankTypeTitle / Venue / Authors
2024 J jnl
How many matchings cover the nodes of a graph?
Math. Program.
Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer
2023 J jnl
Problems and results on 1-cross-intersecting set pair systems.
Comb. Probab. Comput.
Zoltán Füredi, András Gyárfás, Zoltán Király
2022 J jnl
Upper bounds for the necklace folding problems.
J. Comb. Theory B
Endre Csóka, Zoltán L. Blázsik, Zoltán Király, Dániel Lenger
2021 J jnl
Application of the ZED Depth Sensor for Painting Robot Vision System Development.
IEEE Access
Vladimir Tadic, Ákos Odry, Ervin Burkus, István Kecskés, Zoltán Király, Zoltán Vizvári, Attila Tóth, Péter Odry
2021 — conf
Quantitative metrics characterizing malicious samples.
CyberSA
Ferenc Leitold, Krisztina Gyorffyné Holló, Zoltán Király
2020 J jnl
Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding.
IEEE/ACM Trans. Netw.
Alija Pasic, Péter Babarczi, János Tapolcai, Erika R. Bérczi-Kovács, Zoltán Király, Lajos Rónyai
2019 J jnl
Packing tree degree sequences.
Informatica (Slovenia)
Kristóf Bérczi, Zoltán Király, Changshuo Liu, István Miklós
2018 J jnl
Acyclic orientations with degree constraints.
CoRR
Zoltán Király, Dömötör Pálvölgyi
2018 Misc conf
Fuzzified Gabor Filter for Text Recognition in Images.
SISY
Vladimir Tadic, Zoltán Király, Zeljen Trpovski, Tatjana Loncar-Turukalo, Péter Odry
2018 J jnl
How many matchings cover the nodes of a graph?
CoRR
Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer
2018 J jnl
Optimal and heuristic network coding algorithms for multi-layered video broadcast.
Networks
Erika R. Bérczi-Kovács, Zoltán Király
2018 J jnl
Spanning tree with lower bound on the degrees.
Discret. Appl. Math.
Zoltán Király
2017 J jnl
Covering complete partite hypergraphs by monochromatic components.
Discret. Math.
András Gyárfás, Zoltán Király
2017 J jnl
Network Coding Algorithms for Multi-Layered Video Broadcast.
CoRR
Erika R. Bérczi-Kovács, Zoltán Király
2017 J jnl
On Ryser's Conjecture for $t$-Intersecting and Degree-Bounded Hypergraphs.
Electron. J. Comb.
Zoltán Király, Lilla Tóthmérész
2016 — ch.
Simpler Approximation for Stable Marriage.
Encyclopedia of Algorithms
Zoltán Király
2015 J jnl
On the tractability of some natural packing, covering and partitioning problems.
Discret. Appl. Math.
Attila Bernáth, Zoltán Király
2015 J jnl
Randomized and deterministic algorithms for network coding problems in wireless networks.
Inf. Process. Lett.
Zoltán Király, Erika R. Kovács
2015 B conf
Survivable routing meets diversity coding.
Networking
Alija Pasic, János Tapolcai, Péter Babarczi, Erika R. Bérczi-Kovács, Zoltán Király, Lajos Rónyai
2014 J jnl
Monochromatic components in edge-colored complete uniform hypergraphs.
Eur. J. Comb.
Zoltán Király
2014 J jnl
Notes on dual-critical graphs.
CoRR
Zoltán Király, Sándor Kisfaludi-Bak
2014 J jnl
On the tractability of some natural packing, covering and partitioning problems.
CoRR
Attila Bernáth, Zoltán Király
2014 B conf
Shortest Paths in Nearly Conservative Digraphs.
IPEC
Zoltán Király
2014 J jnl
Shortest Paths in Nearly Conservative Digraphs.
CoRR
Zoltán Király
2013 J jnl
Linear Time Local Approximation Algorithm for Maximum Stable Marriage.
Algorithms
Zoltán Király
2013 J jnl
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence.
Comb. Probab. Comput.
Péter L. Erdös, Zoltán Király, István Miklós
2012 — conf
Deterministic network coding algorithms and applications for wireless networks.
NetCod
Zoltán Király, Erika Renata Kovács
2012 J jnl
Efficient implementations of minimum-cost flow algorithms
CoRR
Zoltán Király, Péter Kovács
2012 J jnl
On Families of Weakly Cross-intersecting Set-pairs.
Fundam. Informaticae
Zoltán Király, Zoltán Lóránt Nagy, Dömötör Pálvölgyi, Mirkó Visontai
2012 J jnl
On the swap-distances of different realizations of a graphical degree sequence
CoRR
Péter L. Erdös, Zoltán Király, István Miklós
2011 J jnl
Better and Simpler Approximation Algorithms for the Stable Marriage Problem.
Algorithmica
Zoltán Király
2011 J jnl
Monochromatic components in edge-colored complete uniform hypergraphs.
Electron. Notes Discret. Math.
Zoltán Király
2010 J jnl
Induced Graph Packing Problems.
Graphs Comb.
Zoltán Király, Jácint Szabó
2010 J jnl
Local edge-connectivity augmentation in hypergraphs is NP-complete.
Discret. Appl. Math.
Zoltán Király, Ben Cosh, Bill Jackson
2008 A conf
Better and Simpler Approximation Algorithms for the Stable Marriage Problem.
ESA
Zoltán Király
2008 J jnl
Recent results on well-balanced orientations.
Discret. Optim.
Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti
2007 J jnl
An algorithm for node-capacitated ring routing.
Oper. Res. Lett.
András Frank, Zoltán Király, Balázs Kotnyek
2006 J jnl
Simultaneous well-balanced orientations of graphs.
J. Comb. Theory B
Zoltán Király, Zoltán Szigeti
2005 A conf
An Algorithm for Node-Capacitated Ring Routing.
ESA
András Frank, Zoltán Király, Balázs Kotnyek
2005 — conf
Generalized Secure Routerless Routing.
ICN (2)
Vince Grolmusz, Zoltán Király
2004 J jnl
Packing paths of length at least two.
Discret. Math.
Mikio Kano, Gyula Y. Katona, Zoltán Király
2004 — conf
Secure routerless routing.
FDNA@SIGCOMM
Vince Grolmusz, Zoltán Király
2003 J jnl
On the orientation of graphs and hypergraphs.
Discret. Appl. Math.
András Frank, Tamás Király, Zoltán Király
2002 J jnl
Graph Orientations with Edge-connection and Parity Constraints.
Comb.
András Frank, Zoltán Király
1999 A conf
Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis.
ESA
András A. Benczúr, Jörg Förster, Zoltán Király
1999 J jnl
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.
SIAM J. Discret. Math.
András Gyárfás, Zoltán Király, Jenö Lehel
1999 B conf
Parity Constrained
IPCO
András Frank, Zoltán Király
1998 J jnl
On intersecting hypergraphs.
Discret. Math.
Barry Guiduli, Zoltán Király
1997 J jnl
On-line 3-chromatic graphs - II critical graphs.
Discret. Math.
András Gyárfás, Zoltán Király, Jenö Lehel