| Description |
1 online resource (xi, 364 pages) : illustrations (black and white) |
| Series |
Lecture notes in computer science ; 7924 |
|
SL 1, Theoretical Computer Science and General Issues |
|
Lecture notes in computer science ; 7924. 1611-3349
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues
|
| Contents |
Invited Lectures. The Square Root Phenomenon in Planar Graphs / Dániel Marx -- An Algorithm for Determining Whether a Pair of Polygons Is Reversible / Jin Akiyama, Hyunwoo Seong -- Contributed Papers. Disjoint Small Cycles in Graphs and Bipartite Graphs / Ding Ma, Yunshu Gao -- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree / Marcin Krzywkowski -- Algorithms for Testing Length Four Permutations / Yijie Han, Sanjeev Saxena -- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds / Pawan Aurora, Sumit Singh, Shashank K. Mehta -- Faster Exact Computation of rSPR Distance / Zhi-Zhong Chen, Lusheng Wang -- Arbitrated Quantum Signature Schemes: Attacks and Security / Xiangfu Zou, Daowen Qiu -- Randomized Algorithms for Removable Online Knapsack Problems / Xin Han, Yasushi Kawase, Kazuhisa Makino -- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs / Mingyu Xiao, Hiroshi Nagamochi -- FWLS: A Local Search for Graph Coloring / Wei Wu, Chuan Luo, Kaile Su |
|
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids / Mark Korenblit, Vadim E. Levit -- Monomial Testing and Applications / Shenshi Chen -- The Optimal Rescue Path Set Problem in Undirected Graphs / Huili Zhang, Yinfeng Xu -- Expected Computations on Color Spanning Sets / Chenglin Fan [and others] -- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs / Min Lu, Tian Liu, Ke Xu -- Spanning Distribution Trees of Graphs / Masaki Kawabata, Takao Nishizeki -- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem / Jinghao Sun, Yakun Meng, Guozhen Tan -- Zero-Visibility Cops and Robber Game on a Graph / Dariusz Dereniowski [and others] -- On (k, ℓ)-Graph Sandwich Problems / Fernanda Couto [and others] -- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints / J. Crampton [and others] -- Two-Round Discrete Voronoi Game along a Line / Aritra Banik [and others] -- Inverse Maximum Flow Problems under the Combining Norms / Longcheng Liu |
|
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs / Carlos A. Martinhon, Luérbio Faria -- A Cost-Efficient Scheduling Algorithm for Traffic Grooming / Xianrong Liu [and others] -- Strategies of Groups Evacuation from a Convex Region in the Plane / Yinfeng Xu, Lan Qin -- Kernelization and Lower Bounds of the Signed Domination Problem / Ying Zheng, Jianxin Wang, Qilong Feng -- On Edge-Independent Sets / Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon -- On the Complexity of Approximate Sum of Sorted List / Bin Fu -- Large Hypertree Width for Sparse Random Hypergraphs / Chaoyi Wang, Tian Liu, Ke Xu -- On Perfect Absorbants in De Bruijn Digraphs / Yue-Li Wang, Kuo-Hua Wu, Ton Kloks -- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width / Xiaojie Deng, Bingkai Lin, Chihao Zhang -- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints / Yumei Huo, Hairong Zhao -- Zero-Sum Flow Numbers of Hexagonal Grids / Tao-Ming Wang, Guang-Hui Zhang -- Pattern-Guided k-Anonymity / Robert Bredereck, André Nichterlein, Rolf Niedermeier |
| Summary |
This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications |
| Analysis |
computerwetenschappen |
|
computer sciences |
|
computertechnieken |
|
computer techniques |
|
computational science |
|
informatiesystemen |
|
information systems |
|
wiskunde |
|
mathematics |
|
computerwiskunde |
|
computational mathematics |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
gegevensstructuren |
|
data structures |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Computer algorithms -- Congresses
|
|
Combinatorial analysis -- Congresses
|
|
Information resources management.
|
|
Algorithms
|
|
Information Management
|
|
algorithms.
|
|
Information resources management
|
|
Combinatorial analysis
|
|
Computer algorithms
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Fellows, M. R. (Michael Ralph), 1952- editor
|
|
Tan, Xuehou, editor
|
|
Zhu, Binhai, 1966- editor
|
|
Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, FAW-AAIM (26-06-2013 - 28-06-2013 : Dalian, China)
|
| ISBN |
9783642387562 |
|
364238756X |
|
