LIPIcs.ESA.2021.pdf
- Filesize: 38.96 MB
- 1340 pages
Document
LIPIcs, Volume 204, ESA 2021, Complete Volume
Authors
Petra Mutzel 
,
Rasmus Pagh ,
Grzegorz Herman
-
Part of:
Volume:
29th Annual European Symposium on Algorithms (ESA 2021)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: European Symposium on Algorithms (ESA) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2021-08-31
File
Document Identifiers
Author Details
Cite AsGet BibTex
29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 1-1340, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.ESA.2021
https://doi.org/10.4230/LIPIcs.ESA.2021
Abstract
LIPIcs, Volume 204, ESA 2021, Complete Volume
Subject Classification
ACM Subject Classification
- Computing methodologies → Concurrent computing methodologies
- Computing methodologies → Feature selection
- Computing methodologies → Search methodologies
- Mathematics of computing → Algebraic topology
- Mathematics of computing → Approximation algorithms
- Mathematics of computing → Discrete mathematics
- Mathematics of computing → Distribution functions
- Mathematics of computing → Graph algorithms
- Mathematics of computing → Graph coloring
- Mathematics of computing → Graph enumeration
- Mathematics of computing → Graphs and surfaces
- Mathematics of computing → Matroids and greedoids
- Mathematics of computing → Paths and connectivity problems
- Mathematics of computing → Permutations and combinations
- Mathematics of computing → Probabilistic algorithms
- Mathematics of computing → Random graphs
- Mathematics of computing → Topology
- Mathematics of computing → Trees
- Networks → Network algorithms
- Security and privacy → Pseudonymity, anonymity and untraceability
- Theory of computation → Algorithm design techniques
- Theory of computation → Algorithmic game theory
- Theory of computation → Algorithmic mechanism design
- Theory of computation → Approximation algorithms analysis
- Theory of computation → Backtracking
- Theory of computation → Cell probe models and lower bounds
- Theory of computation → Computational complexity and cryptography
- Theory of computation → Computational geometry
- Theory of computation → Data compression
- Theory of computation → Data structures design and analysis
- Theory of computation → Design and analysis of algorithms
- Theory of computation → Dynamic graph algorithms
- Theory of computation → Dynamic programming
- Theory of computation → Fixed parameter tractability
- Theory of computation → Graph algorithms analysis
- Theory of computation → Machine learning theory
- Theory of computation → Models of computation
- Theory of computation → Network flows
- Theory of computation → Network optimization
- Theory of computation → Online algorithms
- Theory of computation → Packing and covering problems
- Theory of computation → Parameterized complexity and exact algorithms
- Theory of computation → Pattern matching
- Theory of computation → Problems, reductions and completeness
- Theory of computation → Pseudorandomness and derandomization
- Theory of computation → Quantum complexity theory
- Theory of computation → Quantum computation theory
- Theory of computation → Random network models
- Theory of computation → Rounding techniques
- Theory of computation → Scheduling algorithms
- Theory of computation → Semidefinite programming
- Theory of computation → Shared memory algorithms
- Theory of computation → Shortest paths
- Theory of computation → Sparsification and spanners
Keywords
- LIPIcs, Volume 204, ESA 2021, Complete Volume
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads