János Barát

668 total citations
42 papers, 270 citations indexed

About

János Barát is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, János Barát has authored 42 papers receiving a total of 270 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 24 papers in Discrete Mathematics and Combinatorics and 13 papers in Electrical and Electronic Engineering. Recurrent topics in János Barát's work include Advanced Graph Theory Research (28 papers), Limits and Structures in Graph Theory (17 papers) and graph theory and CDMA systems (13 papers). János Barát is often cited by papers focused on Advanced Graph Theory Research (28 papers), Limits and Structures in Graph Theory (17 papers) and graph theory and CDMA systems (13 papers). János Barát collaborates with scholars based in Hungary, Australia and United States. János Barát's co-authors include David R. Wood, Carsten Thomassen, Péter P. Varjú, Jiřı́ Matoušek, Dániel Gerbner, Gábor N. Sárközy, András Gyárfás, Leo Storme, Peter I. Hajnal and Gwenaël Joret and has published in prestigious journals such as Journal of the Association for Information Systems, Journal of Information Technology and Discrete Mathematics.

In The Last Decade

János Barát

35 papers receiving 248 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
János Barát Hungary	9	215	127	71	47	36	42	270
V. E. Alekseev Russia	9	242 1.1×	97 0.8×	52 0.7×	54 1.1×	78 2.2×	24	297
Zbigniew Lonc Poland	10	174 0.8×	89 0.7×	100 1.4×	63 1.3×	32 0.9×	57	269
H. Meyniel France	11	293 1.4×	108 0.9×	58 0.8×	88 1.9×	42 1.2×	16	343
Bert Gerards Netherlands	11	229 1.1×	80 0.6×	65 0.9×	37 0.8×	60 1.7×	19	248
Jochen Harant Germany	13	408 1.9×	151 1.2×	75 1.1×	112 2.4×	68 1.9×	62	448
Garth Isaak United States	11	216 1.0×	73 0.6×	45 0.6×	56 1.2×	43 1.2×	31	305
D. S. Malyshev Russia	10	269 1.3×	110 0.9×	84 1.2×	45 1.0×	31 0.9×	77	305
Csilla Bujtás Hungary	13	408 1.9×	186 1.5×	127 1.8×	64 1.4×	79 2.2×	72	492
Zevi Miller United States	9	184 0.9×	71 0.6×	67 0.9×	89 1.9×	63 1.8×	29	261
Phyllis Zweig Chinn United States	4	227 1.1×	35 0.3×	59 0.8×	58 1.2×	91 2.5×	11	286

Countries citing papers authored by János Barát

Since Specialization

Citations

This map shows the geographic impact of János Barát's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by János Barát with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites János Barát more than expected).

Fields of papers citing papers by János Barát

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by János Barát. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by János Barát. The network helps show where János Barát may publish in the future.

Co-authorship network of co-authors of János Barát

This figure shows the co-authorship network connecting the top 25 collaborators of János Barát. A scholar is included among the top collaborators of János Barát based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with János Barát. János Barát is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Barát, János, et al.. (2024). Improved upper bound on the Frank number of 3-edge-connected graphs. European Journal of Combinatorics. 118. 103913–103913.

Barát, János, András Gyárfás, & Gézá Tóth. (2023). Monochromatic spanning trees and matchings in ordered complete graphs. Journal of Graph Theory. 105(4). 523–541. 2 indexed citations

Barát, János. (2022). Extremal $$K_4$$-minor-free graphs without short cycles. Periodica Mathematica Hungarica. 86(1). 108–114.

Barát, János. (2019). Decomposition of cubic graphs related to Wegner’s conjecture. Discrete Mathematics. 342(5). 1520–1527.

Barát, János & Gézá Tóth. (2018). Improvements on the density of maximal 1-planar graphs. ELTE Digital Institutional Repository (EDIT) (Eötvös Loránd University). 4 indexed citations

Barát, János, András Gyárfás, Jenő Lehel, & Gábor N. Sárközy. (2016). Ramsey number of paths and connected matchings in Ore-type host graphs. Discrete Mathematics. 339(6). 1690–1698.

Barát, János, András Gyárfás, & Gábor N. Sárközy. (2016). Rainbow matchings in bipartite multigraphs. Periodica Mathematica Hungarica. 74(1). 108–111. 8 indexed citations

Barát, János & Ian M. Wanless. (2014). Rainbow matchings and transversals. Repository of the Academy's Library (Library of the Hungarian Academy of Sciences). 59(1). 211–217. 4 indexed citations

Barát, János, Gwenaël Joret, & David R. Wood. (2011). Disproof of the List Hadwiger Conjecture. arXiv (Cornell University). 10 indexed citations

10.

Barát, János & Matthias Kriesell. (2010). What is on his mind?. Discrete Mathematics. 310(20). 2573–2583. 6 indexed citations

11.

Barát, János, et al.. (2010). Elementary proof techniques for the maximum number of islands. European Journal of Combinatorics. 32(2). 276–281. 8 indexed citations

12.

Barát, János & Gézá Tóth. (2010). Towards the Albertson Conjecture. The Electronic Journal of Combinatorics. 17(1). 1 indexed citations

13.

Barát, János & Miloš Stojaković. (2010). On Winning Fast in Avoider-Enforcer Games. The Electronic Journal of Combinatorics. 17(1).

14.

Barát, János & Péter P. Varjú. (2008). On square-free edge colorings of graphs. Ars Combinatoria. 87. 377–383. 4 indexed citations

15.

Barát, János & Péter P. Varjú. (2008). A contribution to infinite disjoint covering systems. Journal de Théorie des Nombres de Bordeaux. 17(1). 51–55.

16.

Barát, János, et al.. (2006). A contribution to queens graphs: A substitution method. Discrete Mathematics. 306(12). 1105–1114. 2 indexed citations

17.

Barát, János, Jiřı́ Matoušek, & David R. Wood. (2006). Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. The Electronic Journal of Combinatorics. 13(1). 27 indexed citations

18.

Barát, János, Stefano Marcugini, Fernanda Pambianco, & Tamás Szőnyi. (2005). Note on disjoint blocking sets in Galois planes. Journal of Combinatorial Designs. 14(2). 149–158. 4 indexed citations

19.

Barát, János, Yves Edel, Rachel C. Hill, & Leo Storme. (2004). On complete caps in the projective geometries over F_3. II: New improvements. Journal of Combinatorial Mathematics and Combinatorial Computing. 49. 9–31. 5 indexed citations

20.

Barát, János. (1992). Scenario Playing for Critical Success Factor Analysis. Journal of the Association for Information Systems. 7(1). 12–19. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact