Zoltán Tasnádi

According to our database1, Zoltán Tasnádi authored at least 4 papers between 2022 and 2024.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Detecting Triangle-Densest-K-Subgraphs with Simple Nature-Inspired Algorithms.
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.
Proceedings of the Machine Learning, Optimization, and Data Science, 2023

2022
An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem.
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.
Proceedings of the Bioinspired Optimization Methods and Their Applications, 2022


  Loading...