( en | de | ru )

 

Disambiguation of "Golumbic, Martin Charles"

Author of the publication

copydeleteadd this publication to your clipboard
String graphs of k-bend paths on a grid.

, , , , , and . Electron. Notes Discret. Math., (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Charles Trenckle

Charles Horowitz

Charles Grard

Charles Zschau

Charles Asseke

 

Other publications of authors with the same name

Factoring and Recognition of Read-Once Functions using Cographs and Normality., , and . DAC, page 109-114. ACM, (2001)Landmarks in Algorithmic Graph Theory: A Personal Retrospective.. Graph Theory, Computational Intelligence and Thought, volume 5420 of Lecture Notes in Computer Science, page 1-14. Springer, (2009)Containment Graphs, Posets, and Related Classes of Graphs., and . CoRR, (2019)Constraint Satisfiability Algorithms for Interactive Student Scheduling., and . IJCAI, page 1010-1016. Morgan Kaufmann, (1989)On the Clique-Width of Perfect Graph Classes., and . WG, volume 1665 of Lecture Notes in Computer Science, page 135-147. Springer, (1999)On the Clique-Width of Some Perfect Graph Classes., and . Int. J. Found. Comput. Sci., 11 (3): 423-443 (2000)Two tricks to triangulate chordal probe graphs in polynomial time., , and . SODA, page 962-969. SIAM, (2004)On the bi-enhancement of chordal-bipartite probe graphs., , , and . Inf. Process. Lett., 110 (5): 193-197 (2010)Stability in Circular Arc Graphs., and . J. Algorithms, 9 (3): 314-320 (1988)Ineractive Scheduling as a Constraint Satisfiability Problem., and . Ann. Math. Artif. Intell., (1990)