LATIN 2016 : theoretical informatics : 12th Latin American Symposium, Ensenada, Mexico, April 1115, 2016, Proceedings
 Responsibility
 Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez (eds.).
 Language
 English. English.
 Digital
 text file
 Publication
 Berlin : Springer, 2016.
 Physical description
 1 online resource (xxvi, 714 pages) : illustrations
 Series
 Lecture notes in computer science ; 9644. 03029743
 Lecture notes in computer science. Advanced research in computing and software science.
 LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Online
More options
Description
Creators/Contributors
 Meeting
 Latin American Symposium on Theoretical Informatics (12th : 2016 : Ensenada, Mexico)
 Contributor
 Kranakis, Evangelos, editor.
 Navarro, Gonzalo, editor.
 Chávez, Edgar, editor.
Contents/Summary
 Bibliography
 Includes bibliographical references and author index.
 Contents

 Reversible Figures and Solids
 Simplicity is in Vogue (again)
 Subgame Perfect Equilibrium: Computation and Efficiency
 Buying Stuff Online
 Data Crowdsourcing: Is It for Real
 A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
 A Middle Curve Based on Discrete Fréchet Distance
 ComparisonBased FIFO Buffer Management in QoS Switches
 Scheduling on PowerHeterogeneous Processors
 Period Recovery over the Hamming and Edit Distances
 Chasing Convex Bodies and Functions
 Parameterized Lower Bounds and Dichotomy Results for the NPCompleteness of HFree Edge Modification Problems
 Parameterized Complexity of Red Blue Set Cover for lines
 Tight Bounds for BeaconBased Coverage in Simple Rectilinear Polygons
 On Mobile Agent Verifiable Problems
 Computing Maximal Layers Of Points In Ef(n)
 On the Total Number of Bends for Planar Octilinear Drawings
 Bidirectional BWTBased De Bruijn Graphs
 The Read/Write Protocol Complex is Collapsible
 The I/O Complexity of Computing Prime Tables.Increasing Diamonds
 Scheduling Transfers of Resources over Time: Towards CarSharing with Flexible DropOffs
 A 0.821Ratio Purely Combinatorial Algorithm for Maximum kVertex Cover in Bipartite Graphs
 Improved Spanning Ratio for Low Degree Spanners
 Constructing Consistent Digital Line Segments
 Faster Information Gathering in AdHoc Radio Tree Networks
 Stabbing circles for Sets of Segments in the Plane
 Faster Algorithms to Enumerate Hypergraph Transversals
 Listing Acyclic Orientations of Graphs with Single and Multiple Sources
 LinearTime Sequence Comparison Using Minimal Absent Words
 The Grandmama de Bruijn Sequence for Binary Strings
 Compressing Bounded Degree Graphs
 Random Partial Match Queries in QuadKd Trees
 From Discrepancy to Majority
 On the Planar Split Thickness of Graphs
 A BoundedRisk Mechanism for the Kidney Exchange Game
 Tight Approximations of Degeneracy in Large Graphs
 Improved Approximation Algorithms for Capacitated FaultTolerant kCenter
 Bundled Crossings in Embedded Graphs
 Probabilistic Analysis of the Dual NextFit Algorithm for Bin Covering
 Deterministic Sparse Suffix Sorting on Rewritable Texts
 Minimizing the Number of Opinions for FaultTolerant Distributed Decision Using WellQuasi Ordering
 Unshuffling Permutations
 Generating Random Spanning Trees via Fast Matrix Multiplication
 Routing in Unit Disk Graphs
 Graph Drawings with One Bend and Few Slopes
 EdgeEditing to a Dense and a Sparse Graph Class
 Containment and Evasion in Stochastic Point Data
 Tree Compression Using String Grammars
 Trees and Languages with Periodic Signature
 Rank Reduction of Directed Graphs by Vertex and Edge Deletions
 New Deterministic Algorithms for Solving Parity Games
 Computing a Geodesic TwoCenter of Points in a Simple Polygon
 Simple Approximation Algorithms for Balanced MAX 2SAT
 A Parameterized Algorithm for MixedCut
 (k; n
 k)MAXCUT: An O*(2p)Time Algorithm and a Polynomial Kernel
 Independent set of convex polygons: from nƐ to 1 + Ɛ via shrinking.
 Summary
 This book constitutes the refereed proceedings of the 12th Latin American Symposium on Theoretical Informatics, LATIN 2016, held in Ensenada, Mexico, in April 2016. The 52 papers presented together with 5 abstracts were carefully reviewed and selected from 131 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.
Subjects
 Subjects
 Computer science > Congresses.
 Informatique > Congrès.
 Computer science.
Bibliographic information
 Publication date
 2016
 Series
 Lecture notes in computer science, 03029743 ; 9644
 Advanced research in computing and software science
 LNCS sublibrary. SL 1, Theoretical computer science and general issues
 Note
 International conference proceedings.
 ISBN
 9783662495292 (electronic bk.)
 3662495295 (electronic bk.)
 3662495287
 9783662495285
 9783662495285 (print)
 DOI
 10.1007/9783662495292