default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. FAW 2009: Hefei, China
- Xiaotie Deng, John E. Hopcroft, Jinyun Xue:
Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings. Lecture Notes in Computer Science 5598, Springer 2009, ISBN 978-3-642-02269-2
Invited Talks
- Guoliang Chen:
Study on Parallel Computing. 1 - Andrew Chi-Chih Yao:
Communication Complexity and Its Applications. 2 - Frances F. Yao:
Algorithmic Problems in Computer and Network Power Management. 3
Graph Algorithms
- Franz-Josef Brandenburg, Mao-cheng Cai:
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. 4-15 - Pinar Heggernes
, Rodica Mihai:
Edge Search Number of Cographs in Linear Time. 16-26 - Changjing Wang, Jinyun Xue:
Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems. 27-39 - Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai:
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. 40-50 - Mingwen Chen, Songlin Hu, Zhiyong Liu:
Covering-Based Routing Algorithms for Cyclic Content-Based P/S System. 51-62
Game Theory with Applications
- Wei Chen, Shang-Hua Teng, Yajun Wang, Yuan Zhou:
On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. 63-73 - Hiroshi Nagamochi:
Cop-Robber Guarding Game with Cycle Robber Region. 74-84 - Feng Wang, Yuanxiang Li, Cheng Yang:
Covered Interest Arbitrage in Exchange Rate Forecasting Markets. 85-96
Graph Theory, Computational Geometry I
- Xiang Zhou:
CFI Construction and Balanced Graphs. 97-107 - Christian Knauer, Klaus Kriegel, Fabian Stehn:
Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions. 108-119 - Mostafa Nouri, Mohammad Ghodsi:
Space-Query-Time Tradeoff for Computing the Visibility Polygon. 120-131 - Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Square and Rectangle Covering with Outliers. 132-140
Graph Theory, Computational Geometry II
- Danny Z. Chen, Haitao Wang:
Processing an Offline Insertion-Query Sequence with Applications. 141-152 - Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong Chwa:
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs. 153-162 - Huaming Zhang:
On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs. 163-172 - Yuan Chen, Yao Mao, Qunjiao Zhang:
On Modulo Linked Graphs. 173-180 - Rodica Mihai, Ioan Todinca:
Pathwidth is NP-Hard for Weighted Trees. 181-195
Machine Learning
- Xinwang Liu, Jianping Yin, En Zhu, Yubin Zhan, Miaomiao Li, Changwang Zhang:
A Max-Margin Learning Algorithm with Additional Features. 196-206 - Jieren Cheng, Jianping Yin, Yun Liu, Zhiping Cai, Min Li:
DDoS Attack Detection Algorithm Using IP Address Features. 207-215 - Xinjun Peng, Yifei Wang:
Learning with Sequential Minimal Transductive Support Vector Machine. 216-227 - Hongliang Yao, Jian Chang, Caizi Jiang, Hao Wang:
Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams. 228-236
Parameterized Algorithms, Heuristics and Analysis
- Jianxin Wang, Beiwei Chen, Qilong Feng, Jianer Chen:
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set. 237-250 - Li Liu, Hao Li, Junling Wang, Lian Li, Caihong Li:
Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks. 251-260 - Lusheng Wang, Binhai Zhu:
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems. 261-270 - Yanyan Xu, Weiya Yue, Kaile Su:
The BDD-Based Dynamic A* Algorithm for Real-Time Replanning. 271-282
Approximation Algorithms
- Chi Zhang, Gang Wang, Xiaoguang Liu, Jing Liu:
Approximating Scheduling Machines with Capacity Constraints. 283-292 - Chung-Shou Liao, Louxin Zhang:
Approximating the Spanning k-Tree Forest Problem. 293-301 - Yujun Zheng, Jinyun Xue, Zhengkang Zuo:
Toward an Automatic Approach to Greedy Algorithms. 302-313 - Jinghui Zhang, Junzhou Luo, Zhiang Wu:
A Novel Approximate Algorithm for Admission Control. 314-325
Pattern Recognition Algorithms, Large Scale Data Mining
- Meng Zhang, Yi Zhang, Liang Hu, Peichen Xin:
On the Structure of Consistent Partitions of Substring Set of a Word. 326-335 - Guomin Zhang, En Zhu, Ling Mao, Ming Yin:
A Bit-Parallel Exact String Matching Algorithm for Small Alphabet. 336-345 - Hong Li, XueGang Hu, Yanming Zhang:
An Improved Database Classification Algorithm for Multi-database Mining. 346-357 - Takaaki Mizuki, Hideaki Sone:
Six-Card Secure AND and Four-Card Secure XOR. 358-369
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-28 01:15 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.
