Aman Gour

Papers

Total Citations

H-Index

About

Aman Gour is a theoretical computer scientist whose research centers on graph theory, combinatorics, and discrete algorithms, with a particular emphasis on conflict-free colorings—a concept with far-reaching applications in wireless networking, robotics, and computational geometry. In her seminal 2018 work, "Conflict-Free Coloring of Graphs" (28 citations), Gour established foundational results on assigning colors to vertices so that every vertex sees a unique color in its closed neighborhood, a problem critical for minimizing interference in ad-hoc networks. Her most celebrated contribution, "Three Colors Suffice: Conflict-Free Coloring of Planar Graphs" (2017, 8 citations), proved a tight bound showing that just three colors are always sufficient for planar graphs, resolving a key open question and demonstrating that even complex geometric structures can be efficiently colored. This work has influenced subsequent studies in graph coloring and network design. Gour’s research is characterized by elegant combinatorial proofs and practical algorithmic insights, making her a rising voice in discrete mathematics. Her achievements highlight how theoretical graph problems can directly impact real-world systems, inspiring students to explore the intersection of mathematics and computer science.