Sven Kosub

Orcid: 0000-0001-6316-8546

Affiliations:
  • University of Konstanz, Department of Computer & Information Science, Germany


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Permutation Inequalities for Walks in Graphs.
CoRR, 2023

2022
Global Evaluation for Decision Tree Learning.
CoRR, 2022

2020
A note on the complexity of manipulating weighted Schulze voting.
Inf. Process. Lett., 2020

Smoothed Analysis of Trie Height by Star-like PFAs.
CoRR, 2020

2019
A note on the triangle inequality for the Jaccard distance.
Pattern Recognit. Lett., 2019

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

2015
Dichotomy results for fixed point counting in boolean dynamical systems.
Theor. Comput. Sci., 2015

2013
Inequalities for the Number of Walks in Graphs.
Algorithmica, 2013

2012
Finding a Periodic Attractor of a Boolean Network.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

2010
Computational analysis of complex systems. Discrete foundations, algorithms, and the internet
PhD thesis, 2010

2008
Combinatorial network abstraction by trees and distances.
Theor. Comput. Sci., 2008

Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems.
Math. Comput. Sci., 2008

The boolean hierarchy of NP-partitions.
Inf. Comput., 2008

2007
The Complexity of Computing the Size of an Interval.
SIAM J. Comput., 2007

Cluster computing and the power of edge recognition.
Inf. Comput., 2007

Acyclic type-of-relationship problems on the internet: an experimental analysis.
Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007

All-Pairs Ancestor Problems in Weighted Dags.
Proceedings of the Combinatorics, 2007

2006
The complexity of detecting fixed-density clusters.
Discret. Appl. Math., 2006

Acyclic Type-of-Relationship Problems on the Internet.
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.
Theory Comput. Syst., 2005

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

2003
Generic separations and leaf languages.
Math. Log. Q., 2003

Boolean NP-Partitions and Projective Closure.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2001
Complexity and Partitions (Komplexität von Partitionen)
PhD thesis, 2001

The Complexity of Computing the Size of an Interval.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Uniform Characterizations of Complexity Classes of Functions.
Int. J. Found. Comput. Sci., 2000

1999
A Note on Unambiguous Function Classes.
Inf. Process. Lett., 1999

1998
Uniformly Defining Complexity Classes of Functions.
Proceedings of the STACS 98, 1998


  Loading...