research
∙
03/11/2021
Terrain prickliness: theoretical grounds for low complexity viewsheds
An important task when working with terrain models is computing viewshed...
share
research
∙
10/13/2020
On the Complexity of Some Facet-Defining Inequalities of the QAP-polytope
The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem t...
research
∙
01/15/2020
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach
It can be shown that each permutation group G S_n can be embedded, in a...
research
∙
02/27/2019
