Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

LATIN 2024: Theoretical Informatics

16th Latin American Symposium, Puerto Varas, Chile, March 18–22, 2024, Proceedings, Part I

  • Conference proceedings
  • © 2024

Overview

Editors:
  1. José A. Soto

    1. DIM-CMM, Universidad de Chile, Santiago, Chile

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Andreas Wiese

    1. Technical University of Munich, Munich, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 14578)

Included in the following conference series:

Conference proceedings info: LATIN 2024.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the proceedings of the 16th Latin American Symposium on Theoretical Informatics, LATIN 2042, which took place in Puerto Varas, Chile, in March 2024. 
The 44 papers presented in this volume were carefully reviewed and selected from 93 submissions. They were organized in topical sections as follows:Part I: Algorithms and Data Structures; Approximation and Online Algorithms; Complexity Theory; 
Part II: Combinatorics and Graph Theory; Parameterized Algorithms; Automata Theory and Formal Languages; and Game Theory and Fairness. 

Keywords

Table of contents (22 papers)

  1. Front Matter

    Pages i-xix
    Download chapter PDF

  2. Algorithms and Data Structures

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. On 1-Bend Upward Point-Set Embeddings of st-Digraphs

      • Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis et al.
      Pages 3-18

    3. Decoding Tree Decompositions from Permutations

      • Samuel Eduardo da Silva, Uéverton S. Souza
      Pages 19-34

    4. Enumerating m-Length Walks in Directed Graphs with Constant Delay

      • Duncan Adamson, Paweł Gawrychowski, Florin Manea
      Pages 35-50

    5. The Hardness of Local Certification of Finite-State Dynamics

      • Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson
      Pages 51-65

    6. Iterated Straight-Line Programs

      • Gonzalo Navarro, Cristian Urbina
      Pages 66-80

    7. Computing Largest Minimum Color-Spanning Intervals of Imprecise Points

      • Ankush Acharyya, Vahideh Keikha, Maria Saumell, Rodrigo I. Silveira
      Pages 81-96

    8. Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness

      • Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob
      Pages 97-113

    9. Generating Signed Permutations by Twisting Two-Sided Ribbons

      • Yuan Qiu, Aaron Williams
      Pages 114-129

    10. A BWT-Based Algorithm for Random de Bruijn Sequence Construction

      • Zsuzsanna Lipták, Luca Parmigiani
      Pages 130-145

    11. Space-Efficient Conversions from SLPs

      • Travis Gagie, Adrián Goga, Artur Jeż, Gonzalo Navarro
      Pages 146-161

    12. Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast

      • Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis, Hilde Verbeek
      Pages 162-177

    13. Wheeler Maps

      • Andrej Baláž, Travis Gagie, Adrián Goga, Simon Heumos, Gonzalo Navarro, Alessia Petescia et al.
      Pages 178-192

    14. Faster Combinatorial k-Clique Algorithms

      • Amir Abboud, Nick Fischer, Yarin Shechter
      Pages 193-206

  3. Approximation and Online Algorithms

    1. Front Matter

      Pages 207-207
      Download chapter PDF

    2. On Approximate Colored Path Counting

      • Younan Gao, Meng He
      Pages 209-224

    3. Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments

      • Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman
      Pages 225-240

    4. Better Algorithms for Online Bin Stretching via Computer Search

      • Matej Lieskovský
      Pages 241-253

    5. Competitive Searching over Terrains

      • Sarita de Berg, Nathan van Beusekom, Max van Mulken, Kevin Verbeek, Jules Wulms
      Pages 254-269
Back to top

Other volumes

  1. LATIN 2024: Theoretical Informatics

  2. LATIN 2024: Theoretical Informatics

Editors and Affiliations

  • DIM-CMM, Universidad de Chile, Santiago, Chile

    José A. Soto

  • Technical University of Munich, Munich, Germany

    Andreas Wiese

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation