Bernard Lidický

914 total citations
60 papers, 370 citations indexed

About

Bernard Lidický is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Bernard Lidický has authored 60 papers receiving a total of 370 indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computational Theory and Mathematics, 30 papers in Discrete Mathematics and Combinatorics and 16 papers in Electrical and Electronic Engineering. Recurrent topics in Bernard Lidický's work include Advanced Graph Theory Research (42 papers), Limits and Structures in Graph Theory (29 papers) and graph theory and CDMA systems (16 papers). Bernard Lidický is often cited by papers focused on Advanced Graph Theory Research (42 papers), Limits and Structures in Graph Theory (29 papers) and graph theory and CDMA systems (16 papers). Bernard Lidický collaborates with scholars based in United States, Czechia and United Kingdom. Bernard Lidický's co-authors include Riste Škrekovski, Jiřı́ Fiala, Zdenĕk Dvořák, József Balogh, Florian Pfender, Ping Hu, Sandi Klavžar, Cory Palmer, Hong Liu and Hong Liu and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Bernard Lidický

57 papers receiving 345 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Bernard Lidický United States	10	306	202	113	67	46	60	370
Jianliang Wu China	12	473 1.5×	134 0.7×	114 1.0×	105 1.6×	73 1.6×	80	538
Tomáš Kaiser Czechia	12	348 1.1×	194 1.0×	109 1.0×	73 1.1×	41 0.9×	60	404
Kenta Ozeki Japan	10	492 1.6×	318 1.6×	246 2.2×	77 1.1×	58 1.3×	97	528
Jochen Harant Germany	13	408 1.3×	151 0.7×	112 1.0×	75 1.1×	64 1.4×	62	448
Luis Goddyn Canada	11	286 0.9×	171 0.8×	62 0.5×	113 1.7×	33 0.7×	30	372
Paul Wollan Italy	13	445 1.5×	220 1.1×	89 0.8×	49 0.7×	44 1.0×	34	484
Stanley Fiorini United Kingdom	8	280 0.9×	125 0.6×	131 1.2×	77 1.1×	26 0.6×	26	329
Peter Che Bor Lam Hong Kong	14	370 1.2×	90 0.4×	179 1.6×	118 1.8×	29 0.6×	42	453
Iztok Peterin Slovenia	11	359 1.2×	123 0.6×	134 1.2×	66 1.0×	12 0.3×	71	408
André Kündgen United States	10	292 1.0×	199 1.0×	80 0.7×	77 1.1×	23 0.5×	30	329

Countries citing papers authored by Bernard Lidický

Since Specialization

Citations

This map shows the geographic impact of Bernard Lidický'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 Bernard Lidický with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bernard Lidický more than expected).

Fields of papers citing papers by Bernard Lidický

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bernard Lidický. 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 Bernard Lidický. The network helps show where Bernard Lidický may publish in the future.

Co-authorship network of co-authors of Bernard Lidický

This figure shows the co-authorship network connecting the top 25 collaborators of Bernard Lidický. A scholar is included among the top collaborators of Bernard Lidický 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 Bernard Lidický. Bernard Lidický 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

Balogh, József, et al.. (2023). The Spectrum of Triangle-Free Graphs. SIAM Journal on Discrete Mathematics. 37(2). 1173–1179. 1 indexed citations

Balogh, József, et al.. (2023). Nearly All 𝑘-SAT Functions Are Unate. 958–962. 1 indexed citations

Lidický, Bernard, et al.. (2020). Inducibility of directed paths. Discrete Mathematics. 343(10). 112015–112015. 8 indexed citations

Lidický, Bernard, et al.. (2019). Facial unique-maximum colorings of plane graphs with restriction on big vertices. Discrete Mathematics. 342(9). 2612–2617. 2 indexed citations

Lidický, Bernard & Florian Pfender. (2018). Pentagons in triangle-free graphs. European Journal of Combinatorics. 74. 85–89. 5 indexed citations

Kynčl, Jan, et al.. (2017). Irreversible 2-conversion set in graphs of bounded degree. Discrete Mathematics & Theoretical Computer Science. Vol. 19 no. 3(Graph Theory). 4 indexed citations

Lidický, Bernard, et al.. (2017). 3-coloring triangle-free planar graphs with a precolored 9-cycle. European Journal of Combinatorics. 68. 38–65.

Ferrara, Michael, et al.. (2016). Ore and Chv\'atal-type Degree Conditions for Bootstrap Percolation from Small Sets. arXiv (Cornell University). 1 indexed citations

Balogh, József, Ping Hu, Bernard Lidický, & Florian Pfender. (2015). Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle. European Journal of Combinatorics. 52. 47–58. 16 indexed citations

10.

Kierstead, H. A. & Bernard Lidický. (2015). On choosability with separation of planar graphs with lists of different sizes. Discrete Mathematics. 338(10). 1779–1783. 2 indexed citations

11.

Balogh, József, et al.. (2014). Rainbow copies of C4 in edge-colored hypercubes. Discrete Applied Mathematics. 210. 35–37. 1 indexed citations

12.

Borodin, O. V., et al.. (2014). Planar 4-critical graphs with four triangles. European Journal of Combinatorics. 41. 138–151. 4 indexed citations

13.

Borodin, O. V., et al.. (2013). Short proofs of coloring theorems on planar graphs. European Journal of Combinatorics. 36. 314–321. 6 indexed citations

14.

Balogh, József, Ping Hu, Bernard Lidický, & Hong Liu. (2013). Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. European Journal of Combinatorics. 35. 75–85. 23 indexed citations

15.

Lidický, Bernard, et al.. (2011). Packing chromatic number of distance graphs. Discrete Applied Mathematics. 160(4-5). 518–524. 14 indexed citations

16.

Dvořák, Zdenĕk, Bernard Lidický, & Riste Škrekovski. (2011). Randić index and the diameter of a graph. European Journal of Combinatorics. 32(3). 434–442. 27 indexed citations

17.

Lidický, Bernard, et al.. (2010). COUPLING BUILDING SIMULATION WITH A HARDWARE REALTIME CONTROLLER. Zenodo (CERN European Organization for Nuclear Research). 1 indexed citations

18.

Lidický, Bernard. (2009). On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles.. The Australasian Journal of Combinatorics. 44. 77–86. 5 indexed citations

19.

Dvořák, Zdenĕk, Bernard Lidický, & Riste Škrekovski. (2009). Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discrete Mathematics. 309(20). 5899–5904. 6 indexed citations

20.

Fiala, Jiřı́, Sandi Klavžar, & Bernard Lidický. (2008). The packing chromatic number of infinite product graphs. European Journal of Combinatorics. 30(5). 1101–1113. 39 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