Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range applications and are often visualized as 2-layered drawings, where each set objects is vertices (points) on one parallel horizontal lines relationships represented by (usually straight-line) edges corresponding vertices. One common objectives in such drawings to minimize number crossings. This, ...

Many tractable algorithms for solving the Constraint Satisfaction Problem (Csp) have been developed using the notion of the treewidth of some graph derived from the input Csp instance. In particular, the incidence graph of the Csp instance is one such graph. We introduce the notion of an incidence graph for modal logic formulae in a certain normal form. We investigate the parameterized complexi...

We explore the numerical reconstruction of the potential energy profile of a molecular bond from distributions of bond rupture times. For a single measured first passage time (FPT) distribution the inverse problem is highly ill-conditioned and only a few attributes (such as the height and width of an energy barrier) can usually be reconstructed. Upon more careful analysis, we find optimal tempe...

The aims of the paper are to describe the Vietnamese offshore software outsourcing industry and to investigate key success factors of the largest offshore software outsourcing company in Vietnam, FPT Software. Vietnam has taken ICT industry a strategic one for its economic development, and it has been showing high growth in that field. Especially, Vietnam has potential to be successful in offsh...

Over the past two decades the main focus of research into first-order (FO) model checking algorithms has been on sparse relational structures – culminating in the FPT algorithm by Grohe, Kreutzer and Siebertz for FO model checking of nowhere dense classes of graphs. On contrary to that, except the case of locally bounded clique-width only little is currently known about FO model checking of den...

Many tractable algorithms for solving the Constraint Satisfaction Problem (Csp) have been developed using the notion of the treewidth of some graph derived from the input Csp instance. In particular, the incidence graph of the Csp instance is one such graph. We introduce the notion of an incidence graph for modal logic formulas in a certain normal form. We investigate the parameterized complexi...

We propose a novel approach to learn the structure of Partially Observable Markov Models (POMMs) and to estimate jointly their parameters. POMMs are graphical models equivalent to Hidden Markov Models (HMMs). The model structure is built to support the First Passage Times (FPT) dynamics observed in the training sample. We argue that the FPT in POMMs are closely related to the model structure. S...

We present a complete classification of the parameterized complexity of all operator fragments of the satisfiability problem in computation tree logic CTL. The investigated parameterization is temporal depth and pathwidth. Our results show a dichotomy between W[1]-hard and fixed-parameter tractable fragments. The two real operator fragments which are in FPT are the fragments containing solely A...

We propose a new theoretical approach to study the kinetics of the electron transfer (ET) under the dynamical influence of the complex environments with the first passage times (FPT) of the reaction events. By measuring the mean and high order moments of FPT and their ratios, the full kinetics of ET, especially the dynamical transitions across different temperature zones, is revealed. The poten...