


default search action
7. FAW / 9. AAIM 2013: Dalian, China
- Michael R. Fellows, Xuehou Tan, Binhai Zhu:

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings. Lecture Notes in Computer Science 7924, Springer 2013, ISBN 978-3-642-38755-5
Invited Lectures
- Dániel Marx

:
The Square Root Phenomenon in Planar Graphs. 1 - Jin Akiyama, Hyunwoo Seong:

An Algorithm for Determining Whether a Pair of Polygons Is Reversible. 2-3
Contributed Papers
- Ding Ma, Yunshu Gao:

Disjoint Small Cycles in Graphs and Bipartite Graphs. 4-11 - Marcin Krzywkowski:

An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree. 12-16 - Yijie Han, Sanjeev Saxena:

Algorithms for Testing Length Four Permutations. 17-23 - Pawan Aurora

, Sumit Singh, Shashank K. Mehta:
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds. 24-35 - Zhi-Zhong Chen, Lusheng Wang

:
Faster Exact Computation of rSPR Distance. 36-47 - Xiangfu Zou

, Daowen Qiu
:
Arbitrated Quantum Signature Schemes: Attacks and Security. 48-59 - Xin Han, Yasushi Kawase, Kazuhisa Makino:

Randomized Algorithms for Removable Online Knapsack Problems. 60-71 - Mingyu Xiao, Hiroshi Nagamochi:

An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs. 72-83 - Wei Wu, Chuan Luo, Kaile Su

:
FWLS: A Local Search for Graph Coloring. 84-93 - Mark Korenblit, Vadim E. Levit

:
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. 94-105 - Shenshi Chen:

Monomial Testing and Applications. 106-117 - Huili Zhang, Yinfeng Xu:

The Optimal Rescue Path Set Problem in Undirected Graphs. 118-129 - Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:

Expected Computations on Color Spanning Sets. 130-141 - Min Lu, Tian Liu, Ke Xu:

Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs. 142-152 - Masaki Kawabata, Takao Nishizeki:

Spanning Distribution Trees of Graphs. 153-162 - Jinghao Sun, Yakun Meng, Guozhen Tan:

A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem. 163-174 - Dariusz Dereniowski

, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
Zero-Visibility Cops and Robber Game on a Graph. 175-186 - Fernanda Couto

, Luérbio Faria, Sulamita Klein, Fábio Protti
, Loana Tito Nogueira
:
On (k, ℓ)-Graph Sandwich Problems. 187-197 - Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan:

Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. 198-209 - Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:

Two-Round Discrete Voronoi Game along a Line. 210-220 - Longcheng Liu:

Inverse Maximum Flow Problems under the Combining Norms. 221-230 - Carlos A. J. Martinhon, Luérbio Faria:

The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs. 231-240 - Xianrong Liu, Wenhong Tian, Minxian Xu

, Qin Xiong:
A Cost-Efficient Scheduling Algorithm for Traffic Grooming. 241-249 - Yinfeng Xu, Lan Qin:

Strategies of Groups Evacuation from a Convex Region in the Plane. 250-260 - Ying Zheng, Jianxin Wang, Qilong Feng:

Kernelization and Lower Bounds of the Signed Domination Problem. 261-271 - Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon

:
On Edge-Independent Sets. 272-283 - Bin Fu:

On the Complexity of Approximate Sum of Sorted List. 284-293 - Chaoyi Wang, Tian Liu, Ke Xu:

Large Hypertree Width for Sparse Random Hypergraphs. 294-302 - Yue-Li Wang, Kuo-Hua Wu, Ton Kloks:

On Perfect Absorbants in De Bruijn Digraphs. 303-314 - Xiaojie Deng, Bingkai Lin, Chihao Zhang:

Multi-Multiway Cut Problem on Graphs of Bounded Branch Width. 315-324 - Yumei Huo, Hairong Zhao:

Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints. 325-338 - Tao-Ming Wang, Guang-Hui Zhang:

Zero-Sum Flow Numbers of Hexagonal Grids. 339-349 - Robert Bredereck, André Nichterlein, Rolf Niedermeier:

Pattern-Guided k-Anonymity. 350-361

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














