Domingos Moreira Cardoso

Orcid: 0000-0001-6239-3557

Affiliations:
  • University of Aveiro, Portugal


According to our database1, Domingos Moreira Cardoso authored at least 32 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Integer eigenvalues of the n-Queens graph.
Discret. Math., 2024

2021
The main vertices of a star set and related graph parameters.
Discret. Math., 2021

2020
Graphs with clusters perturbed by regular graphs - <i>A<sub>α</sub></i>-spectrum and applications.
Discuss. Math. Graph Theory, 2020

Some new aspects of main eigenvalues of graphs.
Comput. Appl. Math., 2020

2019
An overview of (κ, τ)-regular sets and their applications.
Discret. Appl. Math., 2019

2018
On the dominating induced matching problem: Spectral results and sharp bounds.
Discret. Appl. Math., 2018

2017
Laplacian Distribution and Domination.
Graphs Comb., 2017

Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs.
Discret. Math., 2017

Combinatorial and spectral properties of König-Egerváry graphs.
Discret. Appl. Math., 2017

On Cops and Robbers on $G^{\Xi}$ and cop-edge critical graphs.
Contributions Discret. Math., 2017

2016
A simplex like approach based on star sets for recognizing convex-QP adverse graphs.
J. Comb. Optim., 2016

Efficient domination through eigenvalues.
Discret. Appl. Math., 2016

2015
Spectral Characterization of Families of Split Graphs.
Graphs Comb., 2015

2013
Spectra of graphs obtained by a generalization of the join graph operation.
Discret. Math., 2013

Convex Quadratic Programming in Graphs - Links between Continuous and Discrete Problems.
Proceedings of the ICORES 2013, 2013

2012
Computing the Laplacian spectra of some graphs.
Discret. Appl. Math., 2012

2011
On the complexity of the dominating induced matching problem in hereditary classes of graphs.
Discret. Appl. Math., 2011

2009
Spectral upper bounds on the size of k-regular induced subgraphs.
Electron. Notes Discret. Math., 2009

Dominating Induced Matchings.
Proceedings of the Graph Theory, 2009

2008
Efficient edge domination in regular graphs.
Discret. Appl. Math., 2008

2007
Maximum <i>k</i> -regular induced subgraphs.
J. Comb. Optim., 2007

Laplacian eigenvectors and eigenvalues and almost equitable partitions.
Eur. J. Comb., 2007

Spectral results on regular graphs with (k, tau)-regular sets.
Discret. Math., 2007

2006
On the optimal parameter of a self-concordant barrier over a symmetric cone.
Eur. J. Oper. Res., 2006

2005
A Multi-Attribute Ranking Solutions Confirmation Procedure.
Ann. Oper. Res., 2005

2004
On regular-stable graphs.
Ars Comb., 2004

2003
A numerical tool for multiattribute ranking problems.
Networks, 2003

2001
Convex Quadratic Programming Approach to the Maximum Matching Problem.
J. Glob. Optim., 2001

Convex Quadratic Programming Approach.
J. Glob. Optim., 2001

A quadratic programming approach to the determination of an upper bound on the weighted stability number.
Eur. J. Oper. Res., 2001

1998
A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph.
Ann. Oper. Res., 1998

1992
The generalized simplex method.
Oper. Res. Lett., 1992


  Loading...