Ondřej Suchý
-
- Advanced Graph Theory Research 22
- Complexity and Algorithms in Graphs 16
- Graph Labeling and Dimension Problems 6
-
- Computational Geometry and Mesh Generation 3
-
- Interconnection Networks and Systems 5
- Optimization and Search Problems 3
-
- Game Theory and Voting Systems 4
-
- VLSI and FPGA Design Techniques 3
- Co-authors
- Rolf NiedermeierSepp HartungJiong GuoManuel SorgeSaket SaurabhRobert BredereckHendrik MolterJan Kratochvı́l
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignDiscrete Mathematics and Combinatorics
- Journals
- Artificial Intelligence (1 paper)Journal of Computer and System Sciences (2 papers)Journal of Artificial Intelligence Research (1 paper)
- Partner nations
- CzechiaGermanyUnited Kingdom
In The Last Decade
Ondřej Suchý
26 papers receiving 112 citations
Peers
Comparison fields: 5 of 38
- Computational Theory and Mathematics 79
- Computer Graphics and Computer-Aided Design 11
- Discrete Mathematics and Combinatorics 5
- Computer Networks and Communications 31
- Management Science and Operations Research 13
Countries citing papers authored by Ondřej Suchý
This map shows the geographic impact of Ondřej Suchý'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 Ondřej Suchý with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ondřej Suchý more than expected).
Fields of papers citing papers by Ondřej Suchý
This network shows the impact of papers produced by Ondřej Suchý. 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 Ondřej Suchý. The network helps show where Ondřej Suchý may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Ondřej Suchý, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 0 | |
| 2 | 2023 | 1 | |
| 3 | 2023 | 0 | |
| 4 | 2022 | 0 | |
| 5 | 2022 | 2 | |
| 6 | 2021 | 1 | |
| 7 | 2019 | 1 | |
| 8 | 2019 | 1 | |
| 9 | 2018 | 3 | |
| 10 | 2018 | 8 | |
| 11 | 2017 | 3 | |
| 12 | 2016 | 2 | |
| 13 | 2015 | 1 | |
| 14 | 2015 | 5 | |
| 15 | 2014 | 11 | |
| 16 | 2014 | 6 | |
| 17 | 2013 | 2 | |
| 18 | 2012 | 6 | |
| 19 | 2011 | 2 | |
| 20 | 2010 | 4 |
About Ondřej Suchý
Ondřej Suchý is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 31 papers that have together received 121 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (22 papers), Complexity and Algorithms in Graphs (16 papers), Graph Labeling and Dimension Problems (6 papers), Interconnection Networks and Systems (5 papers), Game Theory and Voting Systems (4 papers), VLSI and FPGA Design Techniques (3 papers), Optimization and Search Problems (3 papers) and Computational Geometry and Mesh Generation (3 papers). The work is most often cited by research in Computational Theory and Mathematics (79 citations), Computer Graphics and Computer-Aided Design (11 citations) and Discrete Mathematics and Combinatorics (5 citations). Ondřej Suchý has collaborated with scholars based in Czechia, Germany and United Kingdom. Frequent co-authors include Rolf Niedermeier, Sepp Hartung, Jiong Guo, Manuel Sorge, Saket Saurabh, Robert Bredereck, Hendrik Molter, Jan Kratochvı́l, Jeson Chen and André Nichterlein. Their work appears in journals such as Artificial Intelligence, Journal of Computer and System Sciences and Journal of Artificial Intelligence Research.
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.