Tero Laihonen

908 total citations
72 papers, 525 citations indexed

About

Tero Laihonen is a scholar working on Computer Networks and Communications, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Tero Laihonen has authored 72 papers receiving a total of 525 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computer Networks and Communications, 40 papers in Artificial Intelligence and 30 papers in Molecular Biology. Recurrent topics in Tero Laihonen's work include Coding theory and cryptography (31 papers), graph theory and CDMA systems (29 papers) and DNA and Biological Computing (28 papers). Tero Laihonen is often cited by papers focused on Coding theory and cryptography (31 papers), graph theory and CDMA systems (29 papers) and DNA and Biological Computing (28 papers). Tero Laihonen collaborates with scholars based in Finland, France and United States. Tero Laihonen's co-authors include Iiro Honkala, Geoffrey Exoo, Simon Litsyn, Svante Janson, Cunsheng Ding, María Luz Puertas, Florent Foucaud, Julien Moncel, Sylvain Gravier and Aline Parreau and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and SIAM Journal on Computing.

In The Last Decade

Tero Laihonen

67 papers receiving 486 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Tero Laihonen Finland	14	315	267	233	210	154	72	525
Antonia Wachter-Zeh Germany	14	240 0.8×	319 1.2×	178 0.8×	118 0.6×	157 1.0×	93	503
M.U. Siddiqi Malaysia	11	178 0.6×	334 1.3×	265 1.1×	92 0.4×	44 0.3×	44	469
Vladimir Sidorenko Germany	15	356 1.1×	448 1.7×	403 1.7×	142 0.7×	42 0.3×	75	589
Fred S. Annexstein United States	8	268 0.9×	89 0.3×	146 0.6×	177 0.8×	25 0.2×	28	376
Andrej Bogdanov Hong Kong	12	199 0.6×	238 0.9×	123 0.5×	255 1.2×	20 0.1×	36	467
Xiao Guo-zhen China	11	68 0.2×	405 1.5×	171 0.7×	202 1.0×	146 0.9×	64	562
Netanel Raviv United States	11	212 0.7×	260 1.0×	67 0.3×	82 0.4×	95 0.6×	51	388
Nicolas Sendrier France	13	224 0.7×	618 2.3×	300 1.3×	152 0.7×	23 0.1×	29	659
Jaroslav Opatrný Canada	11	259 0.8×	49 0.2×	142 0.6×	139 0.7×	24 0.2×	43	368
Itzhak Tamo Israel	17	1.1k 3.4×	603 2.3×	164 0.7×	457 2.2×	83 0.5×	58	1.2k

Countries citing papers authored by Tero Laihonen

Since Specialization

Citations

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

Fields of papers citing papers by Tero Laihonen

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Tero Laihonen

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

Laihonen, Tero, et al.. (2024). On the unicyclic graphs having vertices that belong to all their (strong) metric bases. Discrete Applied Mathematics. 353. 191–207.

Laihonen, Tero, et al.. (2022). Optimal bounds on codes for location in circulant graphs. UTUPub (University of Turku). 1 indexed citations

Laihonen, Tero, et al.. (2022). On the Metric Dimensions for Sets of Vertices. SHILAP Revista de lepidopterología. 3 indexed citations

Puertas, María Luz, et al.. (2019). On Stronger Types of Locating-dominating Codes. Discrete Mathematics & Theoretical Computer Science. 21. 1 indexed citations

Gravier, Sylvain, et al.. (2014). Graphs where every k-subset of vertices is an identifying set. Discrete Mathematics & Theoretical Computer Science. Vol. 16 no. 1(Combinatorics). 2 indexed citations

Laihonen, Tero, et al.. (2013). Optimal identification of sets of edges using 2-factors. Discrete Mathematics. 313(16). 1636–1647. 1 indexed citations

Foucaud, Florent, Iiro Honkala, Tero Laihonen, Aline Parreau, & Guillem Perarnau. (2012). Locally identifying colourings for graphs with given maximum degree. Discrete Mathematics. 312(10). 1832–1837. 6 indexed citations

Exoo, Geoffrey, et al.. (2011). Locating-dominating codes in cycles.. Australas. J Comb.. 49. 177–194. 11 indexed citations

Exoo, Geoffrey, et al.. (2011). Locating–dominating codes in paths. Discrete Mathematics. 311(17). 1863–1873. 4 indexed citations

10.

Honkala, Iiro & Tero Laihonen. (2010). On Vertex-Robust Identifying Codes of Level Three.. Ars Combinatoria. 94. 1 indexed citations

11.

Laihonen, Tero, et al.. (2010). Identification in Z2 using Euclidean balls. Discrete Applied Mathematics. 159(5). 335–343. 1 indexed citations

12.

Laihonen, Tero & Julien Moncel. (2008). On graphs admitting t-ID codes.. Australas. J Comb.. 41. 81–92. 2 indexed citations

13.

Honkala, Iiro & Tero Laihonen. (2007). On identifying codes that are robust against edge changes. Information and Computation. 205(7). 1078–1095. 6 indexed citations

14.

Laihonen, Tero. (2006). On robust identification in the square and king grids. Discrete Applied Mathematics. 154(17). 2499–2510. 4 indexed citations

15.

Honkala, Iiro & Tero Laihonen. (2006). On a new class of identifying codes in graphs. Information Processing Letters. 102(2-3). 92–98. 19 indexed citations

16.

Honkala, Iiro, et al.. (2002). On strongly identifying codes. Discrete Mathematics. 254(1-3). 191–205. 32 indexed citations

17.

Laihonen, Tero. (2002). Optimal Codes for Strong Identification. European Journal of Combinatorics. 23(3). 307–313. 8 indexed citations

18.

Laihonen, Tero, et al.. (2002). Families of optimal codes for strong identification. Discrete Applied Mathematics. 121(1-3). 203–213. 13 indexed citations

19.

Honkala, Iiro, et al.. (2001). . Designs Codes and Cryptography. 24(2). 193–204. 27 indexed citations

20.

Ding, Cunsheng, et al.. (1997). Linear Multisecret-Sharing Schemes and Error-Correcting Codes.. JUCS - Journal of Universal Computer Science. 3(7 Suppl). 1023–1036. 11 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