close
1.

図書

図書
Ding-Zhu Du ... [et al.] (eds.)
出版情報: Berlin : Springer, c2000  xii, 478 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1858
所蔵情報: loading…
2.

図書

図書
Tao Jiang, D.T. Lee (eds.)
出版情報: Berlin ; Tokyo : Springer, c1997  xii, 522 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1276
所蔵情報: loading…
3.

図書

図書
Wen-Lian Hsu, Ming-Yang Kao, (eds.)
出版情報: Berlin : Springer, c1998  xii, 372 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1449
所蔵情報: loading…
4.

図書

図書
Jin-Yi Cai, Chak Kuen Wong, (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  x, 419 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1090
所蔵情報: loading…
5.

図書

図書
Ding-Zhu Du, Ming Li (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer-Verlag, c1995  xiii, 654 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 959
所蔵情報: loading…
6.

図書

図書
Jie Wang (ed.)
出版情報: Berlin ; Tokyo : Springer, c2001  xiii, 602 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2108
所蔵情報: loading…
7.

図書

図書
Oscar H. Ibarra, Louxin Zhang (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  xiii, 606 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2387
所蔵情報: loading…
8.

図書

図書
Danny Z. Chen, D.T. Lee (eds.)
出版情報: Berlin : Springer, 2006  xiv, 528 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 4112
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
The Unpredictable Deviousness of Models / Franco P. Preparata
Security Issues in Collaborative Computing / Mikhail J. Atallah
Computational Economics, Finance, and Management / Session A:
A Simplicial Approach for Discrete Fixed Point Theorems / Xi Chen ; Xiaotie Deng
On Incentive Compatible Competitive Selection Protocol / Becky Jie Liu
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands / George Karakostas ; Stavros G. Kolliopoulos
Aggregating Strategy for Online Auctions / Shigeaki Harada ; Eiji Takimoto ; Akira Maruoka
Graph Algorithms
On Indecomposability Preserving Elimination Sequences / Chandan K. Dubey ; Shashank K. Mehta
Improved Algorithms for the Minmax Regret 1-Median Problem / Hung-I Yu ; Tzu-Chin Lin ; Biing-Feng Wang
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size / Takehiro Ito ; Kazuya Goto ; Xiao Zhou ; Takao Nishizeki
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs / Min Chih Lin ; Jayme L. Szwarcfiter
Computational Complexity and Computability
Varieties Generated by Certain Models of Reversible Finite Automata / Marats Golovkins ; Jean-Eric Pin
Iterated TGR Languages: Membership Problem and Effective Closure Properties / Ian McQuillan ; Kai Salomaa ; Mark Daley
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences / Takayuki Sato ; Kazuyuki Amano
Quantum Computing
Robust Quantum Algorithms with [epsiv]-Biased Oracles / Tomoya Suzuki ; Shigeru Yamashita ; Masaki Nakanishi ; Katsumasa Watanabe
The Complexity of Black-Box Ring Problems / V. Arvind ; Bireswar Das ; Partha Mukhopadhyay
Computational Biology and Medicine
Lower Bounds and Parameterized Approach for Longest Common Subsequence / Xiuzhen Huang
Finding Patterns with Variable Length Gaps or Don't Cares / M. Sohel Rahman ; Costas S. Iliopoulos ; Inbok Lee ; Manal Mohamed ; William F. Smyth
The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy / Xin Dou ; Xiaodong Wu ; John E. Bayouth ; John M. Buatti
Computational Geometry
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem / Marc Benkert ; Joachim Gudmundsson ; Christian Knauer ; Esther Moet ; Rene van Oostrum ; Alexander Wolff
A PTAS for Cutting Out Polygons with Lines / Sergey Bereg ; Ovidiu Daescu ; Minghui Jiang
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees / Sheung-Hung Boon
Restricted Mesh Simplification Using Edge Contractions / Mattias Andersson ; Christos Levcopoulos
Graph Theory
Enumerating Non-crossing Minimally Rigid Frameworks / David Avis ; Naoki Katoh ; Makoto Ohsaki ; Ileana Streinu ; Shin-ichi Tanigawa
Sequences Characterizing k-Trees / Zvi Lotker ; Debapriyo Majumdar ; N.S. Narayanaswamy ; Ingmar Weber
On the Threshold of Having a Linear Treewidth in Random Graphs / Yong Gao
Computational Biology
Reconciling Gene Trees with Apparent Polytomies / Wen-Chieh Chang ; Oliver Eulenstein
Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes / Zhixiang Chen ; Richard H. Fowler ; Bin Fu ; Binhai Zhu
Computing Maximum-Scoring Segments in Almost Linear Time / Fredrik Bengtsson ; Jingsen Chen
Graph Algorithms and Applications / Session B:
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants / Daniel Molle ; Stefan Richter ; Peter Rossmanith
A Detachment Algorithm for Inferring a Graph from Path Frequency / Hiroshi Nagamochi
The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm / Ying Xiao ; Christoforos Hadjicostis ; Krishnaiyan Thulasiraman
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms / Iyad A. Kanj ; Luay Nakhleh ; Ge Xia
On-Line Algorithms
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis / Wun-Tat Chan ; Prudence W.H. Wong ; Fencol C.C. Yung
Improved On-Line Broadcast Scheduling with Deadlines / Feifeng Zheng ; Stanley P.Y. Fung ; Wun- Tat Chan ; Y.L. Chin ; Chung Keung Poon
A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast / Regant Y.S. Hung ; H.F. Ting
On Lazy Bin Covering and Packing Problems / Mingen Lin ; Yang Yang ; Jinhui Xu
Creation and Growth of Components in a Random Hypergraph Process / Vlady Ravelomanana ; Alphonse Laza Rijamamy
Optimal Acyclic Edge Colouring of Grid Like Graphs / Rahul Muthu ; N. Narayanan ; C.R. Subramanian
An Edge Ordering Problem of Regular Hypergraphs / Hongbing Fan ; Robert Kalbfleisch
Algorithms for Security and Systems
Efficient Partially Blind Signature Scheme with Provable Security / Zheng Gong ; Xiangxue Li ; Kefei Chen
A Rigorous Analysis for Set-Up Time Models - A Metric Perspective / Eitan Bachmat ; Tao Kai Lam ; Avner Magen
Discrete Geometry and Graph Theory
Geometric Representation of Graphs in Low Dimension / L. Sunil Chandran ; Naveen Sivadasan
The On-Line Heilbronn's Triangle Problem in d Dimensions / Gill Barequet ; Alina Shaikhet
Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes / Gadi Aleksandrowicz
Approximation Algorithms
Approximating Min-Max (Regret) Versions of Some Polynomial Problems / Hassene Aissi ; Cristina Bazgan ; Daniel Vanderpooten
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand / E.C. Xavier ; F.K. Miyazawa
MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees / Sun- Yuan Hsieh ; Shih- Cheng Yang
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs / Jianbo Li ; Mingxia Chen ; Jianping Li ; Weidong Li
Overlap-Free Regular Languages / Yo-Sub Han ; Derick Wood
On the Combinatorial Representation of Information / Joel Ratsaby
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard / Jesper Torp Kristensen ; Peter Bro Miltersen
Experimental Algorithms
Bimodal Crossing Minimization / Christoph Buchheim ; Michael Junger ; Annette Menze ; Merijam Percan
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem / Lanbo Zheng
On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem / Dae-Sik Choi ; In-Chan Choi
Author Index
Invited Talks
The Unpredictable Deviousness of Models / Franco P. Preparata
Security Issues in Collaborative Computing / Mikhail J. Atallah
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