@incollection{Eppstein/10a,
AUTHOR = {Eppstein, David},
TITLE = {Regular labelings and geometric structures},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {1-1},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/g83527h670n60702/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Franklin/10,
AUTHOR = {Franklin, Matt},
TITLE = {Algorithmic aspects of secure computation and communication},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {2-2},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/932h43u463854331/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Karpinski-Schudy/10,
AUTHOR = {Karpinski, Marek and Schudy, Warren},
TITLE = {Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {3-14},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/g4hx353821760480/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Berman-Karpinski-Zelikovsky/10,
AUTHOR = {Berman, Piotr and Karpinski, Marek and Zelikovsky, Alexander},
TITLE = {A 3/2-approximation algorithm for Generalized Steiner Trees in complete graphs with edge lengths 1 and 2},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {15-24},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/9010317764kh0248/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Amir-Eisenberg-Levy/10,
AUTHOR = {Amir, Amihood and Eisenberg, Estrella and Levy, Avivit},
TITLE = {Approximate periodicity},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {25-36},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/26222327780w24m7/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cheng-Knauer-Langerman-Smid/10,
AUTHOR = {Cheng, Siu-Wing and Knauer, Christian and Langerman, Stefan and Smid, Michiel},
TITLE = {Approximating the average stretch factor of geometric graphs},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {37-48},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/1242h3562t46j0m3/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Liang-He/10,
AUTHOR = {Liang, Hongyu and He, Jing},
TITLE = {Satisfiability with index dependency},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {49-60},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/a8485140k5063wk2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cheung-Mamoulis-Wong-Yiu-Zhang/10,
AUTHOR = {Cheung, David W. and Mamoulis, Nikos and Wong, W.K. and Yiu, S.M. and Zhang, Ye},
TITLE = {Anonymous fuzzy identity-based encryption for similarity search},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {61-72},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/j756u04425830n17/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Iwama-Seto-Takai-Tamaki/10,
AUTHOR = {Iwama, Kazuo and Seto, Kazuhisa and Takai, Tadashi and Tamaki, Suguru},
TITLE = {Improved randomized algorithms for 3-SAT},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {73-84},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/351w31366j712411/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Iwama-Nishimura-Raymond-Teruyama/10,
AUTHOR = {Iwama, Kazuo and Nishimura, Harumichi and Raymond, Rudy and Teruyama, Junichi},
TITLE = {Quantum counterfeit coin problems},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {85-96},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/u0135h03741m2w57/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Goodrich-Strash/10,
AUTHOR = {Goodrich, Michael T. and Strash, Darren},
TITLE = {Priority range trees},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {97-108},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/c62774t402n4q58h/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bose-Douieb/10,
AUTHOR = {Bose, Prosenjit and Dou{\"{i}}eb, Karim},
TITLE = {Should static search trees ever be unbalanced?},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {109-120},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/du38580425v0mn42/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Miyamoto-Uno-Kubo/10,
AUTHOR = {Miyamoto, Yuichiro and Uno, Takeaki and Kubo, Mikio},
TITLE = {Levelwise mesh sparsification for shortest path queries},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {121-132},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/wv052j731062q277/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Brodnik-Iacono/10,
AUTHOR = {Brodnik, Andrej and Iacono, John},
TITLE = {Unit-time predecessor queries on massive data sets},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {133-144},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/542250p5w5u0534w/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kavitha-Nasre-Nimbhorkar/10,
AUTHOR = {Kavitha, Telikepalli and Nasre, Meghana and Nimbhorkar, Prajakta},
TITLE = {Popularity at minimum cost},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {145-156},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/f76r24075h722739/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Jirasek-Klavik/10,
AUTHOR = {Jir{\'a}sek, Jozef and Klav{\'{i}}k, Pavel},
TITLE = {Structural and complexity aspects of line systems of graphs},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {157-168},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/6331217845864141/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Shioura/10,
AUTHOR = {Shioura, Akiyoshi},
TITLE = {Neighbor systems, jump systems, and bisubmodular polyhedra},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {169-181},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/n03q311648414883/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Zhuang-Nagamochi/10a,
AUTHOR = {Zhuang, Bingbing and Nagamochi, Hiroshi},
TITLE = {Generating trees on multisets},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {182-193},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/pwn8379v1260kl5l/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Limouzy/10,
AUTHOR = {Limouzy, Vincent},
TITLE = {Seidel minor, permutation graphs and combinatorial properties},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {194-205},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/g7667t0334747031/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Jampani-Lubiw/10,
AUTHOR = {Jampani, Krishnam Raju and Lubiw, Anna},
TITLE = {Simultaneous interval graphs},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {206-217},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/f805226033658h7k/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Li-Zhang/10a,
AUTHOR = {Li, Angsheng and Zhang, Peng},
TITLE = {Unbalanced graph partitioning},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {218-229},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/16r7m541228g3827/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Mertzios-Zaks/10,
AUTHOR = {Mertzios, George B. and Zaks, Shmuel},
TITLE = {On the intersection of tolerance and cocomparability graphs},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {230-240},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/9821672u116671ln/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chambers-Eppstein/10,
AUTHOR = {Chambers, Erin and Eppstein, David},
TITLE = {Flows in one-crossing-minor-free graphs},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {241-252},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/035677l27k0534q7/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cai-Huang-Lu/10,
AUTHOR = {Cai, Jin-Yi and Huang, Sangxia and Lu, Pinyan},
TITLE = {From Holant to \#CSP and back: Dichotomy for Holant$^c$ problems},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {253-265},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/2373g423718j78hw/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Giesbrecht-Roche-Tilak/10,
AUTHOR = {Giesbrecht, Mark and Roche, Daniel S. and Tilak, Hrushikesh},
TITLE = {Computing sparse multiples of polynomials},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {266-278},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/a156034835613ql2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Duchier-Durand-Lose-Senot/10,
AUTHOR = {Duchier, Denys and Durand-Lose, J{\'e}r{\^o}me and Senot, Maxime},
TITLE = {Fractal parallelism: Solving SAT in bounded space and time},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {279-290},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/3h48210140w012g7/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Feree-Hainry-Hoyrup-Pechoux/10,
AUTHOR = {F{\'e}r{\'e}e, Hugo and Hainry, Emmanuel and Hoyrup, Mathieu and P{\'e}choux, Romain},
TITLE = {Interpretation of stream programs: Characterizing type 2 polynomial time complexity},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {291-303},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/k70l061281632783/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Amano/10a,
AUTHOR = {Amano, Kazuyuki},
TITLE = {New upper bounds on the average PTF density of Boolean functions},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {304-315},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/j41709t08j316135/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Carmi-Smid/10,
AUTHOR = {Carmi, Paz and Smid, Michiel},
TITLE = {An optimal algorithm for computing angle-constrained spanners},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {316-327},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/1656g4k046156764/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Xu-Xu-Xie/10,
AUTHOR = {Xu, Jinhui and Xu, Lei and Xie, Yulai},
TITLE = {Approximating minimum bending energy path in a simple corridor},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {328-339},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/r65l3j1004891862/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Sudholt-Zarges/10,
AUTHOR = {Sudholt, Dirk and Zarges, Christine},
TITLE = {Analysis of an iterated local search algorithm for vertex coloring},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {340-352},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/a75u8q7470850111/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bampis-Kononov-Lucarelli-Milis/10,
AUTHOR = {Bampis, Evripidis and Kononov, Alexander and Lucarelli, Giorgio and Milis, Ioannis},
TITLE = {Bounded max-colorings of graphs},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {353-365},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/t526r33k58k463u1/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Adiga-Chitnis-Saurabh/10,
AUTHOR = {Adiga, Abhijin and Chitnis, Rajesh and Saurabh, Saket},
TITLE = {Parameterized algorithms for boxicity},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {366-377},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/l74041086246433u/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Nichterlein-Niedermeier-Uhlmann-Weller/10,
AUTHOR = {Nichterlein, Andr{\'e} and Niedermeier, Rolf and Uhlmann, Johannes and Weller, Mathias},
TITLE = {On tractable cases of target set selection},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {378-389},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/d87137t141h63716/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Brankovic-Fernau/10,
AUTHOR = {Brankovic, Ljiljana and Fernau, Henning},
TITLE = {Combining two worlds: Parameterised approximation for vertex cover},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {390-402},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/55034504762u11hl/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Eppstein-Loffler-Strash/10,
AUTHOR = {Eppstein, David and L{\"o}ffler, Maarten and Strash, Darren},
TITLE = {Listing all maximal cliques in sparse graphs in near-optimal time},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {403-414},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/650317j4jn76x1v7/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hansen-Zwick/10,
AUTHOR = {Hansen, Thomas Dueholm and Zwick, Uri},
TITLE = {Lower bounds for Howard's algorithm for finding minimum mean-cost cycles},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {415-426},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/n17x60714q1q1141/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bomze-Chimani-Junger-Ljubic-Mutzel-Zey/10,
AUTHOR = {Bomze, Immanuel and Chimani, Markus and J{\"u}nger, Michael and Ljubi{\'c}, Ivana and Mutzel, Petra and Zey, Bernd},
TITLE = {Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {427-439},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/74n3181l41202406/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Spoerhase/10,
AUTHOR = {Spoerhase, Joachim},
TITLE = {An optimal algorithm for single maximum coverage location on trees and related problems},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {440-450},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/04350537714hx713/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Babenko/10,
AUTHOR = {Babenko, Maxim A.},
TITLE = {A faster algorithm for the maximum even factor problem},
BOOKTITLE = {Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'2010, Part I (Jeju Island, Korea, December 15-17, 2010)},
SERIES = {LNCS},
VOLUME = {6506},
PAGES = {451-462},
YEAR = {2010},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
URL = {http://springerlink.metapress.com/content/e3050765j1416hr1/fulltext.pdf" title="Download PDF (213.5 KB)"><span>Download PDF (213.5 KB)</span></a></li> 	</ul></li><li class="primitive primitiveResource Backmatter"><p class="title">Back matter</p><ul class="resources fulltextResources" data-ftxUrl="/content/978-3-642-17516-9/#section=828634"> 		<li><a class="sprite pdf-resource-spritehttp://springerlink.metapress.com/content/978-3-642-17516-9/back-matter.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}