Friedrich Slivovsky
- Computational Theory and Mathematics top 10%
- Artificial Intelligence
- Computer Networks and Communications
- Information Systems
- Software
- Co-authors
- Stefan SzeiderDaniël PaulusmaRobert GanianSubhajit RoyKuldeep S. MeelFranz‐Xaver ReichlEun Jung KimMarkus Hecher
- Topics
- Formal Methods in Verification (11 papers)Advanced Graph Theory Research (4 papers)Complexity and Algorithms in Graphs (4 papers)
- Journals
- Theoretical Computer ScienceJournal of Computer and System SciencesJournal of Artificial Intelligence Research
- Partner nations
- AustriaUnited KingdomSingapore
In The Last Decade
Friedrich Slivovsky
13 papers receiving 68 citations
Peers
Comparison fields: 5 of 18
- Computational Theory and Mathematics 48
- Artificial Intelligence 39
- Computer Networks and Communications 23
- Information Systems 6
- Software 6
Countries citing papers authored by Friedrich Slivovsky
This map shows the geographic impact of Friedrich Slivovsky'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 Friedrich Slivovsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Friedrich Slivovsky more than expected).
Fields of papers citing papers by Friedrich Slivovsky
This network shows the impact of papers produced by Friedrich Slivovsky. 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 Friedrich Slivovsky. The network helps show where Friedrich Slivovsky may publish in the future.
Co-authorship network of co-authors of Friedrich Slivovsky
This figure shows the co-authorship network connecting the top 25 collaborators of Friedrich Slivovsky. A scholar is included among the top collaborators of Friedrich Slivovsky 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 Friedrich Slivovsky. Friedrich Slivovsky 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 | 3 | |
| 3 | 2 | |
| 4 | 2 | |
| 5 | 8 | |
| 6 | 0 | |
| 7 | 11 | |
| 8 | 5 | |
| 9 | 1 | |
| 10 | 6 | |
| 11 | 15 | |
| 12 | 2 | |
| 13 | 9 | |
| 14 | Expander CNFs have Exponential DNNF Size. | 4 |
| 15 | 4 |
About Friedrich Slivovsky
Friedrich Slivovsky is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Software, having authored 15 papers that have together received 72 indexed citations. Recurring topics across this work include Formal Methods in Verification (11 papers), Advanced Graph Theory Research (4 papers) and Complexity and Algorithms in Graphs (4 papers). The work is most often cited by research in Computational Theory and Mathematics (48 citations), Software (6 citations) and Artificial Intelligence (39 citations). Friedrich Slivovsky has collaborated with scholars based in Austria, United Kingdom and Singapore. Frequent co-authors include Stefan Szeider, Daniël Paulusma, Robert Ganian, Subhajit Roy, Kuldeep S. Meel, Franz‐Xaver Reichl, Eun Jung Kim, Markus Hecher, Sebastian Ordyniak and Johannes K. Fichte. Their work appears in journals such as Theoretical Computer Science, 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.