6 citations · 7 across the 5 of their papers we have counts for
6 papers
On dually-CPT and strong-CPT posets
Liliana Alcón, Martin Charles Golumbic, Noemí Gudiño +2
A poset is a containment of paths in a tree (CPT) if it admits a representation by containment where each element of the poset is represented by a path in a tree and two elements a…
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators
Boi Faltings, Martin Charles Golumbic
Partitioning a graph using graph separators, and particularly clique separators, are well-known techniques to decompose a graph into smaller units which can be treated independentl…
Containment Graphs, Posets, and Related Classes of Graphs
Martin Charles Golumbic, Edward R. Scheinerman
In this paper, we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets. Let be a family of nonempty sets. We call a (s…
The Complexity of Helly- EPG Graph Recognition
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos +2
Golumbic, Lipshteyn, and Stern defined in 2009 the class of EPG graphs, the intersection graph class of edge paths on a grid. An EPG graph is a graph that admits a representati…
Boxicity and separation dimension
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic +2
A family of permutations of the vertices of a hypergraph is called 'pairwise suitable' for if, for every pair of disjoint edges in , there exists a permuta…
Chain Graphs have Unbounded Readability
Martin Charles Golumbic, Uri N. Peled, Udi Rotics
A triangle-free graph is called read- when there exists a monotone Boolean formula whose variables are the vertices of and whose minterms are precisely the edges of…