13 citations · 24 across the 6 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015
A Note on Graphs with 2 Bends
Martin Pergel
We show NP-completeness for the recognition problem of 2-line-bend graphs.
math.CO2015
The Complexity of the Partial Order Dimension Problem - Closing the Gap
Stefan Felsner, Irina Mustata, Martin Pergel
The dimension of a partial order is the minimum number of linear orders whose intersection is . There are efficient algorithms to test if a partial order has dimension at mo…