Zoltán Tasnádi

According to our database, Zoltán Tasnádi authored at least 6 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

An Ant Colony Optimization Approach for Safest Path Pair Computation Under Correlated Failures.

Zoltán Tasnádi, Balázs Vass, Noémi Gaskó

Proceedings of the Hybrid Artificial Intelligent Systems - 20th International Conference, 2025

Ant Colony Optimization Algorithm for Safest Path Computation in Presence of Correlated Failures in Backbone Networks.

Zoltán Tasnádi, Balázs Vass, Noémi Gaskó

Proceedings of the Genetic and Evolutionary Computation Conference, 2025

2024

Detecting Triangle-Densest-K-Subgraphs with Simple Nature-Inspired Algorithms.

Zoltán Tasnádi

Proceedings of the 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2024

2023

Heaviest and Densest Subgraph Computation for Binary Classification. A Case Study.

Zoltán Tasnádi, Noémi Gaskó

Proceedings of the Machine Learning, Optimization, and Data Science, 2023

2022

An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem.

Zoltán Tasnádi, Noémi Gaskó

Proceedings of the 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2022

A New Type of Anomaly Detection Problem in Dynamic Graphs: An Ant Colony Optimization Approach.

Zoltán Tasnádi, Noémi Gaskó

Proceedings of the Bioinspired Optimization Methods and Their Applications, 2022