Dušan Knop

440 total citations
40 papers, 111 citations indexed

About

Dušan Knop is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Economics and Econometrics. According to data from OpenAlex, Dušan Knop has authored 40 papers receiving a total of 111 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 13 papers in Computer Networks and Communications and 11 papers in Economics and Econometrics. Recurrent topics in Dušan Knop's work include Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (13 papers) and Game Theory and Voting Systems (11 papers). Dušan Knop is often cited by papers focused on Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (13 papers) and Game Theory and Voting Systems (11 papers). Dušan Knop collaborates with scholars based in Czechia, Germany and Austria. Dušan Knop's co-authors include Pavel Dvořák, Rolf Niedermeier, Tomáš Gavenčiak, Robert Bredereck, Sebastian Ordyniak, Robert Ganian, Matthias Mnich, Piotr Faliszewski, Jiehua Chen and Jiřı́ Fiala and has published in prestigious journals such as Artificial Intelligence, Mathematical Programming and Journal of Computer and System Sciences.

In The Last Decade

Dušan Knop

27 papers receiving 108 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Dušan Knop Czechia	7	79	34	32	25	18	40	111
Sepp Hartung Germany	8	73 0.9×	17 0.5×	19 0.6×	14 0.6×	13 0.7×	16	121
Rajiv Raman United States	8	105 1.3×	12 0.4×	48 1.5×	27 1.1×	12 0.7×	25	160
Luciano Gualà Italy	6	57 0.7×	15 0.4×	45 1.4×	30 1.2×	9 0.5×	34	109
Yuri Faenza United States	7	92 1.2×	16 0.5×	36 1.1×	13 0.5×	23 1.3×	27	141
Ondřej Suchý Czechia	7	79 1.0×	18 0.5×	31 1.0×	13 0.5×	7 0.4×	31	121
Kristoffer Arnsfelt Hansen Denmark	7	82 1.0×	27 0.8×	28 0.9×	37 1.5×	2 0.1×	28	146
Rajesh Chitnis United States	7	123 1.6×	9 0.3×	58 1.8×	11 0.4×	3 0.2×	20	145
John Fearnley United Kingdom	9	78 1.0×	59 1.7×	29 0.9×	83 3.3×	2 0.1×	35	181
Manfred Kerber United Kingdom	8	48 0.6×	19 0.6×	27 0.8×	26 1.0×	4 0.2×	48	166
Bundit Laekhanukit Canada	7	120 1.5×	7 0.2×	78 2.4×	10 0.4×	2 0.1×	26	151

Countries citing papers authored by Dušan Knop

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Dušan Knop

This figure shows the co-authorship network connecting the top 25 collaborators of Dušan Knop. A scholar is included among the top collaborators of Dušan Knop 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 Dušan Knop. Dušan Knop is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Knop, Dušan, et al.. (2025). Solving Multiagent Path Finding on Highly Centralized Networks. Proceedings of the AAAI Conference on Artificial Intelligence. 39(22). 23186–23193.

Knop, Dušan, et al.. (2024). On the Complexity of Target Set Selection in Simple Geometric Networks. Discrete Mathematics & Theoretical Computer Science. vol. 26:2(Discrete Algorithms).

Bredereck, Robert, et al.. (2024). Multivariate algorithmics for eliminating envy by donating goods. Autonomous Agents and Multi-Agent Systems. 38(2).

Knop, Dušan, et al.. (2024). Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. Proceedings of the AAAI Conference on Artificial Intelligence. 38(16). 17380–17388.

Ganian, Robert, et al.. (2023). Hedonic diversity games: A complexity picture with more than two colors. Artificial Intelligence. 325. 104017–104017. 1 indexed citations

Ganian, Robert, et al.. (2023). The Parameterized Complexity of Network Microaggregation. Proceedings of the AAAI Conference on Artificial Intelligence. 37(5). 6262–6270. 1 indexed citations

Bodlaender, Hans L., Édouard Bonnet, Dušan Knop, et al.. (2023). Treewidth Is NP-Complete on Cubic Graphs. IT University Of Copenhagen (IT University of Copenhagen).

Knop, Dušan, et al.. (2022). Constant factor approximation for tracking paths and fault tolerant feedback vertex set. Discrete Optimization. 47. 100756–100756.

Bredereck, Robert, et al.. (2021). High-Multiplicity Fair Allocation Made More Practical. Autonomous Agents and Multi-Agent Systems. 260–268. 1 indexed citations

10.

Dvořák, Pavel, et al.. (2021). The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artificial Intelligence. 300. 103561–103561. 5 indexed citations

11.

Chaplick, Steven, et al.. (2020). Recognizing Proper Tree-Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

12.

Bredereck, Robert, et al.. (2020). Adapting Stable Matchings to Evolving Preferences. Proceedings of the AAAI Conference on Artificial Intelligence. 34(2). 1830–1837. 6 indexed citations

13.

Bredereck, Robert, et al.. (2020). Fine-Grained View on Bribery for Group Identification. 67–73. 1 indexed citations

14.

Bredereck, Robert, et al.. (2020). Parameterized Algorithms for Finding a Collective Set of Items. Proceedings of the AAAI Conference on Artificial Intelligence. 34(2). 1838–1845. 9 indexed citations

15.

Knop, Dušan, et al.. (2019). Complexity of the Steiner Network Problem with Respect to the Number of Terminals. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 1 indexed citations

16.

Knop, Dušan, et al.. (2019). Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Logical Methods in Computer Science. Volume 15, Issue 4. 9 indexed citations

17.

Gavenčiak, Tomáš, et al.. (2019). Integer Programming in Parameterized Complexity: Three Miniatures. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

18.

Gavenčiak, Tomáš, et al.. (2017). Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity.. arXiv (Cornell University). 1 indexed citations

19.

Knop, Dušan, et al.. (2017). Computational complexity of distance edge labeling. Discrete Applied Mathematics. 246. 80–98. 1 indexed citations

20.

Knop, Dušan, et al.. (2017). IV-matching is strongly NP-hard. Information Processing Letters. 125. 5–8. 1 indexed citations

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.

Explore authors with similar magnitude of impact