LIPIcs.ESA.2019.pdf
- Filesize: 47.74 MB
- 1312 pages
Document
LIPIcs, Volume 144, ESA'19, Complete Volume
Authors
Ola Svensson 
,
Grzegorz Herman
-
Part of:
Volume:
27th Annual European Symposium on Algorithms (ESA 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: European Symposium on Algorithms (ESA) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2019-09-17
File
Document Identifiers
Author Details
Cite AsGet BibTex
Michael A. Bender, Ola Svensson, and Grzegorz Herman. LIPIcs, Volume 144, ESA'19, Complete Volume. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.ESA.2019
https://doi.org/10.4230/LIPIcs.ESA.2019
Abstract
LIPIcs, Volume 144, ESA'19, Complete Volume
Subject Classification
ACM Subject Classification
- Applied computing → Transportation
- Computing methodologies → Algebraic algorithms
- Hardware → External storage
- Human-centered computing → Graph drawings
- Information systems → Data structures
- Mathematics of computing → Algebraic topology
- Mathematics of computing → Approximation algorithms
- Mathematics of computing → Combinatorial algorithms
- Mathematics of computing → Combinatorial optimization
- Mathematics of computing → Graph algorithms
- Mathematics of computing → Graphs and surfaces
- Mathematics of computing → Graph theory
- Mathematics of computing → Integer programming
- Mathematics of computing → Linear programming
- Mathematics of computing → Network flows
- Mathematics of computing → Network optimization
- Mathematics of computing → Paths and connectivity problems
- Mathematics of computing → Probabilistic algorithms
- Mathematics of computing → Probability and statistics
- Mathematics of computing → Semidefinite programming
- Mathematics of computing → Spectra of graphs
- Networks → Network algorithms
- Networks → Routing protocols
- Theory of computation → Algorithm design techniques
- Theory of computation → Algorithmic game theory and mechanism design
- Theory of computation → Algorithmic mechanism design
- Theory of computation → Approximation algorithms analysis
- Theory of computation → Computational complexity and cryptography
- Theory of computation → Computational geometry
- Theory of computation → Convex optimization
- 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 → Exact and approximate computation of equilibria
- Theory of computation → Facility location and clustering
- Theory of computation → Fixed parameter tractability
- Theory of computation → Graph algorithms analysis
- Theory of computation → Interactive proof systems
- Theory of computation → Linear programming
- Theory of computation → Lower bounds and information complexity
- Theory of computation → Massively parallel algorithms
- Theory of computation → Mathematical optimization
- Theory of computation → Nearest neighbor algorithms
- Theory of computation → Network flows
- Theory of computation → Numeric approximation algorithms
- Theory of computation → Online algorithms
- Theory of computation → Packing and covering problems
- Theory of computation → Parallel algorithms
- Theory of computation → Parameterized complexity and exact algorithms
- Theory of computation → Pattern matching
- Theory of computation → Problems, reductions and completeness
- Theory of computation → Quantum computation theory
- Theory of computation → Routing and network design problems
- Theory of computation → Scheduling algorithms
- Theory of computation → Shortest paths
- Theory of computation → Sketching and sampling
- Theory of computation → Sparsification and spanners
- Theory of computation → Streaming, sublinear and near linear time algorithms
- Theory of computation → Submodular optimization and polymatroids
- Theory of computation → Unsupervised learning and clustering
- Theory of computation → W hierarchy
Keywords
- Applied computing, Transportation; Computing methodologies, Algebraic algorithms; Hardware, External storage; Human-centered computing, Graph drawings
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads