Friedrich Slivovsky

415 total citations
15 papers, 72 citations indexed

About

Friedrich Slivovsky is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Friedrich Slivovsky has authored 15 papers receiving a total of 72 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 5 papers in Artificial Intelligence and 4 papers in Computer Networks and Communications. Recurrent topics in Friedrich Slivovsky's work include Formal Methods in Verification (11 papers), Advanced Graph Theory Research (4 papers) and Complexity and Algorithms in Graphs (4 papers). Friedrich Slivovsky is often cited by papers focused on Formal Methods in Verification (11 papers), Advanced Graph Theory Research (4 papers) and Complexity and Algorithms in Graphs (4 papers). Friedrich Slivovsky collaborates with scholars based in Austria, United Kingdom and Singapore. Friedrich Slivovsky's 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 and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Journal of Artificial Intelligence Research.

In The Last Decade

Friedrich Slivovsky

13 papers receiving 68 citations

Peers

Friedrich Slivovsky

CTM

AI

CNC

IS

SOFTW

Ondřej Lengál Czechia

Wilmer Ricciotti Italy

Norbert Manthey Germany

Jean-Marie Lagniez France

Daniel Hirschkoff France

Ayrat Khalimov Austria

Jean-Marc Talbot France

Diego Figueira France

Aurélien Lemay France

Larissa Meinicke Australia

Ondřej Lengál Czechia

Friedrich Slivovsky

26 ×0.5

CTM

52 ×1.3

AI

17 ×0.7

CNC

10 ×1.7

IS

14 ×2.3

SOFTW

Citations per year, relative to Friedrich Slivovsky Friedrich Slivovsky (= 1×) peers Ondřej Lengál

Countries citing papers authored by Friedrich Slivovsky

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

15 of 15 papers shown

1.

Slivovsky, Friedrich, et al.. (2024). Towards Uniform Certification in QBF. Logical Methods in Computer Science. Volume 20, Issue 1.

2.

Reichl, Franz‐Xaver, Friedrich Slivovsky, & Stefan Szeider. (2023). Circuit Minimization with QBF-Based Exact Synthesis. Proceedings of the AAAI Conference on Artificial Intelligence. 37(4). 4087–4094. 3 indexed citations

3.

Fichte, Johannes K., Robert Ganian, Markus Hecher, Friedrich Slivovsky, & Sebastian Ordyniak. (2023). Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. 1–14. 2 indexed citations

4.

Ganian, Robert, Eun Jung Kim, Friedrich Slivovsky, & Stefan Szeider. (2022). Sum-of-Products with Default Values: Algorithms and Complexity Results. Journal of Artificial Intelligence Research. 73. 535–552. 2 indexed citations

5.

Slivovsky, Friedrich, et al.. (2021). Engineering an Efficient Boolean Functional Synthesis Engine. 1–9. 8 indexed citations

6.

Ganian, Robert, et al.. (2020). Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. 392–402.

7.

Slivovsky, Friedrich, et al.. (2019). Dependency Learning for QBF. Journal of Artificial Intelligence Research. 65. 181–208. 11 indexed citations

8.

Slivovsky, Friedrich, et al.. (2018). Long-Distance Q-Resolution with Dependency Schemes. Journal of Automated Reasoning. 63(1). 127–155. 5 indexed citations

9.

Slivovsky, Friedrich, et al.. (2016). On Compiling Structured CNFs to OBDDs. Theory of Computing Systems. 61(2). 637–655. 1 indexed citations

10.

Ganian, Robert, Friedrich Slivovsky, & Stefan Szeider. (2015). Meta-kernelization with structural parameters. Journal of Computer and System Sciences. 82(2). 333–346. 6 indexed citations

11.

Slivovsky, Friedrich & Stefan Szeider. (2015). Soundness of Q-resolution with dependency schemes. Theoretical Computer Science. 612. 83–101. 15 indexed citations

12.

Slivovsky, Friedrich & Stefan Szeider. (2015). Quantifier Reordering for QBF. Journal of Automated Reasoning. 56(4). 459–477. 2 indexed citations

13.

Paulusma, Daniël, Friedrich Slivovsky, & Stefan Szeider. (2015). Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica. 76(1). 168–194. 9 indexed citations

14.

Slivovsky, Friedrich, et al.. (2014). Expander CNFs have Exponential DNNF Size.. 4 indexed citations

15.

Paulusma, Daniël, Friedrich Slivovsky, & Stefan Szeider. (2013). Model Counting for CNF Formulas of Bounded Modular Treewidth. Durham Research Online (Durham University). 4 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