Zoltán Király - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2024

How many matchings cover the nodes of a graph?Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer. mp, 203(1):271-284, January 2024. [doi]

2022

Upper bounds for the necklace folding problemsEndre Csóka, Zoltán L. Blázsik, Zoltán Király, Dániel Lenger. jctb, 157:123-143, 2022. [doi]

2021

Quantitative metrics characterizing malicious samplesFerenc Leitold, Krisztina Gyorffyné Holló, Zoltán Király. cybersa 2021: 1-2 [doi]

Application of the ZED Depth Sensor for Painting Robot Vision System DevelopmentVladimir Tadic, Ákos Odry, Ervin Burkus, István Kecskés, Zoltán Király, Zoltán Vizvári, Attila Tóth, Péter Odry. access, 9:117845-117859, 2021. [doi]

2020

Minimum Cost Survivable Routing Algorithms for Generalized Diversity CodingAlija Pasic, Péter Babarczi, János Tapolcai, Erika R. Bérczi-Kovács, Zoltán Király, Lajos Rónyai. ton, 28(1):289-300, 2020. [doi]

2019

Packing tree degree sequencesKristóf Bérczi, Zoltán Király, Changshuo Liu, István Miklós. informaticaSI, 43(1), 2019. [doi]

2018

Optimal and heuristic network coding algorithms for multi-layered video broadcastErika R. Bérczi-Kovács, Zoltán Király. networks, 71(1):51-59, 2018. [doi]

Spanning tree with lower bound on the degreesZoltán Király. DAM, 242:82-88, 2018. [doi]

Fuzzified Gabor Filter for Text Recognition in ImagesVladimir Tadic, Zoltán Király, Zeljen Trpovski, Tatjana Loncar-Turukalo, Péter Odry. sisy 2018: 221-226 [doi]

2017

Covering complete partite hypergraphs by monochromatic componentsAndrás Gyárfás, Zoltán Király. DM, 340(12):2753-2761, 2017. [doi]

On Ryser's Conjecture for $t$-Intersecting and Degree-Bounded HypergraphsZoltán Király, Lilla Tóthmérész. combinatorics, 24(4):4, 2017. [doi]

2015

On the tractability of some natural packing, covering and partitioning problemsAttila Bernáth, Zoltán Király. DAM, 180:25-35, 2015. [doi]

Randomized and deterministic algorithms for network coding problems in wireless networksZoltán Király, Erika R. Kovács. ipl, 115(4):507-511, 2015. [doi]

Survivable routing meets diversity codingAlija Pasic, János Tapolcai, Péter Babarczi, Erika R. Berczi-Kovacs, Zoltán Király, Lajos Rónyai. networking 2015: 1-9 [doi]

2014

Monochromatic components in edge-colored complete uniform hypergraphsZoltán Király. ejc, 35:374-376, 2014. [doi]

Shortest Paths in Nearly Conservative DigraphsZoltán Király. iwpec 2014: 234-245 [doi]

2013

On the Swap-Distances of Different Realizations of a Graphical Degree SequencePéter L. Erdös, Zoltán Király, István Miklós. cpc, 22(3):366-383, 2013. [doi]

Linear Time Local Approximation Algorithm for Maximum Stable MarriageZoltán Király. algorithms, 6(3):471-484, 2013. [doi]

2012

Deterministic network coding algorithms and applications for wireless networksZoltán Király, Erika Renata Kovács. netcod 2012: 103-107 [doi]

On Families of Weakly Cross-intersecting Set-pairsZoltán Király, Zoltán Lóránt Nagy, Dömötör Pálvölgyi, Mirkó Visontai. FUIN, 117(1-4):189-198, 2012. [doi]

2011

Monochromatic components in edge-colored complete uniform hypergraphsZoltán Király. endm, 38:517-521, 2011. [doi]

Better and Simpler Approximation Algorithms for the Stable Marriage ProblemZoltán Király. algorithmica, 60(1):3-20, 2011. [doi]

2010

Induced Graph Packing ProblemsZoltán Király, Jácint Szabó. gc, 26(2):243-257, 2010. [doi]

Local edge-connectivity augmentation in hypergraphs is NP-completeZoltán Király, Ben Cosh, Bill Jackson. DAM, 158(6):723-727, 2010. [doi]

2008

Recent results on well-balanced orientationsAttila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti. disopt, 5(4):663-676, 2008. [doi]

Better and Simpler Approximation Algorithms for the Stable Marriage ProblemZoltán Király. esa 2008: 623-634 [doi]

2007

An algorithm for node-capacitated ring routingAndrás Frank, Zoltán Király, Balázs Kotnyek. orl, 35(3):385-391, 2007. [doi]

2006

Simultaneous well-balanced orientations of graphsZoltán Király, Zoltán Szigeti. JCT, 96(5):684-692, 2006. [doi]

2005

An Algorithm for Node-Capacitated Ring RoutingAndrás Frank, Zoltán Király, Balázs Kotnyek. esa 2005: 249-258 [doi]

Generalized Secure Routerless RoutingVince Grolmusz, Zoltán Király. icn 2005: 454-462 [doi]

2004

Secure routerless routingVince Grolmusz, Zoltán Király. sigcomm 2004: 21-27 [doi]

Packing paths of length at least twoMikio Kano, Gyula Y. Katona, Zoltán Király. DM, 283(1-3):129-135, 2004. [doi]

2003

On the orientation of graphs and hypergraphsAndrás Frank, Tamás Király, Zoltán Király. DAM, 131(2):385-400, 2003. [doi]

2002

Graph Orientations with Edge-connection and Parity ConstraintsAndrás Frank, Zoltán Király. combinatorica, 22(1):47-70, 2002. [doi]

1999

Dilworth s Theorem and Its Application for Path Systems of a Cycle - Implementation and AnalysisAndrás A. Benczúr, Jörg Förster, Zoltán Király. esa 1999: 498-509 [doi]

Parity Constrained ::::k::::-Edge-Connected OrientationsAndrás Frank, Zoltán Király. ipco 1999: 191-201 [doi]

On-Line 3-Chromatic Graphs I. Triangle-Free GraphsAndrás Gyárfás, Zoltán Király, Jenö Lehel. siamdm, 12(3):385-411, 1999. [doi]

1998

On intersecting hypergraphsBarry Guiduli, Zoltán Király. DM, 182(1-3):139-151, 1998. [doi]

1997

On-line 3-chromatic graphs - II critical graphsAndrás Gyárfás, Zoltán Király, Jenö Lehel. DM, 177(1-3):99-122, 1997. [doi]

Sign in or sign up to see more results.

runs on WebDSL