Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2008: Nagoya, Japan
- Mirka Miller, Koichi Wada:
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
Invited Talks
- Masafumi Yamashita:
Designing good random walks on finite graphs. IWOCA 2008: 1 - Stephan Olariu:
Delivering multimedia content in vehicular ad hoc networks. IWOCA 2008: 2 - Vasek Chvátal:
Combinatorial algorithms in concorde. IWOCA 2008: 3
Session 1: Combinatorial Algorithms I
- Petr Hlinený, Robert Ganian:
Automata approach to graphs of bounded rank-width. IWOCA 2008: 4-15 - Heikki Hyyrö:
Notes on generating completely condensed d-neighborhoods. IWOCA 2008: 16-26 - Matthew Johnson, Daniël Paulusma, Chantal Wood:
Path factors and parallel knock-out schemes of almost claw-free graphs. IWOCA 2008: 27-41
Session 2: Graph Theory
- Jianmin Tang, Yuqing Lin, Mirka Miller:
Construction of Extremal Graphs. IWOCA 2008: 42-49 - Matthias Baumgart:
Partitioning Bispanning Graphs into Spanning Trees. IWOCA 2008: 50-62 - Tao-Ming Wang, Peter Che Bor Lam, Jun-Lin Kuo, Feng-Rung Hu:
On Irreducibility of Maximal Cliques. IWOCA 2008: 63-74 - Rikio Ichishima, Akito Oshima:
On partitional labelings of graphs. IWOCA 2008: 75-82 - Alison Marr, Nick Phillips, Walter D. Wallis:
Bimagic Labelings. IWOCA 2008: 83-88
Session 3: Search and Sorting Algorithms I
- Eunsang Kim, Kunsoo Park:
Improving Multikey Quicksort for Sorting Strings. IWOCA 2008: 89-99 - Taehyung Lee, Sung-Ryul Kim, Kunsoo Park:
Approximate Word Sequence Matching on an Inverted File Index. IWOCA 2008: 100-114
Session 4: Graph Theory and Applications
- Tomas Gavenciak:
Cop-Win Graphs with Maximal Capture-Time. IWOCA 2008: 115-128 - S. Anthony Lee, Raymond Lister:
K-Phase Oscillator Synchronization for Graph Coloring. IWOCA 2008: 129-143 - Lichao Chen, Francesc Comellas, Zhongzhi Zhang:
Self-similar planar graphs as models for complex networks. IWOCA 2008: 144-154 - Yuuki Tanaka, Yukio Shibata:
On the pagenumber of the cube-connected cycles. IWOCA 2008: 155-165 - Peter Che Bor Lam, Tao-Ming Wang, Guohua Gu:
L(2, 1)-labellings of integer distance graphs. IWOCA 2008: 166-172
Session 5: Combinatorial Algorithms II
- Daniel Berend, Shira Zucker:
An improved Algorithm for the Black-and-White Coloring Problem on Trees. IWOCA 2008: 173-181 - Matthew Johnson, Luis Cereceda, Jan van den Heuvel:
Finding Paths Between 3-Colourings. IWOCA 2008: 182-196 - George B. Mertzios, Walter Unger:
An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. IWOCA 2008: 197-211 - Satoshi Fujita:
Loose Cover of Graphs by a Local Structure. IWOCA 2008: 212-223 - Balasubramanian Sivan, S. Harini, C. Pandu Rangan:
On Conditional Covering Problem. IWOCA 2008: 224-238
Session 6: Search and Sorting Algorithms II
- Johannes Fischer, Volker Heun:
Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. IWOCA 2008: 239-252 - Reinhard Kutzelnigg:
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations. IWOCA 2008: 253-266
a service of 
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-04-16 20:18 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:
