Vilmar Trevisan

According to our database, Vilmar Trevisan authored at least 48 papers between 1990 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

Limit points for the spectral radii of unbalanced signed graphs.

Maurizio Brunetti, Vilmar Trevisan

Discret. Math., 2026

Locating eigenvalues of matrogenic graphs in linear time.

Nelson Assis, Vilmar Trevisan

Discret. Appl. Math., 2026

2025

An Interlacing Property of the Signless Laplacian of Threshold Graphs.

Christoph Helmberg, Guilherme Porto, Guilherme Torres, Vilmar Trevisan

Electron. J. Comb., 2025

Fast Gaussian Elimination for Low Treewidth Matrices.

Martin Fürer, Carlos Hoppen, Vilmar Trevisan

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Graphs sharing an arbitrary number of ordered complementarity eigenvalues.

David Sossa, Vilmar Trevisan

Discret. Math., March, 2024

Limit points of (signless) Laplacian spectral radii of linear trees.

Francesco Belardo, Elismar R. Oliveira, Vilmar Trevisan

Appl. Math. Comput., 2024

2023

Exploring symmetries in cographs: Obtaining spectra and energies.

Átila A. Jones, Vilmar Trevisan, Cybele T. M. Vinagre

Discret. Appl. Math., 2023

2021

Most Laplacian eigenvalues of a tree are small.

David Pokrass Jacobs, Elismar R. Oliveira, Vilmar Trevisan

J. Comb. Theory B, 2021

Locating eigenvalues of unbalanced unicyclic signed graphs.

Francesco Belardo, Maurizio Brunetti, Vilmar Trevisan

Appl. Math. Comput., 2021

2020

Determining graphs by the complementary spectrum.

K. Pinheiro, Bruna S. Souza, Vilmar Trevisan

Discuss. Math. Graph Theory, 2020

Null decomposition of unicyclic graphs.

Luiz Emilio Allem, Daniel A. Jaume, Gonzalo Molina, Maikon M. Toledo, Vilmar Trevisan

Discret. Appl. Math., 2020

Independence and matching numbers of unicyclic graphs from null space.

Luiz Emilio Allem, Daniel A. Jaume, Gonzalo Molina, Maikon M. Toledo, Vilmar Trevisan

Comput. Appl. Math., 2020

Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth.

Martin Fürer, Carlos Hoppen, Vilmar Trevisan

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues.

Rodrigo Grijó, Leonardo Silva de Lima, Carla Silva Oliveira, Guilherme Porto, Vilmar Trevisan

Discret. Appl. Math., 2019

2018

Maximality of the signless Laplacian energy.

Lucélia Kowalski Pinheiro, Vilmar Trevisan

Discret. Math., 2018

Eigenvalue location in cographs.

David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura

Discret. Appl. Math., 2018

Partial Characterization of Graphs Having a Single Large Laplacian Eigenvalue.

Luiz Emilio Allem, Antonio Cafure, Ezequiel Dratman, Luciano N. Grippo, Martín D. Safe, Vilmar Trevisan

Electron. J. Comb., 2018

Locating the Eigenvalues for Graphs of Small Clique-Width.

Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Laplacian Distribution and Domination.

Domingos M. Cardoso, David Pokrass Jacobs, Vilmar Trevisan

Graphs Comb., 2017

On graphs with a single large Laplacian eigenvalue.

Luiz Emilio Allem, Antonio Cafure, Ezequiel Dratman, Luciano N. Grippo, Martín Darío Safe, Vilmar Trevisan

Electron. Notes Discret. Math., 2017

Exponentially many graphs have a Q-cospectral mate.

João Carvalho, Bruna S. Souza, Vilmar Trevisan, Fernando Tura

Discret. Math., 2017

Maximum Laplacian energy of unicyclic graphs.

Kinkar Chandra Das, Eliseu Fritscher, Lucélia Kowalski Pinheiro, Vilmar Trevisan

Discret. Appl. Math., 2017

2016

Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum.

Eliseu Fritscher, Vilmar Trevisan

