Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
This paper discusses how semiotic engineering can support the formulation of problems and solutions involved in handling face-to-face (F2F) sociability models in computer-mediated ...