Bernard Lidický

1.0k citations
83 papers · 559 · h-index 12

Impact in

Papers in

Bernard Lidický

76 papers receiving 529 citations

Peers

Bernard Lidický
Comparison fields: 5 of 51
  • Discrete Mathematics and Combinatorics 300
  • Computer Graphics and Computer-Aided Design 107
  • Computational Theory and Mathematics 467
  • Geometry and Topology 159
  • Computer Networks and Communications 52
Replace János Barát with:
János Barát Hungary
Henri Meyniel France
Paul Wollan Italy
Martin Kochol Slovakia
V. Neumann‐Lara Mexico
Luis Goddyn Canada
Jochen Harant Germany
Florian Pfender United States
Ko‐Wei Lih Taiwan
Kenta Ozeki Japan
Bernard Lidický relative to János Barát Hungary János Barát's profile →
Citations per field
00.5×2×4×5.6×
János Barát · 1×
Citations per year

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-authors

The 25 scholars most cited alongside Bernard Lidický, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Bernard Lidický Line = papers co-authored together Bernard Lidický links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 83 papers — load more, or switch the sort, to bring in the rest.

#Work
1 200843
2 201332
3 201330
4 201527
5 201125
6 201223
7 201020
8 201419
9 200916
10 201115
11 201713
12 201013
13 201411
14 201610
15 201010
16 201110
17 20099
18 20139
19 20099
20 20159

About Bernard Lidický

Bernard Lidický is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Computer Networks and Communications, having authored 83 papers that have together received 559 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (60 papers), Limits and Structures in Graph Theory (39 papers), Computational Geometry and Mesh Generation (22 papers), graph theory and CDMA systems (20 papers), Graph Labeling and Dimension Problems (18 papers), Graph theory and applications (12 papers), Optimization and Search Problems (9 papers) and Digital Image Processing Techniques (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (300 citations), Computer Graphics and Computer-Aided Design (107 citations), Computational Theory and Mathematics (467 citations), Geometry and Topology (159 citations) and Computer Networks and Communications (52 citations). Bernard Lidický has collaborated with scholars based in United States, Czechia and United Kingdom. Frequent co-authors include Zdenĕk Dvořák, József Balogh, Florian Pfender, Riste Škrekovski, Jiřı́ Fiala, Ping Hu, Sandi Klavžar, Hong Liu, Cory Palmer and Jan Kratochvı́l. Their work appears in journals such as European Journal of Combinatorics, SIAM Journal on Discrete Mathematics, Journal of Graph Theory, Discrete Applied Mathematics and Discrete Mathematics.

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