Somnath Sikdar
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 10%
- Discrete Mathematics and Combinatorics top 10%
- Artificial Intelligence
- Electrical and Electronic Engineering
- Co-authors
- Venkatesh RamanHannes MoserSaket SaurabhPeter RossmanithFelix ReidlAlexander LangerMeena MahajanGeevarghese Philip
- Topics
- Advanced Graph Theory Research (21 papers)Complexity and Algorithms in Graphs (16 papers)Graph Labeling and Dimension Problems (5 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
In The Last Decade
Somnath Sikdar
23 papers receiving 244 citations
Peers
Comparison fields: 5 of 24
- Computational Theory and Mathematics 238
- Computer Networks and Communications 77
- Discrete Mathematics and Combinatorics 42
- Artificial Intelligence 36
- Electrical and Electronic Engineering 31
Countries citing papers authored by Somnath Sikdar
This map shows the geographic impact of Somnath Sikdar's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Somnath Sikdar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Somnath Sikdar more than expected).
Fields of papers citing papers by Somnath Sikdar
This network shows the impact of papers produced by Somnath Sikdar. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Somnath Sikdar. The network helps show where Somnath Sikdar may publish in the future.
Co-authorship network of co-authors of Somnath Sikdar
This figure shows the co-authorship network connecting the top 25 collaborators of Somnath Sikdar. A scholar is included among the top collaborators of Somnath Sikdar based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Somnath Sikdar. Somnath Sikdar is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 11 | |
| 3 | 7 | |
| 4 | 14 | |
| 5 | Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. | 3 |
| 6 | Kernelization Using Structural Parameters on Sparse Graph Classes | 10 |
| 7 | 8 | |
| 8 | Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Extended Abstract) | 2 |
| 9 | 11 | |
| 10 | 19 | |
| 11 | 16 | |
| 12 | 2 | |
| 13 | 6 | |
| 14 | 16 | |
| 15 | PARAMETERIZING FROM THE EXTREMES: FEASIBLE PARAMETERIZATIONS OF SOME NP-OPTIMIZATION PROBLEMS | 1 |
| 16 | 1 | |
| 17 | 37 | |
| 18 | 35 | |
| 19 | 4 | |
| 20 | 28 |
About Somnath Sikdar
Somnath Sikdar is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Networks and Communications, having authored 23 papers that have together received 264 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (21 papers), Complexity and Algorithms in Graphs (16 papers) and Graph Labeling and Dimension Problems (5 papers). The work is most often cited by research in Computational Theory and Mathematics (238 citations), Discrete Mathematics and Combinatorics (42 citations) and Computer Graphics and Computer-Aided Design (12 citations). Somnath Sikdar has collaborated with scholars based in Germany, India and Czechia. Frequent co-authors include Venkatesh Raman, Hannes Moser, Saket Saurabh, Peter Rossmanith, Felix Reidl, Alexander Langer, Meena Mahajan, Geevarghese Philip, Petr Hliněný and Neeldhara Misra. Their work appears in journals such as Journal of Computer and System Sciences, Discrete Applied Mathematics and Journal of Combinatorial Theory Series B.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.