Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Sven Kosub
2010 – today
- 2012
[j11]Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura: Finding a Periodic Attractor of a Boolean Network. IEEE/ACM Trans. Comput. Biology Bioinform. 9(5): 1410-1421 (2012)- [c14]Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann: Inequalities for the Number of Walks in Graphs. ANALCO 2012: 28-39
2000 – 2009
- 2008
- [j10]Sven Kosub, Klaus W. Wagner: The boolean hierarchy of NP-partitions. Inf. Comput. 206(5): 538-568 (2008)
- [j9]Sven Kosub: Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems. Mathematics in Computer Science 1(3): 487-505 (2008)
- [j8]Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke: Combinatorial network abstraction by trees and distances. Theor. Comput. Sci. 407(1-3): 1-20 (2008)
- [i4]Sven Kosub: Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems. CoRR abs/0801.3802 (2008)
- [i3]Christopher M. Homan, Sven Kosub: Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. CoRR abs/0812.0283 (2008)
- 2007
- [j7]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster computing and the power of edge recognition. Inf. Comput. 205(8): 1274-1293 (2007)
- [j6]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner: The Complexity of Computing the Size of an Interval. SIAM J. Comput. 36(5): 1264-1300 (2007)
- [c13]Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak: All-Pairs Ancestor Problems in Weighted Dags. ESCAPE 2007: 282-293
- [c12]Sven Kosub, Christopher M. Homan: Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. ICTCS 2007: 163-174
- [c11]Benjamin Hummel, Sven Kosub: Acyclic type-of-relationship problems on the internet: an experimental analysis. Internet Measurement Comference 2007: 221-226
- 2006
- [j5]Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig: The complexity of detecting fixed-density clusters. Discrete Applied Mathematics 154(11): 1547-1562 (2006)
- [c10]Sven Kosub, Moritz G. Maaß, Hanjo Täubig: Acyclic Type-of-Relationship Problems on the Internet. CAAN 2006: 98-111
- [c9]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition. TAMC 2006: 283-294
- 2005
- [j4]Sven Kosub: NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. Theory Comput. Syst. 38(1): 83-113 (2005)
- [c8]Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke: Combinatorial Network Abstraction by Trees and Distances. ISAAC 2005: 1100-1109
- [i2]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner: The Complexity of Computing the Size of an Interval. CoRR abs/cs/0502058 (2005)
- [i1]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition. CoRR abs/cs/0509060 (2005)
- 2004
- [c7]
- 2003
- [j3]Matthias Galota, Sven Kosub, Heribert Vollmer: Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003)
- [c6]Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig: The Complexity of Detecting Fixed-Density Clusters. CIAC 2003: 201-212
- [c5]
- 2001
- [c4]Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner: The Complexity of Computing the Size of an Interval. ICALP 2001: 1040-1051
- 2000
- [j2]Sven Kosub, Heinz Schmitz, Heribert Vollmer: Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000)
- [c3]Sven Kosub: On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. MFCS 2000: 467-476
- [c2]
1990 – 1999
- 1999
- [j1]
- 1998
- [c1]Sven Kosub, Heinz Schmitz, Heribert Vollmer: Uniformly Defining Complexity Classes of Functions. STACS 1998: 607-617
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-15 21:55 CEST by the dblp team