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 II

  • Conference proceedings
  • © 2024

Overview

Editors:
  1. José A. Soto

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

  2. Andreas Wiese

    1. Technical University of Munich, Munich, Germany

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

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
eBook EUR 106.99
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 139.09
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

') var buybox = document.querySelector("[data-id=id_"+ timestamp +"]").parentNode var buyboxMaxSingleColumnWidth = 480 ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(initCollapsibles) function initCollapsibles(buyingOption, index) { var toggle = buyingOption.querySelector(".buying-option-price") buyingOption.classList.remove("expanded") var form = buyingOption.querySelector(".buying-option-form") var priceInfo = buyingOption.querySelector(".price-info") if (toggle && form && priceInfo) { toggle.setAttribute("role", "button") toggle.setAttribute("tabindex", "0") toggle.addEventListener("click", function (event) { var expandedBuyingOptions = buybox.querySelectorAll(".buying-option.expanded") var buyboxWidth = buybox.offsetWidth ;[].slice.call(expandedBuyingOptions).forEach(function(option) { if (buyboxWidth -1 ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(function (option, index) { var toggle = option.querySelector(".buying-option-price") var form = option.querySelector(".buying-option-form") var priceInfo = option.querySelector(".price-info") if (allOptionsInitiallyCollapsed || narrowBuyboxArea && index > 0) { toggle.setAttribute("aria-expanded", "false") form.hidden = "hidden" priceInfo.hidden = "hidden" } else { toggle.click() } }) } initialStateOpen() if (window.buyboxInitialised) return window.buyboxInitialised = true initKeyControls() })()

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. 

Similar content being viewed by others

Keywords

Table of contents (22 papers)

  1. Front Matter

    Pages i-xix
    Download chapter PDF

  2. Combinatorics and Graph Theory

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Self-complementary (Pseudo-)Split Graphs

      • Yixin Cao, Haowei Chen, Shenghua Wang
      Pages 3-18

    3. Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs

      • Christian Ortlieb
      Pages 19-30

    4. Bi-arc Digraphs: Recognition Algorithm and Applications

      • Pavol Hell, Akbar Rafiey, Arash Rafiey
      Pages 31-45

    5. Pebbling in Kneser Graphs

      • Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina de Figueiredo, Glenn Hurlbert, Diana Sasaki
      Pages 46-60

    6. Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs

      • Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis
      Pages 61-76

    7. Directed Ear Anonymity

      • Marcelo Garlet Milani
      Pages 77-97

    8. Separating Path Systems in Complete Graphs

      • Cristina G. Fernandes, Guilherme Oliveira Mota, Nicolás Sanhueza-Matamala
      Pages 98-113

    9. Infinite Separation Between General and Chromatic Memory

      • Alexander Kozachinskiy
      Pages 114-128

  3. Parameterized Algorithms

    1. Front Matter

      Pages 129-129
      Download chapter PDF

    2. Sparsity in Covering Solutions

      • Pallavi Jain, Manveer Singh Rathore
      Pages 131-146

    3. Induced Tree Covering and the Generalized Yutsis Property

      • Luís Cunha, Gabriel Duarte, Fábio Protti, Loana Nogueira, Uéverton Souza
      Pages 147-161

    4. Knapsack: Connectedness, Path, and Shortest-Path

      • Palash Dey, Sudeshna Kolay, Sipra Singh
      Pages 162-176

    5. Parameterized Approximation Algorithms for Weighted Vertex Cover

      • Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh
      Pages 177-192

    6. Parameterized Algorithms for Minimum Sum Vertex Cover

      • Shubhada Aute, Fahad Panolan
      Pages 193-207

    7. A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion

      • Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu
      Pages 208-222

    8. Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses

      • Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh et al.
      Pages 223-237

  4. Automata Theory and Formal Languages

    1. Front Matter

      Pages 239-239
      Download chapter PDF

    2. Counting Fixed Points and Pure 2-Cycles of Tree Cellular Automata

      • Volker Turau
      Pages 241-256
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

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Publish with us

Policies and ethics

Back to top