Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam and Nitin Saurabh, Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. [Bibtex] Meng He, Cuong P. Nguyen and Norbert Zeh, Maximal and Convex Layers of Random Point Sets. [Bibtex] R. Krithika, Abhishek Sahu, Saket Saurabh and Meirav Zehavi, . [Bibtex] Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner and Renato Portugal, . [Bibtex] Kunal Agrawal, Jing Li, Kefu Lu and Benjamin Moseley, Scheduling Parallelizable Jobs Online to Maximize Throughput. [Bibtex] Nir Ailon, Anup Bhattacharya and Ragesh Jaiswal, Approximate Correlation Clustering Using Same-Cluster Queries. [Bibtex] Peter Allen, Christoph Koch, Olaf Parczyk and Yury Person, Finding Tight Hamilton Cycles in Random Hypergraphs Faster. [Bibtex] Saeed Akhoondian Amiri, Klaus-Tycho Foerster and Stefan Schmid, Walking Through Waypoints. [Bibtex] Antonios Antoniadis, Carsten Fischer and Andreas Tönnis, A Collection of Lower Bounds for Online Matching on the Line. [Bibtex] Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau and Ana Silva, . [Bibtex] Sandip Banerjee, Sujoy Bhore and Rajesh Chitnis, . [Bibtex] Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman and Saket Saurabh, A Polynomial Sized Kernel for Tracking Paths Problem. [Bibtex] Bahareh Banyassady, Luis Barba and Wolfgang Mulzer, Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees. [Bibtex] Yair Bartal and Lee-Ad Gottlieb, Approximate Nearest Neighbor Search for \(\ell_p\)-Spaces \(2\lt p\lt\infty \) via Embeddings. [Bibtex] Florent Becker, Pedro Montealegre, Ivan Rapaport and Ioan Todinca, . [Bibtex] Therese C. Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal and Alexi Turcotte, Partitioning Orthogonal Histograms into Rectangular Boxes. [Bibtex] Lélia Blin and Sébastien Tixeuil, Compact Self-Stabilizing Leader Election for General Networks. [Bibtex] Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker and Marc P. Renault, Random Walks with Multiple Step Lengths. [Bibtex] Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh and Sudeshna Kolay, Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. [Bibtex] Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski and Anna Zych-Pawlewicz, A Tight Bound for Shortest Augmenting Paths on Trees. [Bibtex] Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi and Leen Stougie, . [Bibtex] Luis Evaristo Caraballo, Pablo Pérez-Lantero, Carlos Seara and Inmaculada Ventura, Maximum Box Problem on Stochastic Points. [Bibtex] Rodrigo A. Carrasco, Kirk Pruhs, Cliff Stein and José Verschae, The Online Set Aggregation Problem. [Bibtex] Thom Castermans, Bettina Speckmann, Frank Staals and Kevin Verbeek, Agglomerative Clustering of Growing Squares. [Bibtex] L. Sunil Chandran, Anita Das, Davis Issac and Erik Jan van Leeuwen, Algorithms and Bounds for Very Strong Rainbow Coloring. [Bibtex] Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu and Solon P. Pissis, Property Suffix Array with Applications. [Bibtex] Vincent Chau, Shengzhong Feng and Nguyen Kim Thang, Competitive Algorithms for Demand Response Management in Smart Grid. [Bibtex] Ruiwen Chen, Igor Carboni Oliveira and Rahul Santhanam, An Average-Case Lower Bound Against \(\mathsf{ACC}^0\). [Bibtex] Anders Roy Christiansen and Mikko Berggren Ettienne, Compressed Indexing with Signature Grammars. [Bibtex] Jonas Cleve and Wolfgang Mulzer, Combinatorics of Beacon-Based Routing in Three Dimensions. [Bibtex] Zakir Deniz, Simon Nivelle, Bernard Ries and David Schindl, On Split \(B_1\)-EPG Graphs. [Bibtex] Tamal K. Dey, Tianqi Li and Yusu Wang, Efficient Algorithms for Computing a Minimal Homology Basis. [Bibtex] Sergey Dovgal and Vlady Ravelomanana, . [Bibtex] Philippe Duchon and Cyril Nicaud, On the Biased Partial Word Collector Problem. [Bibtex] Andrzej Dudek and Andrzej Ruciński, Constructive Ramsey Numbers for Loose Hyperpaths. [Bibtex] Matteo Dusefante and Riko Jacob, Cache Oblivious Sparse Matrix Multiplication. [Bibtex] David Eppstein, Michael T. Goodrich and Nil Mamano, Reactive Proximity Data Structures for Graphs. [Bibtex] Sándor P. Fekete, Sven von Höveling, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer, Arne Schmidt and James R. Zuber, Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading. [Bibtex] Carsten Fischer and Heiko Röglin, Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering. [Bibtex] Martin Fürer, Carlos Hoppen, David Pokrass Jacobs and Vilmar Trevisan, Locating the Eigenvalues for Graphs of Small Clique-Width. [Bibtex] Travis Gagie, Gonzalo Navarro and Nicola Prezza, On the Approximation Ratio of Lempel-Ziv Parsing. [Bibtex] Hang Gao and Wenyu Gao, Kernelization for Maximum Happy Vertices Problem. [Bibtex] Bernd Gärtner and Ahad N. Zehmakan, Majority Model on Random Regular Graphs. [Bibtex] Serge Gaspers, Joachim Gudmundsson, Michael Horton and Stefan Rümmele, When is Red-Blue Nonblocker Fixed-Parameter Tractable?. [Bibtex] Loukas Georgiadis, Giuseppe F. Italiano and Nikos Parotsidis, Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. [Bibtex] Roberto Grossi, Andrea Marino and Luca Versari, Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. [Bibtex] Juan Gutiérrez, Transversals of Longest Cycles in Chordal and Bounded Tree-Width Graphs. [Bibtex] Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales and Henrique Stagni, Property Testing for Point Sets on the Plane. [Bibtex] Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi and Ravi Sundaram, Plane Gossip: Approximating Rumor Spread in Planar Graphs. [Bibtex] Adalat Jabrayilov and Petra Mutzel, New Integer Linear Programming Models for the Vertex Coloring Problem. [Bibtex] Yasushi Kawase, Hanna Sumita and Takuro Fukunaga, Submodular Maximization with Uncertain Knapsack Capacity. [Bibtex] 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. [Bibtex] Katharina Klost and Wolfgang Mulzer, . [Bibtex] Yoshiharu Kohayakawa, Flávio Keidi Miyazawa and Yoshiko Wakabayashi, . [Bibtex] Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny and Sunil M. Shende, Satisfying Neighbor Preferences on a Circle. [Bibtex] Carla Negri Lintzmayer, Flávio Keidi Miyazawa and Eduardo Candido Xavier, Two-Dimensional Knapsack for Circles. [Bibtex] Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos Raptopoulos and Paul G. Spirakis, . [Bibtex] Wouter Meulemans, Bettina Speckmann, Kevin Verbeek and Jules Wulms, . [Bibtex] Sarah Miracle and Amanda Pascoe Streib, Rapid Mixing of \(k\)-Class Biased Permutations. [Bibtex] Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth and Ahad N. Zehmakan, Transition Operations over Plane Trees. [Bibtex] Pablo Rotondo, Brigitte Vallée and Alfredo Viola, Analysis of the Continued Logarithm Algorithm. [Bibtex] Daniel Stefankovic, Eric Vigoda and John Wilmes, On Counting Perfect Matchings in General Graphs. [Bibtex] Thomas Watson, Quadratic Simulations of Merlin-Arthur Games. [Bibtex]

[Home] [All LATIN Papers] [LATIN 2018]