Cospectral Graphs and Regular Orthogonal Matrices of Level 2. - Aida Abiad; Willem H. Haemers (Electron. J. Comb., 2012)

Algebraic characterizations of regularity properties in bipartite graphs. - Aida Abiad; Cristina Dalfó; Miguel Angel Fiol (Eur. J. Comb., 2013)

Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231]. - Aida Abiad; Cristina Dalfó; Miguel Angel Fiol (Eur. J. Comb., 2014)

Switched symplectic graphs and their 2-ranks. - Aida Abiad; Willem H. Haemers (Des. Codes Cryptogr., 2016)

Some spectral and quasi-spectral characterizations of distance-regular graphs. - Aida Abiad; Edwin R. van Dam; Miguel Angel Fiol (J. Comb. Theory A, 2016)

An Application of Hoffman Graphs for Spectral Characterizations of Graphs. - Qianqian Yang 006; Aida Abiad; Jack H. Koolen (Electron. J. Comb., 2017)

On the Wiener index, distance cospectrality and transmission-regular graphs. - Aida Abiad; Boris Brimkov; Aysel Erey; Lorinda Leshock; Xavier Martínez-Rivera; Suil O; Sung-Yell Song; Jason Williford (Discret. Appl. Math., 2017)

A characterization of weight-regular partitions of graphs. - Aida Abiad (Electron. Notes Discret. Math., 2018)

Graph switching, 2-ranks, and graphical Hadamard matrices. - Aida Abiad; Steve Butler; Willem H. Haemers (Discret. Math., 2019)

On the k-independence number of graphs. - Aida Abiad; Gabriel Coutinho; Miquel A. Fiol (Discret. Math., 2019)

Printed circuit boards isomorphism: An experimental study. - Aida Abiad; Alexander Grigoriev; Stefanie Niemzok (Comput. Ind. Eng., 2020)

On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. - Aida Abiad; Sander Gribling; Domenico Lahaye; Matthias Mnich; Guus Regts; Lluís Vena; Gerard Verweij; Peter J. Zwaneveld (Discret. Optim., 2020)

Enumeration of cospectral and coinvariant graphs. - Aida Abiad; Carlos A. Alfaro (Appl. Math. Comput., 2021)

On the status sequences of trees. - Aida Abiad; Boris Brimkov; Alexander Grigoriev (Theor. Comput. Sci., 2021)

The Kaleidoscopic Game of Life. - Aida Abiad; Merit Geldmacher; Alexander Grigoriev (Complex Syst., 2022)

Descriptive complexity of the generalized spectra of graphs. - Aida Abiad; Anuj Dawar; Octavio Zapata (CoRR, 2022)

Neumaier graphs with few eigenvalues. - Aida Abiad; Bart De Bruyn; Jozefien D'haeseleer; Jack H. Koolen (Des. Codes Cryptogr., 2022)

Optimization of eigenvalue bounds for the independence and chromatic number of graph powers. - Aida Abiad; Gabriel Coutinho; Miguel Angel Fiol; Bruno Demattos Nogueira; Sjanne Zeijlemaker (Discret. Math., 2022)

Descriptive complexity of controllable graphs. - Aida Abiad; Anuj Dawar; Octavio Zapata (LAGOS, 2023)

An infinite class of Neumaier graphs and non-existence results. - Aida Abiad; Wouter Castryck; Maarten De Boeck; Jack H. Koolen; Sjanne Zeijlemaker (J. Comb. Theory A, 2023)

The M-matrix group inverse problem for distance-biregular graphs. - Aida Abiad; Ángeles Carmona; Andrés M. Encinas; María José Jiménez 002 (Comput. Appl. Math., 2023)

On inertia and ratio type bounds for the k-independence number of a graph and their relationship. - Aida Abiad; Cristina Dalfó; Miguel Angel Fiol; Sjanne Zeijlemaker (Discret. Appl. Math., 2023)

Bounding the sum of the largest signless Laplacian eigenvalues of a graph. - Aida Abiad; Leonardo Silva de Lima; Sina Kalantarzadeh; Mona Mohammadi; Carla Silva Oliveira (Discret. Appl. Math., 2023)

Eigenvalue bounds for the distance-t chromatic number of a graph and their application to Lee codes. - Aida Abiad; Alessandro Neri 002; Luuk Reijnders (CoRR, 2024)

Eigenvalue bounds and alternating rank-metric codes. - Aida Abiad; Gianira N. Alfarano; Alberto Ravagnani (CoRR, 2024)

On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme. - Aida Abiad; Robin Simoens; Sjanne Zeijlemaker (Discret. Appl. Math., 2024)

On the k-independence number of graph products. - Aida Abiad; Hidde Koerts (Discuss. Math. Graph Theory, 2024)

The diameter of sum basic equilibria games. - Aida Abiad; Carme Àlvarez; Arnau Messegué (Theor. Comput. Sci., 2024)

A switching method for constructing cospectral gain graphs. - Aida Abiad; Francesco Belardo; Antonina P. Khramova (Discret. Math., 2024)

On the Existence of Small Strictly Neumaier Graphs. - Aida Abiad; Maarten De Boeck; Sjanne Zeijlemaker (Graphs Comb., 2024)

Eigenvalue Bounds for Sum-Rank-Metric Codes. - Aida Abiad; Antonina P. Khramova; Alberto Ravagnani (IEEE Trans. Inf. Theory, 2024)

Distinguishing graphs by their spectra, Smith normal forms and complements. - Aida Abiad; Carlos A. Alfaro; Ralihe R. Villagrán (Appl. Math. Comput., 2025)

The clique number of the exact distance t-power graph: Complexity and eigenvalue bounds. - Aida Abiad; Afrouz Jabal Ameli; Luuk Reijnders (Discret. Appl. Math., 2025)

A Linear Programming Bound for Sum-Rank Metric Codes. - Aida Abiad; Alexander L. Gavrilyuk; Antonina P. Khramova; Ilia Ponomarenko (IEEE Trans. Inf. Theory, 2025)