Lombardi Drawings of Knots and Links
DOI10.1007/978-3-319-73915-1_10zbMath1464.68288arXiv1708.09819OpenAlexW2751467574MaRDI QIDQ4625105
Maarten Löffler, André Schulz, Stephen G. Kobourov, Martin Nöllenburg, Birgit Vogtenhuber, Philipp Kindermann
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/1708.09819
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Relations of low-dimensional topology with graph theory (57M15) Graph representations (geometric and intersection representations, etc.) (05C62) Knot theory (57K10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the eigenvectors of Hadamard matrices of order \(2^ n\).
- The \textsf{Simeck} family of lightweight block ciphers
- Improving key-recovery in linear attacks: application to 28-round PRESENT
- Improved automatic search algorithm for differential and linear cryptanalysis on SIMECK and the applications
- On probability of success in linear and differential cryptanalysis
- Linear Hull Attack on Round-Reduced Simeck with Dynamic Key-Guessing Techniques
- Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers
- Improving the Algorithm 2 in Multidimensional Linear Cryptanalysis
- Multidimensional Extension of Matsui’s Algorithm 2
- Improved Linear Cryptanalysis of Reduced-Round SIMON-32 and SIMON-48
- Toeplitz and Circulant Matrices: A Review
- MILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck
- Improved Linear Hull Attack on Round-Reduced Simon with Dynamic Key-Guessing Techniques
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- New Impossible Differential Search Tool from Design and Cryptanalysis Aspects
- Advances in Cryptology – CRYPTO 2004
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- Smooth Orthogonal Drawings of Planar Graphs
- Lombardi Drawings of Graphs
This page was built for publication: Lombardi Drawings of Knots and Links
