default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Kun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Panna Tímea Fekete, Gábor Kun:
Easy testability for posets. CoRR abs/2302.11390 (2023)- 2022
- [j14]Gábor Kun:
On Gardner's Conjecture. Comb. 42(4): 553-558 (2022)
2010 – 2019
- 2016
- [j13]Gábor Kun, Mario Szegedy:
A new line of attack on the dichotomy conjecture. Eur. J. Comb. 52: 338-367 (2016) - [j12]Daniel Dadush, Gábor Kun:
Lattice Sparsification and the Approximate Closest Vector Problem. Theory Comput. 12(1): 1-34 (2016) - 2013
- [j11]Gábor Kun:
Constraints, MMSNP and expander relational structures. Comb. 33(3): 335-347 (2013) - [j10]Béla Bollobás, Gábor Kun, Imre Leader:
Cops and robbers in a random graph. J. Comb. Theory B 103(2): 226-236 (2013) - [c7]Daniel Dadush
, Gábor Kun:
Lattice Sparsification and the Approximate Closest Vector Problem. SODA 2013: 1088-1102 - 2012
- [c6]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]Gábor Kun, Claude Tardif:
Homomorphisms of random paths. Eur. J. Comb. 31(3): 688-693 (2010)
2000 – 2009
- 2009
- [j8]Gábor Kun, Benoît Larose:
Maximum stable sets in analogs of Kneser and complete graphs. Eur. J. Comb. 30(1): 17-29 (2009) - [c5]Gábor Kun, Mario Szegedy:
A new line of attack on the dichotomy conjecture. STOC 2009: 725-734 - [i2]Gábor Kun, Mario Szegedy:
A NEW LINE OF ATTACK ON THE DICHOTOMY CONJECTURE. Electron. Colloquium Comput. Complex. TR09 (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. Electron. Notes Discret. Math. 29: 373-381 (2007) - [j5]Gábor Kun, Vera Vértesi:
The Membership Problem in Finite Flat Hypergraph Algebras. Int. J. Algebra Comput. 17(3): 449-459 (2007) - [c4]Gábor Kun, Jaroslav Nesetril:
NP by Means of Lifts and Shadows. MFCS 2007: 171-181 - [i1]Gábor Kun, Jaroslav Nesetril:
NP by means of lifts and shadows. CoRR abs/0706.3459 (2007) - 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. Period. Math. Hung. 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) - [c3]Gábor Kun:
Differential games on Lie groups. ECC 2001: 7-12 - [c2]Gerhard Jank, Dirk Kremer, Gábor Kun, Jan Polzer, T. Scholt:
A Stackelberg-game approach for tracking problems of flexible robots. ECC 2001: 214-219
1990 – 1999
- 1999
- [c1]Gerhard Jank, Gábor Kun:
Riccati equations in disturbed linear quadratic differential games. ECC 1999: 3493-3498
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
