@proceedings{DBLP:conf/latin/2018,
  editor    = {Michael~A. Bender and Martin Farach{-}Colton and Miguel~A. Mosteiro},
  title     = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
               Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10807},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-319-77404-6},
  doi       = {10.1007/978-3-319-77404-6},
  isbn      = {978-3-319-77403-9},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{l18-275-289,
  AUTHOR    = {Sourav Chakraborty and Sushrut Karmalkar and Srijita Kundu and Satyanarayana~V. Lokam and Nitin Saurabh},
  TITLE     = {Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {275--289},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-597-610,
  AUTHOR    = {Meng He and Cuong~P. Nguyen and Norbert Zeh},
  TITLE     = {Maximal and Convex Layers of Random Point Sets},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {597--610},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-712-726,
  AUTHOR    = {R. Krithika and Abhishek Sahu and Saket Saurabh and Meirav Zehavi},
  TITLE     = {The Parameterized Complexity of Cycle Packing: Indifference is Not
               an Issue},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {712--726},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-1-13,
  AUTHOR    = {Alexandre Santiago~de~Abreu and Lu\'\i{}s~Felipe~I. Cunha and Tharso~D. Fernandes and Celina~M.~H. de~Figueiredo and Luis~Antonio Brasil~Kowada and Franklin~L. Marquezino and Daniel Posner and Renato Portugal},
  TITLE     = {The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms
               and Hardness},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {1--13},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-755-776,
  AUTHOR    = {Kunal Agrawal and Jing Li and Kefu Lu and Benjamin Moseley},
  TITLE     = {Scheduling Parallelizable Jobs Online to Maximize Throughput},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {755--776},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-14-27,
  AUTHOR    = {Nir Ailon and Anup Bhattacharya and Ragesh Jaiswal},
  TITLE     = {Approximate Correlation Clustering Using Same-Cluster Queries},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {14--27},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-28-36,
  AUTHOR    = {Peter Allen and Christoph Koch and Olaf Parczyk and Yury Person},
  TITLE     = {Finding Tight Hamilton Cycles in Random Hypergraphs Faster},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {28--36},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-37-51,
  AUTHOR    = {Saeed Akhoondian~Amiri and Klaus{-}Tycho Foerster and Stefan Schmid},
  TITLE     = {Walking Through Waypoints},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {37--51},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-52-65,
  AUTHOR    = {Antonios Antoniadis and Carsten Fischer and Andreas T\"onnis},
  TITLE     = {A Collection of Lower Bounds for Online Matching on the Line},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {52--65},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-66-79,
  AUTHOR    = {J\'ulio Ara\'ujo and Victor~A. Campos and Ana~Karolinna Maia and Ignasi Sau and Ana Silva},
  TITLE     = {On the Complexity of Finding Internally Vertex-Disjoint Long Directed
               Paths},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {66--79},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-80-93,
  AUTHOR    = {Sandip Banerjee and Sujoy Bhore and Rajesh Chitnis},
  TITLE     = {Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored
               Point Sets},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {80--93},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-94-107,
  AUTHOR    = {Aritra Banik and Pratibha Choudhary and Daniel Lokshtanov and Venkatesh Raman and Saket Saurabh},
  TITLE     = {A Polynomial Sized Kernel for Tracking Paths Problem},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {94--107},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-108-119,
  AUTHOR    = {Bahareh Banyassady and Luis Barba and Wolfgang Mulzer},
  TITLE     = {Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {108--119},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-120-133,
  AUTHOR    = {Yair Bartal and Lee{-}Ad Gottlieb},
  TITLE     = {Approximate Nearest Neighbor Search for \(\ell_p\)-Spaces \(2\lt p\lt\infty \) via Embeddings},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {120--133},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-134-145,
  AUTHOR    = {Florent Becker and Pedro Montealegre and Ivan Rapaport and Ioan Todinca},
  TITLE     = {The Impact of Locality on the Detection of Cycles in the Broadcast
               Congested Clique Model},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {134--145},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-146-160,
  AUTHOR    = {Therese~C. Biedl and Martin Derka and Veronika Irvine and Anna Lubiw and Debajyoti Mondal and Alexi Turcotte},
  TITLE     = {Partitioning Orthogonal Histograms into Rectangular Boxes},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {146--160},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-161-173,
  AUTHOR    = {L\'elia Blin and S\'ebastien Tixeuil},
  TITLE     = {Compact Self-Stabilizing Leader Election for General Networks},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {161--173},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-174-186,
  AUTHOR    = {Lucas Boczkowski and Brieuc Guinard and Amos Korman and Zvi Lotker and Marc~P. Renault},
  TITLE     = {Random Walks with Multiple Step Lengths},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {174--186},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-187-200,
  AUTHOR    = {Jean{-}Daniel Boissonnat and Kunal Dutta and Arijit Ghosh and Sudeshna Kolay},
  TITLE     = {Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {187--200},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-201-216,
  AUTHOR    = {Bartlomiej Bosek and Dariusz Leniowski and Piotr Sankowski and Anna Zych{-}Pawlewicz},
  TITLE     = {A Tight Bound for Shortest Augmenting Paths on Trees},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {201--216},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-217-230,
  AUTHOR    = {Thomas Bosman and Martijn van~Ee and Yang Jiao and Alberto Marchetti{-}Spaccamela and R. Ravi and Leen Stougie},
  TITLE     = {Approximation Algorithms for Replenishment Problems with Fixed Turnover
               Times},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {217--230},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-231-244,
  AUTHOR    = {Luis~Evaristo Caraballo and Pablo P\'erez-Lantero and Carlos Seara and Inmaculada Ventura},
  TITLE     = {Maximum Box Problem on Stochastic Points},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {231--244},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-245-259,
  AUTHOR    = {Rodrigo~A. Carrasco and Kirk Pruhs and Cliff Stein and Jos\'e Verschae},
  TITLE     = {The Online Set Aggregation Problem},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {245--259},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-260-274,
  AUTHOR    = {Thom Castermans and Bettina Speckmann and Frank Staals and Kevin Verbeek},
  TITLE     = {Agglomerative Clustering of Growing Squares},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {260--274},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-625-639,
  AUTHOR    = {L. Sunil~Chandran and Anita Das and Davis Issac and Erik~Jan van~Leeuwen},
  TITLE     = {Algorithms and Bounds for Very Strong Rainbow Coloring},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {625--639},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-290-302,
  AUTHOR    = {Panagiotis Charalampopoulos and Costas~S. Iliopoulos and Chang Liu and Solon~P. Pissis},
  TITLE     = {Property Suffix Array with Applications},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {290--302},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-303-316,
  AUTHOR    = {Vincent Chau and Shengzhong Feng and Nguyen Kim~Thang},
  TITLE     = {Competitive Algorithms for Demand Response Management in Smart Grid},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {303--316},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-317-330,
  AUTHOR    = {Ruiwen Chen and Igor Carboni~Oliveira and Rahul Santhanam},
  TITLE     = {An Average-Case Lower Bound Against \(\mathsf{ACC}^0\)},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {317--330},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-331-345,
  AUTHOR    = {Anders Roy~Christiansen and Mikko Berggren~Ettienne},
  TITLE     = {Compressed Indexing with Signature Grammars},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {331--345},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-346-360,
  AUTHOR    = {Jonas Cleve and Wolfgang Mulzer},
  TITLE     = {Combinatorics of Beacon-Based Routing in Three Dimensions},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {346--360},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-361-375,
  AUTHOR    = {Zakir Deniz and Simon Nivelle and Bernard Ries and David Schindl},
  TITLE     = {On Split \(B_1\)-EPG Graphs},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {361--375},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-376-398,
  AUTHOR    = {Tamal~K. Dey and Tianqi Li and Yusu Wang},
  TITLE     = {Efficient Algorithms for Computing a Minimal Homology Basis},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {376--398},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-399-412,
  AUTHOR    = {Sergey Dovgal and Vlady Ravelomanana},
  TITLE     = {Shifting the Phase Transition Threshold for Random Graphs Using Degree
               Set Constraints},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {399--412},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-413-426,
  AUTHOR    = {Philippe Duchon and Cyril Nicaud},
  TITLE     = {On the Biased Partial Word Collector Problem},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {413--426},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-427-436,
  AUTHOR    = {Andrzej Dudek and Andrzej Ruci\'nski},
  TITLE     = {Constructive Ramsey Numbers for Loose Hyperpaths},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {427--436},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-437-447,
  AUTHOR    = {Matteo Dusefante and Riko Jacob},
  TITLE     = {Cache Oblivious Sparse Matrix Multiplication},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {437--447},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-777-789,
  AUTHOR    = {David Eppstein and Michael~T. Goodrich and Nil Mamano},
  TITLE     = {Reactive Proximity Data Structures for Graphs},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {777--789},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-448-460,
  AUTHOR    = {S\'andor~P. Fekete and Sven von~H\"oveling and Joseph~S.~B. Mitchell and Christian Rieck and Christian Scheffer and Arne Schmidt and James~R. Zuber},
  TITLE     = {Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {448--460},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-461-474,
  AUTHOR    = {Carsten Fischer and Heiko R\"oglin},
  TITLE     = {Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {461--474},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-475-489,
  AUTHOR    = {Martin F\"urer and Carlos Hoppen and David Pokrass~Jacobs and Vilmar Trevisan},
  TITLE     = {Locating the Eigenvalues for Graphs of Small Clique-Width},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {475--489},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-490-503,
  AUTHOR    = {Travis Gagie and Gonzalo Navarro and Nicola Prezza},
  TITLE     = {On the Approximation Ratio of Lempel-Ziv Parsing},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {490--503},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-504-514,
  AUTHOR    = {Hang Gao and Wenyu Gao},
  TITLE     = {Kernelization for Maximum Happy Vertices Problem},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {504--514},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-572-583,
  AUTHOR    = {Bernd G\"artner and Ahad~N. Zehmakan},
  TITLE     = {Majority Model on Random Regular Graphs},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {572--583},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-515-528,
  AUTHOR    = {Serge Gaspers and Joachim Gudmundsson and Michael Horton and Stefan R\"ummele},
  TITLE     = {When is Red-Blue Nonblocker Fixed-Parameter Tractable?},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {515--528},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-529-543,
  AUTHOR    = {Loukas Georgiadis and Giuseppe~F. Italiano and Nikos Parotsidis},
  TITLE     = {Incremental Strong Connectivity and 2-Connectivity in Directed Graphs},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {529--543},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-544-557,
  AUTHOR    = {Roberto Grossi and Andrea Marino and Luca Versari},
  TITLE     = {Efficient Algorithms for Listing k Disjoint st-Paths in Graphs},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {544--557},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-558-571,
  AUTHOR    = {Juan Guti\'errez},
  TITLE     = {Transversals of Longest Cycles in Chordal and Bounded Tree-Width Graphs},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {558--571},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-584-596,
  AUTHOR    = {Jie Han and Yoshiharu Kohayakawa and Marcelo Tadeu~Sales and Henrique Stagni},
  TITLE     = {Property Testing for Point Sets on the Plane},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {584--596},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-611-624,
  AUTHOR    = {Jennifer Iglesias and Rajmohan Rajaraman and R. Ravi and Ravi Sundaram},
  TITLE     = {Plane Gossip: Approximating Rumor Spread in Planar Graphs},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {611--624},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-640-652,
  AUTHOR    = {Adalat Jabrayilov and Petra Mutzel},
  TITLE     = {New Integer Linear Programming Models for the Vertex Coloring Problem},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {640--652},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-653-668,
  AUTHOR    = {Yasushi Kawase and Hanna Sumita and Takuro Fukunaga},
  TITLE     = {Submodular Maximization with Uncertain Knapsack Capacity},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {653--668},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-669-682,
  AUTHOR    = {Samir Khuller and Jingling Li and Pascal Sturmfels and Kevin Sun and Prayaag Venkat},
  TITLE     = {Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {669--682},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-683-696,
  AUTHOR    = {Katharina Klost and Wolfgang Mulzer},
  TITLE     = {Recognizing Generalized Transmission Graphs of Line Segments and Circular
               Sectors},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {683--696},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-697-711,
  AUTHOR    = {Yoshiharu Kohayakawa and Fl\'avio~Keidi Miyazawa and Yoshiko Wakabayashi},
  TITLE     = {A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds
               for Prices of Anarchy of a Related Game},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {697--711},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-727-740,
  AUTHOR    = {Danny Krizanc and Manuel Lafond and Lata Narayanan and Jaroslav Opatrny and Sunil~M. Shende},
  TITLE     = {Satisfying Neighbor Preferences on a Circle},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {727--740},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-741-754,
  AUTHOR    = {Carla~Negri Lintzmayer and Fl\'avio~Keidi Miyazawa and Eduardo~Candido Xavier},
  TITLE     = {Two-Dimensional Knapsack for Circles},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {741--754},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-790-804,
  AUTHOR    = {Themistoklis Melissourgos and Sotiris~E. Nikoletseas and Christoforos Raptopoulos and Paul~G. Spirakis},
  TITLE     = {Mutants and Residents with Different Connection Graphs in the Moran
               Process},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {790--804},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-805-819,
  AUTHOR    = {Wouter Meulemans and Bettina Speckmann and Kevin Verbeek and Jules Wulms},
  TITLE     = {A Framework for Algorithm Stability and Its Application to Kinetic
               Euclidean MSTs},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {805--819},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-820-834,
  AUTHOR    = {Sarah Miracle and Amanda~Pascoe Streib},
  TITLE     = {Rapid Mixing of \(k\)-Class Biased Permutations},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {820--834},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-835-848,
  AUTHOR    = {Torrie~L. Nichols and Alexander Pilz and Csaba~D. T\'oth and Ahad~N. Zehmakan},
  TITLE     = {Transition Operations over Plane Trees},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {835--848},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-849-863,
  AUTHOR    = {Pablo Rotondo and Brigitte Vall\'ee and Alfredo Viola},
  TITLE     = {Analysis of the Continued Logarithm Algorithm},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {849--863},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-873-885,
  AUTHOR    = {Daniel Stefankovic and Eric Vigoda and John Wilmes},
  TITLE     = {On Counting Perfect Matchings in General Graphs},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {873--885},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}

@InProceedings{l18-864-872,
  AUTHOR    = {Thomas Watson},
  TITLE     = {Quadratic Simulations of Merlin-Arthur Games},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {864--872},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}