18. ISAAC 2007:
Sendai,
Japan
Takeshi Tokuyama (Ed.):
Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings.
Lecture Notes in Computer Science 4835 Springer 2007, ISBN 978-3-540-77118-0 BibTeX
Invited Talk
Best Paper Award Presentation
Graph Algorithms I
Computational Geometry I
- Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin:
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.
65-74
Electronic Edition (link) BibTeX
- Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh:
Geometric Spanner of Segments.
75-87
Electronic Edition (link) BibTeX
- Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles.
88-99
Electronic Edition (link) BibTeX
Complexity I
Graph Drawing
Distributed Algorithms
- Thomas Sauerwald:
On Mixing and Edge Expansion Properties in Randomized Broadcasting.
196-207
Electronic Edition (link) BibTeX
- Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer:
Linear Reconfiguration of Cube-Style Modular Robots.
208-219
Electronic Edition (link) BibTeX
- Artur Czumaj, Xin Wang:
Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks.
220-231
Electronic Edition (link) BibTeX
- Martin Farach-Colton, Miguel A. Mosteiro:
Sensor Network Gossiping or How to Break the Broadcast Lower Bound.
232-243
Electronic Edition (link) BibTeX
- Darin Goldstein, Kojiro Kobayashi:
On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem.
244-255
Electronic Edition (link) BibTeX
Optimization I
- Mong-Jen Kao, Chung-Shou Liao:
Capacitated Domination Problem.
256-267
Electronic Edition (link) BibTeX
- Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian:
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.
268-279
Electronic Edition (link) BibTeX
- Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick:
New Bounds for the Nearly Equitable Edge Coloring Problem.
280-291
Electronic Edition (link) BibTeX
- Ehab Morsy, Hiroshi Nagamochi:
Approximation to the Minimum Cost Edge Installation Problem.
292-303
Electronic Edition (link) BibTeX
- Zachary Friggstad, Mohammad R. Salavatipour:
Approximability of Packing Disjoint Cycles.
304-315
Electronic Edition (link) BibTeX
Data Structure I
Game Theory
Database Applications
Online Algorithms
I/O Algorithms
Networks
- Qin Xin:
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences.
549-560
Electronic Edition (link) BibTeX
- Omid Amini, Stéphane Pérennes, Ignasi Sau:
Hardness and Approximation of Traffic Grooming.
561-573
Electronic Edition (link) BibTeX
- David Barbella, George Kachergis, David Liben-Nowell, Anna Sallstrom, Ben Sowell:
Depth of Field and Cautious-Greedy Routing in Social Networks.
574-586
Electronic Edition (link) BibTeX
- Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer:
Locating Facilities on a Network to Minimize Their Average Service Radius.
587-598
Electronic Edition (link) BibTeX
Optimization II
Computational Geometry II
Geometric Applications
Data Structures II
Computational Geometry III
- Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle:
Compressing Spatio-temporal Trajectories.
763-775
Electronic Edition (link) BibTeX
- Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle:
Finding Popular Places.
776-787
Electronic Edition (link) BibTeX
- Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa:
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.
788-799
Electronic Edition (link) BibTeX
Complexity II
String
- Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis.
834-845
Electronic Edition (link) BibTeX
- Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Siu-Ming Yiu:
Space Efficient Indexes for String Matching with Don't Cares.
846-857
Electronic Edition (link) BibTeX
- Ferdinando Cicalese, José Augusto Amgarten Quitzau:
2-Stage Fault Tolerant Interval Group Testing.
858-868
Electronic Edition (link) BibTeX
- Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur:
Approximate String Matching with Swap and Mismatch.
869-880
Electronic Edition (link) BibTeX
Graph Algorithms II
Copyright © Sat May 16 23:24:48 2009
by Michael Ley (ley@uni-trier.de)