Skip to main content
Springer Nature Link
Log in

LATIN 2022: Theoretical Informatics

15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings

  • Conference proceedings
  • © 2022

Overview

Editors:
  1. Armando Castañeda

    1. Universidad Nacional Autónoma de México, Mexico City, Mexico

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Francisco Rodríguez-Henríquez

    1. Centro de investigación y de Estudios Avanzados, Mexico City, Mexico

    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 13568)

Included in the following conference series:

Conference proceedings info: LATIN 2022.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

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 15th Latin American Symposium on Theoretical Informatics, LATIN 2022, which took place in Guanajuato, Mexico, in November 2022. 

The 46 papers presented in this volume were carefully reviewed and selected from 114 submissions. They were organized in topical sections as follows: Algorithms and Data Structures; Approximation Algorithms; Cryptography; Social Choice Theory; Theoretical Machine Learning; Automata Theory and Formal Languages; Combinatorics and Graph Theory; Complexity Theory; Computational Geometry.


Chapter “Klee’s Measure Problem Made Oblivious” is available open access under a CC BY 4.0 license.





Similar content being viewed by others

Keywords

Table of contents (46 papers)

  1. Front Matter

    Pages i-xvi
    Download chapter PDF

  2. Algorithms and Data Structures

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees

      • Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini
      Pages 3-19

    3. Elastic-Degenerate String Matching with 1 Error

      • Giulia Bernardini, Esteban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba
      Pages 20-37

    4. Median and Hybrid Median K-Dimensional Trees

      • Amalia Duch, Conrado Martínez, Mercè Pons, Salvador Roura
      Pages 38-53

    5. Weighted Connected Matchings

      • Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto, Vinicius F. dos Santos, Jayme L. Szwarcfiter
      Pages 54-70

    6. Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries

      • Seungbum Jo, Geunho Kim
      Pages 71-87

    7. Near-Optimal Search Time in \(\delta \)-Optimal Space

      • Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares
      Pages 88-103

    8. Computing and Listing Avoidable Vertices and Paths

      • Charis Papadopoulos, Athanasios E. Zisis
      Pages 104-120

    9. Klee’s Measure Problem Made Oblivious

      • Thore Thießen, Jan Vahrenhold
      Pages 121-138Open Access

  3. Approximation Algorithms

    1. Front Matter

      Pages 139-139
      Download chapter PDF

    2. A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center

      • Marcelo P. L. Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa
      Pages 141-156

    3. Theoretical Analysis of git bisect

      • Julien Courtiel, Paul Dorbec, Romain Lecoq
      Pages 157-171

    4. Pathlength of Outerplanar Graphs

      • Thomas Dissaux, Nicolas Nisse
      Pages 172-187

    5. Approximations for the Steiner Multicycle Problem

      • Cristina G. Fernandes, Carla N. Lintzmayer, Phablo F. S. Moura
      Pages 188-203

    6. Approximation Schemes for Packing Problems with \(\ell _p\)-norm Diversity Constraints

      • Waldo Gálvez, Víctor Verdugo
      Pages 204-221

    7. Obtaining Approximately Optimal and Diverse Solutions via Dispersion

      • Jie Gao, Mayank Goswami, C. S. Karthik, Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang
      Pages 222-239

  4. Cryptography

    1. Front Matter

      Pages 241-241
      Download chapter PDF

    2. On APN Functions Whose Graphs are Maximal Sidon Sets

      • Claude Carlet
      Pages 243-254

    3. On the Subfield Codes of a Subclass of Optimal Cyclic Codes and Their Covering Structures

      • Félix Hernández, Gerardo Vega
      Pages 255-270
Back to top

Other volumes

  1. LATIN 2022: Theoretical Informatics

Editors and Affiliations

  • Universidad Nacional Autónoma de México, Mexico City, Mexico

    Armando Castañeda

  • Centro de investigación y de Estudios Avanzados, Mexico City, Mexico

    Francisco Rodríguez-Henríquez

Bibliographic Information

Publish with us

Policies and ethics

Back to top