Dušan Knop
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 20
- Complexity and Algorithms in Graphs 13
- Graph Labeling and Dimension Problems 6
-
- Constraint Satisfaction and Optimization 6
- Optimization and Search Problems 5
- Co-authors
- Pavel Dvořák (3 shared papers)Robert Ganian (7 shared papers)Robert Bredereck (8 shared papers)Tomáš Gavenčiak (4 shared papers)Sebastian Ordyniak (5 shared papers)Rolf Niedermeier (6 shared papers)Matthias Mnich (3 shared papers)Piotr Faliszewski (1 shared paper)
In The Last Decade
Dušan Knop
29 papers receiving 115 citations
Peers
Comparison fields: 5 of 22
- Computational Theory and Mathematics 82
- Discrete Mathematics and Combinatorics 7
- Industrial and Manufacturing Engineering 21
- Management Science and Operations Research 25
- Computer Networks and Communications 32
Countries citing papers authored by Dušan Knop
This map shows the geographic impact of Dušan Knop'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 Dušan Knop with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dušan Knop more than expected).
Fields of papers citing papers by Dušan Knop
This network shows the impact of papers produced by Dušan Knop. 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 Dušan Knop. The network helps show where Dušan Knop may publish in the future.
Co-authors
The 23 scholars most cited alongside Dušan Knop, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 40 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2017 | 13 | |
| 2 | 2019 | 9 | |
| 3 | 2020 | 9 | |
| 4 | 2020 | 9 | |
| 5 | 2018 | 9 | |
| 6 | 2020 | 9 | |
| 7 | 2020 | 6 | |
| 8 | 2019 | 6 | |
| 9 | 2021 | 5 | |
| 10 | 2018 | 5 | |
| 11 | 2017 | 4 | |
| 12 | 2022 | 4 | |
| 13 | 2019 | 3 | |
| 14 | 2019 | 3 | |
| 15 | 2021 | 3 | |
| 16 | 2021 | 3 | |
| 17 | 2019 | 2 | |
| 18 | 2019 | 2 | |
| 19 | 2022 | 2 | |
| 20 | Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. | 2017 | 1 |
About Dušan Knop
Dušan Knop is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Economics and Econometrics, Artificial Intelligence and Management Science and Operations Research, having authored 40 papers that have together received 117 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (13 papers), Game Theory and Voting Systems (11 papers), Graph Labeling and Dimension Problems (6 papers), Constraint Satisfaction and Optimization (6 papers), Optimization and Search Problems (5 papers), Game Theory and Applications (3 papers) and Robotic Path Planning Algorithms (3 papers). The work is most often cited by research in Computational Theory and Mathematics (82 citations), Discrete Mathematics and Combinatorics (7 citations), Industrial and Manufacturing Engineering (21 citations), Management Science and Operations Research (25 citations) and Computer Networks and Communications (32 citations). Dušan Knop has collaborated with scholars based in Czechia, Germany and Austria. Frequent co-authors include Pavel Dvořák, Robert Ganian, Robert Bredereck, Tomáš Gavenčiak, Sebastian Ordyniak, Rolf Niedermeier, Matthias Mnich, Piotr Faliszewski, Shmuel Onn and Fedor V. Fomin. Their work appears in journals such as Autonomous Agents and Multi-Agent Systems, Discrete Applied Mathematics, Discrete Optimization, Artificial Intelligence and Algorithmica.
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.