IWOCA 2008: Nagoya, Japan
Mirka Miller, Koichi Wada (Eds.): Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan. College Publications 2008 ISBN 978-1-904987-74-1 [ contents ]
Invited Talks
- Masafumi Yamashita: Designing good random walks on finite graphs. 1
- Stephan Olariu: Delivering multimedia content in vehicular ad hoc networks. 2
- Vasek Chvátal: Combinatorial algorithms in concorde. 3
Session 1: Combinatorial Algorithms I
- Heikki Hyyrö: Notes on generating completely condensed d-neighborhoods. 16-26
- Matthew Johnson, Daniël Paulusma, Chantal Wood: Path factors and parallel knock-out schemes of almost claw-free graphs. 27-41
Session 2: Graph Theory
- Matthias Baumgart: Partitioning Bispanning Graphs into Spanning Trees. 50-62
- Tao-Ming Wang, Peter Che Bor Lam, Jun-Lin Kuo, Feng-Rung Hu: On Irreducibility of Maximal Cliques. 63-74
Session 3: Search and Sorting Algorithms I
- Taehyung Lee, Sung-Ryul Kim, Kunsoo Park: Approximate Word Sequence Matching on an Inverted File Index. 100-114
Session 4: Graph Theory and Applications
- Tomás Gavenciak: Cop-Win Graphs with Maximal Capture-Time. 115-128
- Lichao Chen, Francesc Comellas, Zhongzhi Zhang: Self-similar planar graphs as models for complex networks. 144-154
Session 5: Combinatorial Algorithms II
- Daniel Berend, Shira Zucker: An improved Algorithm for the Black-and-White Coloring Problem on Trees. 173-181
- George B. Mertzios, Walter Unger: An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. 197-211
- Satoshi Fujita: Loose Cover of Graphs by a Local Structure. 212-223
- Balasubramanian Sivan, S. Harini, Pandu Rangan Chandrashekaran: On Conditional Covering Problem. 224-238
Session 6: Search and Sorting Algorithms II
- Johannes Fischer, Volker Heun: Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. 239-252
- Reinhard Kutzelnigg: An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations. 253-266
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team