Document Open Access Logo

LIPIcs, Volume 173, ESA 2020, Complete Volume

Authors Fabrizio Grandoni , Grzegorz Herman , Peter Sanders



PDF
Thumbnail PDF

File

LIPIcs.ESA.2020.pdf
  • Filesize: 57.63 MB
  • 1598 pages

Document Identifiers

Author Details

Fabrizio Grandoni
  • IDSIA, USI-SUPSI, Manno, Switzerland
Grzegorz Herman
  • Jagiellonian University, Kraków, Poland
Peter Sanders
  • Karlsruhe Institute of Technology, Germany

Cite AsGet BibTex

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

Abstract

LIPIcs, Volume 173, ESA 2020, Complete Volume

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
  • LIPIcs, Volume 173, ESA 2020, Complete Volume

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