3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DS2018
Finding a Maximum-Weight Convex Set in a Chordal Graph
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal grap…
cs.CG2018★ 3 cited
A universality theorem for allowable sequences with applications
Udo Hoffmann, Keno Merckx
Order types are a well known abstraction of combinatorial properties of a point set. By Mnëv's universality theorem for each semi-algebraic set there is an order type with a re…