Tags: andrew lim, approximation algorithms, computational complexity, decidability, demange, jinhee chun, michael hoffmann, michael kaminski, minimum coverage, naoki katoh, reducibility, shuguang li, takeshi tokuyama, tatsuya akutsu, toshio nakata, transformation protocol, traveling salesman problem, xiaodong wu, z chen, zhi zhong chen,
COCOON 2004 Accpeted Papers (by Number)
printed on April 17, 2004
006 Title: On the Selection and Assignment with Minimum Quantity Commitments
Author(s): Andrew Lim, Fan Wang, and Zhou Xu
007 Title: k-Center Problems With Minimum Coverage
Author(s): Andrew Lim, Brian Rodrigues, Fan Wang, and Zhou Xu
009 Title: Algorithms for the On-Line Quota Traveling Salesman Problem
Author(s): G. Ausiello, M. Demange, L. Laura, and V. Paschos
011 Title: New Bounds on the Number of Edges in a k-Map Graph
Author(s): Zhi-Zhong Chen
012 Title: On the expected time for Herman's probabilistic self-stabilizing algorithm
Author(s): Toshio Nakata
015 Title: Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines
Author(s): Shuguang Li and Guojun Li
016 Title: Algorithms for Point Set Matching with k-Differences
Author(s): Tatsuya Akutsu
022 Title: Some open problems in decidability of brick (labelled polyomino) codes
Author(s): Malgorzata Moczurad and Wlodzimierz Moczurad
023 Title: The Traveling Salesman Problem with Few Inner Points
Author(s): Michael Hoffmann and Yoshio Okamoto
024 Title: Computational Complexity Classification of Partition under Compaction and Retrac-
tion
Author(s): Narayan Vikas
026 Title: Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems:
Implementations and Experimental Study
Author(s): Ying Du, Danny Z.Chen, and Xiaodong Wu
028 Title: Regular expressions for languages over infinite alphabets
Author(s): Michael Kaminski and Tony Tan
029 Title: Efficient Algorithms for Approximating a Multi-Dimensional Voxel Terrain by a Uni-
modal Terrain
Author(s): Danny Z. Chen, Jinhee Chun, Naoki Katoh, and Takeshi Tokuyama
034 Title: Necessary and Sufficient Numbers of Cards for the Transformation Protocol
Author(s): Koichi Koizumi, Takaaki Mizuki, and Takao Nishizeki
035 Title: On the Extensions of Solovay-Reducibility
Author(s): Xizhong Zheng and Robert Rettinger
036 Title: Maximization of the size and the weight of schedules of degradable intervals
1
Author(s): Fabien Baille, Evripidis Bampis, and Christian Laforest
038 Title: On the Complexity of Samples for Learning
Author(s): Joel Ratsaby
042 Title: Fault Hamiltonicity of Meshes with Two Wraparound Edges
Author(s): Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, and Hee-Chul Kim
043 Title: Transshipment through Crossdocks with Inventory and Time Windows
Author(s): Andrew Lim, Zhaowei Miao, Brian Rodrigues, and Zhou Xu
045 Title: Towards Constructing Optimal Strip Move Sequences
Author(s): Meena Mahajan, Raghavan Rama, and S. Vijayakumar
051 Title: Coloring Octrees
Author(s): Udo Adamy, Michael Hoffmann, Jozsef Solymosi, and Milos Stojakovic
052 Title: Progress on Maximum Weight Triangulation
Author(s): Francis Chin, Jianbo Qian, and Cao An Wang
054 Title: The complexity of counting solutions to systems of equations over finite semigroups
Author(s): Gustav Nordh and Peter Jonsson
057 Title: Dynamic Storage Allocation and Online Colouring Interval Graphs
Author(s): N. S. Narayanaswamy
058 Title: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees
of Plane Graphs
Author(s): Kazuyuki Miura, Machiko Azuma, and Takao Nishizeki
059 Title: The Worst-Case Time Complexity for Generating All Maximal Cliques
Author(s): Etsuji Tomita, Akira Tanaka, and Haruhisa Takahashi
062 Title: On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack
Operations
Author(s): Masaki Nakanishi
063 Title: Adjacency of optimal region of Huffman tree
Author(s): Kensuke Onishi
065 Title: Fault-Tolerant Meshes with Constant Degree
Author(s): Toshinori YAMADA
067 Title: Q-ary Ulam-R´nyi game with weighted constrained lies
e
Author(s): Ferdinando Cicalese, Christian Deppe, and Daniele Mundici
068 Title: Computing Phylogenetic Roots with Bounded Degrees and Errors is Hard
Author(s): Tatsuie Tsukiji and Zhi-Zhong Chen
071 Title: One-to-many disjoint path covers in a graph with faulty elements
Author(s): Jung-Heum Park
073 Title: Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets
2
Author(s): Jesper Jansson and Wing-Kin Sung
075 Title: A Faster Algorithm for the All Pairs Shortest Path Problem and its Application
Author(s): Tadao Takaoka
080 Title: An Efficient Algorithm for Online Square Detection
Author(s): H.F. Leung, Z.S. Peng, and H.F. Ting
081 Title: Approximation algorithms for inscribing or circumscribing an axially symmetric poly-
gon to a convex polygon
Author(s): Hee-Kap Ahn, Peter Brass, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, and
Antoine Vigneron
082 Title: New Results on On-demand Broadcasting with Deadline via Job Scheduling with
Cancellation
Author(s): Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, and Prudence W.H. Wong
083 Title: Approximated Vertex Cover for Graphs with Perfect Matchings
Author(s): Tomokazu Imamura, Kazuo Iwama, and Tatsuie Tsukiji
085 Title: On the Arrangement of Cliques in Chordal graphs with respect to the Cuts
Author(s): L. Sunil Chandran and N. S. Narayanaswamy
089 Title: A Construction Method for Optimally Universal Hash Famillies and its Consequences
for the Existence of RBIBDs
Author(s): Philipp Woelfel
090 Title: Large Triangles in the d-Dimensional Unit-Cube
Author(s): Hanno Lefmann
091 Title: Learning DNFs and Circuits using Teaching Assistants
Author(s): N. V. Vinodchandran
092 Title: On the Orthogonal Drawing of Outerplanar Graphs
Author(s): Kumiko Nomura, Satochi Tayu, and Shuichi Ueno
094 Title: New Approximation Algorithms for Some Dynamic Storage Allocation Problems
Author(s): S. C. Li, H. W. Leong, and S. K. Quek
101 Title: An approximation Algorithm for Weighted Weak Vertex Cover Problem in undirected
graphs
Author(s): Zhang Yong and Zhu Hong
109 Title: An Efficient Local Alignment Algorithm for Masked Sequences
Author(s): Jin Wook Kim and Kunsoo Park
total 46 unique papers.
3