Daniel Lokshtanov
About
In The Last Decade
Daniel Lokshtanov
146 papers receiving 2.3k citations
Hit Papers
Peers
Comparison fields: 5 of 80
- Computational Theory and Mathematics 2.0k
- Computer Networks and Communications 772
- Discrete Mathematics and Combinatorics 333
- Artificial Intelligence 284
- Electrical and Electronic Engineering 174
Countries citing papers authored by Daniel Lokshtanov
This map shows the geographic impact of Daniel Lokshtanov'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 Daniel Lokshtanov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Lokshtanov more than expected).
Fields of papers citing papers by Daniel Lokshtanov
This network shows the impact of papers produced by Daniel Lokshtanov. 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 Daniel Lokshtanov. The network helps show where Daniel Lokshtanov may publish in the future.
Co-authorship network of co-authors of Daniel Lokshtanov
This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Lokshtanov. A scholar is included among the top collaborators of Daniel Lokshtanov 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 Daniel Lokshtanov. Daniel Lokshtanov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 4 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 2 | |
| 6 | 2 | |
| 7 | 0 | |
| 8 | Polylogarithmic approximation algorithms for weighted-F-Deletion problems | 4 |
| 9 | 3 | |
| 10 | 1 | |
| 11 | 2 | |
| 12 | Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems | 1 |
| 13 | 3 | |
| 14 | 30 | |
| 15 | Near-Optimal Bounds for Cross-Validation via Loss Stability | 4 |
| 16 | 11 | |
| 17 | 22 | |
| 18 | 59 | |
| 19 | Local search: is brute-force avoidable? | 15 |
| 20 | 15 |
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.