@incollection{Valiant/05a,
AUTHOR = {Valiant, Leslie G.},
TITLE = {Completeness for parity problems},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {1-8},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Apostolico/05,
AUTHOR = {Apostolico, Alberto},
TITLE = {Monotony and surprise},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {9-9},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Teng/05,
AUTHOR = {Teng, Shang-Hua},
TITLE = {Smoothed analysis of algorithms and heuristics},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {10-11},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Wu-Gu/05,
AUTHOR = {Wu, Shiquan and Gu, Xun},
TITLE = {Gene network: Model, dynamics and simulation},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {12-21},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Blin-Rizzi/05,
AUTHOR = {Blin, Guillaume and Rizzi, Romeo},
TITLE = {Conserved interval distance computation between non-trivial genomes},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {22-31},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bereg-Zhu/05,
AUTHOR = {Bereg, Sergey and Zhu, Binhai},
TITLE = {RNA multiple structural alignment with longest common subsequences},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {32-41},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Sagot-Tannier/05,
AUTHOR = {Sagot, Marie-France and Tannier, Eric},
TITLE = {Perfect sorting by reversals},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {42-51},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Zheng-Sankoff/05,
AUTHOR = {Zheng, Chunfang and Sankoff, David},
TITLE = {Genome rearrangements with partially ordered chromosomes},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {52-62},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Liu-Tang-Moret/05,
AUTHOR = {Liu, Tao and Tang, Jijun and Moret, Bernard M.E.},
TITLE = {Quartet-based phylogeny reconstruction from gene orders},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {63-73},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Tan-Chua-Zhang/05,
AUTHOR = {Tan, Jinsong and Chua, Kok Seng and Zhang, Louxin},
TITLE = {Algorithmic and complexity issues of three clustering methods in microarray data analysis},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {74-83},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Nakhleh-Ruths-Wang/05,
AUTHOR = {Nakhleh, Luay and Ruths, Derek and Wang, Li-San},
TITLE = {RIATA-HGT: A fast and accurate heuristic for reconstructing horizontal gene transfer},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {84-93},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Li-Zhu/05,
AUTHOR = {Li, Hengwu and Zhu, Daming},
TITLE = {A new pseudoknots folding algorithm for RNA structure prediction},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {94-103},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Csuros-Ma/05,
AUTHOR = {Cs{\H{u}}r{\"o}s, Mikl{\'o}s and Ma, Bin},
TITLE = {Rapid homology search with two-stage extension and daughter seeds},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {104-114},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Berry-Guillemot-Nicolas-Paul/05,
AUTHOR = {Berry, Vincent and Guillemot, Sylvain and Nicolas, Fran{\c{c}}ois and Paul, Christophe},
TITLE = {On the approximation of computing evolutionary trees},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {115-125},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Li-Wan/05,
AUTHOR = {Li, Xiang-Yang and Wan, Peng-Jun},
TITLE = {Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {126-135},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cai-Lin-Xue/05,
AUTHOR = {Cai, Zhipeng and Lin, Guohui and Xue, Guoliang},
TITLE = {Improved approximation algorithms for the capacitated multicast routing problem},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {136-145},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Zeng-Hsu-Zhou/05,
AUTHOR = {Zeng, Jianyang and Hsu, Wen-Jing and Zhou, Suiping},
TITLE = {Construction of scale-free networks with partial information},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {146-155},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Desmedt-Wang-Safavi-Naini-Wang/05,
AUTHOR = {Desmedt, Yvo and Wang, Yongge and Safavi-Naini, Rei and Wang, Huaxiong},
TITLE = {Radio networks with reliable communication},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {156-166},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hoefer-Krysta/05,
AUTHOR = {Hoefer, Martin and Krysta, Piotr},
TITLE = {Geometric network design with selfish agents},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {167-178},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Krysta/05,
AUTHOR = {Krysta, Piotr},
TITLE = {Bicriteria network design via iterative rounding},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {179-187},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kuhn-von_Rickenbach-Wattenhofer-Welzl-Zollinger/05,
AUTHOR = {Kuhn, Fabian and von Rickenbach, Pascal and Wattenhofer, Roger and Welzl, Emo and Zollinger, Aaron},
TITLE = {Interference in cellular networks: The minimum membership set cover problem},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {188-198},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Hu-Shuai/05,
AUTHOR = {Chen, Xujin and Hu, Xiaodong and Shuai, Tianping},
TITLE = {Routing and coloring for maximal number of trees},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {199-209},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Wang-Li-Sun/05,
AUTHOR = {Wang, WeiZhao and Li, Xiang-Yang and Sun, Zheng},
TITLE = {Share the multicast payment fairly},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {210-219},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Li-Li-Law-Zhao/05,
AUTHOR = {Li, Jianping and Li, Kang and Law, Ken C.K. and Zhao, Hao},
TITLE = {On packing and coloring hyperedges in a cycle},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {220-229},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Liu-Wan-Jia/05,
AUTHOR = {Liu, Hai and Wan, Peng-Jun and Jia, Xiaohua},
TITLE = {Fault-tolerant relay node placement in wireless sensor networks},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {230-239},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ono-Ng/05,
AUTHOR = {Ono, Hirotaka and Ng, Yen Kaow},
TITLE = {Best fitting fixed-length substring patterns for a set of strings},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {240-250},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Caminiti-Petreschi/05,
AUTHOR = {Caminiti, Saverio and Petreschi, Rossella},
TITLE = {String coding of trees with locality and heritability},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {251-262},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Liben-Nowell-Vee-Zhu/05,
AUTHOR = {Liben-Nowell, David and Vee, Erik and Zhu, An},
TITLE = {Finding longest increasing and common subsequences in streaming data},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {263-272},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Na-Giancarlo-Park/05,
AUTHOR = {Na, Joong Chae and Giancarlo, Raffaele and Park, Kunsoo},
TITLE = {$O(n^2 \log n)$ time on-line construction of two-dimensional suffix trees},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {273-282},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_29},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Li-Liu-Yao/05,
AUTHOR = {Li, Minming and Liu, Becky Jie and Yao, Frances F.},
TITLE = {Min-energy voltage allocation for tree-structured tasks},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {283-296},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_30},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Tan-He/05,
AUTHOR = {Tan, Zhiyi and He, Yong},
TITLE = {Semi-online problems on identical machines with inexact partial information},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {297-307},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Baille-Bampis-Laforest-Thibault/05,
AUTHOR = {Baille, Fabien and Bampis, Evripidis and Laforest, Christian and Thibault, Nicolas},
TITLE = {On-line simultaneous maximization of the size and the weight for degradable intervals schedules},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {308-317},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_32},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chan-Chin-Zhang-Zhu-Shen-Wong/05,
AUTHOR = {Chan, Wun-Tat and Chin, Francis Y.L. and Zhang, Yong and Zhu, Hong and Shen, Hong and Wong, Prudence W.H.},
TITLE = {Off-line algorithms for minimizing total flow time in broadcast scheduling},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {318-328},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_33},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chung-Graham-Mao-Yao/05,
AUTHOR = {Chung, Fan and Graham, Ron and Mao, Jia and Yao, Andrew},
TITLE = {Oblivious and adaptive strategies for the majority and plurality problems},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {329-338},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_34},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cai-Chakaravarthy/05,
AUTHOR = {Cai, Jin-Yi and Chakaravarthy, Venkatesan T.},
TITLE = {A note on zero error algorithms having oracle access to one $NP$ query},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {339-348},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_35},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ko-Yu/05,
AUTHOR = {Ko, Ker-I and Yu, Fuxiang},
TITLE = {On the complexity of computing the logarithm and square root functions on a complex domain},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {349-358},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_36},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Rettinger-Zheng/05,
AUTHOR = {Rettinger, Robert and Zheng, Xizhong},
TITLE = {Solovay reducibility on $D-c.e$ real numbers},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {359-368},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_37},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Martinez-Coelho_de_Pina-Soares/05,
AUTHOR = {Martinez, F{\'a}bio Viduani and Coelho de Pina, Jos{\'e} and Soares, Jos{\'e}},
TITLE = {Algorithms for terminal Steiner trees},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {369-379},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_38},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chalermsook-Fakcharoenphol/05,
AUTHOR = {Chalermsook, Parinya and Fakcharoenphol, Jittat},
TITLE = {Simple distributed algorithms for approximating minimum Steiner trees},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {380-389},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_39},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Guala-Proietti/05,
AUTHOR = {Gual{\`a}, Luciano and Proietti, Guido},
TITLE = {A truthful $(2-2/k)$-approximation mechanism for the Steiner tree problem with $k$ terminals},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {390-400},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_40},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bachmaier-Fischer-Forster/05,
AUTHOR = {Bachmaier, Christian and Fischer, Florian and Forster, Michael},
TITLE = {Radial coordinate assignment for level graphs},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {401-410},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_41},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Yang-Song-Yang-Xie/05,
AUTHOR = {Yang, Guowu and Song, Xiaoyu and Yang, Hannah H. and Xie, Fei},
TITLE = {A theoretical upper bound for IP-based floorplanning},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {411-419},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_42},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hallgren-Russell-Shparlinski/05,
AUTHOR = {Hallgren, Sean and Russell, Alexander and Shparlinski, Igor E.},
TITLE = {Quantum noisy rational function reconstruction},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {420-429},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_43},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Zhang/05c,
AUTHOR = {Zhang, Shengyu},
TITLE = {Promised and distributed quantum search},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {430-439},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_44},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Viger-Latapy/05,
AUTHOR = {Viger, Fabien and Latapy, Matthieu},
TITLE = {Efficient and simple generation of random simple connected graphs with prescribed degree sequence},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {440-449},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_45},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{List-Maucher-Schoning-Schuler/05,
AUTHOR = {List, Beatrice and Maucher, Markus and Sch{\"o}ning, Uwe and Schuler, Rainer},
TITLE = {Randomized Quicksort and the entropy of the random source},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {450-460},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_46},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Sankowski/05,
AUTHOR = {Sankowski, Piotr},
TITLE = {Subquadratic algorithm for dynamic shortest distances},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {461-470},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_47},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ding-Qian-Tsang-Wang/05,
AUTHOR = {Ding, Q. and Qian, J. and Tsang, W. and Wang, C.},
TITLE = {Randomly generating triangulations of a simple polygon},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {471-480},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_48},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Xu-Dai-Katoh-Ohsaki/05,
AUTHOR = {Xu, Yinfeng and Dai, Wenqiang and Katoh, Naoki and Ohsaki, Makoto},
TITLE = {Triangulating a convex polygon with small number of non-standard bars},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {481-489},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_49},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Fu-Tang-Zhu/05,
AUTHOR = {Chen, Zhixiang and Fu, Bin and Tang, Yong and Zhu, Binhai},
TITLE = {A PTAS for a disc covering problem using width-bounded separators},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {490-503},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_50},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Wu/05a,
AUTHOR = {Wu, Xiaodong},
TITLE = {Efficient algorithms for intensity map splitting problems in radiation therapy},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {504-513},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_51},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lefmann/05,
AUTHOR = {Lefmann, Hanno},
TITLE = {Distributions of points in $d$ dimensions and large $k$-point simplices},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {514-523},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_52},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Icking-Kamphans-Klein-Langetepe/05,
AUTHOR = {Icking, Christian and Kamphans, Tom and Klein, Rolf and Langetepe, Elmar},
TITLE = {Exploring simple grid polygons},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {524-533},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_53},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Tan/05,
AUTHOR = {Tan, Xuehou},
TITLE = {Approximation algorithms for cutting out polygons with lines and rays},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {534-543},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_54},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gupta-Janardan-Smid/05,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel},
TITLE = {Efficient non-intersection queries on aggregated geometric data},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {544-553},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_55},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ackerman-Barequet-Pinter/05,
AUTHOR = {Ackerman, Eyal and Barequet, Gill and Pinter, Ron Y.},
TITLE = {An upper bound on the number of rectangulations of a point set},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {554-559},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_56},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Poon-Yiu/05,
AUTHOR = {Poon, Chung Keung and Yiu, Wai Keung},
TITLE = {Opportunistic data structures for range queries},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {560-569},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_57},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ruskey-Williams/05,
AUTHOR = {Ruskey, Frank and Williams, Aaron},
TITLE = {Generating combinations by prefix shifts},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {570-576},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_58},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Braeken-Nikov-Nikova/05,
AUTHOR = {Braeken, An and Nikov, Ventzislav and Nikova, Svetla},
TITLE = {Error-set codes and related objects},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {577-585},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_59},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Deng-Huang-Li/05,
AUTHOR = {Deng, Xiaotie and Huang, Li-Sha and Li, Minming},
TITLE = {On Walrasian price of CPU time},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {586-595},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_60},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Angelopoulos-Sarma-Magen-Viglas/05,
AUTHOR = {Angelopoulos, Spyros and Sarma, Atish Das and Magen, Avner and Viglas, Anastasios},
TITLE = {On-line algorithms for market equilibria},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {596-607},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_61},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kothari-Suri-Zhou/05,
AUTHOR = {Kothari, Anshul and Suri, Subhash and Zhou, Yunhong},
TITLE = {Interval subset sum and uniform-price auction clearing},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {608-620},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_62},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bae-Takaoka/05,
AUTHOR = {Bae, Sung E. and Takaoka, Tadao},
TITLE = {Improved algorithms for the $K$-maximum subarray problem for small $K$},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {621-631},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_63},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chaudhuri-Kothari-Pendavingh-Swaminathan-Tarjan-Zhou/05,
AUTHOR = {Chaudhuri, Kamalika and Kothari, Anshul and Pendavingh, Rudi and Swaminathan, Ram and Tarjan, Robert and Zhou, Yunhong},
TITLE = {Server allocation algorithms for tiered systems},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {632-643},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_64},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Xu-Xu/05b,
AUTHOR = {Xu, Guang and Xu, Jinhui},
TITLE = {An improved approximation algorithm for uncapacitated facility location problem with penalties},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {644-653},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_65},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chrobak-Kenyon-Young/05,
AUTHOR = {Chrobak, Marek and Kenyon, Claire and Young, Neal E.},
TITLE = {The reverse greedy algorithm for the metric $k$-median problem},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {654-660},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_66},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ma-Peng-Wei/05,
AUTHOR = {Ma, Guoxuan and Peng, Jiming and Wei, Yu},
TITLE = {On approximate balanced bi-clustering},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {661-670},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_67},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Wang/05c,
AUTHOR = {Wang, Tao-Ming},
TITLE = {Toroidal grids are anti-magic},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {671-679},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_68},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Szegedy-Wang/05,
AUTHOR = {Chen, Xiaomin and Szegedy, Mario and Wang, Lei},
TITLE = {Optimally balanced forward degree sequence},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {680-689},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_69},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dubey-Mehta-Deogun/05,
AUTHOR = {Dubey, Chandan K. and Mehta, Shashank K. and Deogun, Jitender S.},
TITLE = {Conditionally critical indecomposable graphs},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {690-700},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_70},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cardinal-Labbe-Langerman-Levy-Melot/05,
AUTHOR = {Cardinal, Jean and Labb{\'e}, Martine and Langerman, Stefan and Levy, Eythan and M{\'e}lot, Hadrien},
TITLE = {A tight analysis of the maximal matching heuristic},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {701-709},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_71},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Jowhari-Ghodsi/05,
AUTHOR = {Jowhari, Hossein and Ghodsi, Mohammad},
TITLE = {New streaming algorithms for counting triangles in graphs},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {710-716},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_72},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Suters-Abu-Khzam-Zhang-Symons-Samatova-Langston/05,
AUTHOR = {Suters, W. Henry and Abu-Khzam, Faisal N. and Zhang, Yun and Symons, Christopher T. and Samatova, Nagiza F. and Langston, Michael A.},
TITLE = {A new approach and faster exact methods for the maximum common subgraph problem},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {717-727},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_73},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Allulli-Ausiello-Laura/05,
AUTHOR = {Allulli, Luca and Ausiello, Giorgio and Laura, Luigi},
TITLE = {On the power of lookahead in on-line vehicle routing problems},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {728-736},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_74},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Misiolek-Chen/05,
AUTHOR = {Misio{\l}ek, Ewa and Chen, Danny Z.},
TITLE = {Efficient algorithms for simplifying flow networks},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {737-746},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_75},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fukunaga-Nagamochi/05,
AUTHOR = {Fukunaga, Takuro and Nagamochi, Hiroshi},
TITLE = {Approximation algorithms for the $b$-edge dominating set problem and its related problems},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {747-756},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_76},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dom-Guo-Niedermeier/05,
AUTHOR = {Dom, Michael and Guo, Jiong and Niedermeier, Rolf},
TITLE = {Bounded degree closest $k$-tree power is $NP$-complete},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {757-766},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_77},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Khachiyan-Boros-Elbassioni-Gurvich/05,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir},
TITLE = {A new algorithm for the hypergraph transversal problem},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {767-776},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_78},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gomez-Gutierrez-Ibeas-Martinez-Beivide/05,
AUTHOR = {G{\'o}mez, Domingo and Gutierrez, Jaime and Ibeas, {\'A}lvar and Mart{\'{i}}nez, Carmen and Beivide, Ram{\'o}n},
TITLE = {On finding a shortest path in circulant graphs with two jumps},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {777-786},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_79},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hsu/05,
AUTHOR = {Hsu, Wen-Lian},
TITLE = {A linear time algorithm for finding a maximal planar subgraph based on PC-trees},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {787-797},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_80},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ito-Kato-Zhou-Nishizeki/05,
AUTHOR = {Ito, Takehiro and Kato, Akira and Zhou, Xiao and Nishizeki, Takao},
TITLE = {Algorithms for finding distance-edge-colorings of graphs},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {798-807},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_81},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chang-Kloks-Kratsch-Liu-Peng/05,
AUTHOR = {Chang, Maw-Shang and Kloks, Ton and Kratsch, Dieter and Liu, Jiping and Peng, Sheng-Lung},
TITLE = {On the recognition of probe graphs of some self-complementary classes of perfect graphs},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {808-817},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_82},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Liao-Lee/05,
AUTHOR = {Liao, Chung-Shou and Lee, Der-Tsai},
TITLE = {Power domination problem in graphs},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {818-828},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_83},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bazgan-Tuza-Vanderpooten/05,
AUTHOR = {Bazgan, Cristina and Tuza, Zsolt and Vanderpooten, Daniel},
TITLE = {Complexity and approximation of satisfactory partition problems},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {829-838},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_84},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Grandoni-Konemann-Panconesi/05,
AUTHOR = {Grandoni, Fabrizio and K{\"o}nemann, Jochen and Panconesi, Alessandro},
TITLE = {Distributed weighted vertex cover via maximal matchings},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {839-848},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_85},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kara-Kratochvil-Wood/05,
AUTHOR = {K{\'a}ra, Jan and Kratochv{\'{i}}l, Jan and Wood, David R.},
TITLE = {On the complexity of the balanced vertex ordering problem},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {849-858},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_86},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dehne-Fellows-Langston-Rosamond-Stevens/05,
AUTHOR = {Dehne, Frank and Fellows, Michael and Langston, Michael A. and Rosamond, Frances and Stevens, Kim},
TITLE = {An $O(2^{O(k)}n^3)$ FPT algorithm for the undirected feedback vertex set problem},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {859-869},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_87},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Gao-Yu-Zang/05,
AUTHOR = {Chen, Guantao and Gao, Zhicheng and Yu, Xingxing and Zang, Wenan},
TITLE = {Approximating the longest cycle problem on graphs with bounded degree},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {870-884},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_88},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{He-Dosa/05,
AUTHOR = {He, Yong and D{\'o}sa, Gy{\"o}rgy},
TITLE = {Bin packing and covering problems with rejection},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {885-894},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_89},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hemaspaandra-Thakur/05,
AUTHOR = {Hemaspaandra, Lane A. and Thakur, Mayur},
TITLE = {Query-monotonic Turing reductions},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {895-904},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_90},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ibarra-Woodworth-Yen-Dang/05,
AUTHOR = {Ibarra, Oscar H. and Woodworth, Sara and Yen, Hsu-Chun and Dang, Zhe},
TITLE = {On sequential and 1-deterministic $P$ systems},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {905-914},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_91},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Huang/05a,
AUTHOR = {Huang, Xiaofei},
TITLE = {Global optimality conditions and near-perfect optimization in coding},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {915-924},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_92},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kutz-Por/05,
AUTHOR = {Kutz, Martin and P{\'o}r, Attila},
TITLE = {Angel, devil, and king},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {925-934},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_93},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cicalese-Damaschke-Tansini-Werth/05,
AUTHOR = {Cicalese, Ferdinando and Damaschke, Peter and Tansini, Libertad and Werth, S{\"o}ren},
TITLE = {Overlaps help: Improved bounds for group testing with interval queries},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {935-944},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_94},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Yoon-Yoo/05,
AUTHOR = {Yoon, Eun-Jun and Yoo, Kee-Young},
TITLE = {New efficient simple authenticated key agreement protocol},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {945-954},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_95},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Fu/05,
AUTHOR = {Chen, Zhixiang and Fu, Bin},
TITLE = {A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {955-964},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_96},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bocker-Liptak/05,
AUTHOR = {B{\"o}cker, Sebastian and Lipt{\'a}k, Zsuzsanna},
TITLE = {The money changing problem revisited: Computing the Frobenius number in time $O(k a_1)$},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {965-974},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_97},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Huang-Kanj-Xia/05,
AUTHOR = {Chen, Jianer and Huang, Xiuzhen and Kanj, Iyad A. and Xia, Ge},
TITLE = {$W$-hardness under linear FPT-reductions: Structural properties and further applications},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {975-984},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_98},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Yang-Zhang/05,
AUTHOR = {Yang, Xiao Guang and Zhang, Jian Zhong},
TITLE = {Some new results on inverse sorting problems},
BOOKTITLE = {Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON'2005 (Kunming, China, August 16-29, 2005)},
SERIES = {LNCS},
VOLUME = {3595},
PAGES = {985-992},
YEAR = {2005},
EDITOR = {Wang, Lusheng},
URL = {http://dx.doi.org/10.1007/11533719_99},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}