基本信息
浏览量:496
职业迁徙
个人简介
I am interested in designing efficient algorithms (or prove it does not exist) for hard problems arising in every domain. In particular I design algorithms whose running time is analyzed in terms of different input parameters. In particular, I am interested in Multivariate Complexity or its two variable avatar Parameterized Complexity. My other interests include Graph Theory, Matroids, Matching Theory and Approximation Algorithms. In short my current research interests include:
Parameterized Complexity
Moderately Exponential Time Algorithms
Graph Theory
Approximation Algorithms
Parameterized Complexity
Moderately Exponential Time Algorithms
Graph Theory
Approximation Algorithms
研究兴趣
论文共 554 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Innovations in Theoretical Computer Sciencepp.64:1-64:22, (2024)
CoRR (2024): 225-240
Algorithmicapp.1-43, (2024)
Conference on Current Trends in Theory and Practice of Informaticspp.96-110, (2024)
arxiv(2024)
引用0浏览0引用
0
0
Pallavi Jain,Lawqueen Kanesh,Fahad Panolan, Souvik Saha,Abhishek Sahu,Saket Saurabh, Anannya Upasana
Latin American Symposium on Theoretical Informaticspp.223-237, (2024)
Latin American Symposium on Theoretical Informaticspp.177-192, (2024)
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn