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