Document Open Access Logo

Front Matter, Table of Contents, Preface, Conference Organization

Authors Shiri Chechik, Gonzalo Navarro , Eva Rotenberg , Grzegorz Herman



PDF
Thumbnail PDF

File

LIPIcs.ESA.2022.0.pdf
  • Filesize: 0.5 MB
  • 22 pages

Document Identifiers

Author Details

Shiri Chechik
  • Tel Aviv University, Israel
Gonzalo Navarro
  • University of Chile, Santiago, Chile
Eva Rotenberg
  • Technical University of Denmark, Lyngby, Denmark
Grzegorz Herman
  • Jagiellonian University, Kraków, Poland

Cite AsGet BibTex

30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 0:i-0:xxii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.ESA.2022.0

Abstract

Front Matter, Table of Contents, Preface, Conference Organization

Subject Classification

ACM Subject Classification
  • Applied computing → Transportation
  • Computing methodologies → Linear algebra algorithms
  • Computing methodologies → Shared memory algorithms
  • Human-centered computing → Graph drawings
  • Information systems → Clustering
  • 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 → Combinatorics
  • Mathematics of computing → Discrete optimization
  • Mathematics of computing → Graph algorithms
  • Mathematics of computing → Graph coloring
  • Mathematics of computing → Graph theory
  • Mathematics of computing → Network flows
  • 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 → Trees
  • Networks → Network algorithms
  • Theory of computation → Algorithm design techniques
  • Theory of computation → Approximation algorithms analysis
  • Theory of computation → Bloom filters and hashing
  • Theory of computation → Branch-and-bound
  • Theory of computation → Communication complexity
  • Theory of computation → Complexity theory and logic
  • 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 → 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 → Graph algorithms analysis
  • Theory of computation → Integer programming
  • Theory of computation → K-server algorithms
  • Theory of computation → Linear programming
  • Theory of computation → Network flows
  • 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 → Randomness, geometry and discrete structures
  • Theory of computation → Random projections and metric embeddings
  • Theory of computation → Rounding techniques
  • Theory of computation → Shared memory algorithms
  • Theory of computation → Shortest paths
  • Theory of computation → Sketching and sampling
  • Theory of computation → Solution concepts in game theory
  • Theory of computation → Sparsification and spanners
  • Theory of computation → Stochastic approximation
  • Theory of computation → Stochastic control and optimization
  • Theory of computation → Streaming, sublinear and near linear time algorithms
  • Theory of computation → Submodular optimization and polymatroids
  • Theory of computation → W hierarchy
Keywords
  • Front Matter
  • Table of Contents
  • Preface
  • Conference Organization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail