Network Theory and Combinatorial Optimization

His research lies in the area of combinatorial optimization on networks, with a particular focus on resource allocation under interaction constraints. While matching problems seek optimal pairings between agents—for example, assigning workers to firms, students to schools, or donors to recipients—graph coloring addresses a complementary class of problems in which scarce resources must be assigned across a network while avoiding conflicts. Examples include allocating communication frequencies, scheduling activities, assigning processors in distributed systems, or organizing tasks that cannot occur simultaneously. Both matching and coloring study how network structure determines the existence and efficiency of feasible allocations, making them fundamental tools in modern network science and closely related to several questions studied in network economics.

He has worked on total coloring and strong coloring, two fundamental graph-coloring problems that have been central topics in graph theory for several decades. At their core, these problems seek to determine the minimum number of colors required under increasingly restrictive adjacency and incidence constraints. Despite their deceptively simple formulation, many fundamental questions—including exact coloring numbers, structural characterizations, and long-standing conjectures—remain unresolved even for important classes of graphs. His work develops structural and combinatorial techniques for establishing optimal coloring results across a broad range of graph families. By combining structural analysis with constructive methods, he obtains exact coloring results and establish new sufficient conditions for these fundamental graph-coloring problems.

Publications:

Analytic Theory of Polynomials

Polynomials are among the most fundamental objects in mathematics, with applications ranging from approximation theory and numerical computation to control theory and optimization. A central problem in complex analysis is understanding the location of the zeros of polynomials and establishing inequalities that describe their behaviour. These questions have been studied extensively for over a century and continue to play an important role in classical analysis and its applications.

His research develops new inequalities and improved bounds for the location of polynomial zeros in the complex plane. This work extends several classical results in polynomial theory and contributes to the broader literature on complex analysis and analytic inequalities by providing improved estimates and new theoretical insights into the geometry of polynomial zeros.

Publications