Abstract is missing.
- Line-Constrained k -Median, k -Means, and k -Center Problems in the PlaneHaitao Wang, Jingru Zhang. 3-14 [doi]
- Reconstructing Point Set Order Typesfrom Radial OrderingsOswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr. 15-26 [doi]
- A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi DiagramsCecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi. 27-37 [doi]
- Average-Case Complexity of the Min-Sum Matrix Product ProblemKen Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan. 41-52 [doi]
- Efficiently Correcting Matrix ProductsLeszek Gasieniec, Christos Levcopoulos, Andrzej Lingas. 53-64 [doi]
- 3D Rectangulations and Geometric Matrix MultiplicationPeter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu. 65-78 [doi]
- Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-DelayAndre Droschinsky, Bernhard Heinemann, Nils Kriege, Petra Mutzel. 81-93 [doi]
- Efficient Enumeration of Induced Subtrees in a K-Degenerate GraphKunihiro Wasa, Hiroki Arimura, Takeaki Uno. 94-102 [doi]
- An Efficient Method for Indexing All Topological Orders of a Directed GraphYuma Inoue, Shin-ichi Minato. 103-114 [doi]
- Planar Matchings for Weighted Straight SkeletonsTherese C. Biedl, Stefan Huber, Peter Palfrader. 117-127 [doi]
- Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency QueriesMeng He, Ganggui Tang, Norbert Zeh. 128-140 [doi]
- Dynamic and Multi-Functional Labeling SchemesSøren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart. 141-153 [doi]
- Hashing and Indexing: Succinct DataStructures and Smoothed AnalysisAlberto Policriti, Nicola Prezza. 157-168 [doi]
- Top- k Term-Proximity in Succinct SpaceJ. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan. 169-180 [doi]
- The Power and Limitations of Static Binary Search Trees with Lazy FingerProsenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman. 181-192 [doi]
- Minimum-Cost b -Edge Dominating Sets on TreesTakehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto. 195-207 [doi]
- Fixed-Parameter Tractability of Token Jumping on Planar GraphsTakehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono. 208-219 [doi]
- Covering Problems for Partial Words and for Indeterminate StringsMaxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 220-232 [doi]
- Dynamic Interval Scheduling for Multiple MachinesAlexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu. 235-246 [doi]
- Throughput Maximization in Multiprocessor Speed-ScalingEric Angel, Evripidis Bampis, Vincent Chau, Nguyen Kim Thang. 247-258 [doi]
- Speed-Scaling with No PreemptionsEvripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli. 259-269 [doi]
- A Short Implicant of a CNF Formula with Many Satisfying AssignmentsDaniel M. Kane, Osamu Watanabe 0001. 273-284 [doi]
- On the Computational Complexity of Vertex Integrity and Component Order ConnectivityPål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof. 285-297 [doi]
- Co-Clustering Under the Maximum NormLaurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier. 298-309 [doi]
- The Price of OrderProsenjit Bose, Pat Morin, André van Renssen. 313-325 [doi]
- Range Queries on Uncertain DataJian Li, Haitao Wang. 326-337 [doi]
- On the Most Likely Voronoi Diagramand Nearest Neighbor SearchingSubhash Suri, Kevin Verbeek. 338-350 [doi]
- An Improved Approximation Algorithm for the Minimum Common Integer Partition ProblemWeitian Tong, Guohui Lin. 353-364 [doi]
- Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning LithographyTomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi. 365-375 [doi]
- An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution IntegralEi Ando, Shuji Kijima. 376-386 [doi]
- Polynomial-Time Algorithm for Sliding Tokens on TreesErik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada. 389-400 [doi]
- Minimal Obstructions for Partial Representations of Interval GraphsPavel Klavík, Maria Saumell. 401-413 [doi]
- Faster Algorithms for Computing the R* Consensus TreeJesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu. 414-425 [doi]
- Complexity and Kernels for Bipartition into Degree-bounded Induced GraphsMingyu Xiao, Hiroshi Nagamochi. 429-440 [doi]
- Faster Existential FO Model Checking on PosetsJakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak. 441-451 [doi]
- Vertex Cover Reconfiguration and BeyondAmer E. Mouawad, Naomi Nishimura, Venkatesh Raman. 452-463 [doi]
- Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle CoverXingfu Li, Daming Zhu. 467-478 [doi]
- Approximation Algorithms Inspired by Kernelization MethodsFaisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau. 479-490 [doi]
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block MovesHaitao Jiang, Haodi Feng, Daming Zhu. 491-503 [doi]
- Lower Bounds for On-line Graph ColoringsGrzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu. 507-515 [doi]
- An On-line Competitive Algorithm for Coloring P_8 -free Bipartite GraphsPiotr Micek, Veit Wiechert. 516-527 [doi]
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular MaximizationNorman Huang, Allan Borodin. 528-539 [doi]
- Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence ClassesHicham El-Zein, J. Ian Munro, Venkatesh Raman. 543-552 [doi]
- Depth-First Search Using O(n) BitsTetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara. 553-564 [doi]
- Dynamic Path Counting and Reporting in Linear SpaceMeng He, J. Ian Munro, Gelin Zhou. 565-577 [doi]
- Linear-Time Algorithms for Proportional ApportionmentZhanpeng Cheng, David Eppstein. 581-592 [doi]
- Rank-Maximal Matchings - Structure and AlgorithmsPratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar. 593-605 [doi]
- The Generalized Popular Condensation ProblemYen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao. 606-617 [doi]
- Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in GraphsPavel Kolev, He Sun. 621-632 [doi]
- Planar Embeddings with Small and Uniform FacesGiordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter. 633-645 [doi]
- Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection PenaltiesNevzat Onur Domaniç, C. Gregory Plaxton. 646-657 [doi]
- Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection ProtocolXiaoming Sun, Jia Zhang, Jialin Zhang. 661-673 [doi]
- A Geometric Approach to Graph IsomorphismPawan Aurora, Shashank K. Mehta. 674-685 [doi]
- Concentrated Hitting Times of Randomized Search Heuristics with Variable DriftPer Kristian Lehre, Carsten Witt. 686-697 [doi]
- Euclidean TSP with Few Inner Points in Linear SpacePawel Gawrychowski, Damian Rusak. 701-713 [doi]
- Bottleneck Partial-Matching Voronoi Diagrams and ApplicationsMatthias Henze, Rafel Jaume. 714-725 [doi]
- Ham-Sandwich Cuts for Abstract Order TypesStefan Felsner, Alexander Pilz. 726-737 [doi]
- Graph Orientation and Flows over TimeAshwin Arulselvan, Martin Groß, Martin Skutella. 741-752 [doi]
- A Simple Efficient Interior Point Method for Min-Cost FlowRuben Becker, Andreas Karrenbauer. 753-765 [doi]
- Decremental All-Pairs ALL Shortest Paths and Betweenness CentralityMeghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran. 766-778 [doi]