Stanislav Živný
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 5%
- Artificial Intelligence
- Computer Graphics and Computer-Aided Design top 5%
- Signal Processing
- Co-authors
- Johan ThapperPeter JeavonsVladimir KolmogorovDavid A. CohenMartin CooperJustin WardAndrei KrokhinSerge Gaspers
- Topics
- Advanced Graph Theory Research (41 papers)Complexity and Algorithms in Graphs (34 papers)Constraint Satisfaction and Optimization (31 papers)
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignComputer Networks and Communications
- Partner nations
- United KingdomFranceAustria
In The Last Decade
Stanislav Živný
41 papers receiving 266 citations
Peers
Comparison fields: 5 of 27
- Computational Theory and Mathematics 254
- Computer Networks and Communications 182
- Artificial Intelligence 67
- Computer Graphics and Computer-Aided Design 29
- Signal Processing 25
Countries citing papers authored by Stanislav Živný
This map shows the geographic impact of Stanislav Živný'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 Stanislav Živný with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stanislav Živný more than expected).
Fields of papers citing papers by Stanislav Živný
This network shows the impact of papers produced by Stanislav Živný. 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 Stanislav Živný. The network helps show where Stanislav Živný may publish in the future.
Co-authorship network of co-authors of Stanislav Živný
This figure shows the co-authorship network connecting the top 25 collaborators of Stanislav Živný. A scholar is included among the top collaborators of Stanislav Živný 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 Stanislav Živný. Stanislav Živný is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 2 | |
| 3 | 0 | |
| 4 | 1 | |
| 5 | 0 | |
| 6 | 0 | |
| 7 | 7 | |
| 8 | 1 | |
| 9 | 4 | |
| 10 | 0 | |
| 11 | 0 | |
| 12 | 1 | |
| 13 | Treewidth-Pliability and PTAS for Max-CSPs | 2 |
| 14 | 1 | |
| 15 | 3 | |
| 16 | 3 | |
| 17 | 2 | |
| 18 | The Complexity of Valued Constraint Satisfaction | 9 |
| 19 | 14 | |
| 20 | 16 |
About Stanislav Živný
Stanislav Živný is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics, having authored 53 papers that have together received 294 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (41 papers), Complexity and Algorithms in Graphs (34 papers) and Constraint Satisfaction and Optimization (31 papers). The work is most often cited by research in Computational Theory and Mathematics (254 citations), Computer Graphics and Computer-Aided Design (29 citations) and Computer Networks and Communications (182 citations). Stanislav Živný has collaborated with scholars based in United Kingdom, France and Austria. Frequent co-authors include Johan Thapper, Peter Jeavons, Vladimir Kolmogorov, David A. Cohen, Martin Cooper, Justin Ward, Andrei Krokhin, Serge Gaspers, Neeldhara Misra and Sebastian Ordyniak. Their work appears in journals such as Artificial Intelligence, Journal of the ACM and SIAM Journal on Computing.
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.