Abstract is missing.
- Market Approach to Social Ads: The MyLikes Example and Related ProblemsDarja Krushevskaja, S. Muthukrishnan. 1-10 [doi]
- Geodesic-Preserving Polygon SimplificationOswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Birgit Vogtenhuber. 11-21 [doi]
- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle InformationJinhee Chun, Ricardo Garcia de Gonzalo, Takeshi Tokuyama. 22-32 [doi]
- On the Edge Crossing Properties of Euclidean Minimum Weight Laman GraphsSergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa. 33-43 [doi]
- Structure and Computation of Straight Skeletons in 3-SpaceFranz Aurenhammer, Gernot Walzl. 44-54 [doi]
- Pattern Matching with Non Overlapping Reversals - Approximation and On-line AlgorithmsAmihood Amir, Benny Porat. 55-65 [doi]
- Single and Multiple Consecutive Permutation Motif SearchDjamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette. 66-77 [doi]
- Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern MatchingPawel Gawrychowski, Damian Straszak. 78-88 [doi]
- Less Space: Indexing for Queries with WildcardsMoshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan. 89-99 [doi]
- On Determining Deep Holes of Generalized Reed-Solomon CodesQi Cheng, Jiyou Li, Jincheng Zhuang. 100-110 [doi]
- Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph ClassesYota Otachi, Pascal Schweitzer. 111-118 [doi]
- Determinantal Complexities and Field ExtensionsYouming Qiao, Xiaoming Sun, Nengkun Yu. 119-129 [doi]
- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product GraphsMatthew Johnson 0002, Daniël Paulusma, Erik Jan van Leeuwen. 130-140 [doi]
- Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree GraphsMarc Lelarge, Hang Zhou. 141-151 [doi]
- The Complexity of Finding a Large Subgraph under Anonymity ConstraintsRobert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger. 152-162 [doi]
- On the Number of Edges of Fan-Crossing Free GraphsOtfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim. 163-173 [doi]
- Cops and Robbers on Intersection GraphsTomás Gavenciak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl. 174-184 [doi]
- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane GraphsPatrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson. 185-195 [doi]
- Hardness and Algorithms for Variants of Line Graphs of Directed GraphsMourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy. 196-206 [doi]
- Performance Guarantees for Scheduling Algorithms under Perturbed Machine SpeedsMichael Etscheid. 207-217 [doi]
- Better Bounds for Online k-Frame Throughput Maximization in Network SwitchesJun Kawahara, Koji Kobayashi, Shuichi Miyazaki. 218-228 [doi]
- The Solvable Cases of a Scheduling AlgorithmSam Walker, Yakov Zinder. 229-239 [doi]
- Exact Sublinear Binomial SamplingMartin Farach-Colton, Meng-Tsung Tsai. 240-250 [doi]
- Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF FormulasDominik Scheder. 251-261 [doi]
- Dynamic Point Labeling is Strongly PSPACE-CompleteKevin Buchin, Dirk H. P. Gerrits. 262-272 [doi]
- Unsatisfiable CNF Formulas contain Many ConflictsDominik Scheder. 273-283 [doi]
- Pursuit Evasion on Polyhedral SurfacesKyle Klein, Subhash Suri. 284-294 [doi]
- Algorithms for Tolerated Tverberg PartitionsWolfgang Mulzer, Yannik Stein. 295-305 [doi]
- Abstract Voronoi Diagrams with Disconnected RegionsCecilia Bohler, Rolf Klein. 306-316 [doi]
- Terrain Visibility with Multiple ViewpointsFerran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristan, Maria Saumell, Rodrigo I. Silveira, Frank Staals. 317-327 [doi]
- Exact Algorithms for Maximum Independent SetMingyu Xiao, Hiroshi Nagamochi. 328-338 [doi]
- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation GraphsMamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno. 339-349 [doi]
- Testing Mutual Duality of Planar GraphsPatrizio Angelini, Thomas Bläsius, Ignaz Rutter. 350-360 [doi]
- Effective and Efficient Data Reduction for the Subset Interconnection Design ProblemJiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller. 361-371 [doi]
- Myhill-Nerode Methods for HypergraphsRené van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond. 372-382 [doi]
- Augmenting Graphs to Minimize the DiameterFabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson. 383-393 [doi]
- Top-k Document Retrieval in Compact Space and Near-Optimal TimeGonzalo Navarro, Sharma V. Thankachan. 394-404 [doi]
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for IntegersTimothy M. Chan, J. Ian Munro, Venkatesh Raman. 405-412 [doi]
- Trajectory-Based Dynamic Map LabelingAndreas Gemsa, Benjamin Niedermann, Martin Nöllenburg. 413-423 [doi]
- Asynchronous Rumor Spreading on Random GraphsKonstantinos Panagiotou, Leo Speidel. 424-434 [doi]
- Unit Cost Buyback ProblemYasushi Kawase, Xin Han, Kazuhisa Makino. 435-445 [doi]
- Faster Rumor Spreading with Multiple CallsKonstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald. 446-456 [doi]
- Approximating the Value of a Concurrent Reachability Game in the Polynomial Time HierarchySøren Kristoffer Stiil Frederiksen, Peter Bro Miltersen. 457-467 [doi]
- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated ItemsKazuo Murota, Akiyoshi Shioura, Zaifu Yang. 468-478 [doi]
- New Results on the Online Pricing ProblemXiangzhong Xiang. 479-490 [doi]
- RAM-Efficient External Memory SortingLars Arge, Mikkel Thorup. 491-501 [doi]
- Succinct Data Structures for Representing Equivalence ClassesMoshe Lewenstein, J. Ian Munro, Venkatesh Raman. 502-512 [doi]
- Sliding Bloom FiltersMoni Naor, Eylon Yogev. 513-523 [doi]
- Vertex-Weighted Matching in Two-Directional Orthogonal Ray GraphsC. Gregory Plaxton. 524-534 [doi]
- Bounded Representations of Interval and Proper Interval GraphsMartin Balko, Pavel Klavík, Yota Otachi. 535-546 [doi]
- Detecting and Counting Small Pattern GraphsPeter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell. 547-557 [doi]
- An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced MatchingMin Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter. 558-567 [doi]
- New Inapproximability Bounds for TSPMarek Karpinski, Michael Lampis, Richard Schmied. 568-578 [doi]
- Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian NoiseBodo Manthey, Rianne Veenstra. 579-589 [doi]
- Tight Approximation Bounds for Connectivity with a Color-Spanning SetChenglin Fan, Jun Luo, Binhai Zhu. 590-600 [doi]
- The Train Delivery Problem RevisitedJing Chen, He Guo, Xin Han, Kazuo Iwama. 601-611 [doi]
- The Distance 4-Sector of Two Points Is UniqueRobert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson. 612-622 [doi]
- The Number of Different Unfoldings of PolyhedraTakashi Horiyama, Wataru Shoji. 623-633 [doi]
- Computing the Smallest Color-Spanning Axis-Parallel SquarePayam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi. 634-643 [doi]
- Euclidean Traveling Salesman Tours through Stochastic NeighborhoodsPegah Kamousi, Subhash Suri. 644-654 [doi]
- Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio MeasureAngsheng Li, Pan Peng. 655-665 [doi]
- Approximate Čech Complex in Low and High DimensionsMichael Kerber, R. Sharathkumar. 666-676 [doi]
- Model Counting for Formulas of Bounded Clique-WidthFriedrich Slivovsky, Stefan Szeider. 677-687 [doi]
- Computing Plurality Points and Condorcet Points in Euclidean SpaceYen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao. 688-698 [doi]
- Computing Minimum Tile Sets to Self-Assemble Color PatternsAleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki. 699-710 [doi]
- A Probabilistic Analysis of Kademlia NetworksXing Shi Cai, Luc Devroye. 711-721 [doi]
- Approximating the Generalized Minimum Manhattan Network ProblemAparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff. 722-732 [doi]
- Minmax Regret 1-Facility Location on Uncertain Path NetworksHaitao Wang. 733-743 [doi]