EDBT 2026 Demo / reviewers in the wild / expert
Vilmar Trevisan
dblp:49/299
· DBLP profile ↗
19ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0002-7053-8530ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 18 · 1 first-author · 4 since 2021Systems, architecture and hardware · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Locating eigenvalues of matrogenic graphs in linear time
Nelson Assis, Vilmar Trevisan |
Discret. Appl. Math. | 2 |
| 2025 | Fast Gaussian Elimination for Low Treewidth Matrices
Martin Fürer, Carlos Hoppen, Vilmar Trevisan |
ESA | 3 |
| 2025 | Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
Martin Fürer, Carlos Hoppen, Vilmar Trevisan |
Theor. Comput. Sci. | 3 |
| 2023 | Exploring symmetries in cographs: Obtaining spectra and energies
Átila A. Jones, Vilmar Trevisan, Cybele T. M. Vinagre |
Discret. Appl. Math. | 2 |
| 2020 | Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small TreewidthabstractLet M = (m_{ij}) be a symmetric matrix of order n and let G be the graph with vertex set {1,…,n} such that distinct vertices i and j are adjacent if and only if m_{ij} ≠ 0. We introduce a dynamic programming algorithm that finds a diagonal matrix that is congruent to M. If G is given with a tree decomposition 𝒯 of width k, then this can be done in time O(k|𝒯| + k² n), where |𝒯| denotes the number of nodes in 𝒯. Martin Fürer, Carlos Hoppen, Vilmar Trevisan |
ICALP | 3 |
| 2020 | Null decomposition of unicyclic graphs
Luiz Emilio Allem, Daniel A. Jaume, Gonzalo Molina, Maikon M. Toledo, Vilmar Trevisan |
Discret. Appl. Math. | 5 |
| 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. | 5 |
| 2018 | Locating the Eigenvalues for Graphs of Small Clique-Width
Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan |
LATIN | 4 |
| 2018 | Eigenvalue location in cographs
David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura |
Discret. Appl. Math. | 2 |
| 2017 | Maximum Laplacian energy of unicyclic graphs
Kinkar Chandra Das, Eliseu Fritscher, Lucélia Kowalski Pinheiro, Vilmar Trevisan |
Discret. Appl. Math. | 4 |
| 2014 | Bounding the sum of the largest Laplacian eigenvalues of graphs
Israel Rocha, Vilmar Trevisan |
Discret. Appl. Math. | 2 |
| 2013 | Extracting sparse factors from multivariate integral polynomials
Luiz Emilio Allem, Shuhong Gao, Vilmar Trevisan |
J. Symb. Comput. | 3 |
| 2012 | Computing the Laplacian spectra of some graphs
Domingos Moreira Cardoso, Enide Andrade Martins, María Robbiano, Vilmar Trevisan |
Discret. Appl. Math. | 4 |
| 2011 | A note on Gao's algorithm for polynomial factorization
Carlos Hoppen, Virginia M. Rodrigues, Vilmar Trevisan |
Theor. Comput. Sci. | 3 |
| 2008 | Distance- k knowledge in self-stabilizing algorithms
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan |
Theor. Comput. Sci. | 4 |
| 2006 | Distance-k Information in Self-stabilizing Algorithms
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan |
SIROCCO | 4 |
| 1995 | The composite character of the twenty-second Fermat number
Vilmar Trevisan, João B. Carvalho |
J. Supercomput. | 1 |
| 1993 | Polynomial Factorization Sharp Bounds, Efficient Algorithms
Bernard Beauzamy, Vilmar Trevisan, Paul S. Wang |
J. Symb. Comput. | 2 |
| 1991 | Practical Factorization of Univariate Polynomials over Finite FieldsabstractArticle Practical factorization of univariate polynomials over finite fields Share on Authors: Vilmar Trevisan Department of Mathematics and Computer Science, Kent State University, Kent, Ohio Department of Mathematics and Computer Science, Kent State University, Kent, OhioView Profile , Paul Wang Department of Mathematics and Computer Science, Kent State University, Kent, Ohio Department of Mathematics and Computer Science, Kent State University, Kent, OhioView Profile Authors Info & Claims ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computationJune 1991 Pages 22–31https://doi.org/10.1145/120694.120698Published:01 June 1991 2citation353DownloadsMetricsTotal Citations2Total Downloads353Last 12 Months0Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Vilmar Trevisan, Paul S. Wang |
ISSAC | 1 |