Sven Kosub

According to our database, Sven Kosub authored at least 28 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Permutation Inequalities for Walks in Graphs.

Nadja Willenborg, Sven Kosub

CoRR, 2023

2022

Global Evaluation for Decision Tree Learning.

Fabian Spaeh, Sven Kosub

CoRR, 2022

2020

A note on the complexity of manipulating weighted Schulze voting.

Julian Müller, Sven Kosub

Inf. Process. Lett., 2020

Smoothed Analysis of Trie Height by Star-like PFAs.

Stefan Eckhardt, Sven Kosub, Johannes Nowak

CoRR, 2020

2019

A note on the triangle inequality for the Jaccard distance.

Sven Kosub

Pattern Recognit. Lett., 2019

2017

How to Make Sense of Team Sport Data: From Acquisition to Data Modeling and Research Aspects.

Manuel Stein, Halldór Janetzko, Daniel Seebacher, Alexander Jäger, Manuel Nagel, Jürgen Hölsch, Sven Kosub, Tobias Schreck, Daniel A. Keim, Michael Grossniklaus

Data, 2017

2015

Dichotomy results for fixed point counting in boolean dynamical systems.

Christopher M. Homan, Sven Kosub

Theor. Comput. Sci., 2015

2013

Inequalities for the Number of Walks in Graphs.

Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr

Algorithmica, 2013

2012

Finding a Periodic Attractor of a Boolean Network.

Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

2008

Combinatorial network abstraction by trees and distances.

Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke

Theor. Comput. Sci., 2008

Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems.

Sven Kosub

Math. Comput. Sci., 2008

The boolean hierarchy of NP-partitions.

Sven Kosub, Klaus W. Wagner

Inf. Comput., 2008

2007

Computational Analysis of Complex Systems: Discrete Foundations, Algorithms, and the Internet

Sven Kosub

, 2007

The Complexity of Computing the Size of an Interval.

Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner

SIAM J. Comput., 2007

Cluster computing and the power of edge recognition.

Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub

Inf. Comput., 2007

Acyclic type-of-relationship problems on the internet: an experimental analysis.

Benjamin Hummel, Sven Kosub

Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007

All-Pairs Ancestor Problems in Weighted Dags.

Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak

Proceedings of the Combinatorics, 2007

2006

The complexity of detecting fixed-density clusters.

Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig

Discret. Appl. Math., 2006

Acyclic Type-of-Relationship Problems on the Internet.

Sven Kosub, Moritz G. Maaß, Hanjo Täubig

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems.

Sven Kosub

Theory Comput. Syst., 2005

2004

Local Density.

Sven Kosub

Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

2003

Generic separations and leaf languages.

Matthias Galota, Sven Kosub, Heribert Vollmer

Math. Log. Q., 2003

Boolean NP-Partitions and Projective Closure.

Sven Kosub

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2001

Complexity and Partitions (Komplexität von Partitionen)

Sven Kosub

PhD thesis, 2001

The Complexity of Computing the Size of an Interval.

Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Uniform Characterizations of Complexity Classes of Functions.

Sven Kosub, Heinz Schmitz, Heribert Vollmer

Int. J. Found. Comput. Sci., 2000

1999

A Note on Unambiguous Function Classes.

Sven Kosub

Inf. Process. Lett., 1999

1998

Uniformly Defining Complexity Classes of Functions.

Sven Kosub, Heinz Schmitz, Heribert Vollmer

Proceedings of the STACS 98, 1998