LIPIcs.ESA.2020.0.pdf
- Filesize: 326 kB
- 20 pages
Document
Front Matter, Table of Contents, Preface, Conference Organization
Authors
Fabrizio Grandoni 
,
Grzegorz Herman ,
Peter Sanders
-
Part of:
Volume:
28th Annual European Symposium on Algorithms (ESA 2020)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: European Symposium on Algorithms (ESA) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2020-08-26
File
Document Identifiers
Author Details
Cite AsGet BibTex
28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ESA.2020.0
https://doi.org/10.4230/LIPIcs.ESA.2020.0
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Subject Classification
ACM Subject Classification
- Applied computing → Transportation
- Theory of computation → Facility location and clustering
- Computing methodologies → Agent / discrete models
- Computing methodologies → Algebraic algorithms
- Computing methodologies → Combinatorial algorithms
- Human-centered computing → Graph drawings
- Mathematics of computing → Approximation algorithms
- Mathematics of computing → Combinatorial algorithms
- Mathematics of computing → Graph algorithms
- Mathematics of computing → Graph coloring
- Mathematics of computing → Graphs and surfaces
- Mathematics of computing → Graph theory
- Mathematics of computing → Hypergraphs
- Mathematics of computing → Information theory
- Mathematics of computing → Network flows
- Mathematics of computing → Paths and connectivity problems
- Mathematics of computing → Probabilistic algorithms
- Mathematics of computing → Random graphs
- Mathematics of computing → Solvers
- Mathematics of computing → Trees
- Networks → Network algorithms
- Theory of computation → Algorithmic game theory and mechanism design
- Theory of computation → Approximation algorithms analysis
- Theory of computation → Computational geometry
- Theory of computation → Data structures design and analysis
- Theory of computation → Design and analysis of algorithms
- Theory of computation → Online algorithms
- Theory of computation → Distributed algorithms
- Theory of computation → Dynamic graph algorithms
- Theory of computation → Fixed parameter tractability
- Theory of computation → Graph algorithms analysis
- Theory of computation → Network flows
- Theory of computation → Packing and covering problems
- Theory of computation → Parallel algorithms
- Theory of computation → Parallel computing models
- Theory of computation → Parameterized complexity and exact algorithms
- Theory of computation → Pattern matching
- Theory of computation → Problems, reductions and completeness
- Theory of computation → Randomness, geometry and discrete structures
- Theory of computation → Routing and network design problems
- Theory of computation → Scheduling algorithms
- Theory of computation → Shared memory algorithms
- Theory of computation → Shortest paths
- Theory of computation → Sorting and searching
- Theory of computation → Stochastic approximation
Keywords
- Front Matter
- Table of Contents
- Preface
- Conference Organization
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads