Abstract is missing.
- Recent Results for Online Makespan MinimizationSusanne Albers. 1-3 [doi]
- Optimal Stopping Meets Combinatorial OptimizationRobert Kleinberg. 4 [doi]
- New Bounds for the Balloon Popping ProblemDavide Bilò, Vittorio Bilò. 5-16 [doi]
- On the Sequential Price of Anarchy of Isolation GamesAnna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli. 17-28 [doi]
- Social Exchange Networks with Distant BargainingKonstantinos Georgiou, George Karakostas, Jochen Könemann, Zuzanna Stamirowska. 29-40 [doi]
- The 1/4-Core of the Uniform Bin Packing Game Is NonemptyWalter Kern, Xian Qiu. 41-52 [doi]
- L(2, 1)-Coloring Problem on Paths and CyclesMaria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen. 53-64 [doi]
- On Randomized Fictitious Play for Approximating Saddle Points over Convex SetsKhaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani. 65-76 [doi]
- A Fast Algorithm for Data Collection along a Fixed TrackOtfried Cheong, Radwa El Shawi, Joachim Gudmundsson. 77-88 [doi]
- Random Methods for Parameterized ProblemsQilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen. 89-100 [doi]
- DVS Scheduling in a Line or a Star Network of ProcessorsZongxu Mu, Minming Li. 101-113 [doi]
- Online Algorithms for Batch Machines Scheduling with Delivery TimesPeihai Liu, Xiwen Lu. 114-121 [doi]
- How to Schedule the Marketing of Products with Negative ExternalitiesZhigang Cao, Xujin Chen, Changjun Wang. 122-133 [doi]
- From Preemptive to Non-preemptive Speed-Scaling SchedulingEvripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis. 134-146 [doi]
- Selection from Read-Only Memory with Limited WorkspaceAmr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti. 147-157 [doi]
- Deternimization of Büchi Automata as Partitioned AutomataCong Tian, Zhenhua Duan, Mengfei Yang. 158-168 [doi]
- On Linear-Size Pseudorandom Generators and Hardcore FunctionsJoshua Baron, Yuval Ishai, Rafail Ostrovsky. 169-181 [doi]
- A Fast Algorithm Finding the Shortest Reset WordsAndrzej Kisielewicz, Jakub Kowalski, Marek Szykula. 182-196 [doi]
- The Discrete Voronoi Game in a Simple PolygonAritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid. 197-207 [doi]
- Facets for Art Gallery ProblemsSándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt. 208-220 [doi]
- Hitting and Piercing Rectangles Induced by a Point SetNinad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra. 221-232 [doi]
- Realistic Roofs over a Rectilinear Polygon RevisitedJessica Sherette, Sang Duk Yoon. 233-244 [doi]
- Parametric Power Supply NetworksShiho Morishita, Takao Nishizeki. 245-256 [doi]
- Approximating the Minimum Independent Dominating Set in Perturbed GraphsWeitian Tong, Randy Goebel, Guohui Lin. 257-267 [doi]
- A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones PropertyChih-Hsuan Li, Jhih-Hong Ye, Biing-Feng Wang. 268-279 [doi]
- On the Conjunctive Capacity of GraphsMiroslav Chlebík, Janka Chlebíková. 280-291 [doi]
- Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular PenaltyYu Li, Donglei Du, Naihua Xiu, Dachuan Xu. 292-303 [doi]
- An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection ProblemsChenchen wu, Donglei Du, Dachuan Xu. 304-315 [doi]
- Improved Local Search for Universal Facility LocationEric Angel, Nguyen Kim Thang, Damien Regnault. 316-324 [doi]
- k Disjoint Paths Subject to Two ConstraintsLongkun Guo, Hong Shen, Kewen Liao. 325-336 [doi]
- k-Separator ProblemWalid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto. 337-348 [doi]
- On the Treewidth of Dynamic GraphsBernard Mans, Luke Mathieson. 349-360 [doi]
- Square-Orthogonal Drawing with Few Bends per EdgeYu-An Lin, Sheung-Hung Poon. 361-372 [doi]
- Covering Tree with StarsJan Baumbach, Jiong Guo, Rashid Ibragimov. 373-384 [doi]
- A Polynomial Time Approximation Scheme for the Closest Shared Center ProblemWeidong Li, Lusheng Wang, Wenjuan Cui. 385-396 [doi]
- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common AdjacenciesNan Liu, Haitao Jiang, Daming Zhu, Binhai Zhu. 397-408 [doi]
- An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange DistanceKun-Tze Chen, Chi-Long Li, Chung-Han Yang, Chin Lung Lu. 409-420 [doi]
- A Combinatorial Approach for Multiple RNA Interaction: Formulations, Approximations, and HeuristicsSyed Ali Ahmed, Saad Mneimneh, Nancy L. Greenbaum. 421-433 [doi]
- Maximum Balanced Subgraph Problem Parameterized above Lower BoundRobert Crowston, Gregory Gutin, Mark Jones, Gabriele Muciaccia. 434-445 [doi]
- A Toolbox for Provably Optimal Multistage Strict Group Testing StrategiesPeter Damaschke, Azam Sheikh Muhammad. 446-457 [doi]
- A Linear Edge Kernel for Two-Layer Crossing MinimizationYasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki. 458-468 [doi]
- A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian ProductChristophe Crespelle, Eric Thierry, Thomas Lambert. 469-480 [doi]
- Metrical Service Systems with Multiple ServersAshish Chiplunkar, Sundar Vishwanathan. 481-492 [doi]
- The String Guessing Problem as a Method to Prove Lower Bounds on the Advice ComplexityHans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock. 493-505 [doi]
- Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square PackingYong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon, Yung H. Tsin, Deshi Ye. 506-517 [doi]
- Improved Lower Bounds for the Online Bin Packing Problem with Cardinality ConstraintsHiroshi Fujiwara, Koji Kobayashi. 518-530 [doi]
- Parameterized Complexity of Flood-Filling Games on TreesUéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva. 531-542 [doi]
- Parameterized Approximability of Maximizing the Spread of Influence in NetworksCristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora. 543-554 [doi]
- An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced SubgraphsYunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen. 555-566 [doi]
- Parameterized Algorithms for Maximum Agreement Forest on Multiple TreesFeng Shi, Jianer Chen, Qilong Feng, Jianxin Wang. 567-578 [doi]
- H-Coloring Problems for Bounded Degree DigraphsPavol Hell, Aurosish Mishra. 579-590 [doi]
- Bounded Model Checking for Propositional Projection Temporal LogicZhenhua Duan, Cong Tian, Mengfei Yang, Jia He. 591-602 [doi]
- Packing Cubes into a Cube Is NP-Hard in the Strong SenseYiping Lu, Danny Z. Chen, Jianzhong Cha. 603-613 [doi]
- On the Complexity of Solving or Approximating Convex Recoloring ProblemsManoel B. Campêlo, Cristiana G. Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi. 614-625 [doi]
- 2-connecting Outerplanar Graphs without Blowing Up the PathwidthJasine Babu, Manu Basavaraju, Sunil Chandran Leela, Deepak Rajendraprasad. 626-637 [doi]
- 2-Heavy-Hitters on Sliding WindowsVladimir Braverman, Ran Gelles, Rafail Ostrovsky. 638-650 [doi]
- Time/Memory/Data Tradeoffs for Variants of the RSA ProblemPierre-Alain Fouque, Damien Vergnaud, Jean-Christophe Zapalowicz. 651-662 [doi]
- An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion RelationshipTao Hu, Xianyi Ren, Jihong Zhang. 663-671 [doi]
- Straight-Line Monotone Grid Drawings of Series-Parallel GraphsMd. Iqbal Hossain, Md. Saidur Rahman 0001. 672-679 [doi]
- Combination of Two-Machine Flow Shop Scheduling and Shortest Path ProblemsKameng Nip, Zhenbo Wang. 680-687 [doi]
- The Program Download Problem: Complexity and AlgorithmsChao Peng, Jie Zhou, Binhai Zhu, Hong Zhu. 688-696 [doi]
- Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant LogicHongbiao Gao, Kai Shi, Yuichi Goto, Jingde Cheng. 697-704 [doi]
- Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank DataXingwu Liu, Shang-Hua Teng. 705-712 [doi]
- Sublinear Time Approximate Sum via Uniform Random SamplingBin Fu, Wenfeng Li, Zhiyong Peng. 713-720 [doi]
- Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract)Zhao Lu, Tian Liu, Ke Xu. 721-728 [doi]
- On the Minimum Caterpillar Problem in DigraphsTaku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou. 729-736 [doi]
- A New Model for Product Adoption over Social NetworksLidan Fan, Zaixin Lu, Weili Wu, Yuanjun Bi, Ailian Wang. 737-746 [doi]
- Generating Uncertain Networks Based on Historical Network SnapshotsMeng Han, Mingyuan Yan, Jinbao Li, Shouling Ji, Yingshu Li. 747-758 [doi]
- A Short-Term Prediction Model of Topic Popularity on MicroblogsJuanjuan Zhao, Weili Wu, Xiaolong Zhang, Yan Qiang, Tao Liu, Lidong Wu. 759-769 [doi]
- Social Network Path Analysis Based on HBaseYan Qiang, Junzuo Lu, Weili Wu, Juanjuan Zhao, Xiaolong Zhang, Yue Li, Lidong Wu. 770-779 [doi]
- Community Expansion Model Based on Charged System TheoryYuanjun Bi, Weili Wu, Ailian Wang, Lidan Fan. 780-790 [doi]
- Centrality and Spectral Radius in Dynamic Communication NetworksDanica Vukadinovic Greetham, Zhivko Stoyanov, Peter Grindrod. 791-800 [doi]
- Finding Network Communities Using Random Walkers with Improved AccuracyYou Li, Jie Wang, Benyuan Liu, Qilian Liang. 801-810 [doi]
- Homophilies and Communities Detection among a Subset of Blogfa Persian Weblogs: Computer and Internet CategoryAdib Rastegarnia, Meysam Mohajer, Vahid Solouk. 811-820 [doi]
- Neighborhood-Based Dynamic Community Detection with Graph Transform for 0-1 Observed NetworksLi Wang, Yuanjun Bi, Weili Wu, Biao Lian, Wen Xu. 821-830 [doi]
- Effects of Inoculation Based on Structural Centrality on Rumor Dynamics in Social NetworksAnurag Singh, Rahul Kumar, Yatindra Nath Singh. 831-840 [doi]
- A Dominating Set Based Approach to Identify Effective Leader Group of Social NetworkDonghyun Kim, Deying Li, Omid Asgari, Yingshu Li, Alade O. Tokuta. 841-848 [doi]
- Using Network Sciences to Evaluate the Brazilian Airline NetworkDouglas Oliveira, Marco Carvalho, Ronaldo Menezes. 849-858 [doi]