Abstract is missing.
- Online Scheduling on a CPU-GPU ClusterLin Chen, Deshi Ye, Guochuan Zhang. 1-9 [doi]
- Throughput Maximization for Speed-Scaling with Agreeable DeadlinesEric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios. 10-19 [doi]
- Temperature Aware Online Algorithms for Minimizing Flow TimeMartin Birks, Stanley P. Y. Fung. 20-31 [doi]
- Priority Queues and Sorting for Read-Only DataTetsuo Asano, Amr Elmasry, Jyrki Katajainen. 32-41 [doi]
- ε)-Distance Oracles for Vertex-Labeled Planar GraphsMingfei Li, Chu Chung Christopher Ma, Li Ning. 42-51 [doi]
- 1 PlaneHee-Kap Ahn, Sang Won Bae, Wanbin Son. 52-61 [doi]
- Modelling the Power Supply Network - Hardness and ApproximationAlexandru Popa. 62-71 [doi]
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design ProblemAndreas Bley, S. Mehdi Hashemi, Mohsen Rezapour. 72-83 [doi]
- k-means++ under Approximation StabilityManu Agarwal, Ragesh Jaiswal, Arindam Pal. 84-95 [doi]
- An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity StructureMingyu Xiao, Hiroshi Nagamochi. 96-107 [doi]
- Non-crossing Connectors in the PlaneJan Kratochvíl, Torsten Ueckerdt. 108-120 [doi]
- Minimax Regret 1-Sink Location Problems in Dynamic Path NetworksSiu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu. 121-132 [doi]
- A Notion of a Computational Step for Partial Combinatory AlgebrasNathanael Leedom Ackerman, Cameron E. Freer. 133-143 [doi]
- Selection by Recursively Enumerable SetsWolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang. 144-155 [doi]
- On the Boundedness Property of Semilinear SetsOscar H. Ibarra, Shinnosuke Seki. 156-168 [doi]
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog ComputerOlivier Bournez, Daniel S. Graça, Amaury Pouly. 169-180 [doi]
- Computing with and without Arbitrary Large NumbersMichael Brand. 181-192 [doi]
- On the Sublinear Processor Gap for Parallel ArchitecturesAlejandro López-Ortiz, Alejandro Salinger. 193-204 [doi]
- On Efficient Constructions of Short Lists Containing Mostly Ramsey GraphsMarius Zimand. 205-211 [doi]
- On Martin-Löf Convergence of Solomonoff's MixtureTor Lattimore, Marcus Hutter. 212-223 [doi]
- Any Monotone Property of 3-Uniform Hypergraphs Is Weakly EvasiveRaghav Kulkarni, Youming Qiao, Xiaoming Sun. 224-235 [doi]
- The Algorithm for the Two-Sided Scaffold Filling ProblemNan Liu, Daming Zhu. 236-247 [doi]
- Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional ArraysAkira Suzuki, Kei Uchizawa, Xiao Zhou. 248-259 [doi]
- Resolving Rooted Triplet Inconsistency by Dissolving MultigraphsAndrew Chester, Riccardo Dondi, Anthony Wirth. 260-271 [doi]
- Obnoxious Facility Game with a Bounded Service RangeYukun Cheng, Qiaoming Han, Wei Yu, Guochuan Zhang. 272-281 [doi]
- Efficient Self-pairing on Ordinary Elliptic CurvesHongfeng Wu, Rongquan Feng. 282-293 [doi]
- Grey-Box Public-Key SteganographyHirotoshi Takebe, Keisuke Tanaka. 294-305 [doi]
- r -Constraint Satisfaction ProblemsAnthony Perez. 306-318 [doi]
- On Parameterized and Kernelization Algorithms for the Hierarchical Clustering ProblemYixin Cao, Jianer Chen. 319-330 [doi]
- Vector Connectivity in GraphsEndre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic. 331-342 [doi]
- Trees in Graphs with Conflict Edges or Forbidden TransitionsMamadou Moustapha Kanté, Christian Laforest, Benjamin Momège. 343-354 [doi]