On the algorithmic complexity of twelve covering and independence parameters of graphs

The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to covering and independence, each of which has been studied previously in some form. Here we survey briefly results concerning total coverings and total matchings of graphs, and consider the aforementioned 12 covering and independence parameters with regard to algorithmic complexity. We survey briefly known results for several graph classes, and obtain new NP-completeness results for the minimum total cover and maximum minimal total cover problems in planar graphs, the minimum maximal total matching problem in bipartite and chordal graphs, and the minimum independent dominating set problem in planar cubic graphs

Self-Evaluation Applied Mathematics 2003-2008 University of Twente

This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008

Hidden attractors in fundamental problems and engineering models

Recently a concept of self-excited and hidden attractors was suggested: an attractor is called a self-excited attractor if its basin of attraction overlaps with neighborhood of an equilibrium, otherwise it is called a hidden attractor. For example, hidden attractors are attractors in systems with no equilibria or with only one stable equilibrium (a special case of multistability and coexistence of attractors). While coexisting self-excited attractors can be found using the standard computational procedure, there is no standard way of predicting the existence or coexistence of hidden attractors in a system. In this plenary survey lecture the concept of self-excited and hidden attractors is discussed, and various corresponding examples of self-excited and hidden attractors are considered