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.
János Barát
2010 – today
- 2012
[j17]János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós: Large Bd-Free and Union-free Subfamilies. SIAM J. Discrete Math. 26(1): 71-76 (2012)
[i2]János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood: Empty pentagons in point sets with collinearities. CoRR abs/1207.3633 (2012)- 2011
[j16]János Barát, Gwenaël Joret, David R. Wood: Disproof of the List Hadwiger Conjecture. Electr. J. Comb. 18(1) (2011)
[j15]János Barát, Péter Hajnal, Eszter K. Horváth: Elementary proof techniques for the maximum number of islands. Eur. J. Comb. 32(2): 276-281 (2011)
[j14]János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós: Large Bd-free and union-free subfamilies. Electronic Notes in Discrete Mathematics 38: 101-104 (2011)
[i1]János Barát, Gwenaël Joret, David R. Wood: Disproof of the List Hadwiger Conjecture. CoRR abs/1110.2272 (2011)- 2010
[j13]János Barát, Milos Stojakovic: On Winning Fast in Avoider-Enforcer Games. Electr. J. Comb. 17(1) (2010)
[j12]
[j11]
2000 – 2009
- 2008
[j10]
[j9]- 2006
[j8]János Barát, Jirí Matousek, David R. Wood: Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electr. J. Comb. 13(1) (2006)
[j7]G. Ambrus, János Barát: A contribution to queens graphs: A substitution method. Discrete Mathematics 306(12): 1105-1114 (2006)
[j6]János Barát: Directed Path-width and Monotonicity in Digraph Searching. Graphs and Combinatorics 22(2): 161-172 (2006)
[j5]János Barát, Carsten Thomassen: Claw-decompositions and tutte-orientations. Journal of Graph Theory 52(2): 135-146 (2006)- 2004
[j4]János Barát, Alberto Del Fra, Stefano Innamorati, Leo Storme: Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8). Des. Codes Cryptography 31(1): 15-26 (2004)
[j3]János Barát, Leo Storme: Multiple Blocking Sets in PG(n, q), n>3. Des. Codes Cryptography 33(1): 5-21 (2004)- 2001
[j2]
[j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 22:19 CET by the dblp team



