default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDomingos Moreira Cardoso
Person information
- affiliation: University of Aveiro, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Domingos M. Cardoso, Inês Serôdio Costa
, Rui Duarte:
Integer eigenvalues of the n-Queens graph. Discret. Math. 347(9): 114065 (2024)- 2021
- [j31]Milica Andelic, Domingos M. Cardoso, Slobodan K. Simic, Zoran Stanic:
The main vertices of a star set and related graph parameters. Discret. Math. 344(12): 112593 (2021) - 2020
- [j30]Nair Abreu, Domingos M. Cardoso, Francisca Andrea Macedo França, Cybele T. M. Vinagre:
Some new aspects of main eigenvalues of graphs. Comput. Appl. Math. 39(1) (2020) - [j29]Domingos M. Cardoso, Germain Pastén, Oscar Rojo:
Graphs with clusters perturbed by regular graphs - Aα-spectrum and applications. Discuss. Math. Graph Theory 40(2): 451-466 (2020)
2010 – 2019
- 2019
- [j28]Domingos M. Cardoso:
An overview of (κ, τ)-regular sets and their applications. Discret. Appl. Math. 269: 2-10 (2019) - 2018
- [j27]Enide Andrade Martins, Domingos M. Cardoso, Luis Medina, Oscar Rojo:
On the dominating induced matching problem: Spectral results and sharp bounds. Discret. Appl. Math. 234: 22-31 (2018) - 2017
- [j26]Domingos Moreira Cardoso, Charles Dominic, Lukasz Witkowski, Marcin Witkowski:
On Cops and Robbers on $G^{\Xi}$ and cop-edge critical graphs. Contributions Discret. Math. 12(2) (2017) - [j25]Domingos M. Cardoso, María Robbiano, Oscar Rojo:
Combinatorial and spectral properties of König-Egerváry graphs. Discret. Appl. Math. 217: 446-454 (2017) - [j24]Nair Abreu, Domingos M. Cardoso, Paula Carvalho, Cybele T. M. Vinagre:
Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs. Discret. Math. 340(1): 3235-3244 (2017) - [j23]Domingos M. Cardoso, David Pokrass Jacobs, Vilmar Trevisan:
Laplacian Distribution and Domination. Graphs Comb. 33(5): 1283-1295 (2017) - 2016
- [j22]Domingos M. Cardoso, Vadim V. Lozin, Carlos J. Luz, Maria F. Pacheco:
Efficient domination through eigenvalues. Discret. Appl. Math. 214: 54-62 (2016) - [j21]Domingos M. Cardoso, Carlos J. Luz:
A simplex like approach based on star sets for recognizing convex-QP adverse graphs. J. Comb. Optim. 31(1): 311-326 (2016) - 2015
- [j20]Milica Andelic, Domingos M. Cardoso:
Spectral Characterization of Families of Split Graphs. Graphs Comb. 31(1): 59-72 (2015) - 2013
- [j19]Domingos M. Cardoso, Maria Aguieiras A. de Freitas, Enide Andrade Martins, María Robbiano:
Spectra of graphs obtained by a generalization of the join graph operation. Discret. Math. 313(5): 733-741 (2013) - [c2]Domingos Moreira Cardoso:
Convex Quadratic Programming in Graphs - Links between Continuous and Discrete Problems. ICORES 2013: IS-7 - 2012
- [j18]Domingos M. Cardoso, Enide Andrade Martins, María Robbiano, Vilmar Trevisan:
Computing the Laplacian spectra of some graphs. Discret. Appl. Math. 160(18): 2645-2654 (2012) - 2011
- [j17]Domingos Moreira Cardoso, Nicholas Korpelainen, Vadim V. Lozin:
On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discret. Appl. Math. 159(7): 521-531 (2011)
2000 – 2009
- 2009
- [j16]Domingos Moreira Cardoso, Sofia J. Pinheiro:
Spectral upper bounds on the size of k-regular induced subgraphs. Electron. Notes Discret. Math. 32: 3-10 (2009) - [c1]Domingos Moreira Cardoso, Vadim V. Lozin:
Dominating Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 77-86 - 2008
- [j15]Domingos Moreira Cardoso, J. Orestes Cerdeira, Charles Delorme, Pedro C. Silva:
Efficient edge domination in regular graphs. Discret. Appl. Math. 156(15): 3060-3065 (2008) - 2007
- [j14]Domingos Moreira Cardoso, Paula Rama:
Spectral results on regular graphs with (k, tau)-regular sets. Discret. Math. 307(11-12): 1306-1316 (2007) - [j13]Domingos Moreira Cardoso, Charles Delorme, Paula Rama:
Laplacian eigenvectors and eigenvalues and almost equitable partitions. Eur. J. Comb. 28(3): 665-673 (2007) - [j12]Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin:
Maximum k -regular induced subgraphs. J. Comb. Optim. 14(4): 455-463 (2007) - 2006
- [j11]Domingos Moreira Cardoso, Luís Almeida Vieira:
On the optimal parameter of a self-concordant barrier over a symmetric cone. Eur. J. Oper. Res. 169(3): 1148-1157 (2006) - 2005
- [j10]Domingos Moreira Cardoso, Jorge Freire de Sousa:
A Multi-Attribute Ranking Solutions Confirmation Procedure. Ann. Oper. Res. 138(1): 127-141 (2005) - 2004
- [j9]Rommel M. Barbosa, Domingos Moreira Cardoso:
On regular-stable graphs. Ars Comb. 70 (2004) - 2003
- [j8]Domingos Moreira Cardoso, Jorge Freire de Sousa:
A numerical tool for multiattribute ranking problems. Networks 41(4): 229-234 (2003) - 2001
- [j7]Rommel M. Barbosa, Domingos Moreira Cardoso:
On regular-stable graphs. Electron. Notes Discret. Math. 10: 20-22 (2001) - [j6]Carlos J. Luz, Domingos M. Cardoso:
A quadratic programming approach to the determination of an upper bound on the weighted stability number. Eur. J. Oper. Res. 132(3): 569-581 (2001) - [j5]Domingos M. Cardoso:
Convex Quadratic Programming Approach to the Maximum Matching Problem. J. Glob. Optim. 19(3): 291-306 (2001) - [j4]Domingos M. Cardoso:
Convex Quadratic Programming Approach. J. Glob. Optim. 21(1): 89 (2001) - [j3]Domingos M. Cardoso:
Convex Quadratic Programming Approach to the Maximum Matching Problem. J. Glob. Optim. 21(1): 91-106 (2001)
1990 – 1999
- 1998
- [j2]Carlos J. Luz, Domingos M. Cardoso:
A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph. Ann. Oper. Res. 81: 307-320 (1998) - 1992
- [j1]Domingos M. Cardoso, João C. N. Clímaco:
The generalized simplex method. Oper. Res. Lett. 12(5): 337-348 (1992)
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 2024-10-07 21:24 CEST 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:
