CUFinder

Ioana Zelina

About Ioana Zelina

Ioana Zelina, With an exceptional h-index of 10 and a recent h-index of 8 (since 2020), a distinguished researcher at Universitatea Technica din Cluj-Napoca, specializes in the field of informatica.

His recent articles reflect a diverse array of research interests and contributions to the field:

Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem

A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code

A comparative study of the most important methods for forecasting the ICT systems vulnerabilities

An effective genetic algorithm for solving the clustered shortest-path tree problem

Admissible perturbation of demicontractive operators within ant algorithms for medical images edge detection

A novel genetic algorithm for solving the clustered shortest-path tree problem

New ant colony optimization algorithm in medical images edge detection

An efficient soft computing approach for solving the two-stage transportation problem with fixed costs

Ioana Zelina Information

University

Position

___

Citations(all)

310

Citations(since 2020)

168

Cited By

198

hIndex(all)

10

hIndex(since 2020)

8

i10Index(all)

10

i10Index(since 2020)

5

Email

University Profile Page

Google Scholar

Ioana Zelina Skills & Research Interests

informatica

Top articles of Ioana Zelina

Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem

Expert Systems with Applications

2023/4/1

Adrian Petrovan
Adrian Petrovan

H-Index: 5

Cosmin Sabo
Cosmin Sabo

H-Index: 6

Ioana Zelina
Ioana Zelina

H-Index: 5

A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code

2022/9/5

Adrian Petrovan
Adrian Petrovan

H-Index: 5

Cosmin Sabo
Cosmin Sabo

H-Index: 6

Ioana Zelina
Ioana Zelina

H-Index: 5

A comparative study of the most important methods for forecasting the ICT systems vulnerabilities

2021/9/22

Ovidiu Cosma
Ovidiu Cosma

H-Index: 5

Cosmin Sabo
Cosmin Sabo

H-Index: 6

Ioana Zelina
Ioana Zelina

H-Index: 5

An effective genetic algorithm for solving the clustered shortest-path tree problem

IEEE Access

2021/1/21

Ovidiu Cosma
Ovidiu Cosma

H-Index: 5

Ioana Zelina
Ioana Zelina

H-Index: 5

Admissible perturbation of demicontractive operators within ant algorithms for medical images edge detection

Mathematics

2020/6/26

Ioana Zelina
Ioana Zelina

H-Index: 5

A novel genetic algorithm for solving the clustered shortest-path tree problem

Carpathian Journal of Mathematics

2020/1/1

Ovidiu Cosma
Ovidiu Cosma

H-Index: 5

Ioana Zelina
Ioana Zelina

H-Index: 5

New ant colony optimization algorithm in medical images edge detection

Creat. Math. Inf

2020

Ioana Zelina
Ioana Zelina

H-Index: 5

An efficient soft computing approach for solving the two-stage transportation problem with fixed costs

2020

Ovidiu Cosma
Ovidiu Cosma

H-Index: 5

Petrica Pop
Petrica Pop

H-Index: 17

Ioana Zelina
Ioana Zelina

H-Index: 5

See List of Professors in Ioana Zelina University(Universitatea Technica din Cluj-Napoca)