SIAM J. Matrix Anal. Appl., 2016

Domination number and Laplacian eigenvalue distribution.

Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan

Eur. J. Comb., 2016

Some spectral properties of cographs.

Ali Mohammadian, Vilmar Trevisan

Discret. Math., 2016

2015

Diagonalization of generalized lollipop graphs.

Renata R. Del-Vecchio, David Pokrass Jacobs, Vilmar Trevisan, Cybele T. M. Vinagre

Electron. Notes Discret. Math., 2015

Threshold graphs of maximal Laplacian energy.

Christoph Helmberg, Vilmar Trevisan

Discret. Math., 2015

2014

Computing the Characteristic Polynomial of Threshold Graphs.

David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura

J. Graph Algorithms Appl., 2014

Bounding the sum of the largest Laplacian eigenvalues of graphs.

Israel Rocha, Vilmar Trevisan

Discret. Appl. Math., 2014

2013

Extracting sparse factors from multivariate integral polynomials.

Luiz Emilio Allem, Shuhong Gao, Vilmar Trevisan

J. Symb. Comput., 2013

On the distribution of Laplacian eigenvalues of trees.

Rodrigo O. Braga, Virginia M. Rodrigues, Vilmar Trevisan

Discret. Math., 2013

Unicyclic Graphs with equal Laplacian Energy

Eliseu Fritscher, Carlos Hoppen, Vilmar Trevisan

CoRR, 2013

2012

Computing the Laplacian spectra of some graphs.

Domingos M. Cardoso, Enide Andrade Martins, María Robbiano, Vilmar Trevisan

Discret. Appl. Math., 2012

2011

A note on Gao's algorithm for polynomial factorization.

Carlos Hoppen, Virginia M. Rodrigues, Vilmar Trevisan

Theor. Comput. Sci., 2011

Algebraic connectivity on a subclass of caterpillars.

Oscar Rojo, Israel Rocha, Vilmar Trevisan

Electron. Notes Discret. Math., 2011

Laplacian energy of diameter 3 trees.

Vilmar Trevisan, João B. Carvalho, Renata R. Del-Vecchio, Cybele T. M. Vinagre

Appl. Math. Lett., 2011

Gcd of multivariate polynomials via Newton polytopes.

Luiz Emilio Allem, Vilmar Trevisan

Appl. Math. Comput., 2011

2010

A linear model for compound multicommodity network flow problems.

Catia Maria dos Santos Machado, Sérgio Fernando Mayerle, Vilmar Trevisan

Comput. Oper. Res., 2010

Applications of recurrence relations for the characteristic polynomials of Bethe trees.

María Robbiano, Vilmar Trevisan

Comput. Math. Appl., 2010

2008

Distance- k knowledge in self-stabilizing algorithms.

Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan

Theor. Comput. Sci., 2008

2006

Distance-<i>k</i> Information in Self-stabilizing Algorithms.

Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan

Proceedings of the Structural Information and Communication Complexity, 2006

2005

A modular integer GCD algorithm.

Kenneth Weber, Vilmar Trevisan, Luiz Felipe Martins

J. Algorithms, 2005

2001

An O(n²) Algorithm for the Characteristic Polynomial of a Tree.

David Pokrass Jacobs, Catia Maria dos Santos Machado, Vilmar Trevisan

Electron. Notes Discret. Math., 2001

1995

The composite character of the twenty-second Fermat number.

Vilmar Trevisan, João B. Carvalho

J. Supercomput., 1995

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

Dalcidio Moraes Claudio, Maria Angelica Camargo, Vilmar Trevisan

RITA, 1995

1993

Polynomial Factorization Sharp Bounds, Efficient Algorithms.

Bernard Beauzamy, Vilmar Trevisan, Paul S. Wang

J. Symb. Comput., 1993

1991

Practical Factorization of Univariate Polynomials over Finite Fields.

Vilmar Trevisan, Paul S. Wang

Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990

Recognition of Hurwitz polynomials.

Vilmar Trevisan

SIGSAM Bull., 1990