Vilmar Trevisan

51 papers A* 1A 1B 3Journal 46

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Limit points for the spectral radii of unbalanced signed graphs. Discret. Math. Maurizio Brunetti, Vilmar Trevisan
2026	J	`jnl`	Locating eigenvalues of matrogenic graphs in linear time. Discret. Appl. Math. Nelson Assis, Vilmar Trevisan
2026	J	`jnl`	The Critical Index of Brouwer's conjecture. Eur. J. Comb. Guilherme Torres, Vilmar Trevisan
2025	J	`jnl`	An Interlacing Property of the Signless Laplacian of Threshold Graphs. Electron. J. Comb. Christoph Helmberg, Guilherme Porto, Guilherme Torres, Vilmar Trevisan
2025	J	`jnl`	Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. Theor. Comput. Sci. Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2025	A	`conf`	Fast Gaussian Elimination for Low Treewidth Matrices. ESA Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2024	J	`jnl`	Graphs sharing an arbitrary number of ordered complementarity eigenvalues. Discret. Math. David Sossa, Vilmar Trevisan
2024	J	`jnl`	Limit points of (signless) Laplacian spectral radii of linear trees. Appl. Math. Comput. Francesco Belardo, Elismar R. Oliveira, Vilmar Trevisan
2023	J	`jnl`	Exploring symmetries in cographs: Obtaining spectra and energies. Discret. Appl. Math. Átila A. Jones, Vilmar Trevisan, Cybele T. M. Vinagre
2021	J	`jnl`	Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. CoRR Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2021	J	`jnl`	Locating eigenvalues of unbalanced unicyclic signed graphs. Appl. Math. Comput. Francesco Belardo, Maurizio Brunetti, Vilmar Trevisan
2021	J	`jnl`	Most Laplacian eigenvalues of a tree are small. J. Comb. Theory B David Pokrass Jacobs, Elismar R. Oliveira, Vilmar Trevisan
2020	J	`jnl`	Determining graphs by the complementary spectrum. Discuss. Math. Graph Theory K. Pinheiro, Bruna S. Souza, Vilmar Trevisan
2020	A*	`conf`	Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ICALP Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2020	J	`jnl`	Independence and matching numbers of unicyclic graphs from null space. Comput. Appl. Math. Luiz Emilio Allem, Daniel A. Jaume, Gonzalo Molina, Maikon M. Toledo, Vilmar Trevisan
2020	J	`jnl`	Null decomposition of unicyclic graphs. Discret. Appl. Math. Luiz Emilio Allem, Daniel A. Jaume, Gonzalo Molina, Maikon M. Toledo, Vilmar Trevisan
2019	J	`jnl`	Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues. Discret. Appl. Math. Rodrigo Grijó, Leonardo Silva de Lima, Carla Silva Oliveira, Guilherme Porto, Vilmar Trevisan
2018	J	`jnl`	Eigenvalue location in cographs. Discret. Appl. Math. David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura
2018	B	`conf`	Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan
2018	J	`jnl`	Maximality of the signless Laplacian energy. Discret. Math. Lucélia Kowalski Pinheiro, Vilmar Trevisan
2018	J	`jnl`	Partial Characterization of Graphs Having a Single Large Laplacian Eigenvalue. Electron. J. Comb. Luiz Emilio Allem, Antonio Cafure, Ezequiel Dratman, Luciano N. Grippo, Martín D. Safe, Vilmar Trevisan
2017	J	`jnl`	Exponentially many graphs have a Q-cospectral mate. Discret. Math. João Carvalho, Bruna S. Souza, Vilmar Trevisan, Fernando Tura
2017	J	`jnl`	Laplacian Distribution and Domination. Graphs Comb. Domingos M. Cardoso, David Pokrass Jacobs, Vilmar Trevisan
2017	J	`jnl`	Maximum Laplacian energy of unicyclic graphs. Discret. Appl. Math. Kinkar Chandra Das, Eliseu Fritscher, Lucélia Kowalski Pinheiro, Vilmar Trevisan
2017	J	`jnl`	On graphs with a single large Laplacian eigenvalue. Electron. Notes Discret. Math. Luiz Emilio Allem, Antonio Cafure, Ezequiel Dratman, Luciano N. Grippo, Martín Darío Safe, Vilmar Trevisan
2016	J	`jnl`	Domination number and Laplacian eigenvalue distribution. Eur. J. Comb. Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2016	J	`jnl`	Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum. SIAM J. Matrix Anal. Appl. Eliseu Fritscher, Vilmar Trevisan
2016	J	`jnl`	Some spectral properties of cographs. Discret. Math. Ali Mohammadian, Vilmar Trevisan
2015	J	`jnl`	Diagonalization of generalized lollipop graphs. Electron. Notes Discret. Math. Renata R. Del-Vecchio, David Pokrass Jacobs, Vilmar Trevisan, Cybele T. M. Vinagre
2015	J	`jnl`	Threshold graphs of maximal Laplacian energy. Discret. Math. Christoph Helmberg, Vilmar Trevisan
2014	J	`jnl`	Bounding the sum of the largest Laplacian eigenvalues of graphs. Discret. Appl. Math. Israel Rocha, Vilmar Trevisan
2014	J	`jnl`	Computing the Characteristic Polynomial of Threshold Graphs. J. Graph Algorithms Appl. David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura
2013	J	`jnl`	Extracting sparse factors from multivariate integral polynomials. J. Symb. Comput. Luiz Emilio Allem, Shuhong Gao, Vilmar Trevisan
2013	J	`jnl`	On the distribution of Laplacian eigenvalues of trees. Discret. Math. Rodrigo O. Braga, Virginia M. Rodrigues, Vilmar Trevisan
2013	J	`jnl`	Unicyclic Graphs with equal Laplacian Energy CoRR Eliseu Fritscher, Carlos Hoppen, Vilmar Trevisan
2012	J	`jnl`	Computing the Laplacian spectra of some graphs. Discret. Appl. Math. Domingos M. Cardoso, Enide Andrade Martins, María Robbiano, Vilmar Trevisan
2011	J	`jnl`	A note on Gao's algorithm for polynomial factorization. Theor. Comput. Sci. Carlos Hoppen, Virginia M. Rodrigues, Vilmar Trevisan
2011	J	`jnl`	Algebraic connectivity on a subclass of caterpillars. Electron. Notes Discret. Math. Oscar Rojo, Israel Rocha, Vilmar Trevisan
2011	J	`jnl`	Gcd of multivariate polynomials via Newton polytopes. Appl. Math. Comput. Luiz Emilio Allem, Vilmar Trevisan
2011	J	`jnl`	Laplacian energy of diameter 3 trees. Appl. Math. Lett. Vilmar Trevisan, João B. Carvalho, Renata R. Del-Vecchio, Cybele T. M. Vinagre
2010	J	`jnl`	A linear model for compound multicommodity network flow problems. Comput. Oper. Res. Catia Maria dos Santos Machado, Sérgio Fernando Mayerle, Vilmar Trevisan
2010	J	`jnl`	Applications of recurrence relations for the characteristic polynomials of Bethe trees. Comput. Math. Appl. María Robbiano, Vilmar Trevisan
2008	J	`jnl`	Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2006	B	`conf`	Distance- SIROCCO Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2005	J	`jnl`	A modular integer GCD algorithm. J. Algorithms Kenneth Weber, Vilmar Trevisan, Luiz Felipe Martins
2001	J	`jnl`	An O(n Electron. Notes Discret. Math. David Pokrass Jacobs, Catia Maria dos Santos Machado, Vilmar Trevisan
1995	J	`jnl`	The composite character of the twenty-second Fermat number. J. Supercomput. Vilmar Trevisan, João B. Carvalho
1995	J	`jnl`	Um algoritmo algébrico para isolar zeros de polinômios. RITA Dalcidio Moraes Claudio, Maria Angelica Camargo, Vilmar Trevisan
1993	J	`jnl`	Polynomial Factorization Sharp Bounds, Efficient Algorithms. J. Symb. Comput. Bernard Beauzamy, Vilmar Trevisan, Paul S. Wang
1991	B	`conf`	Practical Factorization of Univariate Polynomials over Finite Fields. ISSAC Vilmar Trevisan, Paul S. Wang
1990	J	`jnl`	Recognition of Hurwitz polynomials. SIGSAM Bull. Vilmar Trevisan