Buch, Englisch, 676 Seiten, Format (B × H): 155 mm x 235 mm
17th Latin American Symposium, Florianópolis, Brazil, April 13–17, 2026, Proceedings
Buch, Englisch, 676 Seiten, Format (B × H): 155 mm x 235 mm
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-032-44972-6
Verlag: Springer
This book constitutes the proceedings of the 17th Latin American Symposium on Theoretical Informatics, LATIN 2026, which took place in Florianópolis, Brazil, during April 13–17, 2026.
The 42 full papers included in this book were carefully reviewed and selected from 103 submissions. They focus on algorithms, automata theory and formal languages, combinatorial optimization, complexity theory, computational biology, computational geometry, data compression, quantum computing, and theory of computing.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Angewandte Informatik
Weitere Infos & Material
.- Computing fixed point free automorphisms of graphs.
.- Local Resilience for Containment of Bounded Degree Spanning Subgraphs.
.- How many times can two minimum spanning trees cross?
.- Two Complexity Results on Spanning-Tree Congestion Problems.
.- A lower bound of 4 for online graph exploration.
.- Optimized 2-approximation of Treewidth.
.- A Markov-Chain Characterization of Finite-State Dimension and a Generalization of Agafonov’s Theorem.
.- Launching Identity Testing into (Bounded) Space.
.- Fair Correlation Clustering Meets Graph Parameters.
.- Dynamic data structures for twin-ordered matrices.
.- Partition-based Simple Heaps.
.- On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition.
.- On the near-tightness of chi <= 2r: a general sigma-ary construction and a binary case via LFSRs.
.- A $(4/3+\epsilon)$-Approximation for Preemptive Scheduling with Batch Setup Times.
.- Generating 2-Gray codes for grand Motzkin paths and grand Dyck paths with air pockets in constant amortized time.
.- Homogeneous substructures in random ordered uniform matchings.
.- Computational Complexity of Covers and Partial Covers of 2-in-2-out-Regular Digraphs.
.- The Parameterized Complexity of Geometric 1-Planarity.
.- Compressed Set Representations based on Set Difference.
.- Graph Exploration with Edge Weight Estimates.
.- Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents.
.- How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms.
.- Splittable Spanning Trees and Balanced Forests in Dense Random Graphs.
.- On the Computational Complexity of Asymmetric Median Consensus Trees.
.- Towards Succinct Beer Proper Interval Graphs.
.- Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies.
.- Improvement of the Size of Control Alphabet for Controlled Generation of Unary Strings of Specified Length.
.- Algorithms and Complexity of Connectivity Switching in Graphs.
.- Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs.
.- Inapproximability of H-Coloring Problems.
.- Online computation of normalized substring complexity.
.- Hitting all longest paths in $H$-free graphs and $H$-graphs.
.- Multi-Head Finite-State Compression.
.- Not all (semi)rings are strong.
.- Coresets for Farthest Point Problems in Hyperbolic Space.
.- Majority Boolean networks classifying density: structural characterization and complexity.
.- A 9/5 Approximation Algorithm for the Maximum Edge 2-Coloring Problem on Bipartite Graphs.
.- Square root of split graphs: linear algorithms for threshold and split-indifference graphs.
.- Complexity of the Possible and the Necessary President Problem in Schulze Voting.
.- Computing Dominating Sets in Disk Graphs with Centers in Convex Position.
.- Constructing Alphabet Reduction Pairs of Arrays.
.- Combinatorial ranking algorithms for the general linear group.
