XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

MLA

Sub Algorithms and Complexity, et al. XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. 2022. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.on1379185245&authtype=sso&custid=ns315887.

APA

Sub Algorithms and Complexity, Sub Mathematical Modeling, Algorithms and Complexity, Bodlaender, H. L., Groenland, C., Jacob, H., Jaffke, L., Lima, P. T., Dell, H., & Nederlof, J. (2022). XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure.

Chicago

Sub Algorithms and Complexity, Sub Mathematical Modeling, Algorithms and Complexity, Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima, Holger Dell, and Jesper Nederlof. 2022. “XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.on1379185245&authtype=sso&custid=ns315887.