Latin American Theoretical Informatics 2018
The conference banquet is on Tuesday at 7pm (after the tour), at Rei Bar, Marcelo T. de Alvear 479, Retiro.
The 13th Latin American Theoretical INformatics Symposium (LATIN 2018) will be held in Buenos Aires from 16th to 19th April, 2018. Previous editions of LATIN took place in Sao Paulo, Brazil (1992), Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este, Uruguay (2000), Cancun, Mexico (2002), Buenos Aires, Argentina (2004), Valdivia, Chile (2006), Buzios, Brazil (2008), Oaxaca, Mexico (2010), Arequipa, Peru (2012), Montevideo, Uruguay (2014) and Ensenada, Mexico (2016).
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.
In 2018, LATIN will be held in Buenos Aires, Argentina
Abstract Submission: October 10th, 2017
Submission: October 17th, 2017
Notification: December 5th, 2017
Camera Ready: December 20th, 2017
Symposium: April 16-19, 2018
All deadlines are AOE time zone.
LATIN 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.
Full papers are to be submitted electronically using the EasyChair
server at https://easychair.org/conferences/?conf=latin2018.
Submissions are limited to twelve (12) single-column letter-size pages in Springer LNCS format (see LNCS author guidelines at http://www.springer.com/la/computer-science/lncs/conference-proceedings-guidelines).
This limit includes figures and references. An optional appendix (to be read at the program committee's discretion) may be included if desired. Simultaneous submission of papers to any other conference with published proceedings, as well as the submission of previously published papers, is not allowed. Papers must be written in English. For each accepted paper at least one author must register and attend the symposium to present it. Moreover, an author cannot register for multiple papers. That is, each accepted paper must have its own registrant.
Martín Farach-Colton, Rutgers University, USA
|Monday 16||Tuesday 17||Wednesday 18||Thursday 19|
|8:30||Registration (whole day)||Registration||Registration|
|9:00||Session 1||Session 5||Session 7||Session 11|
|11:05||Coffee break||Coffee break||Coffee break||Coffee break|
|11:30||Keynote Santosh S. Vempala||Session 6||Keynote Leslie Ann Goldberg||Keynote Flavia Bonomo|
|14:10||Session 2||Keynote Andréa Werneck Richa||Session 8||Session 12|
|15:30||Coffee break||Tour + banquet||Coffee break||Coffee break|
|15:50||Session 3||Session 9||Session 13|
|17:30||Session 4||Session 10||Session 14|
|18:50||Adjourned||Business meeting and test of time award||Closing remarks|
|Monday||Session 1 - Chair: Giuseppe Italiano|
|Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun and Prayaag Venkat||Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time|
|Vincent Chau, Shengzhong Feng and Kim Thang Nguyen||Competitive Algorithms for Demand Response Management in Smart Grid|
|Yoshiharu Kohayakawa, Flávio Keidi Miyazawa and Yoshiko Wakabayashi||A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game|
|Saeed Akhoondian Amiri, Klaus-Tycho Foerster and Stefan Schmid||Walking Through Waypoints|
|Kefu Lu, Kunal Agrawal, Jing Li and Benjamin Moseley||Scheduling Parallelizable Jobs Online to Maximize Throughput|
|Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker and Marc Renault||Random Walks with Multiple Step Lengths|
|Monday||Session 2 - Chair: Inge Li Goertz|
|Travis Gagie, Gonzalo Navarro and Nicola Prezza||On the Approximation Ratio of Lempel-Ziv Parsing|
|Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu and Solon P. Pissis||Property Suffix Array with Applications|
|Nil Mamano, David Eppstein and Michael Goodrich||Reactive Proximity Data Structures for Graphs|
|Anders Roy Christiansenand Mikko Berggren Ettienne||Compressed Indexing with Signature Grammars|
|Monday||Session 3 - Chair: John Wilmes|
|Wouter Meulemans, Bettina Speckmann, Kevin Verbeek and Jules Wulms||A Framework for Algorithm Stability and its Application to Kinetic Euclidean MSTs|
|Bart_omiej Bosek, Dariusz Leniowski, Piotr Sankowski and Anna Zych-Pawlewicz||A tight bound for shortest augmenting paths on trees.|
|Torrie L. Nichols, Alexander Pilz, Csaba D. Toth and Ahad N. Zehmakan||Transition Operations over Plane Trees|
|Bahareh Banyassady, Luis Barba and Wolfgang Mulzer||Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees|
|Monday||Session 4 - Chair: Nguyen Kim Thang|
|Matteo Dusefante and Riko Jacob||Cache Oblivious Sparse Matrix Multiplication|
|Yasushi Kawase, Hanna Sumita and Takuro Fukunaga||Submodular maximization with uncertain knapsack capacity|
|Carla Negri Lintzmayer, Flávio Keidi Miyazawa and Eduardo Candido Xavier||Two-dimensional Knapsack for Circles|
|Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana Lokam and Nitin Saurabh||Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions|
|Tuesday||Session 5 - Chair: Yoshiharu Kohayakawa|
|Sándor Fekete, Sven von Höveling, Joseph Mitchell, Christian Rieck, Christian Scheffer, Arne Schmidt and James Zuber||Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading|
|Alexandre Abreu, Luís Cunha, Tharso Fernandes, Celina de Figueiredo, Luis Kowada, Franklin Marquezino, Daniel Posner and Renato Portugal||The graph tessellation cover number: extremal bounds, efficient algorithms and hardness|
|Yair Bartal and Lee-Ad Gottlieb||Approximate nearest neighbor for lp-spaces (2 < p < ∞) via embeddings|
|Sergey Dovgaland Vlady Ravelomanana||Shifting the Phase Transition Threshold for Random Graphs using Degree Set Constraints|
|Peter Allen, Christoph Koch, Olaf Parczyk and Yury Person||Finding tight Hamilton cycles in random hypergraphs faster|
|Bernd Gärtner and Ahad N. Zehmakan||Majority Model on Random Regular Graphs|
|Tuesday||Session 6 - Chair: Yair Bartal|
|Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny and Sunil Shende||Satisfying neighbor preferences on a circle|
|Adalat Jabrayilovand Petra Mutzel||New Integer Linear Programming Models for the Vertex Coloring Problem|
|Hang Gao and Wenyu Gao||Kernelization for Maximum Happy Vertices Problem|
|Wednesday||Session 7 - Chair: Vladimir Braverman|
|Loukas Georgiadis, Giuseppe F. Italiano and Nikos Parotsidis||Incremental Strong Connectivity and 2-Connectivity in Directed Graphs|
|Zakir Deniz, Simon Nivelle, Bernard Ries and David Schindl||On split B1-EPG graphs|
|Martin Fürer, Carlos Hoppen, David Jacobs and Vilmar Trevisan||Locating the eigenvalues for graphs of small clique-width|
|Thom Castermans, Bettina Speckmann, Frank Staals and Kevin Verbeek||Agglomerative Clustering of Growing Squares|
|Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal and Alexi Turcotte||Partitioning Orthogonal Histograms into Rectangular Boxes|
|Jonas Cleveand Wolfgang Mulzer||Combinatorics of Beacon-based Routing in Three Dimensions|
|Wednesday||Session 8 - Chair: Philip Bille|
|R. Krithika, Abhishek Sahu, Saket Saurabh and Meirav Zehavi||The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue|
|Serge Gaspers, Joachim Gudmundsson, Michael Horton and Stefan Rümmele||When is Red-Blue Nonblocker FPT?|
|Ruiwen Chen, Igor Carboni Oliveira and Rahul Santhanam||An Average-Case Lower Bound against ACC^0|
|Thomas Watson||Quadratic Simulations of Merlin-Arthur Games|
|Wednesday||Session 9 - Chair: Alfredo Viola|
|Rodrigo Carrasco, Kirk Pruhs, Clifford Stein and José Verschae||The Online Set Aggregation Problem|
|Carsten Fischer and Heiko Röglin||Probabilistic Analysis of Online (Class-constrained) Bin Packing and Bin Covering|
|Antonios Antoniadis, Carsten Fischer and Andreas Tönnis||Lower Bounds for Online Matching on the Line|
|Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi and Leen Stougie||Approximation Algorithms for Replenishment Problems with Fixed Turnover Times|
|Wednesday||Session 10 - Chair: Kirk Pruhs|
|Davis Issac, L. Sunil Chandran, Anita Das and Erik Jan van Leeuwen||Algorithms and Bounds for Very Strong Rainbow Coloring|
|Florent Becker, Pedro Montealegre, Ivan Rapaport and Ioan Todinca||The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model|
|Jennifer Iglesias, Rajmohan Rajaraman, R Ravi and Ravi Sundaram||Plane Gossip: Approximating rumor spread in planar graphs|
|Lelia Blinand Sebastien Tixeuil||Compact Self-Stabilizing Leader Election for General Networks|
|Thursday||Session 11 - Chair: Pierre Fraigniaud|
|Juan Gutiérrez||Transversals of longest cycles in chordal and bounded tree-width graphs|
|Katharina Klost and Wolfgang Mulzer||Recognizing generalized transmission graphs of line segments and circular sectors|
|Daniel _tefankovi_, Eric Vigoda and John Wilmes||On Counting Perfect Matchings in General Graphs|
|Luis Evaristo Caraballo de La Cruz, Pablo Pérez-Lantero, Carlos Seara and Inmaculada Ventura Molina||Maximum Box Problem on Stochastic Points|
|Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh and Sudeshna Kolay||Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set|
|Sandip Banerjee, Sujoy Bhore and Rajesh Chitnis||Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets|
|Thursday||Session 12 - Chair: Kefu Lu|
|Meng He, Cuong Nguyen and Norbert Zeh||Maximal and Convex Layers of Random Point Sets|
|Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales and Henrique Stagni||Property testing for point sets on the plane|
|Nir Ailon, Anup Bhattacharya and Ragesh Jaiswal||Approximate Correlation Clustering Using Same-Cluster Queries|
|Sarah Miracle and Amanda Streib||Rapid Mixing of k-Class Biased Permutations|
|Thursday||Session 13 - Chair: Meng He|
|Themistoklis Melissourgos, Paul Spirakis, Christoforos Raptopoulos and Sotiris Nikoletseas||Mutants and Residents with Different Connection Graphs in the Moran Process|
|Pablo Rotondo, Brigitte Vallée and Alfredo Viola||Analysis of the Continued Logarithm Algorithm|
|Philippe Duchon and Cyril Nicaud||On the Biased Partial Word Collector Problem|
|Tamal K. Dey, Tianqi Li and Yusu Wang||Efficient algorithms for computing a minimal homology basis|
|Thursday||Session 14 - Chair: Brigitte Vallée|
|Julio Araujo, Victor Campos, Ana Karolinna Maia, Ignasi Sau and Ana Silva||On the complexity of finding internally vertex-disjoint long directed paths|
|Andrzej Dudek and Andrzej Rucinski||Constructive Ramsey Numbers For Loose Hyperpaths|
|Roberto Grossi, Andrea Marino and Luca Versari||Efficient Algorithms for Listing K Disjoint st-Paths in Graphs|
|Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Saket Saurabh and Venkatesh Raman||A Polynomial Sized Kernel for Tracking Paths Problem|
Full papers published in LNCS are available until May 16 here:
Registration fee payment is made through the Fundación Ciencias Exactas y Naturales http://www.fundacen.org.ar/latin2018_en/
ON-SITE REGISTRATION: You can pay cash at the conference place. If you plan to do this, please send an email to email@example.com
Any question or doubt, please contact firstname.lastname@example.org.
After you register, please complete this form in order to choose your preferred excursion (which is included for those who pay the registration fee), and to inform us if you are willing to attend or give a talk in the LATIN Workshop on Theoretical Computer Science.
It will take place in Auditorio Alberto Williams (SALA 2), second floor.
The conference banquet is on Tuesday at 7pm (after the tour), at Rei Bar, Marcelo T. de Alvear 479, Retiro. Extra tickets may be purchased at the conference place.
|Entrance Viamonte street|
|Once you enter, you should see a flight of stairs in front of you|
|Go up these stairs and turn left: you should see another stairway going up|
|Go up these stairs and turn left again. Walk a short distance, and you will be now in front of the steps that lead to the room where the symposium will be held|
There is an elevator in the ground floor, to the left after entering the Centro Cultural Borges. Take this elevator to the second floor, and you will be in front of the room.
In April it is Autumn in Buenos Aires. Temperature might be between 13°C and 22°C. It is rather humid and it may rain.
The current exchange rate is approx. 18 argentine pesos ($) for one U.S. dollar (USD). There are money exchange agencies at the international airport and in many places around the city, especially in the downtown area. Cash machines and ATM are available everywhere around the city. Purchases with credit card are usual, but it is advisable to check with your bank if your card is active in Argentina. In a few stores U.S. dollars may be accepted.
Full papers are to be submitted electronically using the EasyChair
The Secretaria de Turismo has a very complete webpage that includes information about restaurants, different tour guides to visit Buenos Aires, cultural events, weather information, transportation to and from the airport, and much more!
There are several Information Centers providing tourists with maps, brochures, and any other useful information you might need: