Sven Kosub
Impact in
-
- Formal Methods in Verification
- semigroups and automata theory
- Advanced Algebra and Logic
-
- Sports Performance and Training
Papers in
-
- Complexity and Algorithms in Graphs 9
- Advanced Graph Theory Research 8
- semigroups and automata theory 6
- Computability, Logic, AI Algorithms 4
-
- Graph theory and applications 3
- Co-authors
- Tatsuya Akutsu (1 shared paper)Avraham A. Melkman (1 shared paper)Christopher M. Homan (4 shared papers)Takeyuki Tamura (1 shared paper)Halldór Janetzko (1 shared paper)Michael Grossniklaus (1 shared paper)Manuel Stein (1 shared paper)Daniel Seebacher (1 shared paper)
- Journals
- Theoretical Computer Science (3 papers)Information and Computation (2 papers)Theory of Computing Systems (1 paper)Algorithmica (1 paper)Discrete Applied Mathematics (1 paper)
- Partner nations
- GermanyUnited StatesJapan
In The Last Decade
Sven Kosub
20 papers receiving 292 citations
Sven Kosub's Hit Papers
Peers
Comparison fields: 5 of 101
- Computational Theory and Mathematics 75
- Orthopedics and Sports Medicine 31
- Artificial Intelligence 82
- Computer Vision and Pattern Recognition 47
- Statistical and Nonlinear Physics 28
Countries citing papers authored by Sven Kosub
This map shows the geographic impact of Sven Kosub'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 Sven Kosub with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sven Kosub more than expected).
Fields of papers citing papers by Sven Kosub
This network shows the impact of papers produced by Sven Kosub. 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 Sven Kosub. The network helps show where Sven Kosub may publish in the future.
Co-authors
The 22 scholars most cited alongside Sven Kosub, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 22 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | A note on the triangle inequality for the Jaccard distance Hit paper breakdown → | 2018 | 137 |
| 2 | 2017 | 58 | |
| 3 | 2012 | 32 | |
| 4 | 2008 | 14 | |
| 5 | 2007 | 12 | |
| 6 | Complexity and Partitions | 2001 | 7 |
| 7 | 2004 | 7 | |
| 8 | 2007 | 7 | |
| 9 | 2006 | 6 | |
| 10 | 2008 | 4 | |
| 11 | 2006 | 3 | |
| 12 | 1999 | 3 | |
| 13 | 2013 | 3 | |
| 14 | 2000 | 2 | |
| 15 | 2007 | 2 | |
| 16 | The Boolean Hierarchy of NP-Partitions | 2000 | 1 |
| 17 | 2015 | 1 | |
| 18 | All-Pairs Common-Ancestor Problems in Weighted Dags | 2006 | 1 |
| 19 | 2017 | 1 | |
| 20 | 2012 | 1 |
About Sven Kosub
Sven Kosub is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Artificial Intelligence, Statistics and Probability and Computer Networks and Communications, having authored 22 papers that have together received 304 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (9 papers), Advanced Graph Theory Research (8 papers), semigroups and automata theory (6 papers), Markov Chains and Monte Carlo Methods (4 papers), Computability, Logic, AI Algorithms (4 papers), Graph theory and applications (3 papers), Sports Analytics and Performance (2 papers) and Algorithms and Data Compression (2 papers). The work is most often cited by research in Computational Theory and Mathematics (75 citations), Orthopedics and Sports Medicine (31 citations), Artificial Intelligence (82 citations), Computer Vision and Pattern Recognition (47 citations) and Statistical and Nonlinear Physics (28 citations). Sven Kosub has collaborated with scholars based in Germany, United States and Japan. Frequent co-authors include Tatsuya Akutsu, Avraham A. Melkman, Christopher M. Homan, Takeyuki Tamura, Halldór Janetzko, Michael Grossniklaus, Manuel Stein, Daniel Seebacher, Tobias Schreck and Daniel A. Keim. Their work appears in journals such as Theoretical Computer Science, Information and Computation, Theory of Computing Systems, Algorithmica and Discrete Applied Mathematics.
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.