The following pages link to Martin Charles Golumbic (Q251894):
Displayed 50 items.
- Approximation Algorithms for B 1-EPG Graphs (Q2842171) (← links)
- Boxicity and Separation Dimension (Q2945181) (← links)
- Edge intersection graphs of single bend paths on a grid (Q3057113) (← links)
- Vertex Intersection Graphs of Paths on a Grid (Q3143733) (← links)
- Induced Separation Dimension (Q3181052) (← links)
- (Q3198899) (← links)
- (Q3221420) (← links)
- (Q3322150) (← links)
- (Q3328583) (← links)
- (Q3374244) (← links)
- (Q3386616) (← links)
- Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
- Twenty Years of EPT Graphs: From Haifa to Rostock (Q3439519) (← links)
- Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs (Q3519195) (← links)
- Finding Intersection Models of Weakly Chordal Graphs (Q3522961) (← links)
- (Q3576666) (← links)
- Landmarks in Algorithmic Graph Theory: A Personal Retrospective (Q3655134) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- (Q3688409) (← links)
- Stability in circular arc graphs (Q3796775) (← links)
- The edge inducibility of graphs (Q3910550) (← links)
- (Q3914453) (← links)
- (Q3936781) (← links)
- Containment Graphs, Posets, and Related Classes of Graphs (Q3972134) (← links)
- (Q4078052) (← links)
- Combinatorial Merging (Q4141107) (← links)
- (Q4182796) (← links)
- (Q4196463) (← links)
- Perfect Elimination and Chordal Bipartite Graphs (Q4198811) (← links)
- Complexity and algorithms for reasoning about time (Q4285633) (← links)
- (Q4329117) (← links)
- (Q4400883) (← links)
- Archimedean ϕ ‐tolerance graphs (Q4798113) (← links)
- (Q4808719) (← links)
- (Q4828541) (← links)
- Graph Sandwich Problems (Q4857542) (← links)
- (Q4944973) (← links)
- (Q4949812) (← links)
- (Q4949865) (← links)
- The Zeroth Book of Graph Theory (Q4963505) (← links)
- Preliminaries (Q5058664) (← links)
- Graph algorithms (Q5058665) (← links)
- Chordal graphs (Q5058670) (← links)
- Dually and strongly chordal graphs (Q5058671) (← links)
- (Q5133652) (← links)
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049) (← links)
- What Is between Chordal and Weakly Chordal Graphs? (Q5302062) (← links)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463947) (← links)
- Rank‐tolerance graph classes (Q5486282) (← links)
- (Q5501362) (← links)