|
Classic Combinatorial Optimization |
|
|
|
An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling |
|
|
3 | (10) |
|
|
|
An Asymptotic Competitive Scheme for Online Bin Packing |
|
|
13 | (12) |
|
|
|
|
Randomized Online Algorithms for Set Cover Leasing Problems |
|
|
25 | (12) |
|
|
|
Friedhelm Meyer auf der Heide |
|
|
|
|
Optimizing Squares Covering a Set of Points |
|
|
37 | (16) |
|
|
|
|
Priya Ranjan Sinha Mahapatra |
|
|
|
Algorithms for Fair Partitioning of Convex Polygons |
|
|
53 | (13) |
|
|
|
A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW |
|
|
66 | (8) |
|
|
|
|
On-Line Strategies for Evacuating from a Convex Region in the Plane |
|
|
74 | (12) |
|
|
|
|
|
Rectilinear Duals Using Monotone Staircase Polygons |
|
|
86 | (15) |
|
|
|
Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot |
|
|
101 | (12) |
|
|
|
Guarding Monotone Art Galleries with Sliding Cameras in Linear Time |
|
|
113 | (16) |
|
|
|
|
|
|
Information Gathering in Ad-Hoc Radio Networks with Tree Topology |
|
|
129 | (17) |
|
|
|
|
|
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network |
|
|
146 | (15) |
|
|
|
Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks |
|
|
161 | (12) |
|
|
|
|
|
Interference-Free k-barrier Coverage in Wireless Sensor Networks |
|
|
173 | (11) |
|
|
|
|
|
|
Performance Analysis and Improvement for the Construction of MCDS Problem in 3D Space |
|
|
184 | (16) |
|
|
|
|
|
|
A Practical Greedy Approximation for the Directed Steiner Tree Problem |
|
|
200 | (16) |
|
|
|
Spanning Properties of Theta-Theta Graphs |
|
|
216 | (15) |
|
|
|
A Bicriteria Approximation Algorithm for DVRP with Time Windows |
|
|
231 | (10) |
|
|
|
|
|
|
|
Data-Oblivious Graph Algorithms in Outsourced External Memory |
|
|
241 | (17) |
|
|
|
A Dichotomy for Upper Domination in Monogenic Classes |
|
|
258 | (10) |
|
|
|
|
|
|
Algorithms for the Maximum Weight Connected k-Induced Subgraph Problem |
|
|
268 | (15) |
|
|
|
|
|
|
Algorithms for Cut Problems on Trees |
|
|
283 | (16) |
|
|
|
|
|
|
|
|
|
|
|
The Minimum Vulnerability Problem on Graphs |
|
|
299 | (15) |
|
|
|
|
|
|
|
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs |
|
|
314 | (15) |
|
|
|
|
Two Paths Location of a Tree with Positive or Negative Weights |
|
|
329 | (14) |
|
|
|
|
Approximation Algorithms for Optimization Problems in Random Power-Law Graphs |
|
|
343 | (13) |
|
|
|
|
A Comparison Between the Zero Forcing Number and the Strong Metric Dimension of Graphs |
|
|
356 | (10) |
|
|
|
Optimal Trees for Minimizing Average Individual Updating Cost |
|
|
366 | (13) |
|
|
|
|
Cascading Critical Nodes Detection with Load Redistribution in Complex Systems |
|
|
379 | (16) |
|
|
|
|
|
The Power of Rejection in Online Bottleneck Matching |
|
|
395 | (17) |
|
|
|
The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs |
|
|
412 | (17) |
|
|
|
|
|
|
Integer Programming Methods for Special College Admissions Problems |
|
|
429 | (15) |
|
|
|
On the Width of Ordered Binary Decision Diagrams |
|
|
444 | (15) |
|
|
Tight Analysis of Priority Queuing for Egress Traffic |
|
|
459 | (15) |
|
|
|
|
Optimally Bracing Grid Frameworks with Holes |
|
|
474 | (16) |
|
|
|
|
|
|
|
Top-K Query Retrieval of Combinations with Sum-of-Subsets Ranking |
|
|
490 | (16) |
|
|
|
|
|
|
|
Efficient Group Testing Algorithms with a Constrained Number of Positive Responses |
|
|
506 | (16) |
|
|
Maximizing Revenues for On-Line Dial-a-Ride |
|
|
522 | (15) |
|
|
|
|
|
Global Internet Connectedness: 2002--2011 |
|
|
537 | (10) |
|
|
|
Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach |
|
|
547 | (10) |
|
|
|
Multivariate Heavy Tails in Complex Networks |
|
|
557 | (14) |
|
|
|
Mixed Degree-Degree Correlations in Directed Social Networks |
|
|
571 | (10) |
|
|
|
|
Social and Economic Network Formation: A Dynamic Model |
|
|
581 | (12) |
|
|
|
A Region Growing Algorithm for Detecting Critical Nodes |
|
|
593 | (10) |
|
|
|
A Fast Greedy Algorithm for the Critical Node Detection Problem |
|
|
603 | (10) |
|
|
|
Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs |
|
|
613 | (12) |
|
|
|
Complexity, Cryptography and Game |
|
|
|
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints |
|
|
625 | (12) |
|
|
|
|
|
|
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications |
|
|
637 | (15) |
|
|
|
Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics |
|
|
652 | (14) |
|
|
Improved Even Order Magic Square Construction Algorithms and Their Applications |
|
|
666 | (15) |
|
|
|
|
|
The Complexity of the Positive Semidefinite Zero Forcing |
|
|
681 | (13) |
|
|
|
|
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games |
|
|
694 | (19) |
|
|
|
|
|
|
|
The Popular Matching and Condensation Problems Under Matroid Constraints |
|
|
713 | (16) |
|
|
Incremental Computation of Pseudo-Inverse of Laplacian |
|
|
729 | (21) |
|
|
|
|
Optimal Tracking of Multiple Targets Using UAVs |
|
|
750 | (14) |
|
|
|
|
Approximation Algorithm for the Minimum Connected k-Path Vertex Cover Problem |
|
|
764 | (9) |
|
|
|
Author Index |
|
773 | |