Riccati equations in disturbed linear quadratic differential games. - Gerhard Jank; Gábor Kun (ECC, 1999)

A Stackelberg-game approach for tracking problems of flexible robots. - Gerhard Jank; Dirk Kremer; Gábor Kun; Jan Polzer; T. Scholt (ECC, 2001)

Differential games on Lie groups. - Gábor Kun (ECC, 2001)

Order Varieties and Monotone Retractions of Finite Posets. - Gábor Kun; Csaba Szabó (Order, 2001)

Optimal Control of Disturbed Linear-Quadratic Differential Games. - Gerhard Jank; Gábor Kun (Eur. J. Control, 2002)

Jónsson Terms and Near-Unanimity Functions in Finite Posets. - Gábor Kun; Csaba Szabó (Order, 2003)

Large empty convex polygons in k-convex sets. - Gábor Kun; Gábor Lippner (Period. Math. Hung., 2003)

NP by Means of Lifts and Shadows. - Gábor Kun; Jaroslav Nesetril (MFCS, 2007)

NP for Combinatorialists. - Gábor Kun; Jaroslav Nesetril (Electron. Notes Discret. Math., 2007)

The Membership Problem in Finite Flat Hypergraph Algebras. - Gábor Kun; Vera Vértesi (Int. J. Algebra Comput., 2007)

Forbidden lifts (NP and CSP for combinatorialists). - Gábor Kun; Jaroslav Nesetril (Eur. J. Comb., 2008)

A NEW LINE OF ATTACK ON THE DICHOTOMY CONJECTURE. - Gábor Kun; Mario Szegedy (Electron. Colloquium Comput. Complex., 2009)

Maximum stable sets in analogs of Kneser and complete graphs. - Gábor Kun; Benoît Larose (Eur. J. Comb., 2009)

Homomorphisms of random paths. - Gábor Kun; Claude Tardif (Eur. J. Comb., 2010)

Linear programming, width-1 CSPs, and robust satisfaction. - Gábor Kun; Ryan O'Donnell; Suguru Tamaki; Yuichi Yoshida; Yuan Zhou 007 (ITCS, 2012)

Constraints, MMSNP and expander relational structures. - Gábor Kun (Comb., 2013)

Cops and robbers in a random graph. - Béla Bollobás; Gábor Kun; Imre Leader (J. Comb. Theory B, 2013)

Lattice Sparsification and the Approximate Closest Vector Problem. - Daniel Dadush; Gábor Kun (Theory Comput., 2016)

On Gardner's Conjecture. - Gábor Kun (Comb., 2022)

Easy testability for posets. - Panna Tímea Fekete; Gábor Kun (CoRR, 2023)

On pattern-avoiding permutons. - Frederik Garbe; Jan Hladký; Gábor Kun; Kristýna Pekárková (Random Struct. Algorithms, 2024)

Posets are easily testable. - Panna Tímea Fekete; Gábor Kun (Eur. J. Comb., 2025)

Dichotomy for orderings? - Gábor Kun; Jaroslav Nesetril (CoRR, 2025)