Physical review. E, Statistical, nonlinear, andâ€¦

2011

Complex combinatorial optimization can be used to design network systems having desired dynamics and that are robust against structural perturbations. Here genetic networks exhibiting limit-cycleâ€¦ (More)

We give a subexponential fixed parameter algorithm for one-sided crossing minimization. It runs in $O(k2^{\sqrt{2k}} + n)$ time, where n is the number of vertices of the given graph and parameter kâ€¦ (More)

We call a digraph h-semicomplete if each vertex of the digraph has at most h non-neighbors, where a non-neighbor of a vertex v is a vertex u 6= v such that there is no edge between u and v in eitherâ€¦ (More)

To solve hard graph problems from the parameterized perspective, structural parameters have commonly been used. In particular, vertex cover number is frequently used in this context. In this paper,â€¦ (More)

We give an algorithm for computing the directed pathwidth of a digraph with n vertices in $$O(1.89^{n})$$ O ( 1 . 89 n ) time. This is the first algorithm with running time better than theâ€¦ (More)

We give an algorithm that decides whether the bipartite crossing number of a given graph is at most k. The running time of the algorithm is upper bounded by 2 + n, where n is the number of verticesâ€¦ (More)