Abstract is missing.
- A Generalization of the Convex Kakeya ProblemHee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron. 1-12 [doi]
- Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable DeadlinesEric Angel, Evripidis Bampis, Vincent Chau. 13-24 [doi]
- Bichromatic 2-Center of Pairs of PointsEsther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell, Belén Palop, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira. 25-36 [doi]
- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley GraphsVikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar. 37-48 [doi]
- A Better Approximation Ratio and an IP Formulation for a Sensor Cover ProblemRafael da Ponte Barbosa, Yoshiko Wakabayashi. 49-60 [doi]
- On the Advice Complexity of the Knapsack ProblemHans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith. 61-72 [doi]
- Reoptimization of Some Maximum Weight Induced Hereditary Subgraph ProblemsNicolas Boria, Jérôme Monnot, Vangelis Th. Paschos. 73-84 [doi]
- On Plane Constrained Bounded-Degree SpannersProsenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot. 85-96 [doi]
- Space-Efficient Approximation Scheme for Circular Earth Mover DistanceJoshua Brody, Hongyu Liang, Xiaoming Sun. 97-108 [doi]
- Density Classification on Infinite Lattices and TreesAna Busic, Nazim Fatès, Jean Mairesse, Irene Marcovici. 109-120 [doi]
- Coloring Planar Homothets and Three-Dimensional HypergraphsJean Cardinal, Matias Korman. 121-132 [doi]
- An Equivariance Theorem with Applications to RenamingArmando Castañeda, Maurice Herlihy, Sergio Rajsbaum. 133-144 [doi]
- Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus TasksArmando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal. 145-156 [doi]
- Pseudorandomness of a Random Kronecker SequenceEda Cesaratto, Brigitte Vallée. 157-171 [doi]
- Revisiting the Cache Miss Analysis of Multithreaded AlgorithmsRichard Cole, Vijaya Ramachandran. 172-183 [doi]
- Parameterized Complexity of MaxSat above AverageRobert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh. 184-194 [doi]
- Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 nMarek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. 195-206 [doi]
- A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer ProgrammingDaniel Dadush. 207-218 [doi]
- Two-Dimensional Range Diameter QueriesPooya Davoodi, Michiel H. M. Smid, Freek van Walderveen. 219-230 [doi]
- An Improved Upper Bound on the Density of Universal Random GraphsDomingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski 0001. 231-242 [doi]
- Logspace Computations in Graph Groups and Coxeter GroupsVolker Diekert, Jonathan Kausch, Markus Lohrey. 243-254 [doi]
- Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of PointsStefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Ladislav Stacho. 255-266 [doi]
- On the Radon Number for P 3-ConvexityMitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman. 267-278 [doi]
- Computing Minimum Geodetic Sets of Proper Interval GraphsTinaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister. 279-290 [doi]
- Hausdorff Rank of Scattered Context-Free Linear OrdersZoltán Ésik, Szabolcs Iván. 291-302 [doi]
- Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. DeterminismMartin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks. 303-314 [doi]
- On the Non-progressive Spread of Influence through Social NetworksMohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad. 315-326 [doi]
- Forbidden PatternsJohannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki. 327-337 [doi]
- Structural Complexity of Multiobjective NP Search ProblemsKrzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek. 338-349 [doi]
- k-Gap Interval GraphsFedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger. 350-361 [doi]
- Decidability Classes for Mobile Agents ComputingPierre Fraigniaud, Andrzej Pelc. 362-374 [doi]
- NE Is Not NP Turing Reducible to Nonexponentially Dense NP SetsBin Fu. 375-386 [doi]
- Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-WidthMartin Fürer. 387-398 [doi]
- Indexed Multi-pattern MatchingTravis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela, Jorma Tarhio. 399-407 [doi]
- New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set SplittingArchontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh. 408-419 [doi]
- Cache Me If You Can: Capacitated Selfish Replication GamesRagavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram. 420-432 [doi]
- The Efficiency of MapReduce in Parallel External MemoryGero Greiner, Riko Jacob. 433-445 [doi]
- Algorithms for Some H-Join DecompositionsMichel Habib, Antoine Mamcarz, Fabien de Montgolfier. 446-457 [doi]
- On the Bend-Number of Planar and Outerplanar GraphsDaniel Heldt, Kolja B. Knauer, Torsten Ueckerdt. 458-469 [doi]
- Hiring above the m-th Best Candidate: A Generalization of Records in PermutationsAhmed Helmi, Conrado Martínez, Alois Panholzer. 470-481 [doi]
- On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear CostWiebke Höhn, Tobias Jacobs. 482-493 [doi]
- Advantage of Overlapping Clusters for Minimizing ConductanceRohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni. 494-505 [doi]
- Independence of Tabulation-Based Hash ClassesToryn Qwyllyn Klassen, Philipp Woelfel. 506-517 [doi]
- Oblivious Two-Way Finite Automata: Decidability and ComplexityMartin Kutrib, Andreas Malcher, Giovanni Pighizzini. 518-529 [doi]
- Clique-Colouring and Biclique-Colouring Unichord-Free GraphsHélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. Herrera de Figueiredo. 530-541 [doi]
- Random Walks and Bisections in Random Circulant GraphsBernard Mans, Igor Shparlinski. 542-555 [doi]
- The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover ProblemMonaldo Mastrolilli. 556-567 [doi]
- Fully Analyzing an Algebraic Pólya Urn ModelBasile Morcrette. 568-581 [doi]
- Degree-Constrained Node-ConnectivityZeev Nutov. 582-593 [doi]
- Survivable Network Activation ProblemsZeev Nutov. 594-605 [doi]
- On the Integrality Gap of the Subtour LP for the 1, 2-TSPJiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen. 606-617 [doi]
- A Theory and Algorithms for Combinatorial ReoptimizationHadas Shachnai, Gal Tamir, Tami Tamir. 618-630 [doi]
- Capacity Achieving Two-Write WOM CodesAmir Shpilka. 631-642 [doi]
- The Relationship between Inner Product and Counting CyclesXiaoming Sun, Chengu Wang, Wei Yu. 643-654 [doi]
- Approximating Minimum Label s-t Cut via Linear ProgrammingLinqing Tang, Peng Zhang. 655-666 [doi]