Table of Contents

• Building above Read-once Polynomials: Identity Testing and Hardness of RepresentationMeena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah. 1-12 [doi]
• Sampling from Dense Streams without Penalty - Improved Bounds for Frequency Moments and Heavy HittersVladimir Braverman, Gregory Vorsanger. 13-24 [doi]
• L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing ChainsTakeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita. 25-36 [doi]
• Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and AlgorithmDongjing Miao, Xianmin Liu, Jianzhong Li. 37-48 [doi]
• Online Prediction Problems with VariationChia-Jung Lee, Shi-Chun Tsai, Ming-Chuan Yang. 49-60 [doi]
• Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free WordsKayleigh Hyde, Bjørn Kjos-Hanssen. 61-70 [doi]
• An Axiomatization for Cylinder Computation ModelNan Zhang, Zhenhua Duan, Cong Tian. 71-83 [doi]
• Normal Form Expressions of Propositional Projection Temporal LogicZhenhua Duan, Cong Tian, Nan Zhang. 84-93 [doi]
• On the Smoothed Heights of Trie and Patricia Index TreesWeitian Tong, Randy Goebel, Guohui Lin. 94-103 [doi]
• One-Dimensional k-Center on Uncertain DataHaitao Wang, Jingru Zhang. 104-115 [doi]
• The Range 1 Query (R1Q) ProblemMichael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang. 116-128 [doi]
• Competitive Cost-Savings in Data Stream Management SystemsChristine Chung, Shenoda Guirguis, Anastasia Kurdia. 129-140 [doi]
• On the Kernelization Complexity of String ProblemsManu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh. 141-153 [doi]
• Complexity of Dense Bicluster Editing ProblemsPeng Sun, Jiong Guo, Jan Baumbach. 154-165 [doi]
• Parameterized Complexity of Edge Interdiction ProblemsJiong Guo, Yash Raj Shrestha. 166-178 [doi]
• Vertex Cover Gets Faster and Harder on Low Degree GraphsAkanksha Agrawal, Sathish Govindarajan, Neeldhara Misra. 179-190 [doi]
• A Protocol for Generating Random Elements with Their ProbabilitiesThomas Holenstein, Robin Künzler. 191-202 [doi]
• A New View on Worst-Case to Average-Case Reductions for NP ProblemsThomas Holenstein, Robin Künzler. 203-214 [doi]
• The Power of Duples (in Self-Assembly): It's Not So Hip to Be SquareJacob Hendricks, Matthew J. Patitz, Trent A. Rogers, Scott M. Summers. 215-226 [doi]
• A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal ContentsZhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David A. Bader. 227-238 [doi]
• Diffuse Reflection Radius in a Simple PolygonEli Fox-Epstein, Csaba D. Tóth, Andrew Winslow. 239-250 [doi]
• On Edge-Unfolding One-Layer Lattice Polyhedra with Cubic HolesMeng-Huan Liou, Sheung-Hung Poon, Yu-Jie Wei. 251-262 [doi]
• Directed Steiner Tree with Branching ConstraintDimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth. 263-275 [doi]
• On the Parameterized Complexity of Labelled Correlation Clustering ProblemXianmin Liu, Jianzhong Li, Hong Gao. 276-287 [doi]
• Shortest Color-Spanning IntervalsMinghui Jiang, Haitao Wang. 288-299 [doi]
• Fixed Parameter Tractable Algorithms in Combinatorial TopologyBenjamin A. Burton, William Pettersson. 300-311 [doi]
• Improved Approximation Algorithms for a Bilevel Knapsack ProblemXian Qiu, Walter Kern. 312-323 [doi]
• A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut ProblemChenchen wu, Dachuan Xu, Donglei Du, Wen-Qing Xu. 324-335 [doi]
• Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular PenaltiesDachuan Xu, Fengmin Wang, Donglei Du, Chenchen wu. 336-345 [doi]
• A New Approximation Algorithm for the Unbalanced Min s-t Cut ProblemPeng Zhang. 346-356 [doi]
• Approximability of the Minimum Weighted Doubly Resolving Set ProblemXujin Chen, Changjun Wang. 357-368 [doi]
• Approximating High-Dimensional Range Queries with kNN Indexing TechniquesMichael A. Schuh, Tim Wylie, Chang Liu, Rafal A. Angryk. 369-380 [doi]
• Approximation Algorithms for Maximum Agreement Forest on Multiple TreesFeng Shi, Jianer Chen, Qilong Feng, Jianxin Wang. 381-392 [doi]
• Optimal Inspection Points for Malicious Attack Detection in Smart GridsSubhankar Mishra, Thang N. Dinh, My T. Thai, Incheol Shin. 393-404 [doi]
• Reconfiguration of Dominating SetsAkira Suzuki, Amer E. Mouawad, Naomi Nishimura. 405-416 [doi]
• Back-Up 2-Center on a Path/Tree/Cycle/UnicycleBinay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song. 417-428 [doi]
• Quantum Algorithms for Finding Constant-Sized Sub-hypergraphsFrançois Le Gall, Harumichi Nishimura, Seiichiro Tani. 429-440 [doi]
• Approximation Algorithm for the Balanced 2-Connected Bipartition ProblemDi Wu, Zhao Zhang, Weili Wu, Xiaohui Huang. 441-452 [doi]
• Improved Approximation for Time-Dependent Shortest PathsMasoud T. Omran, Jörg-Rüdiger Sack. 453-464 [doi]
• Approximate Sorting of Data Streams with Limited StorageFarzad Farnoud Hassanzadeh, Eitan Yaakobi, Jehoshua Bruck. 465-476 [doi]
• Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned GraphsSeok-Hee Hong, Hiroshi Nagamochi. 477-488 [doi]
• Classifying the Clique-Width of H-Free Bipartite GraphsKonrad Kazimierz Dabrowski, Daniël Paulusma. 489-500 [doi]
• Displacing Random Sensors to Avoid InterferenceEvangelos Kranakis, Gennady Shaikhet. 501-512 [doi]
• On the Performance of Mildly Greedy Players in Cut GamesVittorio Bilò, Mauro Paladini. 513-524 [doi]
• Statistical Properties of Short RSA Distribution and Their Cryptographic ApplicationsPierre-Alain Fouque, Jean-Christophe Zapalowicz. 525-536 [doi]
• Numerical Tic-Tac-Toe on the 4×4 BoardBryce Sandlund, Kerrick Staley, Michael Dixon, Steve Butler. 537-546 [doi]
• On Linear Congestion Games with Altruistic Social ContextVittorio Bilò. 547-558 [doi]
• Scheduling over Scenarios on Two MachinesEsteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen. 559-571 [doi]
• The Complexity of Bounded Register and Skew Arithmetic ComputationVikraman Arvind, S. Raja. 572-583 [doi]
• Minimizing Average Flow-Time under Knapsack ConstraintSuman Kalyan Bera, Syamantak Das, Amit Kumar 0001. 584-595 [doi]
• Depth Lower Bounds against Circuits with Sparse OrientationSajin Koroth, Jayalal Sarma. 596-607 [doi]
• Efficient Respondents Selection for Biased Survey Using Online Social NetworksDonghyun Kim, Jiaofei Zhong, Minhyuk Lee, Deying Li, Alade O. Tokuta. 608-615 [doi]
• Explaining Snapshots of Network Diffusions: Structural and Hardness ResultsGeorgios Askalidis, Randall A. Berry, Vijay G. Subramanian. 616-625 [doi]
• Pioneers of Influence Propagation in Social NetworksKumar Gaurav, Bartlomiej Blaszczyszyn, Holger Paul Keeler. 626-636 [doi]
• Empirical Models for Complex Network Dynamics: A Preliminary StudyDouglas Oliveira, Marco Carvalho. 637-646 [doi]
• Partner Matching Applications of Social NetworksChunyu Ai, Wei Zhong, Mingyuan Yan, Feng Gu. 647-656 [doi]
• YASCA: An Ensemble-Based Approach for Community Detection in Complex NetworksRushed Kanawati. 657-666 [doi]
• Mining the Key Structure of the Information Diffusion NetworkJingzong Yang, Li Wang, Weili Wu. 667-675 [doi]
• Handling Big Data of Online Social Networks on a Small MachineMing Jia, Jie Wang. 676-685 [doi]