The 26^th London Stringology Days & London Algorithmic Workshop

LSD & LAW 2018

Arseny Shur, Ural Federal University, "Make Pals Your Pals: Fast Algorithms for Problems Related to Palindromes" Download
Roberto Grossi, University of Pisa, "Combining strings and graphs for subgraph similarity"
Roman Kolpakov, Lomonosov Moscow State University, "Some results on the number of periodic factors in words" Download
Tatiana Starikovskaya, École normale supérieure, "Streaming and property testing algorithms for string processing" Download

Bill Smyth, McMaster University, "On the Parikh-de-Bruijn Grid" Download
Bill Smyth, McMaster University, "New Approaches to Covering a String"
Cyril Nicaud, LIGM Université Paris-Est, "On the Biased Partial Word Collector Problem" Download
Eric Rivals, CNRS & Université de Montpellier, "Approximation for computing superstrings with multiplicities"
Eric Rivals, CNRS & Université de Montpellier, "Hierarchical Overlap Graph" Download
Gabriel Valiente, Technical University of Catalonia, "A Set Cover Approach to Taxonomic Annotation" Download
Michele Zito, University of Liverpool, "Large Independent Sets in Line of Sight Networks" Download
Mireille Régnier, Ecole Polytechnique, "Repetition Lengths in Random Sequences" Download
Nantia Iakovidou, King's College London, "A symbolic dynamics approach to Epileptic Chronnectomics: Employing strings to predict seizure onset" Download
Raphael Wegner, ETH Zürich, "Call admission problems on grids" Download
Steven Watts, King's College London, "Efficient identification of k-closed strings" Download
Tomasz Radzik, King's College London, "Perpetual Maintenance of Machines with Different Attendance Urgency Factors" Download