( en | de | ru )

 

Disambiguation of "Spinrad, Jeremy P."

Author of the publication

copydeleteadd this publication to your clipboard
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs.

, , , and . SIAM J. Comput., 36 (2): 326-353 (2006)

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.

Jeremy Cohen

Jérémy Bluteau

Jeremy Debattista

Jérémy Huart

Jérémy Fix

 

Other publications of authors with the same name

Recognizing Threshold Tolerance Graphs in O(n2) Time., , , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 214-224. Springer, (2014)Consequences of an algorithm for bridged graphs., and . Discret. Math., 280 (1-3): 271-274 (2004)An improved edge bound on the interval number of a graph., , and . J. Graph Theory, 11 (3): 447-449 (1987)Avoiding Matrix Multiplication., and . WG, volume 484 of Lecture Notes in Computer Science, page 61-71. Springer, (1990)Weakly chordal graph algorithms via handles., , and . SODA, page 42-49. ACM/SIAM, (2000)Transitive Orientation in O(n²) Time. STOC, page 457-466. ACM, (1983)An O(n2) Algorithm for Circular-Arc Graph Recognition., and . SODA, page 128-137. ACM/SIAM, (1993)A polynomial time recognition algorithm for probe interval graphs., and . SODA, page 477-486. ACM/SIAM, (2001)Certifying algorithms for recognizing interval graphs and permutation graphs., , , and . SODA, page 158-167. ACM/SIAM, (2003)Construction of probe interval models., and . SODA, page 866-875. ACM/SIAM, (2002)