Reading Manga
Dynamic Co-Founder and CTO with extensive expertise in pioneering IoT and machine learning innovations focused on enhancing food quality and safety in the agri-tech sector. Specializes in driving the development of complex software architectures and data analytics platforms, leading teams to deliver impactful technological solutions. Recognized nationally and internationally for advancing the application of cutting-edge technologies in agriculture.
Focused research on the Parameterized Complexity of Graph Algorithms and authored a academic paper.
Large dataset management
undefinedAll Publications are published in refreed Confrences and Journals
1. "Greed is Good for Deterministic Scale-Free Networks" Algorithmica, June 19, 2020 Explores deterministic conditions in real-world networks like social media platforms, showing how these can be leveraged to design faster algorithms for graph problems.
2. "Supporting Internet-based Location for Location-based Access Control in Enterprise Cloud Storage Solution" International Conference on Advanced Information Networking and Applications (AINA), March 16, 2019 Introduces an extension of the Location-Based Access Control model that incorporates Internet-based geolocation, enhancing security for cloud storage environments.
3. "Schelling Segregation with Strategic Agents" Symposium on Algorithmic Game Theory (SAGT), June 1, 2018 Analyzes a game-theoretic version of Schelling's segregation model, providing new insights into the dynamics and efficiency of strategic location choices.
4. "Selfish Network Creation with Non-Uniform Edge Cost" International Symposium on Algorithmic Game Theory (SAGT), September 1, 2017 Investigates the game dynamics and computational complexity of network creation games with non-uniform edge costs, demonstrating a constant Price of Anarchy.
5. "Approximating Optimization Problems using EAs on Scale-Free Networks" Genetic and Evolutionary Computation Conference (GECCO), July 7, 2017 Studies the approximation capabilities of evolutionary algorithms on networks that exhibit scale-free properties, detailing how these algorithms perform under various computational scenarios.
6. "On Selfish Creation of Robust Networks" Springer, July 5, 2016 Examines robustness in networks formed by selfish agents, contributing to the understanding of network stability and structural properties in the absence of central authority.
7. "Parameterized Analogues of Probabilistic Computation" Algorithms and Discrete Applied Mathematics, Lecture Notes in Computer Science, Volume 8959, pp 181-192 Introduces a new class within parameterized complexity, translating classical probabilistic computation properties to parameterized contexts.
Reading Manga
VolleyBall