ISBN: 3-540-67787-9
TITLE: Computing and Combinatorics
AUTHOR: Du, Ding-Zhu; Eades, Peter; Estivill-Castro, Vladimir; Lin, Xuemin; Sharma, Arun (Eds.)
TOC:

Invited Talks
Theoretical Problems Related to the Internet 1
Christos H. Papadimitriou
Recent Progress and Prospects for Integer Factorisation Algorithms 3
Richard P. Brent
Hao Wang Award Paper
Approximating Uniform Triangular Meshes in Polygons 23
Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu
The Best Young Researcher Paper
Maximum Induced Matchings of Random Cubic Graphs 34
William Duckworth, Nicholas C. Wormald, Michele Zito
Computational Geometry 1
A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems 44
Gill Barequet
On Local Transformation of Polygons with Visibility Properties 54
Carmen Hernando, Michael E. Houle, Ferran Hurtado
Graph Drawing
Embedding Problems for Paths with Direction Constrained Edges 64
Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
Characterization of Level Non-planar Graphs by Minimal Patterns 74
Patrick Healy, Ago Kuusik, Sebastian Leipert
Rectangular Drawings of Plane Graphs Without Designated Corners 85
Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
Computing Optimal Embeddings for Planar Graphs 95
Petra Mutzel, Ren Weiskircher
Graph Theory and Algorithms 1
Approximation Algorithms for Independent Sets in Map Graphs 105
Zhi-Zhong Chen
Hierarchical Topological Inference on Planar Disc Maps 115
Zhi-Zhong Chen, Xin He
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs 126
Yaw-Ling Lin, Fang Rong Hsu, Yin-Te Tsai
Complexity, Discrete Mathematics, and Number Theory
Parameterized Complexity of Finding Subgraphs with Hereditary Properties 137
Subhash Khot, Venkatesh Raman
Some Results on Tries with Adaptive Branching 148
Yuriy A. Reznik
Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound 159
Ferdinando Cicalese, Daniele Mundici
Closure Properties of Real Number Classes under Limits and Computable Operators 170
Xizhong Zheng
Graph Theory and Algorithms 2
A Characterization of Graphs with Vertex Cover Six 180
Michael J. Dinneen, Liu Xiong
On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree 193
Mirka Miller, Slamin
Online Algorithms
Online Independent Sets 202
Magns M. Halldrsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi
Two-Dimensional On-Line Bin Packing Problem with Rotatable Items 210
Satoshi Fujita, Takeshi Hada
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem 221
Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin
Ordinal On-Line Scheduling on Two Uniform Machines 232
Zhiyi Tan, Yong He
Parallel and Distributed Computing Agents, Distributed Algorithms, and Stabilization 242
Sukumar Ghosh
A Fast Sorting Algorithm and Its Generalization on Broadcast Communications 252
Shyue-Horng Shiau, Chang-Biau Yang
Efficient List Ranking Algorithms on Reconfigurable Mesh 262
Sung-Ryul Kim, Kunsoo Park
Computational Geometry 2
Tripods Do Not Pack Densely 272
Alexandre Tiskin
An Efficient k Nearest Neighbor Searching Algorithm for a Query Line 281
Subhas C. Nandy
Tetrahedralization of Two Nested Convex Polyhedra 291
Cao An Wang, Boting Yang
Efficient Algorithms for Two-Center Problems for a Convex Polygon 299
Sung Kwon Kim, Chan-Su Shin
Combinatorial Optimization
On Computation of Arbitrage for Markets with Friction 310
Xiaotie Deng, Zhongfei Li, Shouyang Wang
On Some Optimization Problems in Obnoxious Facility Location 320
Zhongping Qin, Yinfeng Xu, Binhai Zhu
Generating Necklaces and Strings with Forbidden Substrings 330
Frank Ruskey, Joe Sawada
Optimal Labelling of Point Features in the Slider Model 340
Gunnar W. Klau, Petra Mutzel
Data Structures and Computational Biology
Mappings for Conflict-Free Access of Paths in Elementary Data
Structures 351
Alan A. Bertossi, M. Cristina Pinotti
Theory of Trinomial Heaps 362
Tadao Takaoka
Polyhedral Aspects of the Consecutive Ones Problem 373
Marcus Oswald, Gerhard Reinelt
The Complexity of Physical Mapping with Strict Chimerism 383
Stephan Weis, Rdiger Reischuk
Learning and Cryptography
Logical Analysis of Data with Decomposable Structures 396
Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
Learning from Approximate Data 407
Shirley Cheung H.C.
A Combinatorial Approach to Asymmetric Traitor Tracing 416
Reihaneh Safavi-Naini, Yejing Wang
Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs 426
Giovanni Di Crescenzo
Automata and Quantum Computing
One-Way Probabilistic Reversible and Quantum One-Counter Automata 436
Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
Similarity Enrichment in Image Compression through Weighted Finite Automata 447
Zhuhan Jiang, Bruce Litow, Olivier de Vel
On the Power of Input-Synchronized Alternating Finite Automata 457
Hiroaki Yamamoto
Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction467
Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara
Author Index 477
END
