Login
 Forum
 
 
Personal data sheet
 Print preview
personal data approved: 2016. III. 10.
Personal data
name János Barát
year of birth 1973
name of institution
doctoral school
PE Doctoral School of Information Science and Technology (Academic staff member)
accreditation statement submitted to: University of Szeged
Contact details
E-mail address baratmath.u-szeged.hu
phone number +36 1 372-2500/8046
mobile phone number +36 30 224-6662
own web page
Academic title
scientific degree, title Ph.D.
year degree was obtained 2001
discipline to which degree belongs mathematics and computing
institution granting the degree Szegedi Tudományegyetem (to be translated)
Employment
2013 - MTA-ELTE Geometric and Algebraic Combinatorics Research Group (research institute, not university)
other (not specified) (tudományos főmunkatárs)
Thesis topic supervisor
number of doctoral students supervised until now 0
number of students who fulfilled course requirements 0
students who obtained their degrees:
  Thesis topic proposals
Research
research area Combinatorics
research field in which current research is conducted mathematics and computing
Publications
2014

J Barát, D Gerbner: Edge-decomposition of Graphs into Copies of a Tree with Four Edges, ELECTRONIC JOURNAL OF COMBINATORICS 21: (1) pp. 1-11.
type of document: Journal paper/Article
impact factor: 0.532**
language: English
2013

Barát J, Czap J: Facial Nonrepetitive Vertex Coloring of Plane Graphs, JOURNAL OF GRAPH THEORY 74: (1)
type of document: Journal paper/Article
number of independent citations: 5
language: English
Full text 
2012

Barát J, Hajnal P, Lin Y, Yang A: On the structure of graphs with path-width at most two, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA 49: (2)
type of document: Journal paper/Article
number of independent citations: 3
language: English
URL 
2012

Barát J, Füredi Z, I Kantor, Y Kim, Patkós B: Large B_d-free and union-free subfamilies, SIAM JOURNAL ON DISCRETE MATHEMATICS 26: (1)
type of document: Journal paper/Article
number of independent citations: 1
language: English
DOI 
2012

Barát J, IM Wanless : A Cube Dismantling Problem Related to Bootstrap Percolation, JOURNAL OF STATISTICAL PHYSICS 149: (4)
type of document: Journal paper/Article
language: English
DOI 
2011

Barát J, Joret G, Wood DR: Disproof of the List Hadwiger Conjecture, ELECTRONIC JOURNAL OF COMBINATORICS 18: (1) 7 p. Paper P232.
type of document: Journal paper/Article
number of independent citations: 4
language: English
Full text 
2006

Barát J, Matousek J, Wood DR: Bounded-degree graphs have arbitrarily large geometric thickness, ELECTRONIC JOURNAL OF COMBINATORICS 13: (1) 13 p. Paper R3.
type of document: Journal paper/Article
number of independent citations: 22
language: English
2006

Barát J, Thomassen C: Claw-decompositions and Tutte-orientations, JOURNAL OF GRAPH THEORY 52: (2)
type of document: Journal paper/Article
number of independent citations: 17
language: English
DOI 
2006

Barát J: Directed path-width and monotonicity in digraph searching, GRAPHS AND COMBINATORICS 22: (2)
type of document: Journal paper/Article
number of independent citations: 56
language: English
DOI 
2006

Ambrus G, Barát J, Hajnal P: The slope parameter of graphs, ACTA SCIENTIARUM MATHEMATICARUM - SZEGED 72:
type of document: Journal paper/Article
number of independent citations: 7
language: English
Number of independent citations to these publications:115 
Scientometric data
list of publications and citations
number of scientific publications that meet accreditation criteria:
41
number of scientific publications:
42
monographs and professional books:
0
monographs/books in which chapters/sections were contributed:
0 
scientific publications published abroad that meet the accreditation criteria:
32
publications not in Hungarian, published in Hungary, meeting the accreditation criteria:
7
number of independent citations to scientific publications and creative works:
211

 
All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 1.2318 ( 2016. XI. 26. )