The following pages link to Vilmar Trevisan (Q307804):
Displayed 50 items.
- Distribution of Laplacian eigenvalues of graphs (Q307805) (← links)
- Diagonalization of generalized lollipop graphs (Q324717) (← links)
- Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy (Q332628) (← links)
- An existence theorem on fractional deleted graphs (Q343264) (← links)
- The geometric realization of monomial ideal rings and a theorem of Trevisan (Q360558) (← links)
- On the distribution of Laplacian eigenvalues of trees (Q389451) (← links)
- The \(M\)-principal graph of a commutative ring (Q397091) (← links)
- Counting decomposable multivariate polynomials (Q429753) (← links)
- Algebraic computation of resolvents without extraneous powers (Q444389) (← links)
- Eigenvalues and energy in threshold graphs (Q471959) (← links)
- Term-ordering free involutive bases (Q480676) (← links)
- Regular graphs of large girth and arbitrary degree (Q485001) (← links)
- Gcd of multivariate polynomials via Newton polytopes (Q545987) (← links)
- Locating the eigenvalues of trees (Q609482) (← links)
- A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
- A new strategy for generating shortest addition sequences (Q644844) (← links)
- Partial characterization of graphs having a single large Laplacian eigenvalue (Q668039) (← links)
- A fast and stable algorithm for splitting polynomials (Q679271) (← links)
- On size, order, diameter and edge-connectivity of graphs (Q682097) (← links)
- Polynomial factorization: Sharp bounds, efficient algorithms (Q689110) (← links)
- Maximum Laplacian energy of unicyclic graphs (Q730488) (← links)
- (Q813191) (redirect page) (← links)
- Factorization properties of Chebyshev polynomials (Q813193) (← links)
- Algorithms for near solutions to polynomial equations (Q840709) (← links)
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity (Q862343) (← links)
- Domination number and Laplacian eigenvalue distribution (Q901155) (← links)
- Distance-\(k\) knowledge in self-stabilizing algorithms (Q930908) (← links)
- On Smale's 17th problem: a probabilistic positive solution (Q937276) (← links)
- Applications of recurrence relations for the characteristic polynomials of Bethe trees (Q988337) (← links)
- Differential invariants of a Lie group action: syzygies on a generating set (Q1008571) (← links)
- (Q1293967) (redirect page) (← links)
- Solving zero-dimensional systems through the rational univariate representation (Q1293968) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- The determinant of a tree's neighborhood matrix (Q1355240) (← links)
- A subspace method for the computation of the GCD of polynomials (Q1361353) (← links)
- A fast algorithm for polynomial factorization over \(\mathbb Q_p\) (Q1396437) (← links)
- Resolvent representation for regular differential ideals (Q1566397) (← links)
- New structure theorem for subresultants (Q1569836) (← links)
- An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences (Q1570128) (← links)
- Computing triangular systems and regular systems (Q1582304) (← links)
- Algorithms for computing sparse shifts for multivariate polynomials (Q1583886) (← links)
- On short multiplications and divisions (Q1583887) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← links)
- The multiplication table problem for bipartite graphs (Q1669691) (← links)
- Adventures in graph theory (Q1675045) (← links)
- Laplacian distribution and domination (Q1684945) (← links)
- Eigenvalue location in cographs (Q1752501) (← links)
- Computing the Laplacian spectra of some graphs (Q1759840) (← links)
- Gröbner bases for complete uniform families (Q1870286) (← links)
- The composite character of the twenty-second Fermat number (Q1898714) (← links)