Vilmar Trevisan

Orcid: 0000-0002-7053-8530

According to our database1, Vilmar Trevisan authored at least 43 papers between 1990 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graphs sharing an arbitrary number of ordered complementarity eigenvalues.
Discret. Math., March, 2024

2023
Exploring symmetries in cographs: Obtaining spectra and energies.
Discret. Appl. Math., 2023

2021
Most Laplacian eigenvalues of a tree are small.
J. Comb. Theory, Ser. B, 2021

Locating eigenvalues of unbalanced unicyclic signed graphs.
Appl. Math. Comput., 2021

2020
Determining graphs by the complementary spectrum.
Discuss. Math. Graph Theory, 2020

Null decomposition of unicyclic graphs.
Discret. Appl. Math., 2020

Independence and matching numbers of unicyclic graphs from null space.
Comput. Appl. Math., 2020

Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues.
Discret. Appl. Math., 2019

2018
Maximality of the signless Laplacian energy.
Discret. Math., 2018

Eigenvalue location in cographs.
Discret. Appl. Math., 2018

Partial Characterization of Graphs Having a Single Large Laplacian Eigenvalue.
Electron. J. Comb., 2018

Locating the Eigenvalues for Graphs of Small Clique-Width.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Laplacian Distribution and Domination.
Graphs Comb., 2017

On graphs with a single large Laplacian eigenvalue.
Electron. Notes Discret. Math., 2017

Exponentially many graphs have a Q-cospectral mate.
Discret. Math., 2017

Maximum Laplacian energy of unicyclic graphs.
Discret. Appl. Math., 2017

2016
Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum.
SIAM J. Matrix Anal. Appl., 2016

Domination number and Laplacian eigenvalue distribution.
Eur. J. Comb., 2016

Some spectral properties of cographs.
Discret. Math., 2016

2015
Diagonalization of generalized lollipop graphs.
Electron. Notes Discret. Math., 2015

Threshold graphs of maximal Laplacian energy.
Discret. Math., 2015

2014
Computing the Characteristic Polynomial of Threshold Graphs.
J. Graph Algorithms Appl., 2014

Bounding the sum of the largest Laplacian eigenvalues of graphs.
Discret. Appl. Math., 2014

2013
Extracting sparse factors from multivariate integral polynomials.
J. Symb. Comput., 2013

On the distribution of Laplacian eigenvalues of trees.
Discret. Math., 2013

Unicyclic Graphs with equal Laplacian Energy
CoRR, 2013

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

2011
A note on Gao's algorithm for polynomial factorization.
Theor. Comput. Sci., 2011

Algebraic connectivity on a subclass of caterpillars.
Electron. Notes Discret. Math., 2011

Laplacian energy of diameter 3 trees.
Appl. Math. Lett., 2011

Gcd of multivariate polynomials via Newton polytopes.
Appl. Math. Comput., 2011

2010
A linear model for compound multicommodity network flow problems.
Comput. Oper. Res., 2010

Applications of recurrence relations for the characteristic polynomials of Bethe trees.
Comput. Math. Appl., 2010

2008
Distance- k knowledge in self-stabilizing algorithms.
Theor. Comput. Sci., 2008

2006
Distance-<i>k</i> Information in Self-stabilizing Algorithms.
Proceedings of the Structural Information and Communication Complexity, 2006

2005
A modular integer GCD algorithm.
J. Algorithms, 2005

2001
An O(n<sup>2</sup>) Algorithm for the Characteristic Polynomial of a Tree.
Electron. Notes Discret. Math., 2001

1995
The composite character of the twenty-second Fermat number.
J. Supercomput., 1995

Um algoritmo algébrico para isolar zeros de polinômios.
RITA, 1995

1993
Polynomial Factorization Sharp Bounds, Efficient Algorithms.
J. Symb. Comput., 1993

1991
Practical Factorization of Univariate Polynomials over Finite Fields.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990
Recognition of Hurwitz polynomials.
SIGSAM Bull., 1990


  Loading...