Zoltán Király

associate professor, member

Address:	Department of Computer Science
	Eötvös Loránd University
	1117 Budapest
	Pázmány Péter sétány, 1/C, 3-507
Tel:	(+36-1) 372-2500/8584
Email:	kiraly_at_cs.elte.hu
Home page:	http://www.cs.elte.hu/~kiraly
Publication list:	https://web.cs.elte.hu/~kiraly/publik.pdf

List of EGRES technical reports

The Manickam-Miklós-Singhi Parameter of Graphs and Degree Sequences (Zoltán Király, Neeraja Kulkarni, Ian McMeeking, Joshua Mundinger)
Acyclic orientations with degree constraints (Zoltán Király, Dömötör Pálvölgyi)
On some special cases of Ryser's conjecture (Zoltán Király, Lilla Tóthmérész)
Covering complete partite hypergraphs by monochromatic components (András Gyárfás, Zoltán Király)
Spanning tree with lower bound on the degrees (Zoltán Király)
A succinct tree coding for greedy navigation (Zoltán Király, Sándor Kisfaludi-Bak)
Shortest paths in mixed graphs (Zoltán Király)
Dual-Critical Graphs -- Notes on parity constrained acyclic orientations (Zoltán Király, Sándor Kisfaludi-Bak)
Network Coding Algorithms with Predetermined Coding Coefficients and Applications for Wireless Networks (Zoltán Király, Erika Renáta Bérczi-Kovács)
Recognizing graphic degree sequences and generating all realizations (Zoltán Király)
On the tractability of some natural packing, covering and partitioning problems (Attila Bernáth, Zoltán Király)
Approximation of Maximum Stable Marriage (Zoltán Király)
Monochromatic components in edge-colored complete uniform hypergraphs (Zoltán Király)
Multi-Layered Video Broadcast using Network Coding and a Distributed Connectivity Algorithm (Zoltán Király, Erika Renáta Bérczi-Kovács)
Local Edge-Connectivity Augmentation in Hypergraphs is NP-complete (Zoltán Király, Ben Cosh, Bill Jackson)
Maximum Number of Cycles and Hamiltonian Cycles in Sparse Graphs (Zoltán Király)
Better and simpler approximation algorithms for the stable marriage problem (Zoltán Király)
Lambda-supermodular functions (Zoltán Király)
Recent results on well-balanced orientations (Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti)
Algorithm for Node-Capacitated Ring Routing (András Frank, Zoltán Király, Balázs Kotnyek)
Reliable Orientations of Eulerian Graphs (Zoltán Király, Zoltán Szigeti)
An O(n²) algorithm for ring routing (Zoltán Király)
On well-balanced orientations, counter-examples for related problems (Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti)
Notes on well-balanced orientations (Zoltán Király, Zoltán Szigeti)
Generalized induced factor problems (Zoltán Király, Jácint Szabó)
C₄-free 2-factors in bipartite graphs (Zoltán Király)
On the orientation of graphs and hypergraphs (András Frank, Tamás Király, Zoltán Király)

List of EGRES quick proofs

Finding edge-disjoint subgraphs in graphs (Attila Bernáth, Zoltán Király)
Restricted t-matchings in Bipartite Graphs (Zoltán Király)

Last modification: 18.4.2024. Please email your comments to Tamás Király!