activity
20132018
most citedUsing ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings

3 citations · 8 across the 7 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

cs.CG2013★ 3 cited

Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings

Therese Biedl, Thomas Bläsius, Benjamin Niedermann +3

We present a simple and versatile formulation of grid-based graph representation problems as an integer linear program (ILP) and a corresponding SAT instance. In a grid-based repre…

cs.CG2013

Euclidean Greedy Drawings of Trees

Martin Nöllenburg, Roman Prutkin

Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding…