A

Seven open problems in applied combinatorics

Journal of Combinatorics, vol. 14, pp. 559–601

Abstract

We present and discuss seven different open problems in applied combinatorics. Additionally, the application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.

Authors 12

  1. Pacific Northwest National Laboratory

    Affiliation as printed

    Pacific Northwest National Laboratory, Richland, Washington, U.S.A

  2. Oak Ridge National Laboratory

    Affiliation as printed

    Oak Ridge National Laboratory, Oak Ridge, Tennessee, U.S.A

  3. Temple University

    Affiliation as printed

    Temple University, Philadelphia, Pennsylvania, U.S.A

  4. The University of Texas at Dallas

    Affiliation as printed

    University of Texas, Dallas, Tx., U.S.A

  5. Pacific Northwest National Laboratory

    Affiliation as printed

    Pacific Northwest National Laboratory, Richland, Washington, U.S.A

  6. Uwe Naumann Aachen

    RWTH Aachen University

    Affiliation as printed

    RWTH Aachen University, Aachen, Germany

  7. Pacific Northwest National Laboratory

    Affiliation as printed

    Pacific Northwest National Laboratory, Richland, Washington, U.S.A

  8. Washington State University

    Affiliation as printed

    Washington State University, U.S.A

  9. California Institute of Technology · Jet Propulsion Laboratory · The University of Texas at Dallas

    Affiliation as printed

    University of Texas at Dallas, Jet Propulsion Laboratory, Caltech, U.S.A

  10. Texas A&M University

    Affiliation as printed

    Texas A&M University, College Station, Tx., U.S.A

  11. Pacific Northwest National Laboratory

    Affiliation as printed

    Pacific Northwest National Laboratory, Richland, Washington, U.S.A

Cited by 1 stored of 1

1 result

No patents citing this paper on Lens.org (checked 2026-10-06).

References 0