Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gábor Kun
2010 – today
- 2013
[j10]Béla Bollobás, Gábor Kun, Imre Leader: Cops and robbers in a random graph. J. Comb. Theory, Ser. B 103(2): 226-236 (2013)
[c4]Daniel Dadush, Gábor Kun: Lattice Sparsification and the Approximate Closest Vector Problem. SODA 2013: 1088-1102- 2012
[c3]Gábor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou: Linear programming, width-1 CSPs, and robust satisfaction. ITCS 2012: 484-495
[i3]Daniel Dadush, Gábor Kun: Lattice Sparsification and the Approximate Closest Vector Problem. CoRR abs/1212.6781 (2012)- 2010
[j9]
2000 – 2009
- 2009
[j8]Gábor Kun, Benoit Larose: Maximum stable sets in analogs of Kneser and complete graphs. Eur. J. Comb. 30(1): 17-29 (2009)
[c2]
[i2]Gábor Kun, Mario Szegedy: A NEW LINE OF ATTACK ON THE DICHOTOMY CONJECTURE. Electronic Colloquium on Computational Complexity (ECCC) 16: 59 (2009)- 2008
[j7]Gábor Kun, Jaroslav Nesetril: Forbidden lifts (NP and CSP for combinatorialists). Eur. J. Comb. 29(4): 930-945 (2008)- 2007
[j6]Gábor Kun, Jaroslav Nesetril: NP for Combinatorialists. Electronic Notes in Discrete Mathematics 29: 373-381 (2007)
[j5]Gábor Kun, Vera Vértesi: The Membership Problem in Finite Flat Hypergraph Algebras. IJAC 17(3): 449-459 (2007)
[c1]
[i1]- 2003
[j4]Gábor Kun, Csaba Szabó: Jónsson Terms and Near-Unanimity Functions in Finite Posets. Order 20(4): 291-298 (2003)
[j3]Gábor Kun, Gábor Lippner: Large empty convex polygons in k-convex sets. Periodica Mathematica Hungarica 46(1): 81-88 (2003)- 2002
[j2]Gerhard Jank, Gábor Kun: Optimal Control of Disturbed Linear-Quadratic Differential Games. Eur. J. Control 8(2): 152-162 (2002)- 2001
[j1]Gábor Kun, Csaba Szabó: Order Varieties and Monotone Retractions of Finite Posets. Order 18(1): 79-88 (2001)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-15 21:55 CEST by the dblp team



