Luděk Kučera

715 total citations
35 papers, 303 citations indexed

About

Luděk Kučera is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Luděk Kučera has authored 35 papers receiving a total of 303 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computer Networks and Communications, 8 papers in Computational Theory and Mathematics and 4 papers in Artificial Intelligence. Recurrent topics in Luděk Kučera's work include Advanced Graph Theory Research (5 papers), Graph Labeling and Dimension Problems (4 papers) and Scheduling and Timetabling Solutions (3 papers). Luděk Kučera is often cited by papers focused on Advanced Graph Theory Research (5 papers), Graph Labeling and Dimension Problems (4 papers) and Scheduling and Timetabling Solutions (3 papers). Luděk Kučera collaborates with scholars based in Czechia, United States and Germany. Luděk Kučera's co-authors include Alberto Marchetti-Spaccamela, Zoran Nikoloski, Narsingh Deo, Aleš Pultr, Jaroslav Nešetřil, Marco Protasi, Michele Flammini, Pavol Hell, Vašek Chvátal and Antonı́n Kučera and has published in prestigious journals such as SIAM Journal on Computing, IEEE Transactions on Parallel and Distributed Systems and IEEE Transactions on Mobile Computing.

In The Last Decade

Luděk Kučera

29 papers receiving 275 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Luděk Kučera Czechia	8	177	102	75	37	29	35	303
V. Arvind India	11	305 1.7×	236 2.3×	48 0.6×	20 0.5×	22 0.8×	86	398
Robert Silverman United States	12	84 0.5×	228 2.2×	65 0.9×	29 0.8×	30 1.0×	28	327
Naomi Nishimura Canada	12	300 1.7×	79 0.8×	180 2.4×	31 0.8×	23 0.8×	34	385
Bohdan S. Majewski Australia	6	64 0.4×	152 1.5×	87 1.2×	14 0.4×	18 0.6×	7	246
David Gillman United States	8	62 0.4×	105 1.0×	67 0.9×	15 0.4×	28 1.0×	12	244
Jonathan F. Buss Canada	8	215 1.2×	96 0.9×	98 1.3×	48 1.3×	16 0.6×	20	314
Rossella Petreschi Italy	11	264 1.5×	33 0.3×	76 1.0×	33 0.9×	53 1.8×	40	332
Krzysztof Diks Poland	11	139 0.8×	83 0.8×	229 3.1×	6 0.2×	10 0.3×	37	347
Virginia Vassilevska United States	8	120 0.7×	46 0.5×	78 1.0×	5 0.1×	15 0.5×	13	186
George Purdy United States	9	56 0.3×	84 0.8×	49 0.7×	49 1.3×	41 1.4×	39	285

Countries citing papers authored by Luděk Kučera

Since Specialization

Citations

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

Fields of papers citing papers by Luděk Kučera

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luděk Kučera. 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 Luděk Kučera. The network helps show where Luděk Kučera may publish in the future.

Co-authorship network of co-authors of Luděk Kučera

This figure shows the co-authorship network connecting the top 25 collaborators of Luděk Kučera. A scholar is included among the top collaborators of Luděk Kučera 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 Luděk Kučera. Luděk Kučera 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

Kučera, Luděk & Antonı́n Kučera. (2007). Mathematical foundations of computer science 2007 : 32nd International Symposium, MFCS 2007 Český Krumlov, Czech Republic, August 26-31, 2007 : proceedings. Springer eBooks. 1 indexed citations

Nikoloski, Zoran, Narsingh Deo, & Luděk Kučera. (2007). Distributed Detection And Optimal Traffic-Blocking Of Network Worms. Zenodo (CERN European Organization for Nuclear Research). 1(10). 3271–3277.

Nikoloski, Zoran, Narsingh Deo, & Luděk Kučera. (2006). Correlation Model of Worm Propagation on Scale-Free Networks. Journal of International Crisis and Risk Communication Research. 3(1-3). 169–182. 5 indexed citations

Nikoloski, Zoran, Narsingh Deo, & Luděk Kučera. (2005). Degree-correlation of a Scale-free Random Graph Process. 9 indexed citations

Nikoloski, Zoran, Narsingh Deo, & Luděk Kučera. (2005). Degree-correlation of Scale-free graphs. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AE,...(Proceedings). 4 indexed citations

Kučera, Luděk. (2002). Graph-theoretic concepts in computer science : 28th International Workshop, WG 2002, Ceský Krumlov, Czech Republic, June 13-15, 2002 : revised papers. Springer eBooks. 1 indexed citations

Kučera, Luděk. (2002). Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science. 2 indexed citations

Kučera, Luděk. (1995). Expected complexity of graph partitioning problems. Discrete Applied Mathematics. 57(2-3). 193–212. 78 indexed citations

Kučera, Luděk, Alberto Marchetti-Spaccamela, & Marco Protasi. (1994). On Learning Monotone DNF Formulae under Uniform Distributions. Information and Computation. 110(1). 84–95. 13 indexed citations

10.

Roli, Andrea, et al.. (1994). A Note on Parallel Randomized Algorithms for Searching Porblems.. 33–43.

11.

Kučera, Luděk. (1993). Broadcasting through a noisy one-dimensional network. Max Planck Digital Library. 3 indexed citations

12.

Calkin, Neil J., Alan Frieze, & Luděk Kučera. (1992). On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph. Random Structures and Algorithms. 3(2). 215–221. 2 indexed citations

13.

Kučera, Luděk. (1987). Canonical labeling of regular graphs in linear average time. 271–279. 14 indexed citations

14.

Kučera, Luděk. (1982). On the monoids of homomorphisms of semigroups with unity. Commentationes Mathematicae Universitatis Carolinae. 23(2). 369–381. 2 indexed citations

15.

Kučera, Luděk. (1982). Parallel computation and conflicts in memory access. Information Processing Letters. 14(2). 93–96. 82 indexed citations

16.

Kučera, Luděk, Jaroslav Nešetřil, & Aleš Pultr. (1980). Complexity of dimension three and some related edge-covering characteristics of graphs. Theoretical Computer Science. 11(1). 93–106. 4 indexed citations

17.

Kučera, Luděk & Aleš Pultr. (1973). Non-algebraic concrete categories. Journal of Pure and Applied Algebra. 3(1). 95–102. 5 indexed citations

18.

Kučera, Luděk & Aleš Pultr. (1972). On a mechanism of choosing morphisms in concrete categories. Czech digital mathematics library. 13(4). 263–265. 3 indexed citations

19.

Kučera, Luděk. (1971). Every category is a factorization of a concrete one. Journal of Pure and Applied Algebra. 1(4). 373–376. 7 indexed citations

20.

Chvátal, Vašek, Pavol Hell, Luděk Kučera, & Jaroslav Nešetřil. (1971). Every finite graph is a full subgraph of a rigid graph. Journal of Combinatorial Theory Series B. 11(3). 284–286. 13 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