Seven open problems in applied combinatorics
Not on the map. Why?
Abstract (arXiv)
We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 75 references that are in the map. First posted on arXiv 20 Mar 2023.
Builds on
11 of 75 references.
References · 11
- 2018Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clusteringcited by 25
- 2020Hypergraph Cuts with General Splitting Functionscited by 14
- 2021Decoding the Protein-ligand Interactions Using Parallel Graph Neural Networkscited by 10
- 2017Divide-and-Conquer Checkpointing for Arbitrary Programs with No User Annotationcited by 6
- 2020Directional Laplacian Centrality for Cyber Situational Awarenesscited by 4
- 2013Graph Induced Complex on Point Datacited by 3
- 2014Zero forcing sets and controllability of dynamical systems defined on graphscited by 2
- 2017A generative graph model for electrical infrastructure networkscited by 2
- 2019Ramanujan Graphs and the Spectral Gap of Supercomputing Topologiescited by 1
- 2020Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Fortscited by 1
- 2021Approximate Decomposable Submodular Function Minimization for Cardinality-Based Componentscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.