default search action
Vilmar Trevisan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j39]Francesco Belardo
, Elismar R. Oliveira
Limit points of (signless) Laplacian spectral radii of linear trees. Appl. Math. Comput. 477: 128819 (2024) - [j38]David Sossa, Vilmar Trevisan
Graphs sharing an arbitrary number of ordered complementarity eigenvalues. Discret. Math. 347(3): 113788 (2024) - 2023
- [j37]Átila A. Jones
Exploring symmetries in cographs: Obtaining spectra and energies. Discret. Appl. Math. 325: 120-133 (2023) - 2021
- [j36]Francesco Belardo
Locating eigenvalues of unbalanced unicyclic signed graphs. Appl. Math. Comput. 400: 126082 (2021) - [j35]David Pokrass Jacobs, Elismar R. Oliveira
Most Laplacian eigenvalues of a tree are small. J. Comb. Theory B 146: 1-33 (2021) - [i2]Martin Fürer, Carlos Hoppen, Vilmar Trevisan:
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. CoRR abs/2109.02515 (2021) - 2020
- [j34]Luiz Emilio Allem
Independence and matching numbers of unicyclic graphs from null space. Comput. Appl. Math. 39(2) (2020) - [j33]Luiz Emilio Allem
Null decomposition of unicyclic graphs. Discret. Appl. Math. 285: 594-611 (2020) - [j32]K. Pinheiro, Bruna S. Souza, Vilmar Trevisan:
Determining graphs by the complementary spectrum. Discuss. Math. Graph Theory 40(2): 607-620 (2020) - [c4]Martin Fürer
Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ICALP 2020: 52:1-52:18
2010 – 2019
- 2019
- [j31]Rodrigo Grijó, Leonardo Silva de Lima
Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues. Discret. Appl. Math. 267: 176-183 (2019) - 2018
- [j30]Luiz Emilio Allem
Partial Characterization of Graphs Having a Single Large Laplacian Eigenvalue. Electron. J. Comb. 25(4): 4 (2018) - [j29]David Pokrass Jacobs
Eigenvalue location in cographs. Discret. Appl. Math. 245: 220-235 (2018) - [j28]Lucélia Kowalski Pinheiro, Vilmar Trevisan
Maximality of the signless Laplacian energy. Discret. Math. 341(1): 33-41 (2018) - [c3]Martin Fürer
Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN 2018: 475-489 - 2017
- [j27]Kinkar Chandra Das, Eliseu Fritscher, Lucélia Kowalski Pinheiro, Vilmar Trevisan
Maximum Laplacian energy of unicyclic graphs. Discret. Appl. Math. 218: 71-81 (2017) - [j26]João Carvalho, Bruna S. Souza, Vilmar Trevisan
Exponentially many graphs have a Q-cospectral mate. Discret. Math. 340(9): 2079-2085 (2017) - [j25]Luiz Emilio Allem
On graphs with a single large Laplacian eigenvalue. Electron. Notes Discret. Math. 62: 297-302 (2017) - [j24]Domingos M. Cardoso
Laplacian Distribution and Domination. Graphs Comb. 33(5): 1283-1295 (2017) - 2016
- [j23]Ali Mohammadian, Vilmar Trevisan
Some spectral properties of cographs. Discret. Math. 339(4): 1261-1264 (2016) - [j22]Stephen T. Hedetniemi, David Pokrass Jacobs
Domination number and Laplacian eigenvalue distribution. Eur. J. Comb. 53: 66-71 (2016) - [j21]Eliseu Fritscher, Vilmar Trevisan
Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum. SIAM J. Matrix Anal. Appl. 37(1): 260-289 (2016) - 2015
- [j20]Christoph Helmberg, Vilmar Trevisan
Threshold graphs of maximal Laplacian energy. Discret. Math. 338(7): 1075-1084 (2015) - [j19]Renata R. Del-Vecchio
Diagonalization of generalized lollipop graphs. Electron. Notes Discret. Math. 50: 41-46 (2015) - 2014
- [j18]Israel Rocha
Bounding the sum of the largest Laplacian eigenvalues of graphs. Discret. Appl. Math. 170: 95-103 (2014) - [j17]David Pokrass Jacobs, Vilmar Trevisan
Computing the Characteristic Polynomial of Threshold Graphs. J. Graph Algorithms Appl. 18(5): 709-719 (2014) - 2013
- [j16]Rodrigo O. Braga
On the distribution of Laplacian eigenvalues of trees. Discret. Math. 313(21): 2382-2389 (2013) - [j15]Luiz Emilio Allem
Extracting sparse factors from multivariate integral polynomials. J. Symb. Comput. 52: 3-16 (2013) - [i1]Eliseu Fritscher, Carlos Hoppen, Vilmar Trevisan:
Unicyclic Graphs with equal Laplacian Energy. CoRR abs/1304.1221 (2013) - 2012
- [j14]Domingos M. Cardoso
Computing the Laplacian spectra of some graphs. Discret. Appl. Math. 160(18): 2645-2654 (2012) - 2011
- [j13]Luiz Emilio Allem
Gcd of multivariate polynomials via Newton polytopes. Appl. Math. Comput. 217(21): 8377-8386 (2011) - [j12]Vilmar Trevisan
Laplacian energy of diameter 3 trees. Appl. Math. Lett. 24(6): 918-923 (2011) - [j11]Oscar Rojo, Israel Rocha
Algebraic connectivity on a subclass of caterpillars. Electron. Notes Discret. Math. 37: 153-158 (2011) - [j10]Carlos Hoppen
A note on Gao's algorithm for polynomial factorization. Theor. Comput. Sci. 412(16): 1508-1522 (2011) - 2010
- [j9]María Robbiano, Vilmar Trevisan
Applications of recurrence relations for the characteristic polynomials of Bethe trees. Comput. Math. Appl. 59(9): 3039-3044 (2010) - [j8]Catia Maria dos Santos Machado, Sérgio Fernando Mayerle, Vilmar Trevisan
A linear model for compound multicommodity network flow problems. Comput. Oper. Res. 37(6): 1075-1086 (2010)
2000 – 2009
- 2008
- [j7]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. 399(1-2): 118-127 (2008) - 2006
- [c2]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
Distance-k Information in Self-stabilizing Algorithms. SIROCCO 2006: 349-356 - 2005
- [j6]Kenneth Weber, Vilmar Trevisan
A modular integer GCD algorithm. J. Algorithms 54(2): 152-167 (2005) - 2001
- [j5]David Pokrass Jacobs, Catia Maria dos Santos Machado, Vilmar Trevisan:
An O(n2) Algorithm for the Characteristic Polynomial of a Tree. Electron. Notes Discret. Math. 7: 86-89 (2001)
1990 – 1999
- 1995
- [j4]Dalcidio Moraes Claudio, Maria Angelica Camargo, Vilmar Trevisan:
Um algoritmo algébrico para isolar zeros de polinômios. RITA 2(2): 93-113 (1995) - [j3]Vilmar Trevisan
The composite character of the twenty-second Fermat number. J. Supercomput. 9(1-2): 179-182 (1995) - 1993
- [j2]Bernard Beauzamy, Vilmar Trevisan
Polynomial Factorization Sharp Bounds, Efficient Algorithms. J. Symb. Comput. 15(4): 393-413 (1993) - 1991
- [c1]Vilmar Trevisan
Practical Factorization of Univariate Polynomials over Finite Fields. ISSAC 1991: 22-31 - 1990
- [j1]Vilmar Trevisan
Recognition of Hurwitz polynomials. SIGSAM Bull. 24(4): 26-32 (1990)
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:25 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: