default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. FAW 2014: Zhangjiajie, China
- Jianer Chen, John E. Hopcroft, Jianxin Wang:
Frontiers in Algorithmics - 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014. Proceedings. Lecture Notes in Computer Science 8497, Springer 2014, ISBN 978-3-319-08015-4
Contributed Papers
- Puspal Bhabak, Hovhannes A. Harutyunyan:
Broadcast Problem in Hypercube of Trees. 1-12 - Yixin Cao
:
Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time. 13-24 - Katrin Casel:
A Fixed-Parameter Approach for Privacy-Protection with Global Recoding. 25-35 - Danny Z. Chen, David Craft, Lin Yang:
A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy. 36-47 - David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. 48-59 - Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
The Complexity of Zero-Visibility Cops and Robber. 60-70 - Zhiwen Fang, Yang Chu, Kan Qiao, Xu Feng, Ke Xu:
Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem. 71-81 - Qilong Feng, Qian Zhou, Shaohua Li:
Randomized Parameterized Algorithms for Co-path Set Problem. 82-93 - Longkun Guo:
Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem. 94-104 - Md. Iqbal Hossain, Md. Saidur Rahman:
Monotone Grid Drawings of Planar Graphs. 105-116 - Keisuke Inoue, Takao Nishizeki:
Spanning Distribution Forests of Graphs - (Extended Abstract). 117-127 - Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu:
A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations. 128-140 - Hwee Kim, Yo-Sub Han:
Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time. 141-150 - Marcin Krzywkowski:
Minimal Double Dominating Sets in Trees. 151-157 - Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen:
Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract). 158-169 - Chung-Shou Liao, Chih-Wei Liang, Sheung-Hung Poon:
Approximation Algorithms on Consistent Dynamic Map Labeling. 170-181 - Ling Lin, Yujie Yan, Xing He, Zhiyi Tan:
The PoA of Scheduling Game with Machine Activation Costs. 182-193 - Yuji Obata, Takao Nishizeki:
Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract). 194-204 - Feng Shi, Jie You, Qilong Feng:
Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees. 205-215 - Yangguang Shi, Fa Zhang, Zhiyong Liu:
Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost. 216-228 - Xuehou Tan, Bo Jiang:
Finding Simple Paths on Given Points in a Polygonal Region. 229-239 - Hing-Fung Ting, Xiangzhong Xiang:
Near Optimal Algorithms for Online Maximum Weighted b-Matching. 240-251 - Chaoyi Wang, Hao Chen, Zihan Lei, Ziyang Tang, Tian Liu, Ke Xu:
Tree Convex Bipartite Graphs: NP -Complete Domination, Hamiltonicity and Treewidth. 252-263 - Tao-Ming Wang, Shi-Wei Hu, Guang-Hui Zhang:
Zero-Sum Flow Numbers of Triangular Grids. 264-275 - Wei Xu, Fuzhou Gong:
A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains. 276-287 - Yi Yang, Shuigeng Zhou, Jihong Guan:
Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity. 288-297 - Jie You, Qilong Feng, Jiong Guo, Feng Shi:
On Star-Cover and Path-Cover of a Tree. 298-308 - Yong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang, Jianyu Shi:
On the Complexity of Constrained Sequences Alignment Problems. 309-319 - Xiaofan Zhao, Hong Shen:
On the Advice Complexity of One-Dimensional Online Bin Packing. 320-329 - Quan Zu, Miaomiao Zhang, Bin Yu:
Dynamic Matchings in Left Weighted Convex Bipartite Graphs. 330-342
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.
last updated on 2026-08-29 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
