Viktor Schuppan

1.0k total citations
13 papers, 332 citations indexed

About

Viktor Schuppan is a scholar working on Computational Theory and Mathematics, Software and Artificial Intelligence. According to data from OpenAlex, Viktor Schuppan has authored 13 papers receiving a total of 332 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 10 papers in Software and 8 papers in Artificial Intelligence. Recurrent topics in Viktor Schuppan's work include Formal Methods in Verification (10 papers), Software Testing and Debugging Techniques (5 papers) and Logic, programming, and type systems (4 papers). Viktor Schuppan is often cited by papers focused on Formal Methods in Verification (10 papers), Software Testing and Debugging Techniques (5 papers) and Logic, programming, and type systems (4 papers). Viktor Schuppan collaborates with scholars based in Switzerland, Austria and Poland. Viktor Schuppan's co-authors include Armin Biere, Cyrille Artho, Timo Latvala, Keijo Heljanko and Tommi Junttila and has published in prestigious journals such as Theoretical Computer Science, Science of Computer Programming and Acta Informatica.

In The Last Decade

Viktor Schuppan

12 papers receiving 290 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Viktor Schuppan Switzerland 8 263 180 168 54 49 13 332
Tommi Junttila Finland 9 269 1.0× 181 1.0× 204 1.2× 29 0.5× 59 1.2× 27 345
Philippe Schnoebelen France 7 267 1.0× 108 0.6× 233 1.4× 45 0.8× 50 1.0× 20 385
Timo Latvala Finland 6 169 0.6× 123 0.7× 107 0.6× 24 0.4× 32 0.7× 14 222
Kedar S. Namjoshi United States 11 233 0.9× 121 0.7× 191 1.1× 72 1.3× 104 2.1× 24 350
Dennis Dams Netherlands 11 486 1.8× 275 1.5× 342 2.0× 60 1.1× 54 1.1× 31 559
Sven Schewe United Kingdom 10 249 0.9× 90 0.5× 220 1.3× 32 0.6× 42 0.9× 66 360
Frank Ciesinski Germany 7 262 1.0× 133 0.7× 125 0.7× 56 1.0× 29 0.6× 7 302
Christian Herde Germany 7 251 1.0× 122 0.7× 107 0.6× 125 2.3× 57 1.2× 13 327
Pierluigi San Pietro Italy 12 266 1.0× 186 1.0× 219 1.3× 44 0.8× 52 1.1× 53 360
Judi Romijn Netherlands 10 213 0.8× 104 0.6× 92 0.5× 78 1.4× 49 1.0× 22 283

Countries citing papers authored by Viktor Schuppan

Since Specialization
Citations

This map shows the geographic impact of Viktor Schuppan'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 Viktor Schuppan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Viktor Schuppan more than expected).

Fields of papers citing papers by Viktor Schuppan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Viktor Schuppan. 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 Viktor Schuppan. The network helps show where Viktor Schuppan may publish in the future.

Co-authorship network of co-authors of Viktor Schuppan

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

All Works

13 of 13 papers shown
1.
Schuppan, Viktor. (2018). Enhanced Unsatisfiable Cores for QBF: Weakening Universal to Existential Quantifiers. 4741. 81–89. 1 indexed citations
2.
Schuppan, Viktor. (2016). Enhancing unsatisfiable cores for LTL with information on temporal relevance. Theoretical Computer Science. 655. 155–192. 3 indexed citations
3.
Schuppan, Viktor. (2015). Extracting unsatisfiable cores for LTL via temporal resolution. Acta Informatica. 53(3). 247–299. 7 indexed citations
4.
Schuppan, Viktor. (2013). Extracting Unsatisfiable Cores for LTL via Temporal Resolution. 2988. 54–61. 1 indexed citations
5.
Schuppan, Viktor. (2010). Towards a notion of unsatisfiable and unrealizable cores for LTL. Science of Computer Programming. 77(7-8). 908–939. 19 indexed citations
6.
Schuppan, Viktor & Armin Biere. (2006). Liveness Checking as Safety Checking for Infinite State Spaces. Electronic Notes in Theoretical Computer Science. 149(1). 79–96. 22 indexed citations
7.
Biere, Armin, Keijo Heljanko, Tommi Junttila, Timo Latvala, & Viktor Schuppan. (2006). Linear Encodings of Bounded LTL Model Checking. Logical Methods in Computer Science. Volume 2, Issue 5. 127 indexed citations
8.
Schuppan, Viktor. (2006). Liveness checking as safety checking to find shortest counterexamples to linear time properties. Repository for Publications and Research Data (ETH Zurich). 8 indexed citations
9.
Schuppan, Viktor, et al.. (2005). JVM Independent Replay in Java. Electronic Notes in Theoretical Computer Science. 113. 85–104. 16 indexed citations
10.
Schuppan, Viktor & Armin Biere. (2004). Efficient reduction of finite state model checking to reachability analysis. International Journal on Software Tools for Technology Transfer. 5(2-3). 185–204. 33 indexed citations
11.
Schuppan, Viktor & Armin Biere. (2003). Verifying the IEEE 1394 FireWire Tree Identify Protocol with SMV. Formal Aspects of Computing. 14(3). 267–280. 10 indexed citations
12.
Biere, Armin, Cyrille Artho, & Viktor Schuppan. (2002). Liveness Checking as Safety Checking. Electronic Notes in Theoretical Computer Science. 66(2). 160–177. 80 indexed citations
13.
Schuppan, Viktor & Armin Biere. (2001). A Simple Verification of the Tree Identify Protocol with SMV. 5 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

Rankless by CCL
2026