@incollection{Preparata/06a,
AUTHOR = {Preparata, Franco P.},
TITLE = {The unpredictable deviousness of models},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {1-1},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Atallah/06,
AUTHOR = {Atallah, Mikhail J.},
TITLE = {Security issues in collaborative computing},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {2-2},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Deng/06a,
AUTHOR = {Chen, Xi and Deng, Xiaotie},
TITLE = {A simplicial approach for discrete fixed point theorems},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {3-12},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Deng-Liu/06,
AUTHOR = {Chen, Xi and Deng, Xiaotie and Liu, Becky Jie},
TITLE = {On incentive compatible competitive selection protocol},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {13-22},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Karakostas-Kolliopoulos/06,
AUTHOR = {Karakostas, George and Kolliopoulos, Stavros G.},
TITLE = {Edge pricing of multicommodity networks for selfish users with elastic demands},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {23-32},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Harada-Takimoto-Maruoka/06,
AUTHOR = {Harada, Shigeaki and Takimoto, Eiji and Maruoka, Akira},
TITLE = {Aggregating strategy for online auctions},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {33-41},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dubey-Mehta/06,
AUTHOR = {Dubey, Chandan K. and Mehta, Shashank K.},
TITLE = {On indecomposability preserving elimination sequences},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {42-51},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Yu-Lin-Wang/06,
AUTHOR = {Yu, Hung-I and Lin, Tzu-Chin and Wang, Biing-Feng},
TITLE = {Improved algorithms for the minmax regret 1-median problem},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {52-62},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ito-Goto-Zhou-Nishizeki/06,
AUTHOR = {Ito, Takehiro and Goto, Kazuya and Zhou, Xiao and Nishizeki, Takao},
TITLE = {Partitioning a multi-weighted graph to connected subgraphs of almost uniform size},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {63-72},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lin-Szwarcfiter/06,
AUTHOR = {Lin, Min Chih and Szwarcfiter, Jayme L.},
TITLE = {Characterizations and linear time recognition of Helly circular-arc graphs},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {73-82},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Golovkins-Pin/06,
AUTHOR = {Golovkins, Marats and Pin, Jean-Eric},
TITLE = {Varieties generated by certain models of reversible finite automata},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {83-93},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{McQuillan-Salomaa-Daley/06,
AUTHOR = {McQuillan, Ian and Salomaa, Kai and Daley, Mark},
TITLE = {Iterated TGR languages: Membership problem and effective closure properties},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {94-103},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Sato-Amano-Maruoka/06,
AUTHOR = {Sato, Takayuki and Amano, Kazuyuki and Maruoka, Akira},
TITLE = {On the negation-limited circuit complexity of sorting and inverting $k$-tonic sequences},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {104-115},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Suzuki-Yamashita-Nakanishi-Watanabe/06,
AUTHOR = {Suzuki, Tomoya and Yamashita, Shigeru and Nakanishi, Masaki and Watanabe, Katsumasa},
TITLE = {Robust quantum algorithms with $\epsilon$-biased oracles},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {116-125},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Arvind-Das-Mukhopadhyay/06,
AUTHOR = {Arvind, V. and Das, Bireswar and Mukhopadhyay, Partha},
TITLE = {The complexity of black-box ring problems},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {126-135},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Huang/06a,
AUTHOR = {Huang, Xiuzhen},
TITLE = {Lower bounds and parameterized approach for longest common subsequence},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {136-145},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Rahman-Iliopoulos-Lee-Mohamed-Smyth/06,
AUTHOR = {Rahman, M. Sohel and Iliopoulos, Costas S. and Lee, Inbok and Mohamed, Manal and Smyth, William F.},
TITLE = {Finding patterns with variable length gaps or don't cares},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {146-155},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dou-Wu-Bayouth-Buatti/06,
AUTHOR = {Dou, Xin and Wu, Xiaodong and Bayouth, John E. and Buatti, John M.},
TITLE = {The matrix orthogonal decomposition problem in intensity-modulated radiation therapy},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {156-165},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Benkert-Gudmundsson-Knauer-Moet-van_Oostrum-Wolff/06,
AUTHOR = {Benkert, Marc and Gudmundsson, Joachim and Knauer, Christian and Moet, Esther and van Oostrum, Ren{\'e} and Wolff, Alexander},
TITLE = {A polynomial-time approximation algorithm for a geometric dispersion problem},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {166-175},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bereg-Daescu-Jiang/06,
AUTHOR = {Bereg, Sergey and Daescu, Ovidiu and Jiang, Minghui},
TITLE = {A PTAS for cutting out polygons with lines},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {176-185},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Poon/06a,
AUTHOR = {Poon, Sheung-Hung},
TITLE = {On unfolding lattice polygons/trees and diameter-4 trees},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {186-195},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Andersson-Gudmundsson-Levcopoulos/06,
AUTHOR = {Andersson, Mattias and Gudmundsson, Joachim and Levcopoulos, Christos},
TITLE = {Restricted mesh simplification using edge contractions},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {196-204},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Avis-Katoh-Ohsaki-Streinu-Tanigawa/06,
AUTHOR = {Avis, David and Katoh, Naoki and Ohsaki, Makoto and Streinu, Ileana and Tanigawa, Shin-ichi},
TITLE = {Enumerating non-crossing minimally rigid frameworks},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {205-215},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lotker-Majumdar-Narayanaswamy-Weber/06,
AUTHOR = {Lotker, Zvi and Majumdar, Debapriyo and Narayanaswamy, N.S. and Weber, Ingmar},
TITLE = {Sequences characterizing $k$-trees},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {216-225},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gao/06a,
AUTHOR = {Gao, Yong},
TITLE = {On the threshold of having a linear treewidth in random graphs},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {226-234},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chang-Eulenstein/06,
AUTHOR = {Chang, Wen-Chieh and Eulenstein, Oliver},
TITLE = {Reconciling gene trees with apparent polytomies},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {235-244},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Fowler-Fu-Zhu/06,
AUTHOR = {Chen, Zhixiang and Fowler, Richard H. and Fu, Bin and Zhu, Binhai},
TITLE = {Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {245-254},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bengtsson-Chen/06a,
AUTHOR = {Bengtsson, Fredrik and Chen, Jingsen},
TITLE = {Computing maximum-scoring segments in almost linear time},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {255-264},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Molle-Richter-Rossmanith/06a,
AUTHOR = {M{\"o}lle, Daniel and Richter, Stefan and Rossmanith, Peter},
TITLE = {Enumerate and expand: New runtime bounds for vertex cover variants},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {265-273},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_29},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Nagamochi/06a,
AUTHOR = {Nagamochi, Hiroshi},
TITLE = {A detachment algorithm for inferring a graph from path frequency},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {274-283},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_30},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Xiao-Hadjicostis-Thulasiraman/06,
AUTHOR = {Xiao, Ying and Hadjicostis, Christoforos and Thulasiraman, Krishnaiyan},
TITLE = {The $d$-identifying codes problem for vertex identification in graphs: Probabilistic analysis and an approximation algorithm},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {284-298},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kanj-Nakhleh-Xia/06,
AUTHOR = {Kanj, Iyad A. and Nakhleh, Luay and Xia, Ge},
TITLE = {Reconstructing evolution of natural languages: Complexity and parameterized algorithms},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {299-308},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_32},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chan-Wong-Yung/06,
AUTHOR = {Chan, Wun-Tat and Wong, Prudence W.H. and Yung, Fencol C.C.},
TITLE = {On dynamic bin packing: An improved lower bound and resource augmentation analysis},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {309-319},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_33},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Zheng-Fung-Chan-Chin-Poon-Wong/06,
AUTHOR = {Zheng, Feifeng and Fung, Stanley P.Y. and Chan, Wun-Tat and Chin, Francis Y.L. and Poon, Chung Keung and Wong, Prudence W.H.},
TITLE = {Improved on-line broadcast scheduling with deadlines},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {320-329},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_34},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hung-Ting/06,
AUTHOR = {Hung, Regant Y.S. and Ting, H.F.},
TITLE = {A tight analysis of most-requested-first for on-demand data broadcast},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {330-339},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_35},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lin-Yang-Xu/06,
AUTHOR = {Lin, Mingen and Yang, Yang and Xu, Jinhui},
TITLE = {On lazy bin covering and packing problems},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {340-349},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_36},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ravelomanana-Rijamamy/06,
AUTHOR = {Ravelomanana, Vlady and Rijamamy, Alphonse Laza},
TITLE = {Creation and growth of components in a random hypergraph process},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {350-359},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_37},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Muthu-Narayanan-Subramanian/06,
AUTHOR = {Muthu, Rahul and Narayanan, N. and Subramanian, C.R.},
TITLE = {Optimal acyclic edge colouring of grid like graphs},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {360-367},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_38},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fan-Kalbfleisch/06,
AUTHOR = {Fan, Hongbing and Kalbfleisch, Robert},
TITLE = {An edge ordering problem of regular hypergraphs},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {368-377},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_39},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gong-Li-Chen/06,
AUTHOR = {Gong, Zheng and Li, Xiangxue and Chen, Kefei},
TITLE = {Efficient partially blind signature scheme with provable security},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {378-386},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_40},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bachmat-Lam-Magen/06,
AUTHOR = {Bachmat, Eitan and Lam, Tao Kai and Magen, Avner},
TITLE = {A rigorous analysis for set-up time models --- A metric perspective},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {387-397},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_41},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chandran-Sivadasan/06,
AUTHOR = {Chandran, L. Sunil and Sivadasan, Naveen},
TITLE = {Geometric representation of graphs in low dimension},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {398-407},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_42},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Barequet-Shaikhet/06,
AUTHOR = {Barequet, Gill and Shaikhet, Alina},
TITLE = {The on-line Heilbronn's triangle problem in $d$ dimensions},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {408-417},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_43},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Aleksandrowicz-Barequet/06,
AUTHOR = {Aleksandrowicz, Gadi and Barequet, Gill},
TITLE = {Counting $d$-dimensional polycubes and nonrectangular planar polyominoes},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {418-427},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_44},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Aissi-Bazgan-Vanderpooten/06,
AUTHOR = {Aissi, Hassene and Bazgan, Cristina and Vanderpooten, Daniel},
TITLE = {Approximating min-max (regret) versions of some polynomial problems},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {428-438},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_45},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Xavier-Miyazawa/06,
AUTHOR = {Xavier, E.C. and Miyazawa, F.K.},
TITLE = {The class constrained bin packing problem with applications to video-on-demand},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {439-448},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_46},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hsieh-Yang/06,
AUTHOR = {Hsieh, Sun-Yuan and Yang, Shih-Cheng},
TITLE = {MAX-SNP hardness and approximation of selected-internal Steiner trees},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {449-458},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_47},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Li-Chen-Li-Li/06,
AUTHOR = {Li, Jianbo and Chen, Mingxia and Li, Jianping and Li, Weidong},
TITLE = {Minimum clique partition problem with constrained weight for interval graphs},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {459-468},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_48},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Han-Wood/06,
AUTHOR = {Han, Yo-Sub and Wood, Derick},
TITLE = {Overlap-free regular languages},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {469-478},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_49},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ratsaby/06,
AUTHOR = {Ratsaby, Joel},
TITLE = {On the combinatorial representation of information},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {479-488},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_50},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kristensen-Miltersen/06,
AUTHOR = {Kristensen, Jesper Torp and Miltersen, Peter Bro},
TITLE = {Finding small OBDDs for incompletely specified truth tables is hard},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {489-496},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_51},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Buchheim-Junger-Menze-Percan/06,
AUTHOR = {Buchheim, Christoph and J{\"u}nger, Michael and Menze, Annette and Percan, Merijam},
TITLE = {Bimodal crossing minimization},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {497-506},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_52},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Buchheim-Zheng/06,
AUTHOR = {Buchheim, Christoph and Zheng, Lanbo},
TITLE = {Fixed linear crossing minimization by reduction to the maximum cut problem},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {507-516},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_53},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Choi-Choi/06,
AUTHOR = {Choi, Dae-Sik and Choi, In-Chan},
TITLE = {On the effectiveness of the linear programming relaxation of the 0-1 multi-commodity minimum cost network flow problem},
BOOKTITLE = {Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'2006 (Taipei, Taiwan, August 15-18, 2006)},
SERIES = {LNCS},
VOLUME = {4112},
PAGES = {517-526},
YEAR = {2006},
EDITOR = {Chen, Danny Z. and Lee, D.T.},
URL = {http://dx.doi.org/10.1007/11809678_54},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}