• Publications
  • Influence
Emptiness Problems for Integer Circuits
We study the computational complexity of emptiness problems for circuits over sets of natural numbers with the operations union, intersection, complement, addition, and multiplication. For mostExpand
  • 4
  • PDF
Concatenated k-Path Covers
  • 1
Planar Steiner Orientation is NP-complete
Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edges) and a set T of kExpand
  • 1
  • PDF
Emptiness problems for integer circuits
Abstract We study the computational complexity of emptiness problems for circuits over sets of natural numbers with the operations union, intersection, complement, addition, and multiplication. ForExpand
Puzzling Grid Embeddings
  • 1
Minimum Polygons for Fixed Visibility VC-Dimension
Motivated by the art gallery problem, the visibility VC-dimension was investigated as a measure for the complexity of polygons in previous work. It was shown that simple polygons exhibit a visibilityExpand