You have Guest access.
Log In
Boting Yang, Ding-Zhu Du and Cao An Wang
Front matter
1-12
Going Weighted: Parameterized Algorithms for Cluster Editing
13-22
Parameterized Graph Editing with Chosen Vertex Degrees
23-31
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
32-42
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
43-53
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
54-63
A Parameterized Perspective on Packing Paths of Length Two
64-78
New Algorithms for k -Center and Extensions
79-88
Separating Sublinear Time Computations by Approximate Diameter
89-102
Computational Study on Dominating Set Problem of Planar Graphs
103-115
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region (Extended Abstract)
116-126
Parameterized Algorithms for Generalized Domination
127-138
Turán Graphs, Stability Number, and Fibonacci Index
139-148
Vertex-Uncertainty in Graph-Problems (Extended Abstract)
149-159
Protean Graphs with a Variety of Ranking Schemes
160-170
Simplicial Powers of Graphs
171-179
On k - Versus ( k + 1)-Leaf Powers
180-189
Flows with Unit Path Capacities and Related Packing and Covering Problems
190-200
Strong Formulations for 2-Node-Connected Steiner Network Problems
201-210
Algorithms and Implementation for Interconnection Graph Problem
211-224
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
225-234
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
235-245
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks
246-254
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
255-264
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
265-277
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
278-285
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
286-295
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
296-308
Covering Arrays Avoiding Forbidden Edges
309-318
The Robot Cleans Up
319-327
On Recovering Syntenic Blocks from Comparative Maps
328-338
Automatic Generation of Symmetry-Breaking Constraints
339-350
On the Stable Set Polytope of Claw-Free Graphs
351-360
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
361-373
Magic Labelings on Cycles and Wheels
374-383
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
384-392
The Clique Corona Operation and Greedoids
393-404
On the Surface Area of the ( n , k )-Star Graph
405-416
Enumerating Isolated Cliques in Synthetic and Financial Networks
417-426
A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
427-437
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
438-447
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
448-457
Stochastic Online Scheduling Revisited
458-468
Delay Management Problem: Complexity Results and Robust Algorithms
469-478
Clustered SplitsNetworks
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info