A note on the triangle inequality for the Jaccard distance S Kosub Pattern Recognition Letters 120, 36-38, 2019 | 312 | 2019 |
How to make sense of team sport data: From acquisition to data modeling and research aspects M Stein, H Janetzko, D Seebacher, A Jäger, M Nagel, J Hölsch, S Kosub, ... Data 2 (1), 2, 2017 | 106* | 2017 |
Finding a periodic attractor of a boolean network T Akutsu, S Kosub, AA Melkman, T Tamura IEEE/ACM Transactions on Computational Biology and Bioinformatics 9 (5 …, 2012 | 55 | 2012 |
The boolean hierarchy of NP-partitions S Kosub, KW Wagner Information and Computation 206 (5), 538-568, 2008 | 47* | 2008 |
Local density S Kosub Network Analysis: Methodological Foundations 3418, 112-142, 2005 | 43 | 2005 |
The complexity of detecting fixed-density clusters K Holzapfel, S Kosub, MG Maaß, H Täubig Discrete Applied Mathematics 154 (11), 1547-1562, 2006 | 30 | 2006 |
Dichotomy results for fixed-point existence problems in boolean dynamical systems S Kosub Mathematics in Computer Science 1 (3), 487-505, 2008 | 29 | 2008 |
NP-partitions over posets with an application to reducing the set of solutions of NP problems S Kosub Theory of Computing Systems 38 (1), 83-113, 2005 | 29* | 2005 |
Acyclic type-of-relationship problems on the internet: an experimental analysis B Hummel, S Kosub Internet Measurement Conference, 221-226, 2007 | 26 | 2007 |
Dichotomy results for fixed point counting in boolean dynamical systems CM Homan, S Kosub Theoretical Computer Science 573, 16-25, 2015 | 24* | 2015 |
Acyclic type-of-relationship problems on the internet S Kosub, M Maaß, H Täubig Combinatorial and Algorithmic Aspects of Networking 4235, 98-111, 2006 | 24 | 2006 |
Was messen Zentralitätsindizes? U Brandes, S Kosub, B Nick Die Integration von Theorie und Methode in der Netzwerkforschung, 33-52, 2012 | 23 | 2012 |
The complexity of computing the size of an interval LA Hemaspaandra, CM Homan, S Kosub, KW Wagner SIAM Journal on Computing 36 (5), 1264-1300, 2007 | 22* | 2007 |
Inequalities for the number of walks in graphs H Täubig, J Weihmann, S Kosub, R Hemmecke, EW Mayr Algorithmica 66, 804-828, 2013 | 20* | 2013 |
Uniform characterizations of complexity classes of functions S Kosub, H Schmitz, H Vollmer International Journal of Foundations of Computer Science 11 (04), 525-551, 2000 | 20* | 2000 |
Complexity and partitions S Kosub Dissertation, Fakultät für Mathematik und Informatik, Julius-Maximilians …, 2000 | 20 | 2000 |
Persistent computations S Kosub Institut für Informatik, Julius-Maximilians-Universität Würzburg, 1998 | 20 | 1998 |
All-pairs ancestor problems in weighted dags M Baumgart, S Eckhardt, J Griebsch, S Kosub, J Nowak Combinatorics, Algorithms, Probabilistic and Experimental Methodologies 4614 …, 2007 | 18* | 2007 |
Combinatorial network abstraction by trees and distances S Eckhardt, S Kosub, MG Maaß, H Täubig, S Wernicke Theoretical Computer Science 407 (1-3), 1-20, 2008 | 10 | 2008 |
A note on unambiguous function classes S Kosub Information Processing Letters 72 (5-6), 197-203, 1999 | 10 | 1999 |