Scientific evaluation results for TÜBİTAK 1001 Projects are announced, five projects from GTU are to be granted support.

The scientific evaluation process of the projects proposed to the Research Support Programs Presidency (ARDEB) for 2024's first term call under the "1001-Scientific and Technological Research Projects Funding Program" by TÜBİTAK (The Scientific and Technological Research Council of Türkiye) has been completed, and the results have been announced. Five projects from Gebze Technical University (GTU) academics have earned to receive support.

The academics from GTU and their research projects to be supported under the "1001-Scientific and Technological Research Projects Funding Program" are as follows:

Prof. Didem Gözüpek-Kocaman from GTU Faculty of Engineering, Department of Computer Engineering, has received support for the project titled “Criticality in Packing Coloring of Graphs”.

About the project: Graph theory is a versatile and interdisciplinary research area with wide-ranging applications in various fields such as computer science, telecommunications, industrial engineering, biology, and social sciences. The project will address various packing coloring problems in graphs. The concept of packing coloring has widespread applications, particularly in frequency assignment for wireless networks, where distance requirements play a crucial role. The frequency assignment problem involves assigning frequencies to transmitters in a wireless network.

In a broadcasting network, each transmitter is assigned a frequency channel for its transmissions. Considering both civilian and military applications, the increasing demand leads to spectrum scarcity. Therefore, minimizing the frequency range while preventing interference is a fundamental need, and various studies are being conducted in this regard. The packing coloring approach addressed in this project models the requirement that stations assigned the same broadcast frequency must be far enough apart not to interfere with each other. Additionally, in communication networks, evaluating the network's adaptability in the face of node or link failures is essential. The concept of criticality in graphs is used in these evaluations to understand how the parameters of the network change under specific conditions. Therefore, the project focuses on exploring different aspects of criticality in the packing coloring of graphs, aiming to obtain various characterizations and develop recognition algorithms.

Please click for detailed news.

All News