Cite
Graph editing to bipartite interval graphs: Exact and asymptotic bounds.
MLA
Goos, Gerhard, et al. “Graph Editing to Bipartite Interval Graphs: Exact and Asymptotic Bounds.” Foundations of Software Technology & Theoretical Computer Science, 1997, pp. 37–53. EBSCOhost, https://doi.org/10.1007/BFb0058021.
APA
Goos, G., Hartmanis, J., Leeuwen, J., Ramesh, S., Sivakumar, G., Cirino, K., Muthukrishnan, S., Narayanaswamy, N. S., & Ramesh, H. (1997). Graph editing to bipartite interval graphs: Exact and asymptotic bounds. In Foundations of Software Technology & Theoretical Computer Science (pp. 37–53). https://doi.org/10.1007/BFb0058021
Chicago
Goos, Gerhard, Juris Hartmanis, Jan Leeuwen, S. Ramesh, G. Sivakumar, K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, and H. Ramesh. 1997. “Graph Editing to Bipartite Interval Graphs: Exact and Asymptotic Bounds.” In Foundations of Software Technology & Theoretical Computer Science, 37–53. doi:10.1007/BFb0058021.