


default search action
16th LATIN 2024: Puerto Varas, Chile - Part I
- José A. Soto

, Andreas Wiese
:
LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14578, Springer 2024, ISBN 978-3-031-55597-8
Algorithms and Data Structures
- Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu:

On 1-Bend Upward Point-Set Embeddings of st-Digraphs. 3-18 - Samuel Eduardo da Silva, Uéverton S. Souza

:
Decoding Tree Decompositions from Permutations. 19-34 - Duncan Adamson

, Pawel Gawrychowski, Florin Manea:
Enumerating m-Length Walks in Directed Graphs with Constant Delay. 35-50 - Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson:

The Hardness of Local Certification of Finite-State Dynamics. 51-65 - Ankush Acharyya, Vahideh Keikha, Maria Saumell, Rodrigo I. Silveira:

Computing Largest Minimum Color-Spanning Intervals of Imprecise Points. 81-96 - Dhanyamol Antony

, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob:
Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness. 97-113 - Yuan Qiu, Aaron Williams

:
Generating Signed Permutations by Twisting Two-Sided Ribbons. 114-129 - Zsuzsanna Lipták

, Luca Parmigiani
:
A BWT-Based Algorithm for Random de Bruijn Sequence Construction. 130-145 - Travis Gagie, Adrián Goga, Artur Jez, Gonzalo Navarro:

Space-Efficient Conversions from SLPs. 146-161 - Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis

, Hilde Verbeek:
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast. 162-177 - Andrej Baláz, Travis Gagie, Adrián Goga, Simon Heumos, Gonzalo Navarro, Alessia Petescia, Jouni Sirén:

Wheeler Maps. 178-192 - Amir Abboud, Nick Fischer, Yarin Shechter:

Faster Combinatorial k-Clique Algorithms. 193-206
Approximation and Online Algorithms
- Younan Gao

, Meng He
:
On Approximate Colored Path Counting. 209-224 - Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman:

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. 225-240 - Matej Lieskovský

:
Better Algorithms for Online Bin Stretching via Computer Search. 241-253 - Sarita de Berg

, Nathan van Beusekom, Max van Mulken
, Kevin Verbeek, Jules Wulms:
Competitive Searching over Terrains. 254-269
Computational Geometry
- William S. Evans, Seyed Ali Tabatabaee:

Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities. 273-287 - Omrit Filtser

, Erik Krohn
, Bengt J. Nilsson
, Christian Rieck
, Christiane Schmidt
:
Guarding Polyominoes Under k-Hop Visibility. 288-302 - Taehoon Ahn

, Chaeyoon Chung
, Hee-Kap Ahn
, Sang Won Bae
, Otfried Cheong
, Sang Duk Yoon
:
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions. 303-317
Complexity Theory
- Christoph Grüne

:
The Complexity Classes of Hamming Distance Recoverable Robust Problems. 321-335 - Henry Förster

, Philipp Kindermann
, Tillmann Miltzow
, Irene Parada
, Soeren Terziadis
, Birgit Vogtenhuber
:
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. 336-349

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














