Sven Kosub

43 papers A* 1A 3B 2C 2Journal 27Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Optimal Scalability-Aware Allocation of Swarm Robots: From Linear to Retrograde Performance via Marginal Gains.
IEEE Trans. Syst. Man Cybern. Syst.
Simay Atasoy Bingöl, Tobias Töpfer, Sven Kosub, Heiko Hamann, Andreagiovanni Reina
2025 J jnl
Optimal Scalability-Aware Allocation of Swarm Robots: From Linear to Retrograde Performance via Marginal Gains.
CoRR
Simay Atasoy Bingöl, Tobias Töpfer, Sven Kosub, Heiko Hamann, Andreagiovanni Reina
2023 J jnl
Permutation Inequalities for Walks in Graphs.
CoRR
Nadja Willenborg, Sven Kosub
2022 J jnl
Global Evaluation for Decision Tree Learning.
CoRR
Fabian Spaeh, Sven Kosub
2020 J jnl
A note on the complexity of manipulating weighted Schulze voting.
Inf. Process. Lett.
Julian Müller, Sven Kosub
2020 J jnl
Smoothed Analysis of Trie Height by Star-like PFAs.
CoRR
Stefan Eckhardt, Sven Kosub, Johannes Nowak
2019 J jnl
A note on the triangle inequality for the Jaccard distance.
Pattern Recognit. Lett.
Sven Kosub
2018 J jnl
A Note on the Complexity of Manipulating Weighted Schulze Voting.
CoRR
Julian Müller, Sven Kosub
2017 J jnl
How to Make Sense of Team Sport Data: From Acquisition to Data Modeling and Research Aspects.
Data
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
2016 J jnl
A note on the triangle inequality for the Jaccard distance.
CoRR
Sven Kosub
2015 J jnl
Dichotomy results for fixed point counting in boolean dynamical systems.
Theor. Comput. Sci.
Christopher M. Homan, Sven Kosub
2013 J jnl
Inequalities for the Number of Walks in Graphs.
Algorithmica
Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr
2012 J jnl
Finding a Periodic Attractor of a Boolean Network.
IEEE ACM Trans. Comput. Biol. Bioinform.
Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura
2012 — conf
Inequalities for the Number of Walks in Graphs.
ANALCO
Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann
2008 J jnl
Combinatorial network abstraction by trees and distances.
Theor. Comput. Sci.
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
2008 J jnl
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
CoRR
Christopher M. Homan, Sven Kosub
2008 J jnl
Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems
CoRR
Sven Kosub
2008 J jnl
Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems.
Math. Comput. Sci.
Sven Kosub
2008 J jnl
The boolean hierarchy of NP-partitions.
Inf. Comput.
Sven Kosub, Klaus W. Wagner
2007 A conf
Acyclic type-of-relationship problems on the internet: an experimental analysis.
Internet Measurement Conference
Benjamin Hummel, Sven Kosub
2007 — conf
All-Pairs Ancestor Problems in Weighted Dags.
ESCAPE
Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak
2007 J jnl
Cluster computing and the power of edge recognition.
Inf. Comput.
Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
2007 — book
Computational Analysis of Complex Systems: Discrete Foundations, Algorithms, and the Internet
Sven Kosub
2007 — conf
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems.
ICTCS
Sven Kosub, Christopher M. Homan
2007 J jnl
The Complexity of Computing the Size of an Interval.
SIAM J. Comput.
Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
2006 — conf
Acyclic Type-of-Relationship Problems on the Internet.
CAAN
Sven Kosub, Moritz G. Maaß, Hanjo Täubig
2006 C conf
Cluster Computing and the Power of Edge Recognition.
TAMC
Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
2006 J jnl
The complexity of detecting fixed-density clusters.
Discret. Appl. Math.
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
2005 J jnl
Cluster Computing and the Power of Edge Recognition
CoRR
Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
2005 B conf
Combinatorial Network Abstraction by Trees and Distances.
ISAAC
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
2005 J jnl
NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems.
Theory Comput. Syst.
Sven Kosub
2005 J jnl
The Complexity of Computing the Size of an Interval
CoRR
Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
2004 — conf
Local Density.
Network Analysis
Sven Kosub
2003 — conf
Boolean NP-Partitions and Projective Closure.
DMTCS
Sven Kosub
2003 J jnl
Generic separations and leaf languages.
Math. Log. Q.
Matthias Galota, Sven Kosub, Heribert Vollmer
2003 C conf
The Complexity of Detecting Fixed-Density Clusters.
CIAC
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
2001 — —
Complexity and Partitions (Komplexität von Partitionen)
Sven Kosub
2001 A* conf
The Complexity of Computing the Size of an Interval.
ICALP
Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner
2000 B conf
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems.
MFCS
Sven Kosub
2000 A conf
The Boolean Hierarchy of NP-Partitions.
STACS
Sven Kosub, Klaus W. Wagner
2000 J jnl
Uniform Characterizations of Complexity Classes of Functions.
Int. J. Found. Comput. Sci.
Sven Kosub, Heinz Schmitz, Heribert Vollmer
1999 J jnl
A Note on Unambiguous Function Classes.
Inf. Process. Lett.
Sven Kosub
1998 A conf
Uniformly Defining Complexity Classes of Functions.
STACS
Sven Kosub, Heinz Schmitz, Heribert Vollmer