Scholarly and Creative Works
2023
- Alabandi, G. A. H., Sands, W., Biros, G., & Burtscher, M. (2023). A GPU Algorithm for Detecting Strongly Connected Components. https://doi.org/10.1145/3581784.3607071
2021
- Alabandi, G. A. H., & Burtscher, M. (2021). graphB+: A Scalable Balancing Algorithm for Signed Social Network Graphs. Retrieved from http://cs.txstate.edu/~burtscher/research/graphB/
- Alabandi, G. A. H., Tesic, J., Rusnak, L. J., & Burtscher, M. (2021). Discovering and balancing fundamental cycles in large signed graphs. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (pp. 1–17). ACM. https://doi.org/10.1145/3458817.3476153
2020
- Alabandi, G. A. H., Powers, E., & Burtscher, M. (2020). ECL-GC: A Fast Graph-Coloring Algorithm with Shortcutting for GPUs. Retrieved from http://cs.txstate.edu/~burtscher/research/ECL-GC/
- Alabandi, G. A. H., Powers, E., & Burtscher, M. (2020). Increasing the Parallelism of Graph Coloring via Shortcutting (pp. 262–275).