|
|
|
|
Mining Preserving Structures in a Graph Sequence |
|
|
3 | (13) |
|
|
|
|
|
On the Most Imbalanced Orientation of a Graph |
|
|
16 | (14) |
|
|
|
|
|
|
|
Cheeger Inequalities for General Edge-Weighted Directed Graphs |
|
|
30 | (15) |
|
|
|
|
|
|
|
Game Theory and Algorithms |
|
|
|
Strategy-Proof Mechanism for Obnoxious Facility Location on a Line |
|
|
45 | (12) |
|
|
|
|
|
|
|
Bin Packing Game with an Interest Matrix |
|
|
57 | (13) |
|
|
|
|
|
|
|
|
|
The Least-Core and Nucleolus of Path Cooperative Games |
|
|
70 | (13) |
|
|
|
|
|
|
|
|
|
Reversible Pebble Game on Trees |
|
|
83 | (14) |
|
|
|
|
|
|
|
|
|
|
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms |
|
|
97 | (12) |
|
|
|
|
|
|
|
Complexity of Grundy Coloring and Its Variants |
|
|
109 | (12) |
|
|
|
|
|
|
|
|
|
On the Complexity of the Minimum Independent Set Partition Problem |
|
|
121 | (12) |
|
|
|
|
|
|
|
Bivariate Complexity Analysis of Almost Forest Deletion |
|
|
133 | (14) |
|
|
|
|
|
|
|
|
Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems |
|
|
147 | (12) |
|
|
|
|
|
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems |
|
|
159 | (12) |
|
|
|
|
|
|
|
An Approximation Algorithm for the Smallest Color-Spanning Circle Problem |
|
|
171 | (12) |
|
|
|
|
|
Approximation Algorithms for the Connected Sensor Cover Problem |
|
|
183 | (16) |
|
|
|
|
|
|
|
|
|
|
Skew Circuits of Small Width |
|
|
199 | (12) |
|
|
|
|
|
|
|
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits |
|
|
211 | (12) |
|
|
|
|
|
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable |
|
|
223 | (12) |
|
|
|
|
|
|
|
|
|
Evaluating Matrix Circuits |
|
|
235 | (16) |
|
|
|
|
|
|
|
|
Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem |
|
|
251 | (13) |
|
|
|
|
|
|
|
|
|
Packing Cubes into a Cube in (D>3)-Dimensions |
|
|
264 | (13) |
|
|
|
|
|
|
|
Towards Flexible Demands in Online Leasing Problems |
|
|
277 | (12) |
|
|
|
|
|
|
|
Friedhelm Meyer auf der Heide |
|
|
|
|
Lower Bounds for the Size of Nondeterministic Circuits |
|
|
289 | (8) |
|
|
|
Computing Minimum Dilation Spanning Trees in Geometric Graphs |
|
|
297 | (13) |
|
|
|
Miguel F.A. de M. Gaiowski |
|
|
|
|
|
|
|
|
310 | (15) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Algorithmic Aspects of Disjunctive Domination in Graphs |
|
|
325 | (12) |
|
|
|
|
|
|
|
Algorithmic Aspect of Minus Domination on Small-Degree Graphs |
|
|
337 | (12) |
|
|
|
|
|
|
|
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs |
|
|
349 | (12) |
|
|
|
|
|
|
|
|
|
|
|
Reducing Rank of the Adjacency Matrix by Graph Modification |
|
|
361 | (16) |
|
|
|
|
|
|
|
|
|
|
On the Number of Anchored Rectangle Packings for a Planar Point Set |
|
|
377 | (13) |
|
|
|
|
|
Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem |
|
|
390 | (12) |
|
|
|
|
|
Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead |
|
|
402 | (15) |
|
|
|
|
|
Disjoint Path Allocation with Sublinear Advice |
|
|
417 | (16) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Dynamic Tree Shortcut with Constant Degree |
|
|
433 | (12) |
|
|
|
|
|
|
|
|
|
The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions |
|
|
445 | (12) |
|
|
|
Compact Monotone Drawing of Trees |
|
|
457 | (12) |
|
|
|
|
|
A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion |
|
|
469 | (14) |
|
|
|
|
|
|
Sampling in Space Restricted Settings |
|
|
483 | (12) |
|
|
|
|
|
|
|
|
|
Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality |
|
|
495 | (12) |
|
|
|
Optimal Algorithms for Running Max and Min Filters on Random Inputs |
|
|
507 | (14) |
|
|
|
|
|
|
|
Model Checking MSVL Programs Based on Dynamic Symbolic Execution |
|
|
521 | (16) |
|
|
|
|
|
|
|
|
|
|
|
|
On the Complete Width and Edge Clique Cover Problems |
|
|
537 | (11) |
|
|
|
|
|
Unique Covering problems with Geometric Sets |
|
|
548 | (11) |
|
|
|
|
|
|
|
|
|
Linear Time Approximation Schemes for Geometric Maximum Coverage |
|
|
559 | (16) |
|
|
|
|
|
|
|
|
|
|
|
|
Private Certificate-Based Remote Data Integrity Checking in Public Clouds |
|
|
575 | (12) |
|
|
|
|
|
Maximal and Maximum Transitive Relation Contained in a Given Binary Relation |
|
|
587 | (14) |
|
|
|
|
|
|
|
|
|
An Improved Kernel for the Complementary Maximal Strip Recovery Problem |
|
|
601 | (8) |
|
|
|
|
|
|
|
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions |
|
|
609 | (15) |
|
|
|
|
|
Bounds for the Super Extra Edge Connectivity of Graphs |
|
|
624 | (11) |
|
|
|
|
|
|
|
|
Quantifying Communication in Synchronized Languages |
|
|
635 | (13) |
|
|
|
|
|
|
|
|
|
|
|
Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries |
|
|
648 | (13) |
|
|
|
|
|
A New Non-Merkle-Damgard Structural Hash Function with Provable Security |
|
|
661 | (13) |
|
|
|
|
|
|
|
A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security |
|
|
674 | (15) |
|
|
|
|
|
|
|
|
|
|
An Algorithmic Framework for Labeling Network Maps |
|
|
689 | (12) |
|
|
|
|
|
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm |
|
|
701 | (12) |
|
|
|
|
|
DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of Retrievability |
|
|
713 | (18) |
|
|
|
|
|
Evaluating Bayesian Networks via Data Streams |
|
|
731 | (16) |
|
|
|
|
|
|
|
|
On Energy-Efficient Computations with Advice |
|
|
747 | (12) |
|
|
|
|
|
|
|
|
|
Multi-Radio Channel Detecting Jamming Attack Against Enhanced Jump-Stay Based Rendezvous in Cognitive Radio Networks |
|
|
759 | (12) |
|
|
|
|
|
|
|
|
|
Upper Bounds on Fourier Entropy |
|
|
771 | (12) |
|
|
|
|
|
|
|
|
| Author Index |
|
783 | |
