Emanuel Juliano

PhD student

Emanuel Juliano is a PhD student in Computer Science at UFMG, supervised by Gabriel Coutinho, working on algebraic graph theory, extremal combinatorics, graph spectra, semidefinite programming, and quantum computing. He visited Aida Abiad at Eindhoven University of Technology in 2025 and is visiting Chris Godsil at the University of Waterloo in fall 2026. He received a 2025 Google PhD Fellowship in Algorithms and Optimization.

Supervisor: Gabriel Coutinho

Publications

Projects and Grants

Spectral and extremal graph theory: algorithmic approaches and quantum applications
PDEG — Computational Mathematics

Academic history

PhD student2023–present
Undergraduate researcher2020–2023

Emanuel Juliano

Publications

The edge-isoperimetric number of graphs and their powers

A graph energy conjecture through the lenses of semidefinite programming

Clique and chromatic numbers of graph powers: spectral bounds and anticodes

Computing fixed point free automorphisms of graphs

On the zero-free region for the chromatic polynomial of graphs with maximum degree Δ and girth g

Tightness of a MaxCut Lower Bound via Vector Chromatic Number

A remark on the Whitney Broken Circuit Theorem

Spectral upper bounds for the Grundy number of a graph

The spectrum of symmetric decorated paths

Forbidden subdivision in integral trees

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration

No perfect state transfer in trees with more than 3 vertices

Strong cospectrality in trees

Quantum walks do not like bridges

Projects and Grants

Academic history