Constructing tree decompositions of graphs with bounded gonality
From MaRDI portal
Publication:5918255
DOI10.1007/978-3-030-58150-3_31OpenAlexW3082375719MaRDI QIDQ5918255
Dion C. Gijswijt, Josse van Dobben de Bruyn, Harry Smit, Hans L. Bodlaender
Publication date: 21 April 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.05569
Related Items
Constructing tree decompositions of graphs with bounded gonality, Constructing tree decompositions of graphs with bounded gonality
Cites Work
- Unnamed Item
- A tropical proof of the Brill-Noether theorem
- Are PCPs inherent in efficient arguments?
- Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
- A partial k-arboretum of graphs with bounded treewidth
- Graph searching and a min-max theorem for tree-width
- Leakage resilient one-way functions: the auxiliary-input setting
- Treewidth is a lower bound on graph gonality
- A combinatorial Li-Yau inequality and rational points on curves
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Nonserial dynamic programming
- Bounded KDM Security from iO and OWF
- Barriers in cryptography with weak, correlated and leaky sources
- Harmonic Morphisms and Hyperelliptic Graphs
- Impossibility of Black-Box Simulation Against Leakage Attacks
- On the (Im)Possibility of Key Dependent Encryption
- Signature Schemes with Bounded Leakage Resilience
- Graph minors. II. Algorithmic aspects of tree-width
- The Knowledge Complexity of Interactive Proof Systems
- Foundations of Cryptography
- Self-organized critical state of sandpile automaton models
- A discrete analogue of the harmonic morphism and green kernel comparison theorems
- Sparse Graphs of High Gonality
- On the Composition of Zero-Knowledge Proof Systems
- On the Connection between Leakage Tolerance and Adaptive Security
- Limits of provable security from standard assumptions
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- On Seed-Incompressible Functions
- Theory of Cryptography
- Constructing tree decompositions of graphs with bounded gonality
