I speak
Conferences & Workshops
-
Talk: Computing fixed point free automorphisms of graphs
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
Talk: Graph energy of highly regular graphs (video)
-
Talk: A graph energy conjecture through the lenses of semidefinite programming (abstract)
-
Talk: Spectral upper bounds for the Grundy number of a graph
-
Talk: Computing Fixed Point Free Automorphisms of Graph Classes (abstract)
-
Lightning talk: Matching (Multi)Cut (abstracts)
-
Open problem section: Rainbow Stacking of Random Edge-Colorings
-
Talk: Forbidden structures in integral trees
-
Poster: Spectral bounds for the Grundy number
-
Poster: Strongly Cospectral Vertices in Trees
Seminars
-
Talk: On the connection between max-cuts, the vector chromatic number, and random sphere graphs
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
Talk: Computing Fixed Point Free Automorphisms of Graph Classes
-
Talk: Grundy number and the matching polynomial
-
Talk: Strongly Cospectral Vertices in Trees (video)