The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
This paper studies a general class of formations of unicycle robots. One of the robots plays the role of the leader and the formation is induced through a constraint function F tha...
Rational eigenvalue problems (REPs) are an emerging class of nonlinear eigenvalue problems that arise from a variety of physical applications. In this paper, we propose a lineariz...
Achieving computer vision on micro-scale devices is a challenge. On these platforms, the power and mass constraints are severe enough for even the most common computations (matrix...