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
-
Pacific Northwest National Laboratory
Affiliation as printed
Pacific Northwest National Laboratory, Richland, Washington, U.S.A
-
Affiliation as printed
Oak Ridge National Laboratory, Oak Ridge, Tennessee, U.S.A
-
Affiliation as printed
Temple University, Philadelphia, Pennsylvania, U.S.A
-
The University of Texas at Dallas
Affiliation as printed
University of Texas, Dallas, Tx., U.S.A
-
Pacific Northwest National Laboratory
Affiliation as printed
Pacific Northwest National Laboratory, Richland, Washington, U.S.A
-
Uwe Naumann Aachen
Affiliation as printed
RWTH Aachen University, Aachen, Germany
-
Pacific Northwest National Laboratory
Affiliation as printed
Pacific Northwest National Laboratory, Richland, Washington, U.S.A
-
Affiliation as printed
Washington State University, U.S.A
-
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
-
Affiliation as printed
Texas A&M University, College Station, Tx., U.S.A
-
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).