Zoltán Király

According to our database1, Zoltán Király authored at least 35 papers between 1997 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Packing tree degree sequences.
Informatica (Slovenia), 2019

2018
Optimal and heuristic network coding algorithms for multi-layered video broadcast.
Networks, 2018

Spanning tree with lower bound on the degrees.
Discrete Applied Mathematics, 2018

How many matchings cover the nodes of a graph?
CoRR, 2018

Acyclic orientations with degree constraints.
CoRR, 2018

2017
Covering complete partite hypergraphs by monochromatic components.
Discrete Mathematics, 2017

Network Coding Algorithms for Multi-Layered Video Broadcast.
CoRR, 2017

On Ryser's Conjecture for $t$-Intersecting and Degree-Bounded Hypergraphs.
Electr. J. Comb., 2017

2016
Simpler Approximation for Stable Marriage.
Encyclopedia of Algorithms, 2016

2015
Randomized and deterministic algorithms for network coding problems in wireless networks.
Inf. Process. Lett., 2015

On the tractability of some natural packing, covering and partitioning problems.
Discrete Applied Mathematics, 2015

Survivable routing meets diversity coding.
Proceedings of the 14th IFIP Networking Conference, 2015

2014
Notes on dual-critical graphs.
CoRR, 2014

Shortest Paths in Nearly Conservative Digraphs.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence.
Combinatorics, Probability & Computing, 2013

Linear Time Local Approximation Algorithm for Maximum Stable Marriage.
Algorithms, 2013

2012
On Families of Weakly Cross-intersecting Set-pairs.
Fundam. Inform., 2012

Efficient implementations of minimum-cost flow algorithms
CoRR, 2012

Deterministic network coding algorithms and applications for wireless networks.
Proceedings of the International Symposium on Network Coding, 2012

2011
Monochromatic components in edge-colored complete uniform hypergraphs.
Electronic Notes in Discrete Mathematics, 2011

Better and Simpler Approximation Algorithms for the Stable Marriage Problem.
Algorithmica, 2011

2010
Induced Graph Packing Problems.
Graphs and Combinatorics, 2010

Local edge-connectivity augmentation in hypergraphs is NP-complete.
Discrete Applied Mathematics, 2010

2008
Recent results on well-balanced orientations.
Discrete Optimization, 2008

2007
An algorithm for node-capacitated ring routing.
Oper. Res. Lett., 2007

2006
Simultaneous well-balanced orientations of graphs.
J. Comb. Theory, Ser. B, 2006

2005
Generalized Secure Routerless Routing.
Proceedings of the Networking, 2005

2004
Packing paths of length at least two.
Discrete Mathematics, 2004

2003
On the orientation of graphs and hypergraphs.
Discrete Applied Mathematics, 2003

2002
Graph Orientations with Edge-connection and Parity Constraints.
Combinatorica, 2002

1999
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.
SIAM J. Discrete Math., 1999

Parity Constrained k-Edge-Connected Orientations.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis.
Proceedings of the Algorithms, 1999

1998
On intersecting hypergraphs.
Discrete Mathematics, 1998

1997
On-line 3-chromatic graphs - II critical graphs.
Discrete Mathematics, 1997


  Loading...