The following pages link to Zoltán Király (Q476297):
Displayed 40 items.
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- Better and simpler approximation algorithms for the stable marriage problem (Q547284) (← links)
- Induced graph packing problems (Q604669) (← links)
- Recent results on well-balanced orientations (Q955324) (← links)
- Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
- On-line 3-chromatic graphs. II: Critical graphs (Q1377872) (← links)
- On intersecting hypergraphs (Q1379831) (← links)
- On the orientation of graphs and hypergraphs (Q1410690) (← links)
- Graph orientations with edge-connection and parity constraints (Q1603262) (← links)
- On the combinatorics of projective mappings (Q1610686) (← links)
- On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs (Q1691092) (← links)
- Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
- Spanning tree with lower bound on the degrees (Q1744244) (← links)
- (Q1827781) (redirect page) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- An efficient algorithm for global path optimization in MPLS networks (Q1863861) (← links)
- Upper bounds for the necklace folding problems (Q2171014) (← links)
- Covering complete partite hypergraphs by monochromatic components (Q2404363) (← links)
- An algorithm for node-capacitated ring routing (Q2467482) (← links)
- Simultaneous well-balanced orientations of graphs (Q2498739) (← links)
- Monochromatic components in edge-colored complete uniform hypergraphs (Q2509763) (← links)
- Randomized and deterministic algorithms for network coding problems in wireless networks (Q2512826) (← links)
- (Q2857398) (← links)
- On Families of Weakly Cross-intersecting Set-pairs (Q2898454) (← links)
- (Q2935519) (← links)
- Shortest Paths in Nearly Conservative Digraphs (Q2946022) (← links)
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem (Q3541122) (← links)
- (Q4263712) (← links)
- On-Line 3-Chromatic Graphs I. Triangle-Free Graphs (Q4699166) (← links)
- On the Swap-Distances of Different Realizations of a Graphical Degree Sequence (Q4921567) (← links)
- (Q4938791) (← links)
- Optimal and heuristic network coding algorithms for multi‐layered video broadcast (Q5228506) (← links)
- Algorithms – ESA 2005 (Q5475837) (← links)
- Problems and results on 1-cross-intersecting set pair systems (Q6085875) (← links)
- How many matchings cover the nodes of a graph? (Q6201927) (← links)
- Notes on dual-critical graphs (Q6255276) (← links)
- Packing tree degree sequences (Q6285873) (← links)
- Acyclic orientations with degree constraints (Q6302789) (← links)
- The Manickam-Mikl\'os-Singhi Parameter of Graphs and Degree Sequences (Q6305530) (← links)
- Upper bounds for the necklace folding problems (Q6341427) (← links)