Abstract is missing.
- An Exact Algorithm for Non-preemptive Peak Demand Job SchedulingSean Yaw, Brendan Mumey. 3-12 [doi]
- An Asymptotic Competitive Scheme for Online Bin PackingLin Chen, Deshi Ye, Guochuan Zhang. 13-24 [doi]
- Randomized Online Algorithms for Set Cover Leasing ProblemsSebastian Abshoff, Christine Markarian, Friedhelm Meyer auf der Heide. 25-34 [doi]
- Optimizing Squares Covering a Set of PointsBinay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song. 37-52 [doi]
- Algorithms for Fair Partitioning of Convex PolygonsBogdan Armaselu, Ovidiu Daescu. 53-65 [doi]
- A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTWLiang Song, Hejiao Huang, Hongwei Du. 66-73 [doi]
- On-Line Strategies for Evacuating from a Convex Region in the PlaneQi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang. 74-85 [doi]
- Rectilinear Duals Using Monotone Staircase PolygonsYi-Jun Chang, Hsu-Chun Yen. 86-100 [doi]
- Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple RobotAzadeh Tabatabaei, Mohammad Ghodsi. 101-112 [doi]
- Guarding Monotone Art Galleries with Sliding Cameras in Linear TimeMark de Berg, Stephane Durocher, Saeed Mehrabi 0001. 113-125 [doi]
- Information Gathering in Ad-Hoc Radio Networks with Tree TopologyMarek Chrobak, Kevin Costello, Leszek Gasieniec, Darek R. Kowalski. 129-145 [doi]
- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path NetworkBinay K. Bhattacharya, Tsunehiko Kameda. 146-160 [doi]
- Approximate Aggregation for Tracking Quantiles in Wireless Sensor NetworksZaobo He, Zhipeng Cai, Siyao Cheng, Xiaoming Wang. 161-172 [doi]
- Interference-Free k-barrier Coverage in Wireless Sensor NetworksHongwei Du, Haiming Luo, Jing Zhang, Rongrong Zhu, Qiang Ye. 173-183 [doi]
- Performance Analysis and Improvement for the Construction of MCDS Problem in 3D SpaceJun Li, Xiaofeng Gao, Guihai Chen, Fengwei Gao, Ling Ding. 184-199 [doi]
- A Practical Greedy Approximation for the Directed Steiner Tree ProblemDimitri Watel, Marc-Antoine Weisser. 200-215 [doi]
- Spanning Properties of Theta-Theta GraphsMirela Damian, Dumitru V. Voicu. 216-230 [doi]
- A Bicriteria Approximation Algorithm for DVRP with Time WindowsHao Gu, Liang Song, Hejiao Huang, Hongwei Du. 231-238 [doi]
- Data-Oblivious Graph Algorithms in Outsourced External MemoryMichael T. Goodrich, Joseph A. Simons. 241-257 [doi]
- A Dichotomy for Upper Domination in Monogenic ClassesHassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries. 258-267 [doi]
- Algorithms for the Maximum Weight Connected k -Induced Subgraph ProblemErnst Althaus, Markus Blumenstock, Alexej Disterhoft, Andreas Hildebrandt, Markus Krupp. 268-282 [doi]
- Algorithms for Cut Problems on TreesIyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu. 283-298 [doi]
- The Minimum Vulnerability Problem on GraphsYusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou. 299-313 [doi]
- The List Coloring Reconfiguration Problem for Bounded Pathwidth GraphsTatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou. 314-328 [doi]
- Two Paths Location of a Tree with Positive or Negative WeightsJianjie Zhou, Liying Kang, Erfang Shan. 329-342 [doi]
- Approximation Algorithms for Optimization Problems in Random Power-Law GraphsYilin Shen, Xiang Li, My T. Thai. 343-355 [doi]
- A Comparison Between the Zero Forcing Number and the Strong Metric Dimension of GraphsCong X. Kang, Eunjeong Yi. 356-365 [doi]
- Optimal Trees for Minimizing Average Individual Updating CostSicen Guo, Minming Li, Yingchao Zhao. 366-378 [doi]
- Cascading Critical Nodes Detection with Load Redistribution in Complex SystemsSubhankar Mishra, Xiang Li, My T. Thai, Jungtaek Seo. 379-394 [doi]
- The Power of Rejection in Online Bottleneck MatchingBarbara M. Anthony, Christine Chung. 395-411 [doi]
- The Generalized 3-Edge-Connectivity of Lexicographic Product GraphsXueliang Li, Jun Yue, Yan Zhao. 412-425 [doi]
- Integer Programming Methods for Special College Admissions ProblemsPéter Biró, Iain McBride. 429-443 [doi]
- On the Width of Ordered Binary Decision DiagramsBeate Bollig. 444-458 [doi]
- Tight Analysis of Priority Queuing for Egress TrafficJun Kawahara, Koji M. Kobayashi, Tomotaka Maeda. 459-473 [doi]
- Optimally Bracing Grid Frameworks with HolesYoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell. 474-489 [doi]
- Top - K Query Retrieval of Combinations with Sum-of-Subsets RankingSubhashis Majumder, Biswajit Sanyal, Prosenjit Gupta, Soumik Sinha, Shiladitya Pande, Wing-Kai Hon. 490-505 [doi]
- Efficient Group Testing Algorithms with a Constrained Number of Positive ResponsesAnnalisa De Bonis. 506-521 [doi]
- Maximizing Revenues for On-Line Dial-a-RideAnanya Christman, William Forcier. 522-534 [doi]
- Global Internet Connectedness: 2002-2011Hyunjin Seo, Stuart Thorson. 537-546 [doi]
- Optimal Containment of Misinformation in Social Media: A Scenario-Based ApproachYongjia Song, Thang N. Dinh. 547-556 [doi]
- Multivariate Heavy Tails in Complex NetworksGolshan Golnari, Zhi-Li Zhang. 557-570 [doi]
- Mixed Degree-Degree Correlations in Directed Social NetworksMichael L. Mayo, Ahmed Abdelzaher, Preetam Ghosh. 571-580 [doi]
- Social and Economic Network Formation: A Dynamic ModelOmid Atabati, Babak Farzad. 581-592 [doi]
- A Region Growing Algorithm for Detecting Critical NodesMario Ventresca, Dionne M. Aleman. 593-602 [doi]
- A Fast Greedy Algorithm for the Critical Node Detection ProblemMario Ventresca, Dionne M. Aleman. 603-612 [doi]
- Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse GraphsNeng Fan, Mehdi Golari. 613-622 [doi]
- On the Parameterized Complexity of Dynamic Problems with Connectivity ConstraintsFaisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw. 625-636 [doi]
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and ApplicationsIyad A. Kanj, Stefan Szeider. 637-651 [doi]
- Kolmogorov Structure Functions for Automatic Complexity in Computational StatisticsBjørn Kjos-Hanssen. 652-665 [doi]
- Improved Even Order Magic Square Construction Algorithms and Their ApplicationsZhenhua Duan, Jin Liu, Jie Li, Cong Tian. 666-680 [doi]
- The Complexity of the Positive Semidefinite Zero ForcingShaun M. Fallat, Karen Meagher, Boting Yang. 681-693 [doi]
- A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic GamesEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. 694-709 [doi]
- The Popular Matching and Condensation Problems Under Matroid ConstraintsNaoyuki Kamiyama. 713-728 [doi]
- Incremental Computation of Pseudo-Inverse of LaplacianGyan Ranjan, Zhi-Li Zhang, Daniel Boley. 729-749 [doi]
- Optimal Tracking of Multiple Targets Using UAVsDavid Hay, Shahrzad Shirazipourazad, Arunabha Sen. 750-763 [doi]
- Approximation Algorithm for the Minimum Connected k -Path Vertex Cover ProblemXiaosong Li, Zhao Zhang, Xiaohui Huang. 764-771 [doi]