Sven Kosub

619 total citations · 1 hit paper
22 papers, 304 citations indexed

About

Sven Kosub is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Sven Kosub has authored 22 papers receiving a total of 304 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 4 papers in Geometry and Topology and 4 papers in Artificial Intelligence. Recurrent topics in Sven Kosub's work include Complexity and Algorithms in Graphs (9 papers), Advanced Graph Theory Research (8 papers) and semigroups and automata theory (6 papers). Sven Kosub is often cited by papers focused on Complexity and Algorithms in Graphs (9 papers), Advanced Graph Theory Research (8 papers) and semigroups and automata theory (6 papers). Sven Kosub collaborates with scholars based in Germany, United States and Austria. Sven Kosub's co-authors include Takeyuki Tamura, Tatsuya Akutsu, Avraham A. Melkman, Christopher M. Homan, Daniel Seebacher, Halldór Janetzko, Michael Grossniklaus, Tobias Schreck, Daniel A. Keim and Manuel Stein and has published in prestigious journals such as Pattern Recognition Letters, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Sven Kosub

20 papers receiving 292 citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

A note on the triangle inequality for the Jaccard distance

2018 137 citations Sven Kosub Pattern Recognition Letters profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Sven Kosub Germany	8	82	75	65	47	34	22	304
Dan Vilenchik Israel	9	74 0.9×	74 1.0×	19 0.3×	16 0.3×	31 0.9×	46	250
Anders Holst Sweden	7	341 4.2×	17 0.2×	85 1.3×	36 0.8×	2 0.1×	23	441
Simone Romano Australia	9	259 3.2×	29 0.4×	45 0.7×	94 2.0×	14 0.4×	11	381
M. Sadiq Ali Khan Pakistan	9	145 1.8×	38 0.5×	40 0.6×	14 0.3×	9 0.3×	30	383
Maria Florina Balcan United States	10	210 2.6×	40 0.5×	16 0.2×	107 2.3×	11 0.3×	17	361
Patryk Orzechowski United States	7	275 3.4×	31 0.4×	117 1.8×	33 0.7×	8 0.2×	32	416
Venkatesan Ekambaram United States	10	116 1.4×	18 0.2×	24 0.4×	49 1.0×	12 0.4×	26	323
Weicai Zhong China	12	125 1.5×	23 0.3×	23 0.4×	78 1.7×	8 0.2×	25	376
Benedek Rózemberczki United Kingdom	7	228 2.8×	30 0.4×	65 1.0×	54 1.1×	9 0.3×	9	428
Francisco J. Valverde-Albacete Spain	10	188 2.3×	118 1.6×	62 1.0×	64 1.4×	5 0.1×	38	391

Countries citing papers authored by Sven Kosub

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Sven Kosub

This figure shows the co-authorship network connecting the top 25 collaborators of Sven Kosub. A scholar is included among the top collaborators of Sven Kosub 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 Sven Kosub. Sven Kosub 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:

20 of 20 papers shown

1.

Kosub, Sven. (2018). A note on the triangle inequality for the Jaccard distance. Pattern Recognition Letters. 120. 36–38. 137 indexed citations breakdown →

2.

Schoch, David, et al.. (2017). Biases in the Football Betting Market. SSRN Electronic Journal. 1 indexed citations

3.

Stein, Manuel, Halldór Janetzko, Daniel Seebacher, et al.. (2017). How to Make Sense of Team Sport Data: From Acquisition to Data Modeling and Research Aspects. Data. 2(1). 2–2. 58 indexed citations

4.

Homan, Christopher M. & Sven Kosub. (2015). Dichotomy results for fixed point counting in boolean dynamical systems. Theoretical Computer Science. 573. 16–25. 1 indexed citations

5.

Täubig, Hanjo, et al.. (2013). Inequalities for the Number of Walks in Graphs. Algorithmica. 66(4). 804–828. 3 indexed citations

6.

Akutsu, Tatsuya, Sven Kosub, Avraham A. Melkman, & Takeyuki Tamura. (2012). Finding a Periodic Attractor of a Boolean Network. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 9(5). 1410–1421. 32 indexed citations

7.

Hemmecke, Raymond, et al.. (2012). Inequalities for the Number of Walks in Graphs. 26–39. 1 indexed citations

8.

Kosub, Sven, et al.. (2008). Combinatorial network abstraction by trees and distances. Theoretical Computer Science. 407(1-3). 1–20. 4 indexed citations

9.

Kosub, Sven. (2008). Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems. Mathematics in Computer Science. 1(3). 487–505. 14 indexed citations

10.

Kosub, Sven & Klaus W. Wagner. (2007). The boolean hierarchy of NP-partitions. Information and Computation. 206(5). 538–568. 2 indexed citations

11.

Kosub, Sven & Christopher M. Homan. (2007). DICHOTOMY RESULTS FOR FIXED POINT COUNTING IN BOOLEAN DYNAMICAL SYSTEMS. Theoretical Computer Science. 163–174. 12 indexed citations

12.

Hummel, Benjamin & Sven Kosub. (2007). Acyclic type-of-relationship problems on the internet. 221–226. 7 indexed citations

13.

Kosub, Sven, et al.. (2006). The complexity of detecting fixed-density clusters. Discrete Applied Mathematics. 154(11). 1547–1562. 3 indexed citations

14.

Griebsch, Jan, et al.. (2006). All-Pairs Common-Ancestor Problems in Weighted Dags. 1 indexed citations

15.

Hemaspaandra, Lane A., Christopher M. Homan, Sven Kosub, & Klaus W. Wagner. (2006). The Complexity of Computing the Size of an Interval. SIAM Journal on Computing. 36(5). 1264–1300. 6 indexed citations

16.

Kosub, Sven. (2004). NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. Theory of Computing Systems. 38(1). 83–113. 7 indexed citations

17.

Kosub, Sven. (2001). Complexity and Partitions. KOPS (University of Konstanz). 7 indexed citations

18.

Kosub, Sven & Klaus W. Wagner. (2000). The Boolean Hierarchy of NP-Partitions. 1 indexed citations

19.

Kosub, Sven, Heinz Schmitz, & Heribert Vollmer. (2000). UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS. International Journal of Foundations of Computer Science. 11(4). 525–551. 2 indexed citations

20.

Kosub, Sven. (1999). A note on unambiguous function classes. Information Processing Letters. 72(5-6). 197–203. 3 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