In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
Second order sliding modes are used to keep exactly a constraint of the second relative degree or just to avoid chattering, i.e. in the cases when the standard (first order) slidi...
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...