default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. FAW / 7. AAIM 2011: Jinhua, China
- Mikhail J. Atallah, Xiang-Yang Li, Binhai Zhu:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings. Lecture Notes in Computer Science 6681, Springer 2011, ISBN 978-3-642-21203-1
Invited Lectures
- Jin-yi Cai:
Progress in Complexity of Counting Problems. 1-3 - Michael R. Fellows
:
Recent Developments in the Theory of Pre-processing. 4-5 - Elias Koutsoupias:
Recent Developments in the Mechanism Design Problem for Scheduling. 6-7 - Jack Snoeyink:
Degree-Driven Design for Correct Geometric Algorithms. 8-9
Contributed Papers
- Kerui Weng:
Approximation Algorithm for the Uniform Bounded Facility Problem. 10-16 - Huili Zhang, Yinfeng Xu:
The k-Canadian Travelers Problem with Communication. 17-28 - Wenqiang Dai, Yi Feng:
An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem. 29-35 - Wenchang Luo, Lin Chen:
Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs. 36-45 - Zhong Li, Randy Goebel, Lusheng Wang, Guohui Lin:
An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem. 46-57 - Huaming Zhang, Swetha Govindaiah:
Greedy Routing via Embedding Graphs onto Semi-metric Spaces. 58-69 - Jing He, Hongyu Liang:
On Variants of the Spanning Star Forest Problem. 70-81 - Hao Li, Wantao Ning, Junqing Cai:
An Implicit Degree Condition for Cyclability in Graphs. 82-89 - Gadi Aleksandrowicz, Gill Barequet:
Parallel Enumeration of Lattice Animals. 90-99 - Mingyu Xiao, Hiroshi Nagamochi:
Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract). 100-112 - Chenglin Fan, Wenqi Ju, Jun Luo, Binhai Zhu:
On Some Geometric Problems of Color-Spanning Sets. 113-124 - Xuehou Tan, Gangshan Wu:
Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere. 125-135 - Edita Mácajová, Ján Mazák:
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs. 136-146 - Jing He, Hongyu Liang:
Complexity of Total {k}-Domination and Related Problems. 147-155 - Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo:
The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View. 156-167 - Tao-Ming Wang, Shi-Wei Hu:
Constant Sum Flows in Regular Graphs. 168-175 - Min Chen, György Dósa, Xin Han, Chenyang Zhou, Attila Benko:
2D Knapsack: Packing Squares. 176-184 - Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Tight Approximation Bounds for Greedy Frugal Coverage Algorithms. 185-195 - Danny Z. Chen, Ewa Misiolek:
Algorithms for Interval Structures with Applications. 196-207 - Yong Chen, An Zhang, Zhiyi Tan:
Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time. 208-219 - Zhiheng Zhao, Jianping Yin, Yubin Zhan, Wei Xiong, Yong Li, Fayao Liu:
PSAEC: An Improved Algorithm for Short Read Error Correction Using Partial Suffix Arrays. 220-232 - Wei Jiang, Tian Liu, Tienan Ren, Ke Xu:
Two Hardness Results on Feedback Vertex Sets. 233-243 - Lin Chen, Wenchang Luo, Guochuan Zhang:
Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget. 244-254 - Wlodzimierz Moczurad:
Plane-Filling Properties of Directed Figures. 255-263 - Shikun Chen, Zhoujun Li, Xiaoyu Song, Mengjun Li:
An Iterative Method for Generating Loop Invariants. 264-274 - Trong Dao Le, Melvin Zhang, Hon Wai Leong:
Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters. 275-286 - Yushi Uno, Fumiya Oguri:
Contracted Webgraphs: Structure Mining and Scale-Freeness. 287-299 - Longkun Guo, Hong Shen:
Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs. 300-307 - Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Zhuo Chang:
Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing. 308-318 - Martin Birks, Daniel Cole, Stanley P. Y. Fung, Huichao Xue:
Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints. 319-329 - Martin Birks, Stanley P. Y. Fung:
Temperature Aware Online Algorithms for Scheduling Equal Length Jobs. 330-342 - Sharareh Alipour, Alireza Zarei:
Visibility Testing and Counting. 343-351 - Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders. 352-363 - Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das:
Minimum Width Rectangular Annulus. 364-374 - Sascha Meinert, Dorothea Wagner:
An Experimental Study on Generating Planar Graphs. 375-387
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 2024-10-02 20:30 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
