Vilmar Trevisan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2024

Graphs sharing an arbitrary number of ordered complementarity eigenvaluesDavid Sossa, Vilmar Trevisan. DM, 347(3):113788, March 2024. [doi]

2023

Exploring symmetries in cographs: Obtaining spectra and energiesÁtila A. Jones, Vilmar Trevisan, Cybele T. M. Vinagre. DAM, 325:120-133, 2023. [doi]

2021

Locating eigenvalues of unbalanced unicyclic signed graphsFrancesco Belardo, Maurizio Brunetti, Vilmar Trevisan. amc, 400:126082, 2021. [doi]

Most Laplacian eigenvalues of a tree are smallDavid Pokrass Jacobs, Elismar R. Oliveira, Vilmar Trevisan. jctb, 146:1-33, 2021. [doi]

2020

2019

Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvaluesRodrigo Grijó, Leonardo Silva de Lima, Carla Silva Oliveira, Guilherme Porto, Vilmar Trevisan. DAM, 267:176-183, 2019. [doi]

2018

2017

On graphs with a single large Laplacian eigenvalueLuiz Emilio Allem, Antonio Cafure, Ezequiel Dratman, Luciano N. Grippo, Martín Darío Safe, Vilmar Trevisan. endm, 62:297-302, 2017. [doi]

Laplacian Distribution and DominationDomingos M. Cardoso, David P. Jacobs, Vilmar Trevisan. gc, 33(5):1283-1295, 2017. [doi]

Exponentially many graphs have a Q-cospectral mateJoão Carvalho, Bruna S. Souza, Vilmar Trevisan, Fernando Tura. DM, 340(9):2079-2085, 2017. [doi]

Maximum Laplacian energy of unicyclic graphsKinkar Chandra Das, Eliseu Fritscher, Lucélia Kowalski Pinheiro, Vilmar Trevisan. DAM, 218:71-81, 2017. [doi]

2016

Exploring Symmetries to Decompose Matrices and Graphs Preserving the SpectrumEliseu Fritscher, Vilmar Trevisan. siammax, 37(1):260-289, 2016. [doi]

Domination number and Laplacian eigenvalue distributionStephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan. ejc, 53:66-71, 2016. [doi]

Some spectral properties of cographsAli Mohammadian, Vilmar Trevisan. DM, 339(4):1261-1264, 2016. [doi]

2015

Diagonalization of generalized lollipop graphsRenata R. Del-Vecchio, David Pokrass Jacobs, Vilmar Trevisan, Cybele T. M. Vinagre. endm, 50:41-46, 2015. [doi]

Threshold graphs of maximal Laplacian energyChristoph Helmberg, Vilmar Trevisan. DM, 338(7):1075-1084, 2015. [doi]

2014

Computing the Characteristic Polynomial of Threshold GraphsDavid Pokrass Jacobs, Vilmar Trevisan, Fernando Tura. jgaa, 18(5):709-719, 2014. [doi]

Bounding the sum of the largest Laplacian eigenvalues of graphsIsrael Rocha, Vilmar Trevisan. DAM, 170:95-103, 2014. [doi]

2013

Extracting sparse factors from multivariate integral polynomialsLuiz Emilio Allem, Shuhong Gao, Vilmar Trevisan. JSC, 52:3-16, 2013. [doi]

On the distribution of Laplacian eigenvalues of treesRodrigo O. Braga, Virginia M. Rodrigues, Vilmar Trevisan. DM, 313(21):2382-2389, 2013. [doi]

2012

Computing the Laplacian spectra of some graphsDomingos M. Cardoso, Enide Andrade Martins, María Robbiano, Vilmar Trevisan. DAM, 160(18):2645-2654, 2012. [doi]

2011

Gcd of multivariate polynomials via Newton polytopesLuiz Emilio Allem, Vilmar Trevisan. amc, 217(21):8377-8386, 2011. [doi]

A note on Gao s algorithm for polynomial factorizationCarlos Hoppen, Virginia M. Rodrigues, Vilmar Trevisan. TCS, 412(16):1508-1522, 2011. [doi]

Algebraic connectivity on a subclass of caterpillarsOscar Rojo, Israel Rocha, Vilmar Trevisan. endm, 37:153-158, 2011. [doi]

Laplacian energy of diameter 3 treesVilmar Trevisan, João B. Carvalho, Renata R. Del-Vecchio, Cybele T. M. Vinagre. appml, 24(6):918-923, 2011. [doi]

2010

A linear model for compound multicommodity network flow problemsCatia M. S. Machado, Sergio F. Mayerle, Vilmar Trevisan. cor, 37(6):1075-1086, 2010. [doi]

Applications of recurrence relations for the characteristic polynomials of Bethe treesMaría Robbiano, Vilmar Trevisan. cma, 59(9):3039-3044, 2010. [doi]

2008

Distance- k knowledge in self-stabilizing algorithmsWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan. TCS, 399(1-2):118-127, 2008. [doi]

2006

Distance-::::k:::: Information in Self-stabilizing AlgorithmsWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan. sirocco 2006: 349-356 [doi]

2005

A modular integer GCD algorithmKenneth Weber, Vilmar Trevisan, Luiz Felipe Martins. jal, 54(2):152-167, 2005. [doi]

2001

An O(n:::2:::) Algorithm for the Characteristic Polynomial of a TreeDavid Pokrass Jacobs, Catia M. S. Machado, Vilmar Trevisan. endm, 7:86-89, 2001. [doi]

1995

Um algoritmo algébrico para isolar zeros de polinômiosDalcidio Moraes Claudio, Maria Angelica Camargo, Vilmar Trevisan. rita, 2(2):93-113, 1995.

The composite character of the twenty-second Fermat numberVilmar Trevisan, João B. Carvalho. tjs, 9(1-2):179-182, 1995. [doi]

1993

Polynomial Factorization Sharp Bounds, Efficient AlgorithmsBernard Beauzamy, Vilmar Trevisan, Paul S. Wang. JSC, 15(4):393-413, 1993.

1991

Practical Factorization of Univariate Polynomials over Finite FieldsVilmar Trevisan, Paul S. Wang. issac 1991: 22-31 [doi]

1990

Recognition of Hurwitz polynomialsVilmar Trevisan. cca, 24(4):26-32, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL