G. Kun

Most-cited papers

The De Casteljau Algorithm on Lie Groups and Spheres
P. Crouch, G. Kun, F. Leite
1999117 citations Open access
Semantic Scholar
Cops and robbers in a random graph
B. Bollobás, G. Kun, I. Leader
2013J. Comb. Theory B71 citations Open access
Semantic Scholar
Linear programming, width-1 CSPs, and robust satisfaction
G. Kun, R. O'Donnell, Suguru Tamaki, Yuichi Yoshida +1 more
2012Information Technology Convergence and Services71 citations Open access
Semantic Scholar
A new line of attack on the dichotomy conjecture
G. Kun, M. Szegedy
2009Symposium on the Theory of Computing53 citations Open access
Semantic Scholar
Constraints, MMSNP and expander relational structures
G. Kun
2007Combinatorica45 citations Open access
Semantic Scholar
Matchings in Benjamini-Schramm convergent graph sequences
Mikl'os Ab'ert, P. Csikvári, P. Frenkel, G. Kun
201430 citations Open access
Semantic Scholar
Stabilizability, controllability and optimal strategies of linear and nonlinear dynamical games
G. Kun, G. Jank
200029 citations
Semantic Scholar
Optimal Control of Disturbed Linear-Quadratic Differential Games
G. Jank, G. Kun
2002European Journal of Control28 citations
Semantic Scholar
Lattice Sparsification and the Approximate Closest Vector Problem
D. Dadush, G. Kun
2012Theory of Computing23 citations Open access
Semantic Scholar
Forbidden lifts (NP and CSP for combinatorialists)
G. Kun, J. Nešetřil
2007European journal of combinatorics (Print)23 citations Open access
Semantic Scholar
Order Varieties and Monotone Retractions of Finite Posets
G. Kun, C. Szabó
2001Order20 citations
Semantic Scholar
On sofic approximations of Property (T) groups
G. Kun
201615 citations
Semantic Scholar
Perfect matchings in hyperfinite graphings
Matt Bowen, G. Kun, Marcin Sabok
202113 citations
Semantic Scholar
The measurable Hall theorem fails for treeings
G. Kun
202113 citations
Semantic Scholar
NP by Means of Lifts and Shadows
G. Kun, J. Nešetřil
2007International Symposium on Mathematical Foundations of Computer Science13 citations Open access
Semantic Scholar
Nonsofic wreath products of residually finite groups
G. Kun, Andreas Thom
202611 citations
Semantic Scholar
Inapproximability of actions and Kazhdan's property (T)
G. Kun, Andreas Thom
201911 citations
Semantic Scholar
The Membership Problem in Finite Flat Hypergraph Algebras
G. Kun, Vera Vértesi
2007International journal of algebra and computation10 citations
Semantic Scholar
Solutions of generalized Riccati differential equations and their approximation
G. Jank, G. Kun
199910 citations
Semantic Scholar
Large empty convex polygons in k-convex sets
G. Kun, Gábor Lippner
2003Periodica Mathematica Hungarica9 citations
Semantic Scholar
On pattern‐avoiding permutons
Frederik Garbe, J. Hladký, G. Kun, Kristýna Pekárková
2022Random Struct. Algorithms6 citations Open access
Semantic Scholar
A Stackelberg-game approach for tracking problems of flexible robots
G. Jank, Dirk Kremer, G. Kun, J. Polzer +1 more
2001European Control Conference5 citations
Semantic Scholar
NP for Combinatorialists
G. Kun, J. Nešetřil
2007Electron. Notes Discret. Math.4 citations
Semantic Scholar
Prime values of reducible polynomials, II
Yong-Gao Chen, G. Kun, Gábor Pete, I. Ruzsa +1 more
20054 citations Open access
Semantic Scholar
A polynomial removal lemma for posets
G. Kun, Panna Timea Fekete
2023European Conference on Combinatorics, Graph Theory and Applications3 citations Open access
Semantic Scholar
The uniform Gardner conjecture and rounding Borel flows
Matt Bowen, G. Kun, Marcin Sabok
20223 citations
Semantic Scholar
Expander spanning subgraphs with large girth
I. Benjamini, Mikołaj Frączyk, G. Kun
2020Israel Journal of Mathematics3 citations Open access
Semantic Scholar
The subdirectly irreducible algebras in the variety generated by graph algebras
M. Kozik, G. Kun
20083 citations Open access
Semantic Scholar
Metric characterization of pure unrectifiability.
G. Kun, O. Maleva, András Máthé
20063 citations Open access
Semantic Scholar
On Gardner’s Conjecture
G. Kun
2021Combinatorica2 citations Open access
Semantic Scholar
Jónsson Terms and Near-Unanimity Functions in Finite Posets
G. Kun, C. Szabó
2003Order2 citations
Semantic Scholar
Posets are easily testable
Panna Tímea Fekete, G. Kun
2023European journal of combinatorics (Print)1 citations Open access
Semantic Scholar
Homomorphisms of random paths
G. Kun, Claude Tardif
2010European journal of combinatorics (Print)1 citations Open access
Semantic Scholar
Differential games on Lie groups
G. Kun
2001European Control Conference1 citations
Semantic Scholar
Unique Open Loop Nash Equilibria on the Infinite Time Horizon
G. Jank, Dirk Kremer, G. Kun
20011 citations Open access
Semantic Scholar
Riccati equations in disturbed linear quadratic differential games
G. Jank, G. Kun
1999European Control Conference1 citations
Semantic Scholar
Pattern-avoiding permutons and a removal lemma for permutations ∗
Frederik Garbe, J. Hladký, G. Kun, Kristýna Pekárková
20220 citations
Semantic Scholar
Maximum stable sets in analogs of Kneser and complete graphs
G. Kun, B. Larose
2009European journal of combinatorics (Print)0 citations Open access
Semantic Scholar
A surprising covering of the real line
G. Kun
20060 citations Open access
Semantic Scholar
Chapter 5 – Unique Open Loop Nash Equilibria on the Infinite Time Horizon
G. Jank, Dirk Kremer, G. Kun
20030 citations
Semantic Scholar
Discussion on 'Optimal Control of Disturbed Linear-Quadratic Differential Games' by G. Jank and G. Kun
H. Abou-Kandil, G. Freiling, G. Jank, G. Kun
2002European Journal of Control0 citations
Semantic Scholar