Document Open Access Logo

LIPIcs, Volume 388, ESA 2026, Complete Volume

Authors Philip Bille , Seth Pettie , Sabine Storandt

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2026.pdf
  • Filesize: 119.59 MB
  • 3048 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Applied computing → Bioinformatics
  • Applied computing → Computational biology
  • Applied computing → Sequencing and genotyping technologies
  • Computing methodologies → Motion path planning
  • Computing methodologies → Search methodologies
  • Information systems → Point lookups
  • Mathematics of computing → Approximation algorithms
  • Mathematics of computing → Combinatorial algorithms
  • Mathematics of computing → Combinatorial optimization
  • Mathematics of computing → Combinatoric problems
  • Mathematics of computing → Combinatorics
  • Mathematics of computing → Combinatorics on words
  • Mathematics of computing → Discrete optimization
  • Mathematics of computing → Geometric topology
  • 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 → Paths and connectivity problems
  • Mathematics of computing → Permutations and combinations
  • Mathematics of computing → Probability and statistics
  • Mathematics of computing → Random graphs
  • Mathematics of computing → Stochastic processes
  • Mathematics of computing → Submodular optimization and polymatroids
  • Security and privacy
  • Theory of computation → Approximation algorithms analysis
  • Theory of computation → Bloom filters and hashing
  • Theory of computation → Complexity classes
  • 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 → Distributed algorithms
  • Theory of computation → Dynamic graph algorithms
  • Theory of computation → Facility location and clustering
  • Theory of computation → Finite Model Theory
  • Theory of computation → Fixed parameter tractability
  • Theory of computation → Generating random combinatorial structures
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Integer programming
  • Theory of computation → Massively parallel algorithms
  • 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 → Pseudorandomness and derandomization
  • Theory of computation → Quantum computation theory
  • Theory of computation → Quantum information theory
  • Theory of computation → Quantum query complexity
  • Theory of computation → Randomness, geometry and discrete structures
  • Theory of computation → Shared memory algorithms
  • Theory of computation → Shortest paths
  • 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
Keywords
  • LIPIcs, Volume 388, ESA 2026, Complete Volume

Metrics

Abstract

LIPIcs, Volume 388, ESA 2026, Complete Volume

Cite As Get BibTex

34th Annual European Symposium on Algorithms (ESA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 388, pp. 1-3048, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ESA.2026

Author Details

Philip Bille
  • Technical University of Denmark, Lyngby, Denmark
Seth Pettie
  • University of Michigan, Ann Arbor, MI, USA
Sabine Storandt
  • University of Konstanz, Germany
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact