Table of Contents

• The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and HardnessAlexandre Santiago de Abreu, Luís Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal. 1-13 [doi]
• Approximate Correlation Clustering Using Same-Cluster QueriesNir Ailon, Anup Bhattacharya, Ragesh Jaiswal. 14-27 [doi]
• Finding Tight Hamilton Cycles in Random Hypergraphs FasterPeter Allen, Christoph Koch 0008, Olaf Parczyk, Yury Person. 28-36 [doi]
• Walking Through WaypointsSaeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid. 37-51 [doi]
• A Collection of Lower Bounds for Online Matching on the LineAntonios Antoniadis, Carsten Fischer, Andreas Tönnis. 52-65 [doi]
• On the Complexity of Finding Internally Vertex-Disjoint Long Directed PathsJúlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva. 66-79 [doi]
• Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point SetsSandip Banerjee, Sujoy Bhore, Rajesh Chitnis. 80-93 [doi]
• A Polynomial Sized Kernel for Tracking Paths ProblemAritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001. 94-107 [doi]
• Time-Space Trade-Offs for Computing Euclidean Minimum Spanning TreesBahareh Banyassady, Luis Barba, Wolfgang Mulzer. 108-119 [doi]
• Approximate Nearest Neighbor Search for \ell _p -Spaces (2 via EmbeddingsYair Bartal, Lee-Ad Gottlieb. 120-133 [doi]
• The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique ModelFlorent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca. 134-145 [doi]
• Partitioning Orthogonal Histograms into Rectangular BoxesTherese C. Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte. 146-160 [doi]
• Compact Self-Stabilizing Leader Election for General NetworksLélia Blin, Sébastien Tixeuil. 161-173 [doi]
• Random Walks with Multiple Step LengthsLucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker, Marc Renault. 174-186 [doi]
• Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting SetJean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay. 187-200 [doi]
• A Tight Bound for Shortest Augmenting Paths on TreesBartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz. 201-216 [doi]
• Approximation Algorithms for Replenishment Problems with Fixed Turnover TimesThomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi 0001, Leen Stougie. 217-230 [doi]
• Maximum Box Problem on Stochastic PointsLuis Evaristo Caraballo, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura. 231-244 [doi]
• The Online Set Aggregation ProblemRodrigo A. Carrasco, Kirk Pruhs, Cliff Stein, José Verschae. 245-259 [doi]
• Agglomerative Clustering of Growing SquaresThom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek. 260-274 [doi]
• Fourier Entropy-Influence Conjecture for Random Linear Threshold FunctionsSourav Chakraborty 0001, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh. 275-289 [doi]
• Property Suffix Array with ApplicationsPanagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis. 290-302 [doi]
• Competitive Algorithms for Demand Response Management in Smart GridVincent Chau, Shengzhong Feng, Nguyen Kim Thang. 303-316 [doi]
• An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0Ruiwen Chen, Igor Carboni Oliveira, Rahul Santhanam. 317-330 [doi]
• Compressed Indexing with Signature GrammarsAnders Roy Christiansen, Mikko Berggren Ettienne. 331-345 [doi]
• Combinatorics of Beacon-Based Routing in Three DimensionsJonas Cleve, Wolfgang Mulzer. 346-360 [doi]
• On Split B_1 B 1 -EPG GraphsZakir Deniz, Simon Nivelle, Bernard Ries, David Schindl. 361-375 [doi]
• Efficient Algorithms for Computing a Minimal Homology BasisTamal K. Dey, Tianqi Li, Yusu Wang. 376-398 [doi]
• Shifting the Phase Transition Threshold for Random Graphs Using Degree Set ConstraintsSergey Dovgal, Vlady Ravelomanana. 399-412 [doi]
• On the Biased Partial Word Collector ProblemPhilippe Duchon, Cyril Nicaud. 413-426 [doi]
• Constructive Ramsey Numbers for Loose HyperpathsAndrzej Dudek, Andrzej Rucinski 0001. 427-436 [doi]
• Cache Oblivious Sparse Matrix MultiplicationMatteo Dusefante, Riko Jacob. 437-447 [doi]
• Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and UnloadingSándor P. Fekete, Sven von Höveling, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer, Arne Schmidt, James R. Zuber. 448-460 [doi]
• Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin CoveringCarsten Fischer, Heiko Röglin. 461-474 [doi]
• Locating the Eigenvalues for Graphs of Small Clique-WidthMartin Fürer, Carlos Hoppen, David P. Jacobs, Vilmar Trevisan. 475-489 [doi]
• On the Approximation Ratio of Lempel-Ziv ParsingTravis Gagie, Gonzalo Navarro, Nicola Prezza. 490-503 [doi]
• Kernelization for Maximum Happy Vertices ProblemHang Gao, Wenyu Gao. 504-514 [doi]
• When is Red-Blue Nonblocker Fixed-Parameter Tractable?Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele. 515-528 [doi]
• Incremental Strong Connectivity and 2-Connectivity in Directed GraphsLoukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis. 529-543 [doi]
• Efficient Algorithms for Listing k Disjoint st-Paths in GraphsRoberto Grossi, Andrea Marino, Luca Versari. 544-557 [doi]
• Transversals of Longest Cycles in Chordal and Bounded Tree-Width GraphsJuan Gutiérrez. 558-571 [doi]
• Majority Model on Random Regular GraphsBernd Gärtner, Ahad N. Zehmakan. 572-583 [doi]
• Property Testing for Point Sets on the PlaneJie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni. 584-596 [doi]
• Maximal and Convex Layers of Random Point SetsMeng He 0001, Cuong P. Nguyen, Norbert Zeh. 597-610 [doi]
• Plane Gossip: Approximating Rumor Spread in Planar GraphsJennifer Iglesias, Rajmohan Rajaraman, R. Ravi 0001, Ravi Sundaram. 611-624 [doi]
• Algorithms and Bounds for Very Strong Rainbow ColoringL. Sunil Chandran, Anita Das 0003, Davis Issac, Erik Jan van Leeuwen. 625-639 [doi]
• New Integer Linear Programming Models for the Vertex Coloring ProblemAdalat Jabrayilov, Petra Mutzel. 640-652 [doi]
• Submodular Maximization with Uncertain Knapsack CapacityYasushi Kawase, Hanna Sumita, Takuro Fukunaga. 653-668 [doi]
• Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion TimeSamir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat. 669-682 [doi]
• Recognizing Generalized Transmission Graphs of Line Segments and Circular SectorsKatharina Klost, Wolfgang Mulzer. 683-696 [doi]
• A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related GameYoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi. 697-711 [doi]
• The Parameterized Complexity of Cycle Packing: Indifference is Not an IssueR. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Meirav Zehavi. 712-726 [doi]
• Satisfying Neighbor Preferences on a CircleDanny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende. 727-740 [doi]
• Two-Dimensional Knapsack for CirclesCarla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier. 741-754 [doi]
• Scheduling Parallelizable Jobs Online to Maximize ThroughputKunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley. 755-776 [doi]
• Reactive Proximity Data Structures for GraphsDavid Eppstein, Michael T. Goodrich, Nil Mamano. 777-789 [doi]
• Mutants and Residents with Different Connection Graphs in the Moran ProcessThemistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. 790-804 [doi]
• A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTsWouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms. 805-819 [doi]
• Rapid Mixing of k-Class Biased PermutationsSarah Miracle, Amanda Pascoe Streib. 820-834 [doi]
• Transition Operations over Plane TreesTorrie L. Nichols, Alexander Pilz, Csaba D. Tóth, Ahad N. Zehmakan. 835-848 [doi]
• Analysis of the Continued Logarithm AlgorithmPablo Rotondo, Brigitte Vallée, Alfredo Viola. 849-863 [doi]
• Quadratic Simulations of Merlin-Arthur GamesThomas Watson 0001. 864-872 [doi]
• On Counting Perfect Matchings in General GraphsDaniel Stefankovic, Eric Vigoda, John Wilmes. 873-885 [doi]