2 citations · 4 across the 3 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
Submodular Goal Value of Boolean Functions
Eric Bach, Jeremie Dusart, Lisa Hellerstein +1
Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the "goal value" of the function. The goal value of is defined…
cs.DM2016★ 2 cited
Maximal cliques structure for cocomparability graphs and applications
Jérémie Dusart, Michel Habib, Derek G. Corneil
A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this…