| 2008 |
|---|
| 27 | EE | Sven Kosub:
Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems
CoRR abs/0801.3802: (2008) |
| 26 | EE | Christopher M. Homan,
Sven Kosub:
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
CoRR abs/0812.0283: (2008) |
| 25 | EE | Sven Kosub,
Klaus W. Wagner:
The boolean hierarchy of NP-partitions.
Inf. Comput. 206(5): 538-568 (2008) |
| 24 | EE | Sven Kosub:
Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems.
Mathematics in Computer Science 1(3): 487-505 (2008) |
| 23 | EE | 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) |
| 2007 |
|---|
| 22 | EE | Matthias Baumgart,
Stefan Eckhardt,
Jan Griebsch,
Sven Kosub,
Johannes Nowak:
All-Pairs Ancestor Problems in Weighted Dags.
ESCAPE 2007: 282-293 |
| 21 | | Sven Kosub,
Christopher M. Homan:
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems.
ICTCS 2007: 163-174 |
| 20 | EE | Benjamin Hummel,
Sven Kosub:
Acyclic type-of-relationship problems on the internet: an experimental analysis.
Internet Measurement Comference 2007: 221-226 |
| 19 | EE | Lane A. Hemaspaandra,
Christopher M. Homan,
Sven Kosub:
Cluster computing and the power of edge recognition.
Inf. Comput. 205(8): 1274-1293 (2007) |
| 18 | EE | 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) |
| 2006 |
|---|
| 17 | EE | Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig:
Acyclic Type-of-Relationship Problems on the Internet.
CAAN 2006: 98-111 |
| 16 | EE | Lane A. Hemaspaandra,
Christopher M. Homan,
Sven Kosub:
Cluster Computing and the Power of Edge Recognition.
TAMC 2006: 283-294 |
| 15 | EE | 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) |
| 2005 |
|---|
| 14 | EE | Stefan Eckhardt,
Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig,
Sebastian Wernicke:
Combinatorial Network Abstraction by Trees and Distances.
ISAAC 2005: 1100-1109 |
| 13 | EE | 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) |
| 12 | EE | Lane A. Hemaspaandra,
Christopher M. Homan,
Sven Kosub:
Cluster Computing and the Power of Edge Recognition
CoRR abs/cs/0509060: (2005) |
| 11 | EE | 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) |
| 2004 |
|---|
| 10 | EE | Sven Kosub:
Local Density.
Network Analysis 2004: 112-142 |
| 2003 |
|---|
| 9 | EE | Klaus Holzapfel,
Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig:
The Complexity of Detecting Fixed-Density Clusters.
CIAC 2003: 201-212 |
| 8 | EE | Sven Kosub:
Boolean NP-Partitions and Projective Closure.
DMTCS 2003: 225-236 |
| 7 | EE | Matthias Galota,
Sven Kosub,
Heribert Vollmer:
Generic separations and leaf languages.
Math. Log. Q. 49(4): 353-362 (2003) |
| 2001 |
|---|
| 6 | EE | Lane A. Hemaspaandra,
Sven Kosub,
Klaus W. Wagner:
The Complexity of Computing the Size of an Interval.
ICALP 2001: 1040-1051 |
| 2000 |
|---|
| 5 | EE | Sven Kosub:
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems.
MFCS 2000: 467-476 |
| 4 | EE | Sven Kosub,
Klaus W. Wagner:
The Boolean Hierarchy of NP-Partitions.
STACS 2000: 157-168 |
| 3 | | Sven Kosub,
Heinz Schmitz,
Heribert Vollmer:
Uniform Characterizations of Complexity Classes of Functions.
Int. J. Found. Comput. Sci. 11(4): 525-551 (2000) |
| 1999 |
|---|
| 2 | EE | Sven Kosub:
A Note on Unambiguous Function Classes.
Inf. Process. Lett. 72(5-6): 197-203 (1999) |
| 1998 |
|---|
| 1 | | Sven Kosub,
Heinz Schmitz,
Heribert Vollmer:
Uniformly Defining Complexity Classes of Functions.
STACS 1998: 607-617 |
