Abstract is missing.
- Mining Preserving Structures in a Graph SequenceTakeaki Uno, Yushi Uno. 3-15 [doi]
- On the Most Imbalanced Orientation of a GraphWalid Ben-Ameur, Antoine Glorieux, José Neto. 16-29 [doi]
- Cheeger Inequalities for General Edge-Weighted Directed GraphsT.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang. 30-41 [doi]
- Strategy-Proof Mechanism for Obnoxious Facility Location on a LineDeshi Ye, Lili Mei, Yong Zhang. 45-56 [doi]
- Bin Packing Game with an Interest MatrixZhenbo Wang, Xin Han, György Dósa, Zsolt Tuza. 57-69 [doi]
- The Least-Core and Nucleolus of Path Cooperative GamesQizhi Fang, Bo Li, Xiaohan Shan, Xiaoming Sun. 70-82 [doi]
- Reversible Pebble Game on TreesBalagopal Komarath, Jayalal Sarma, Saurabh Sawlani. 83-94 [doi]
- Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation AlgorithmsKameng Nip, Zhenbo Wang, Wenxun Xing. 97-108 [doi]
- Complexity of Grundy Coloring and Its VariantsEdouard Bonnet, Florent Foucaud, Eun Jung Kim 0002, Florian Sikora. 109-120 [doi]
- On the Complexity of the Minimum Independent Set Partition ProblemT.-H. Hubert Chan, Charalampos Papamanthou, Zhichao Zhao. 121-132 [doi]
- Bivariate Complexity Analysis of Almost Forest DeletionAshutosh Rai, Saket Saurabh. 133-144 [doi]
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing ProblemsWei Yu, Zhaohui Liu. 147-158 [doi]
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges ProblemsPeng Zhang, Tao Jiang, Angsheng Li. 159-170 [doi]
- An Approximation Algorithm for the Smallest Color-Spanning Circle ProblemYin Wang, Yinfeng Xu. 171-182 [doi]
- Approximation Algorithms for the Connected Sensor Cover ProblemLingxiao Huang, Jian Li, Qicai Shi. 183-196 [doi]
- Skew Circuits of Small WidthNikhil Balaji, Andreas Krebs, Nutan Limaye. 199-210 [doi]
- Correlation Bounds and #SAT Algorithms for Small Linear-Size CircuitsRuiwen Chen, Valentine Kabanets. 211-222 [doi]
- Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically SimulatableYasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka. 223-234 [doi]
- Evaluating Matrix CircuitsDaniel König, Markus Lohrey. 235-248 [doi]
- Approximation and Nonapproximability for the One-Sided Scaffold Filling ProblemHaitao Jiang, Jingjing Ma, Junfeng Luan, Daming Zhu. 251-263 [doi]
- Packing Cubes into a Cube in (D>3)-DimensionsYiping Lu, Danny Z. Chen, Jianzhong Cha. 264-276 [doi]
- Towards Flexible Demands in Online Leasing ProblemsShouwei Li, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf der Heide, Sören Riechers. 277-288 [doi]
- Lower Bounds for the Size of Nondeterministic CircuitsHiroki Morizumi. 289-296 [doi]
- Computing Minimum Dilation Spanning Trees in Geometric GraphsAléx F. Brandt, Miguel F. A. de Gaiowski, Pedro J. de Rezende, Cid C. de Souza. 297-309 [doi]
- Speedy Colorful SubtreesW. Timothy J. White, Stephan Beyer, Kai Dührkop, Markus Chimani, Sebastian Böcker. 310-322 [doi]
- Algorithmic Aspects of Disjunctive Domination in GraphsB. S. Panda, Arti Pandey, S. Paul. 325-336 [doi]
- Algorithmic Aspect of Minus Domination on Small-Degree GraphsJin-Yong Lin, Ching-Hao Liu, Sheung-Hung Poon. 337-348 [doi]
- Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth GraphsNiranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh. 349-360 [doi]
- Reducing Rank of the Adjacency Matrix by Graph ModificationS. M. Meesum, Pranabendu Misra, Saket Saurabh. 361-373 [doi]
- On the Number of Anchored Rectangle Packings for a Planar Point SetKevin Balas, Csaba D. Tóth. 377-389 [doi]
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack ProblemDeshi Ye, Guochuan Zhang. 390-401 [doi]
- Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-LookaheadJiayin Pan, Yinfeng Xu. 402-416 [doi]
- Disjoint Path Allocation with Sublinear AdviceHeidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula. 417-429 [doi]
- Dynamic Tree Shortcut with Constant DegreeT.-H. Hubert Chan, Xiaowei Wu, Chenzi Zhang, Zhichao Zhao. 433-444 [doi]
- The Rectilinear Steiner Tree Problem with Given Topology and Length RestrictionsJens Maßberg. 445-456 [doi]
- Compact Monotone Drawing of TreesXin He, Dayu He. 457-468 [doi]
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex DeletionBang Ye Wu. 469-480 [doi]
- Sampling in Space Restricted SettingsAnup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar 0001. 483-494 [doi]
- Entropy of Weight Distributions of Small-Bias Spaces and PseudobinomialityLouay Bazzi. 495-506 [doi]
- Optimal Algorithms for Running Max and Min Filters on Random InputsHongyu Liang, Shengxin Liu, Hao Yuan. 507-520 [doi]
- Model Checking MSVL Programs Based on Dynamic Symbolic ExecutionZhenhua Duan, Kangkang Bu, Cong Tian, Nan Zhang. 521-533 [doi]
- On the Complete Width and Edge Clique Cover ProblemsVan Bang Le, Sheng-Lung Peng. 537-547 [doi]
- Unique Covering Problems with Geometric SetsPradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh. 548-558 [doi]
- Linear Time Approximation Schemes for Geometric Maximum CoverageJian Li, Haitao Wang, Bowei Zhang, Ningye Zhang. 559-571 [doi]
- Private Certificate-Based Remote Data Integrity Checking in Public CloudsHuaqun Wang, Jiguo Li. 575-586 [doi]
- Maximal and Maximum Transitive Relation Contained in a Given Binary RelationSourav Chakraborty 0001, Shamik Ghosh, Nitesh Jha, Sasanka Roy. 587-600 [doi]
- An Improved Kernel for the Complementary Maximal Strip Recovery ProblemShuai Hu, Wenjun Li, Jianxin Wang. 601-608 [doi]
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and PartitionsMarc Hellmuth, Nicolas Wieseke. 609-623 [doi]
- Bounds for the Super Extra Edge Connectivity of GraphsChia-Wen Cheng, Sun-Yuan Hsieh. 624-631 [doi]
- Quantifying Communication in Synchronized LanguagesZhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li. 635-647 [doi]
- Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value QueriesSeungbum Jo, Srinivasa Rao Satti. 648-660 [doi]
- A New Non-Merkle-Damgård Structural Hash Function with Provable SecurityShenghui Su, Tao Xie, Shuwang Lü. 661-673 [doi]
- A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical SecurityShenghui Su, Shuwang Lü, MaoZhi Xu. 674-686 [doi]
- An Algorithmic Framework for Labeling Network MapsJan-Henrik Haunert, Benjamin Niedermann. 689-700 [doi]
- Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex AlgorithmKamiel Cornelissen, Bodo Manthey. 701-712 [doi]
- DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of RetrievabilityKazumasa Omote, Tran Thao Phuong. 713-730 [doi]
- Evaluating Bayesian Networks via Data StreamsAndrew McGregor, Hoa T. Vu. 731-743 [doi]
- On Energy-Efficient Computations With AdviceHans-Joachim Böckenhauer, Richard Dobson, Sacha Krug, Kathleen Steinhöfel. 747-758 [doi]
- Multi-Radio Channel Detecting Jamming Attack Against Enhanced Jump-Stay Based Rendezvous in Cognitive Radio NetworksYang Gao, Zhaoquan Gu, Qiang-Sheng Hua, Hai Jin. 759-770 [doi]
- Upper Bounds on Fourier EntropySourav Chakraborty 0001, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh. 771-782 [doi]