LIPIcs.ESA.2024.pdf
- Filesize: 34.07 MB
- 1734 pages
Document
LIPIcs, Volume 308, ESA 2024, Complete Volume
Authors
Timothy Chan 
,
Johannes Fischer ,
John Iacono ,
Grzegorz Herman
-
Part of:
Volume:
32nd Annual European Symposium on Algorithms (ESA 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: European Symposium on Algorithms (ESA) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-09-23
File
Document Identifiers
Author Details
Cite AsGet BibTex
32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 1-1734, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ESA.2024
https://doi.org/10.4230/LIPIcs.ESA.2024
Abstract
LIPIcs, Volume 308, ESA 2024, Complete Volume
Subject Classification
ACM Subject Classification
- Applied computing → Economics
- Applied computing → Transportation
- Computing methodologies → Distributed algorithms
- Information systems → Geographic information systems
- Information systems → Point lookups
- Mathematics of computing → Approximation algorithms
- Mathematics of computing → Combinatorial algorithms
- Mathematics of computing → Combinatorial optimization
- Mathematics of computing → Discrete mathematics
- Mathematics of computing → Graph algorithms
- Mathematics of computing → Graph coloring
- Mathematics of computing → Graphs and surfaces
- Mathematics of computing → Hypergraphs
- Mathematics of computing → Information theory
- Mathematics of computing → Integer programming
- Mathematics of computing → Matchings and factors
- Mathematics of computing → Matroids and greedoids
- Mathematics of computing → Paths and connectivity problems
- Mathematics of computing → Probabilistic algorithms
- Networks → Network algorithms
- Networks → Network design principles
- Theory of computation → Algebraic complexity theory
- Theory of computation → Algorithm design techniques
- Theory of computation → Algorithmic game theory and mechanism design
- Theory of computation → Bloom filters and hashing
- Theory of computation → Branch-and-bound
- Theory of computation → Complexity classes
- Theory of computation → Computational geometry
- Theory of computation → Continuous optimization
- Theory of computation → Convex optimization
- Theory of computation → Data compression
- Theory of computation → Design and analysis of algorithms
- Theory of computation → Discrete optimization
- Theory of computation → Distributed 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 → Formal languages and automata theory
- Theory of computation → Gaussian processes
- Theory of computation → Integer programming
- Theory of computation → Lower bounds and information complexity
- Theory of computation → Machine learning theory
- Theory of computation → Massively parallel algorithms
- Theory of computation → Network flows
- Theory of computation → Network optimization
- Theory of computation → Nonconvex optimization
- Theory of computation → Online algorithms
- 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 query complexity
- Theory of computation → Random projections and metric embeddings
- Theory of computation → Routing and network design problems
- Theory of computation → Shortest paths
- Theory of computation → Sketching and sampling
- Theory of computation → Sorting and searching
- Theory of computation → Sparsification and spanners
- Theory of computation → Streaming models
- Theory of computation → Streaming, sublinear and near linear time algorithms
- Theory of computation → Theory and algorithms for application domains
- Theory of computation → Unsupervised learning and clustering
Keywords
- LIPIcs, Volume 308, ESA 2024, Complete Volume
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads