default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAida Abiad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j29]Aida Abiad
, Carlos A. Alfaro, Ralihe R. Villagrán:
Distinguishing graphs by their spectra, Smith normal forms and complements. Appl. Math. Comput. 490: 129198 (2025)- [j28]Aida Abiad, Alexander L. Gavrilyuk, Antonina P. Khramova, Ilia Ponomarenko:
A Linear Programming Bound for Sum-Rank Metric Codes. IEEE Trans. Inf. Theory 71(1): 317-329 (2025) - 2024
- [j27]Aida Abiad, Robin Simoens, Sjanne Zeijlemaker:
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme. Discret. Appl. Math. 348: 221-230 (2024) - [j26]Aida Abiad, Francesco Belardo, Antonina P. Khramova:
A switching method for constructing cospectral gain graphs. Discret. Math. 347(4): 113838 (2024) - [j25]Aida Abiad, Hidde Koerts:
On the k-independence number of graph products. Discuss. Math. Graph Theory 44(3): 983 (2024) - [j24]Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker:
On the Existence of Small Strictly Neumaier Graphs. Graphs Comb. 40(3): 51 (2024) - [j23]Aida Abiad, Carme Àlvarez, Arnau Messegué:
The diameter of sum basic equilibria games. Theor. Comput. Sci. 1018: 114807 (2024) - [j22]Aida Abiad, Antonina P. Khramova, Alberto Ravagnani:
Eigenvalue Bounds for Sum-Rank-Metric Codes. IEEE Trans. Inf. Theory 70(7): 4843-4855 (2024) - [i5]Aida Abiad, Alessandro Neri, Luuk Reijnders:
Eigenvalue bounds for the distance-t chromatic number of a graph and their application to Lee codes. CoRR abs/2404.14839 (2024) - [i4]Aida Abiad, Gianira N. Alfarano, Alberto Ravagnani:
Eigenvalue bounds and alternating rank-metric codes. CoRR abs/2405.09254 (2024) - 2023
- [j21]Aida Abiad, Ángeles Carmona, Andrés M. Encinas, María José Jiménez:
The M-matrix group inverse problem for distance-biregular graphs. Comput. Appl. Math. 42(4) (2023) - [j20]Aida Abiad, Cristina Dalfó, Miguel Angel Fiol, Sjanne Zeijlemaker:
On inertia and ratio type bounds for the k-independence number of a graph and their relationship. Discret. Appl. Math. 333: 96-109 (2023) - [j19]Aida Abiad, Leonardo Silva de Lima, Sina Kalantarzadeh, Mona Mohammadi, Carla Silva Oliveira:
Bounding the sum of the largest signless Laplacian eigenvalues of a graph. Discret. Appl. Math. 340: 315-326 (2023) - [j18]Aida Abiad, Wouter Castryck, Maarten De Boeck, Jack H. Koolen, Sjanne Zeijlemaker:
An infinite class of Neumaier graphs and non-existence results. J. Comb. Theory A 193: 105684 (2023) - [c1]Aida Abiad, Anuj Dawar, Octavio Zapata:
Descriptive complexity of controllable graphs. LAGOS 2023: 20-27 - [i3]Aida Abiad, Antonina P. Khramova, Alberto Ravagnani:
Eigenvalue Bounds for Sum-Rank-Metric Codes. CoRR abs/2307.13613 (2023) - [i2]Aida Abiad, Anuj Dawar, Octavio Zapata:
Descriptive complexity of controllable graphs. CoRR abs/2309.04892 (2023) - 2022
- [j17]Aida Abiad, Merit Geldmacher, Alexander Grigoriev:
The Kaleidoscopic Game of Life. Complex Syst. 31(1): 1-58 (2022) - [j16]Aida Abiad, Bart De Bruyn, Jozefien D'haeseleer, Jack H. Koolen:
Neumaier graphs with few eigenvalues. Des. Codes Cryptogr. 90(9): 2003-2019 (2022) - [j15]Aida Abiad, Gabriel Coutinho, Miguel Angel Fiol, Bruno Demattos Nogueira, Sjanne Zeijlemaker:
Optimization of eigenvalue bounds for the independence and chromatic number of graph powers. Discret. Math. 345(3): 112706 (2022) - [i1]Aida Abiad, Anuj Dawar, Octavio Zapata:
Descriptive complexity of the generalized spectra of graphs. CoRR abs/2210.05482 (2022) - 2021
- [j14]Aida Abiad, Carlos A. Alfaro:
Enumeration of cospectral and coinvariant graphs. Appl. Math. Comput. 408: 126348 (2021) - [j13]Aida Abiad, Boris Brimkov, Alexander Grigoriev:
On the status sequences of trees. Theor. Comput. Sci. 856: 110-120 (2021) - 2020
- [j12]Aida Abiad, Alexander Grigoriev, Stefanie Niemzok:
Printed circuit boards isomorphism: An experimental study. Comput. Ind. Eng. 148: 106715 (2020) - [j11]Aida Abiad, Sander Gribling, Domenico Lahaye, Matthias Mnich, Guus Regts, Lluís Vena, Gerard Verweij, Peter J. Zwaneveld:
On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. Discret. Optim. 37: 100565 (2020)
2010 – 2019
- 2019
- [j10]Aida Abiad, Steve Butler, Willem H. Haemers:
Graph switching, 2-ranks, and graphical Hadamard matrices. Discret. Math. 342(10): 2850-2855 (2019) - [j9]Aida Abiad, Gabriel Coutinho, Miquel A. Fiol:
On the k-independence number of graphs. Discret. Math. 342(10): 2875-2885 (2019) - 2018
- [j8]Aida Abiad:
A characterization of weight-regular partitions of graphs. Electron. Notes Discret. Math. 68: 293-298 (2018) - 2017
- [j7]Qianqian Yang, Aida Abiad, Jack H. Koolen:
An Application of Hoffman Graphs for Spectral Characterizations of Graphs. Electron. J. Comb. 24(1): 1 (2017) - [j6]Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock, Xavier Martínez-Rivera, Suil O, Sung-Yell Song, Jason Williford:
On the Wiener index, distance cospectrality and transmission-regular graphs. Discret. Appl. Math. 230: 1-10 (2017) - 2016
- [j5]Aida Abiad, Willem H. Haemers:
Switched symplectic graphs and their 2-ranks. Des. Codes Cryptogr. 81(1): 35-41 (2016) - [j4]Aida Abiad, Edwin R. van Dam, Miguel Angel Fiol:
Some spectral and quasi-spectral characterizations of distance-regular graphs. J. Comb. Theory A 143: 1-18 (2016) - 2014
- [j3]Aida Abiad, Cristina Dalfó, Miguel Angel Fiol:
Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231]. Eur. J. Comb. 38: 130-132 (2014) - 2013
- [j2]Aida Abiad, Cristina Dalfó, Miguel Angel Fiol:
Algebraic characterizations of regularity properties in bipartite graphs. Eur. J. Comb. 34(8): 1223-1231 (2013) - 2012
- [j1]Aida Abiad, Willem H. Haemers:
Cospectral Graphs and Regular Orthogonal Matrices of Level 2. Electron. J. Comb. 19(3): 13 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 00:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
