Obstacle Numbers of Planar Graphs
From MaRDI portal
Publication:4625101
DOI10.1007/978-3-319-73915-1_6zbMath1503.68220arXiv1706.06992OpenAlexW2963407142MaRDI QIDQ4625101
Pavel Valtr, Patrice Ossona de Mendez, John G. Gimbel
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.06992
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improbable differential attacks on \texttt{PRESENT} using undisturbed bits
- Provable Security Evaluation of Structures Against Impossible Differential and Zero Correlation Linear Cryptanalysis
- Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs
- Block Ciphers – Focus on the Linear Layer (feat. PRIDE)
- Automatic Search of Truncated Impossible Differentials for Word-Oriented Block Ciphers
- Impossible Differentials of SPN Ciphers
- Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis
- PRESENT: An Ultra-Lightweight Block Cipher
- Cube Attacks on Tweakable Black Box Polynomials
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- GIFT: A Small Present
- The PHOTON Family of Lightweight Hash Functions
- New Impossible Differential Search Tool from Design and Cryptanalysis Aspects
- Unsolved problems in visibility graphs of points, segments, and polygons
- Progress in Cryptology - INDOCRYPT 2003
- Visibility Algorithms in the Plane
- Toward a theory of crossing numbers
