#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1981

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sven Kosub, Klaus W. Wagner
- STACS
- 2000

- Sven Kosub
- Network Analysis
- 2004

- Sven Kosub
- Theory of Computing Systems
- 2000

The boolean hierarchy of k-partitions over NP for k ≥ 3 was introduced as a generalization of the well-known boolean hierarchy of sets (2-partitions). The classes of this hierarchy are exactly those classes of NP-partitions which are generated by finite labeled lattices. We generalize the boolean hierarchy of NP-partitions by studying partition classes… (More)

- Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak
- ESCAPE
- 2007

- Sven Kosub
- Inf. Process. Lett.
- 1999

- Christopher Homan, Sven Kosub
- ICTCS
- 2007

We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over the domain {0, 1}. For a class F of boolean functions and a class G of graphs, an (F ,G)-system is a boolean dynamical system with local transitions functions lying in F and… (More)

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

We contribute to the study of inferring commercial relationships between autonomous systems (AS relationships) from observable BGP routes. We deduce several forbidden patterns of AS relationships that impose a certain type of acyclicity on the AS graph. We investigate algorithms for solving the acyclic all-paths type-of-relationship problem, i.e., given a… (More)

- Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura
- IEEE/ACM Transactions on Computational Biology…
- 2012

In this paper, we study the problem of finding a periodic attractor of a Boolean network (BN), which arises in computational systems biology and is known to be NP-hard. Since a general case is quite hard to solve, we consider special but biologically important subclasses of BNs. For finding an attractor of period 2 of a BN consisting of n OR functions of… (More)

- Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
- Discrete Applied Mathematics
- 2003

We study the complexity of finding a subgraph of a certain size and a certain density, where density is measured by the average degree. Let γ : N → Q+ be any density function, i.e., γ is computable in polynomial time and satisfies γ(k) ≤ k − 1 for all k ∈ N. Then γ-Cluster is the problem of deciding, given an undirected graph G and a natural number k,… (More)

- Benjamin Hummel, Sven Kosub
- Internet Measurement Conference
- 2007

An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is provided. We investigate the maximum acyclic type-of-relationship problem: on a given set of AS paths, find a maximum-cardinality subset which allows an acyclic and valley-free… (More)