10988

Computers and Intractability: A Guide to the Theory of NPcompleteness
– M Garey, D Johnson
 1979

473

Testing for the consecutive ones property, interval graphs and graph planarity using PQtree algorithms
– K Booth, G Lueker
 1976

1155

Algorithmic Graph Theory and Perfect Graphs
– M C Golumbic
 2004

65

Fixedparameter tractability of graph modification problems for hereditary properties
– Leizhen Cai
 1996

40

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal and Proper Interval Graphs
– Haim Kaplan, Ron Shamir, Robert E. Tarjan
 1994

41

On the Complexity of DNA Physical Mapping
– Martin Charles Golumbic, Haim Kaplan, Ron Shamir
 1994

47

Physical Mapping of Chromosomes Using Unique Probes
– Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig
 1994

134

Representation of finite graphs by a set of intervals on the real line
– C Lekkerkerker, D Boland
 1962

53

Mapping the genome: some combinatorial problems arising in molecular biology
– R M Karp
 1993

894

Parameterized Complexity
– Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen
 1998

20

An NPcomplete problem on interval graphs
– T Kashiwabara, T Fujisawa
 1979

55

Asteroidal TripleFree Graphs
– Derek G. Corneil, Stephan Olariu, Lorna Stewart
 1997

20

Edgemaximal triangulated subgraphs and heuristics for the maximum clique problem
– J Xue
 1994

104

A graphtheoretic study of the numerical solution of sparse positive definite systems of linear equations
– D J Rose
 1973

14

Optical mapping of sitedirected cleavages on single DNA molecules by the RecAassisted restriction endonuclease technique
– Y K Wang, E J Huff, D C Schwartz
 1995

85

A characterization of rigid circuit graphs
– P Buneman
 1974

7

Parameterized complexity for graph layout problems
– M Serna, D M Thilikos

194

Incidence matrices and interval graphs
– D R Fulkerson, O A Gross
 1965

116

On rigid circuit graphs
– G Dirac
 1961
