@incollection{Iwama/06a,
AUTHOR = {Iwama, Kazuo},
TITLE = {Stable matching problems},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {1-1},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dey/06,
AUTHOR = {Dey, Tamal K.},
TITLE = {Delaunay meshing of surfaces},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {2-2},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Demaine-Hajiaghayi-Kawarabayashi/06,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, MohammadTaghi and Kawarabayashi, Ken-ichi},
TITLE = {Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {3-15},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fomin-Gaspers-Saurabh/06,
AUTHOR = {Fomin, Fedor V. and Gaspers, Serge and Saurabh, Saket},
TITLE = {Branching and treewidth based exact algorithms},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {16-25},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lenz/06,
AUTHOR = {Lenz, Tobias},
TITLE = {Deterministic splitter finding in a stream with constant storage and guarantees},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {26-35},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dinitz-Solomon/06,
AUTHOR = {Dinitz, Yefim and Solomon, Shay},
TITLE = {Optimal algorithms for tower of Hanoi problems with relaxed placement rules},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {36-47},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kao-Sanghi-Schweller/06,
AUTHOR = {Kao, Ming-Yang and Sanghi, Manan and Schweller, Robert},
TITLE = {Flexible word design and graph labeling},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {48-60},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chan-Chin-Ye-Zhang-Zhu/06,
AUTHOR = {Chan, Joseph Wun-Tat and Chin, Francis Y.L. and Ye, Deshi and Zhang, Yong and Zhu, Hong},
TITLE = {Frequency allocation problems for linear cellular networks},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {61-70},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Horiyama-Iwama-Kawahara/06,
AUTHOR = {Horiyama, Takashi and Iwama, Kazuo and Kawahara, Jun},
TITLE = {Finite-state online algorithms and their automated competitive analysis},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {71-80},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Khandekar-Pandit/06a,
AUTHOR = {Khandekar, Rohit and Pandit, Vinayaka},
TITLE = {Offline sorting buffers on line},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {81-89},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Akutsu-Fukagawa-Takasu/06,
AUTHOR = {Akutsu, Tatsuya and Fukagawa, Daiji and Takasu, Atsuhiro},
TITLE = {Approximating tree edit distance through string edit distance},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {90-99},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Aoki-Kinoshita-Kanehisa-Kao-Li-Wang/06,
AUTHOR = {Aoki-Kinoshita, Kiyoko F. and Kanehisa, Minoru and Kao, Ming-Yang and Li, Xiang-Yang and Wang, Weizhao},
TITLE = {A 6-approximation algorithm for computing smallest common AoN-supertree with application to the reconstruction of Glycan trees},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {100-110},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Grandoni-Italiano/06,
AUTHOR = {Grandoni, Fabrizio and Italiano, Giuseppe F.},
TITLE = {Improved approximation for single-sink buy-at-bulk},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {111-120},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ito-Demaine-Zhou-Nishizeki/06,
AUTHOR = {Ito, Takehiro and Demaine, Erik D. and Zhou, Xiao and Nishizeki, Takao},
TITLE = {Approximability of partitioning graphs with supply and demand},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {121-130},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kamada-Miura-Nishizeki/06,
AUTHOR = {Kamada, Akira and Miura, Kazuyuki and Nishizeki, Takao},
TITLE = {Convex grid drawings of plane graphs with rectangular contours},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {131-140},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Aggarwal-Dubey-Mehta/06,
AUTHOR = {Aggarwal, Divesh and Dubey, Chandan K. and Mehta, Shashank K.},
TITLE = {Algorithms on graphs with small dominating targets},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {141-152},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kavitha-Shah/06,
AUTHOR = {Kavitha, Telikepalli and Shah, Chintan D.},
TITLE = {Efficient algorithms for weighted rank-maximal matchings and related problems},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {153-162},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ganguly-Saha/06,
AUTHOR = {Ganguly, Sumit and Saha, Barna},
TITLE = {On estimating path aggregates over streaming graphs},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {163-172},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bose-Smid-Xu/06,
AUTHOR = {Bose, Prosenjit and Smid, Michiel and Xu, Daming},
TITLE = {Diamond triangulations contain spanners of bounded degree},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {173-182},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bae-Kim-Chwa/06,
AUTHOR = {Bae, Sang Won and Kim, Jae-Hoon and Chwa, Kyung-Yong},
TITLE = {Optimal construction of the city Voronoi diagram},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {183-192},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Wang/06b,
AUTHOR = {Wang, Yusu},
TITLE = {Relations between two common types of rectangular tilings},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {193-202},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cheng-Shi/06,
AUTHOR = {Cheng, Ho-Lun and Shi, Xinwei},
TITLE = {Quality tetrahedral mesh generation for macromolecules},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {203-212},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Elbassioni-Fishkin-Sitters/06,
AUTHOR = {Elbassioni, Khaled and Fishkin, Aleksei V. and Sitters, Ren{\'e}},
TITLE = {On approximating the TSP with intersecting neighborhoods},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {213-222},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Iwama-Morizumi-Tarui/06,
AUTHOR = {Iwama, Kazuo and Morizumi, Hiroki and Tarui, Jun},
TITLE = {Negation-limited complexity of parity and inverters},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {223-232},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Arvind-Toran/06,
AUTHOR = {Arvind, V. and Tor{\'a}n, Jacobo},
TITLE = {The complexity of quasigroup isomorphism and the minimum generating set problem},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {233-242},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kruger-Hempel/06,
AUTHOR = {Kr{\"u}ger, Michael and Hempel, Harald},
TITLE = {Inverse HAMILTONIAN CYCLE and inverse 3-D MATCHING are coNP-complete},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {243-252},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Guillemot/06,
AUTHOR = {Guillemot, Sylvain},
TITLE = {Parameterized problems on coincidence graphs},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {253-266},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Guruswami/06,
AUTHOR = {Guruswami, Venkatesan},
TITLE = {On 2-query codeword testing with near-perfect completeness},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {267-276},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kujala-Elomaa/06,
AUTHOR = {Kujala, Jussi and Elomaa, Tapio},
TITLE = {Poketree: A dynamically competitive data structure with good worst-case performance},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {277-288},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_29},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Wu/06b,
AUTHOR = {Wu, Xiaodong},
TITLE = {Efficient algorithms for the optimal-ratio region detection problems in discrete geometry with applications},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {289-299},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_30},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Liu-Chao/06,
AUTHOR = {Liu, Hsiao-Fei and Chao, Kun-Mao},
TITLE = {On locating disjoint segments with maximum sum of densities},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {300-307},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Elmasry-Jensen-Katajainen/06,
AUTHOR = {Elmasry, Amr and Jensen, Claus and Katajainen, Jyrki},
TITLE = {Two-tier relaxed heaps},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {308-317},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_32},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Doerr-Lengler-Steurer/06,
AUTHOR = {Doerr, Benjamin and Lengler, Johannes and Steurer, David},
TITLE = {The interval liar game},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {318-327},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_33},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cordasco-Gargano/06,
AUTHOR = {Cordasco, Gennaro and Gargano, Luisa},
TITLE = {How much independent should individual contacts be to form a small-world?},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {328-338},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_34},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cicalese-Manne-Xin/06,
AUTHOR = {Cicalese, Ferdinando and Manne, Fredrik and Xin, Qin},
TITLE = {Faster centralized communication in radio networks},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {339-348},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_35},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Elsasser-Sauerwald/06,
AUTHOR = {Els{\"a}sser, Robert and Sauerwald, Thomas},
TITLE = {On the runtime and robustness of randomized broadcasting},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {349-358},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_36},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Sudholt/06,
AUTHOR = {Sudholt, Dirk},
TITLE = {Local search in evolutionary algorithms: The impact of the local search frequency},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {359-368},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_37},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hoefer/06a,
AUTHOR = {Hoefer, Martin},
TITLE = {Non-cooperative facility location and covering games},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {369-378},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_38},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bhattacharya-Hu-Shi-Tamir/06,
AUTHOR = {Bhattacharya, Binay and Hu, Yuzhuang and Shi, Qiaosheng and Tamir, Arie},
TITLE = {Optimal algorithms for the path/tree-shaped facility location problems in trees},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {379-388},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_39},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Tsaggouris-Zaroliagis/06,
AUTHOR = {Tsaggouris, George and Zaroliagis, Christos},
TITLE = {Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {389-398},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_40},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Rahman-Iliopoulos/06,
AUTHOR = {Rahman, M. Sohel and Iliopoulos, Costas S.},
TITLE = {Algorithms for computing variants of the longest common subsequence problem},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {399-408},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_41},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Korman-Peleg-Rodeh/06,
AUTHOR = {Korman, Amos and Peleg, David and Rodeh, Yoav},
TITLE = {Constructing labeling schemes through universal matrices},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {409-418},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_42},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Heggernes-Mancini-Papadopoulos/06,
AUTHOR = {Heggernes, Pinar and Mancini, Federico and Papadopoulos, Charis},
TITLE = {Making arbitrary graphs transitively orientable: Minimal comparability completions},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {419-428},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_43},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Meyerhenke-Sauerwald/06,
AUTHOR = {Meyerhenke, Henning and Sauerwald, Thomas},
TITLE = {Analyzing disturbed diffusion on networks},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {429-438},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_44},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Liu-Song/06,
AUTHOR = {Liu, Chunmei and Song, Yinglei},
TITLE = {Exact algorithms for finding the minimum independent dominating set in graphs},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {439-448},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_45},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Arvind-Das-Mukhopadhyay/06a,
AUTHOR = {Arvind, V. and Das, Bireswar and Mukhopadhyay, Partha},
TITLE = {On isomorphism and canonization of tournaments and hypertournaments},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {449-459},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_46},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lin-Lee/06,
AUTHOR = {Lin, Tien-Ching and Lee, D.T.},
TITLE = {Efficient algorithms for the sum selection problem and $k$ maximum sums problem},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {460-473},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_47},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Doerr-Friedrich/06,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias},
TITLE = {Deterministic random walks on the two-dimensional grid},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {474-483},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_48},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Maruyama-Miyagawa-Sakamoto/06,
AUTHOR = {Maruyama, Shirou and Miyagawa, Hiromitsu and Sakamoto, Hiroshi},
TITLE = {Improving time and space complexity for compressed pattern matching},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {484-493},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_49},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Zhou/06,
AUTHOR = {Zhou, Yunhong},
TITLE = {Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {494-506},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_50},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Onsjo-Watanabe/06,
AUTHOR = {Onsj{\"o}, Mikael and Watanabe, Osamu},
TITLE = {A simple message passing algorithm for graph partitioning problems},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {507-516},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_51},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Suchan-Todinca/06,
AUTHOR = {Suchan, Karol and Todinca, Ioan},
TITLE = {Minimal interval completion through graph exploration},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {517-526},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_52},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Diaz-Grandoni-Spaccamela/06,
AUTHOR = {Diaz, Josep and Grandoni, Fabrizio and Spaccamela, Alberto Marchetti},
TITLE = {Balanced cut approximation in random geometric graphs},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {527-536},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_53},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lin-Yu-Wang/06,
AUTHOR = {Lin, Tzu-Chin and Yu, Hung-I and Wang, Biing-Feng},
TITLE = {Improved algorithms for the minmax-regret 1-center problem},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {537-546},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_54},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Fleischer-Li-Xie-Zhu/06,
AUTHOR = {Chen, Danny Z. and Fleischer, Rudolf and Li, Jian and Xie, Zhiyi and Zhu, Hong},
TITLE = {On approximating the maximum simple sharing problem},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {547-556},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_55},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kowalik/06a,
AUTHOR = {Kowalik, {\L}ukasz},
TITLE = {Approximation scheme for lowest outdegree orientation and graph density measures},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {557-566},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_56},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lin-Yang-Xu/06a,
AUTHOR = {Lin, Mingen and Yang, Yang and Xu, Jinhui},
TITLE = {Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {567-577},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_57},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Proietti-Widmayer/06,
AUTHOR = {Proietti, Guido and Widmayer, Peter},
TITLE = {Partitioning the nodes of a graph to minimize the sum of subgraph radii},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {578-587},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_58},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Shannigrahi-Pal/06,
AUTHOR = {Shannigrahi, Saswata and Pal, Sudebkumar Prasant},
TITLE = {Efficient Pr{\"u}fer-like coding and counting labelled hypertrees},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {588-597},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_59},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kneis-Molle-Richter-Rossmanith/06b,
AUTHOR = {Kneis, Joachim and M{\"o}lle, Daniel and Richter, Stefan and Rossmanith, Peter},
TITLE = {Intuitive algorithms and $t$-vertex cover},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {598-607},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_60},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Scott-Stege-Zeh/06,
AUTHOR = {Scott, Allan E. and Stege, Ulrike and Zeh, Norbert},
TITLE = {Politician's firefighting},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {608-617},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_61},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Neumann-Witt/06,
AUTHOR = {Neumann, Frank and Witt, Carsten},
TITLE = {Runtime analysis of a simple ant colony optimization algorithm},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {618-627},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_62},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ambainis-Gasarch-Srinivasan-Utis/06,
AUTHOR = {Ambainis, Andris and Gasarch, William and Srinivasan, Aravind and Utis, Andrey},
TITLE = {Lower bounds on the deterministic and quantum communication complexities of Hamming-distance problems},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {628-637},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_63},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hoyer-Mhalla-Perdrix/06,
AUTHOR = {H{\o}yer, Peter and Mhalla, Mehdi and Perdrix, Simon},
TITLE = {Resources required for preparing graph states},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {638-649},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_64},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ruhrup-Schindelhauer/06,
AUTHOR = {R{\"u}hrup, Stefan and Schindelhauer, Christian},
TITLE = {Online multi-path routing in a maze},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {650-659},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_65},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ma-Wang/06,
AUTHOR = {Ma, Weimin and Wang, Ke},
TITLE = {On the on-line $k$-truck problem with benefit maximization},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {660-669},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_66},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Briest-Gunia/06,
AUTHOR = {Briest, Patrick and Gunia, Christian},
TITLE = {Energy-efficient broadcast scheduling for speed-controlled transmission channels},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {670-679},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_67},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Aly-Augustine/06,
AUTHOR = {Aly, Mohamed and Augustine, John},
TITLE = {Online packet admission and oblivious routing in sensor networks},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {680-689},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_68},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Wang/06,
AUTHOR = {Chen, Danny Z. and Wang, Chao},
TITLE = {Field splitting problems in intensity-modulated radiation therapy},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {690-700},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_69},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Hu-Luan-Misiolek-Wang/06,
AUTHOR = {Chen, Danny Z. and Hu, Xiaobo S. and Luan, Shuang and Misio{\l}ek, Ewa and Wang, Chao},
TITLE = {Shape rectangularization problems in intensity-modulated radiation therapy},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {701-711},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_70},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Paluch/06,
AUTHOR = {Paluch, Katarzyna},
TITLE = {A new approximation algorithm for multidimensional rectangle tiling},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {712-721},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_71},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dillard-Natarajan-Weber-Pascucci-Hamann/06,
AUTHOR = {Dillard, Scott E. and Natarajan, Vijay and Weber, Gunther H. and Pascucci, Valerio and Hamann, Bernd},
TITLE = {Tessellation of quadratic elements},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {722-731},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_72},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Das-Flocchini-Nayak-Santoro/06,
AUTHOR = {Das, Shantanu and Flocchini, Paola and Nayak, Amiya and Santoro, Nicola},
TITLE = {Effective elections for anonymous mobile agents},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {732-743},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_73},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Klasing-Markou-Pelc/06,
AUTHOR = {Klasing, Ralf and Markou, Euripides and Pelc, Andrzej},
TITLE = {Gathering asynchronous oblivious mobile robots in a ring},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {744-753},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_74},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hundt-Liskiewicz-Wolfel/06,
AUTHOR = {Hundt, Christian and Li{\'s}kiewicz, Maciej and W{\"o}lfel, Ulrich},
TITLE = {Provably secure steganography and the complexity of sampling},
BOOKTITLE = {Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'2006 (Kolkata, India, December 18-20, 2006)},
SERIES = {LNCS},
VOLUME = {4288},
PAGES = {754-763},
YEAR = {2006},
EDITOR = {Asano, Tetsuo},
URL = {http://dx.doi.org/10.1007/11940128_75},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}