Description 
1 online resource (xvii, 889 pages) : illustrations 
Series 
Advanced research in computing and software science 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science, 03029743 ; 10807 

LNCS sublibrary. SL 1, Theoretical computer science and general issues.


Lecture notes in computer science ; 10807. 03029743


Lecture notes in computer science. Advanced research in computing and software science.

Contents 
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness  Approximate Correlation Clustering Using SameCluster Queries  Finding tight Hamilton cycles in random hypergraphs faster  Walking Through Waypoints  Lower Bounds for Online Matching on the Line  On the complexity of _nding internally vertexdisjoint long directed paths  Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets  A Polynomial Sized Kernel for Tracking Paths Problem  TimeSpace TradeO_s for Computing Euclidean Minimum Spanning Trees  Approximate nearest neighbor for lpspaces (2 < p < ) via embeddings  The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model  Partitioning Orthogonal Histograms into Rectangular Boxes  Compact SelfStabilizing Leader Election for General Networks  Random Walks with Multiple Step Lengths  Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set  A tight bound for shortest augmenting paths on trees  Approximation Algorithms for Replenishment Problems with Fixed Turnover Times  Maximum Box Problem on Stochastic Points  The Online Set Aggregation Problem  Agglomerative Clustering of Growing Squares  Fourier EntropyInuence Conjecture for Random Linear Threshold Functions  Property Suffix Array with Applications  Competitive Algorithms for Demand Response Management in Smart Grid  An AverageCase Lower Bound against ACĈ0  Compressed Indexing with Signature Grammars  Combinatorics of Beaconbased Routing in Three Dimensions  On split B1EPG graphs  Efficient algorithms for computing a minimal homology basis  Shifting the Phase Transition Threshold for Random Graphs using Degree Set Constraints  On the Biased Partial Word Collector Problem  Constructive Ramsey Numbers For Loose Hyperpaths  Cache Oblivious Sparse Matrix Multiplication  Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading  Probabilistic Analysis of Online (Classconstrained) Bin Packing and Bin Covering  Locating the eigenvalues for graphs of small cliquewidth  On the Approximation Ratio of LempelZiv Parsing  Kernelization for Maximum Happy Vertices Problem  When is RedBlue Nonblocker FPT  Incremental Strong Connectivity and 2Connectivity in Directed Graphs  Efficient Algorithms for Listing K Disjoint stPaths in Graphs  Transversals of longest cycles in chordal and bounded treewidth graphs  Majority Model on Random Regular Graphs  Property testing for point sets on the plane  Maximal and Convex Layers of Random Point Sets  Plane Gossip: Approximating rumor spread in planar graphs  Algorithms and Bounds for Very Strong Rainbow Coloring  New Integer Linear Programming Models for the Vertex Coloring Problem  Submodular maximization with uncertain knapsack capacity  Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time  Recognizing generalized transmission graphs of line segments and circular sectors  A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game  The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue  Satisfying neighbor preferences on a circle  Twodimensional Knapsack for Circles  Scheduling Parallelizable Jobs Online to Maximize Throughput  Reactive Proximity Data Structures for Graphs  Mutants and Residents with Different Connection Graphs in the Moran Process  A Framework for Algorithm Stability and its Application to Kinetic Euclidean MSTs  Rapid Mixing of kClass Biased Permutations  Transition Operations over Plane Trees  Analysis of the Continued Logarithm Algorithm  Quadratic Simulations of MerlinArthur Games  On Counting Perfect Matchings in General Graphs 
Summary 
This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions. The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: 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 
Notes 
Includes author index 

International conference proceedings 

Online resource; title from PDF title page (SpringerLink, viewed April 11, 2018) 
Subject 
Computer science  Congresses.

Genre/Form 
Conference papers and proceedings.


Conference papers and proceedings.

Form 
Electronic book

Author 
Bender, Michael A. (Computer scientist), editor


FarachColton, Martin, editor


Mosteiro, Miguel A., editor

ISBN 
3319774034 

3319774042 (electronic bk.) 

9783319774039 

9783319774046 (electronic bk.) 

(print) 
