Get started
Author

Ali Baran Taşdemir

Observed name: Ali Baran Tasdemir
Observed institution: Hacettepe University
ORCID: 0000-0001-5271-5751
Observed ORCID: 0000-0001-5271-5751
OpenAlex ID: A5017908783
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations
2023 · Ali Baran Taşdemir, Tuna Karacan, et al. · Lecture notes in computer science
PDF
Low-Rank Representations Towards Classification Problem of Complex Networks
2022 · Murat Celik, Ali Baran Tasdemir, et al. · Signal Processing and Communications Applications Conference (SIU)
PDF
Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures
2021 · Ali Baran Tasdemir, Lale Ozkahya · Signal Processing and Communications Applications Conference (SIU)
Classification of Complex Networks Using Structural Analysis of Random Graph Models
2020 · Ali Baran Taşdemir, Barkın Atasay, et al. · Signal Processing and Communications Applications Conference (SIU)
Works count: 4
Citation count:
H-index:
I10-index:
Year
Topic
Type