18. ISAAC 2007: Sendai, Japan

Invited Talk

• Pankaj K. Agarwal:
  Modeling and Analyzing Massive Terrain Data Sets. 1
  
• Zdenek Dvorak, Daniel Král, Robin Thomas:
  Coloring Triangle-Free Graphs on Surfaces. 2-4
  

Best Paper Award Presentation

• M. Ziaur Rahman, J. Ian Munro:
  Integer Representation and Counting in the Bit Probe Model. 5-16
  

Graph Algorithms I

• Hiroshi Nagamochi:
  Minimum Degree Orderings. 17-28
  
• Toshimasa Ishii:
  Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. 29-40
  
• Emeric Gioan, Christophe Paul:
  Dynamic Distance Hereditary Graphs Using Split Decomposition. 41-51
  
• Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
  Unifying Two Graph Decompositions with Modular Decomposition. 52-64
  

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
  
• Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh:
  Geometric Spanner of Segments. 75-87
  
• Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
  Dilation-Optimal Edge Deletion in Polygonal Cycles. 88-99
  

Complexity I

• Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
  Unbounded-Error Classical and Quantum Communication Complexity. 100-111
  
• Masaki Yamamoto:
  A Spectral Method for MAX2SAT in the Planted Solution Model. 112-123
  
• Uffe Flarup, Pascal Koiran, Laurent Lyaudet:
  On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices. 124-136
  
• Rahul Tripathi:
  The 1-Versus-2 Queries Problem Revisited. 137-147
  

Graph Drawing

• Petr Hlinený, Gelasio Salazar:
  Approximating the Crossing Number of Toroidal Graphs. 148-159
  
• Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen:
  Width-Optimal Visibility Representations of Plane Graphs. 160-171
  
• Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis:
  Computing Upward Topological Book Embeddings of Upward Planar Digraphs. 172-183
  
• Markus Chimani, Carsten Gutwenger:
  Algorithms for the Hypergraph and the Minor Crossing Number Problems. 184-195
  

Distributed Algorithms

• Thomas Sauerwald:
  On Mixing and Edge Expansion Properties in Randomized Broadcasting. 196-207
  
• 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
  
• Artur Czumaj, Xin Wang:
  Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. 220-231
  
• Martin Farach-Colton, Miguel A. Mosteiro:
  Sensor Network Gossiping or How to Break the Broadcast Lower Bound. 232-243
  
• Darin Goldstein, Kojiro Kobayashi:
  On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem. 244-255
  

Optimization I

• Mong-Jen Kao, Chung-Shou Liao:
  Capacitated Domination Problem. 256-267
  
• 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
  
• Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick:
  New Bounds for the Nearly Equitable Edge Coloring Problem. 280-291
  
• Ehab Morsy, Hiroshi Nagamochi:
  Approximation to the Minimum Cost Edge Installation Problem. 292-303
  
• Zachary Friggstad, Mohammad R. Salavatipour:
  Approximability of Packing Disjoint Cycles. 304-315
  

Data Structure I

• Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro:
  Succinct Representation of Labeled Graphs. 316-328
  
• Mordecai J. Golin, Jian Li:
  More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. 329-340
  
• Stephane Durocher, Christophe Paul:
  Kinetic Maintenance of Mobile k-Centres on Trees. 341-352
  
• Michael T. Goodrich, Jonathan Z. Sun:
  Checking Value-Sensitive Data Structures in Sublinear Space. 353-364
  

Game Theory

• Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer:
  Manipulation in Games. 365-376
  
• Chien-Chung Huang, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
  Using Nash Implementation to Achieve Better Frugality Ratios. 377-389
  
• Vittorio Bilò:
  The Price of Nash Equilibria in Multicast Transmissions Games. 390-401
  

Database Applications

• Takeaki Uno:
  An Efficient Algorithm for Enumerating Pseudo Cliques. 402-414
  
• Samuel Guilbault, Andrzej Pelc:
  Fast Adaptive Diagnosis with a Minimum Number of Tests. 415-426
  
• Jiang Chen, Ke Yi:
  Dynamic Structures for Top- k Queries on Uncertain Data. 427-438
  
• Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou:
  Separating Populations with Wide Data: A Spectral Analysis. 439-451
  

Online Algorithms

• Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
  A Constant-Competitive Algorithm for Online OVSF Code Assignment. 452-463
  
• Deepak Ajwani, Tobias Friedrich:
  Average-Case Analysis of Online Topological Ordering. 464-475
  
• Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong:
  Energy Efficient Deadline Scheduling in Two Processor Systems. 476-487
  
• Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
  On the Relative Dominance of Paging Algorithms. 488-499
  

I/O Algorithms

• Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
  I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. 500-511
  
• Eric Y. Chen:
  Geometric Streaming Algorithms with a Sorting Primitive. 512-524
  
• Yakov Nekrich:
  External Memory Range Reporting on a Grid. 525-535
  
• Micha Streppel, Ke Yi:
  Approximate Range Searching in External Memory. 536-548
  

Networks

• Qin Xin:
  Faster Treasure Hunt and Better Strongly Universal Exploration Sequences. 549-560
  
• Omid Amini, Stéphane Pérennes, Ignasi Sau:
  Hardness and Approximation of Traffic Grooming. 561-573
  
• David Barbella, George Kachergis, David Liben-Nowell, Anna Sallstrom, Ben Sowell:
  Depth of Field and Cautious-Greedy Routing in Social Networks. 574-586
  
• Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer:
  Locating Facilities on a Network to Minimize Their Average Service Radius. 587-598
  

Optimization II

• Anna Urbanska:
  Faster Combinatorial Algorithms for Determinant and Pfaffian. 599-608
  
• Yoshio Okamoto, Takeaki Uno:
  A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. 609-620
  
• Hannes Moser, Venkatesh Raman, Somnath Sikdar:
  The Parameterized Complexity of the Unique Coverage Problem. 621-631
  
• Tommy Färnqvist, Peter Jonsson:
  Bounded Tree-Width and CSP-Related Problems. 632-643
  

Computational Geometry II

• Paz Carmi, Matthew J. Katz, Nissan Lev-Tov:
  Covering Points by Unit Disks of Fixed Location. 644-655
  
• Magdalene G. Borgelt, Marc J. van Kreveld, Jun Luo:
  Geodesic Disks and Clustering in a Simple Polygon. 656-667
  
• Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
  An O ( n ²log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. 668-680
  
• Boris Aronov, Tetsuo Asano, Stefan Funke:
  Optimal Triangulation with Steiner Points. 681-691
  

Geometric Applications

• Xiaodong Wu, Xin Dou, John E. Bayouth, John M. Buatti:
  New Algorithm for Field Splitting in Radiation Therapy. 692-703
  
• Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui:
  In-Place Algorithm for Image Rotation. 704-715
  
• Evanthia Papadopoulou:
  Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction. 716-727
  

Data Structures II

• Cyril Gavoille, Arnaud Labourel:
  Distributed Relationship Schemes for Trees. 728-738
  
• Philip Bille, Anna Pagh, Rasmus Pagh:
  Fast Evaluation of Union-Intersection Expressions. 739-750
  
• Sung Eun Bae, Tadao Takaoka:
  A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem. 751-762
  

Computational Geometry III

• Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle:
  Compressing Spatio-temporal Trajectories. 763-775
  
• Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle:
  Finding Popular Places. 776-787
  
• 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
  

Complexity II

• Vikraman Arvind, Partha Mukhopadhyay:
  The Monomial Ideal Membership Problem and Polynomial Identity Testing. 800-811
  
• Satoshi Tayu, Shigeru Ito, Shuichi Ueno:
  On the Fault Testing for Reversible Circuits. 812-821
  
• Vikraman Arvind, Bireswar Das, Johannes Köbler:
  The Space Complexity of k -Tree Isomorphism. 822-833
  

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
  
• Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Siu-Ming Yiu:
  Space Efficient Indexes for String Matching with Don't Cares. 846-857
  
• Ferdinando Cicalese, José Augusto Amgarten Quitzau:
  2-Stage Fault Tolerant Interval Group Testing. 858-868
  
• Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur:
  Approximate String Matching with Swap and Mismatch. 869-880
  

Graph Algorithms II

• Federico Mancini:
  Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs. 881-892
  
• Emgad H. Bachoore, Hans L. Bodlaender:
  Weighted Treewidth Algorithmic Techniques and Results. 893-903
  
• Emanuele G. Fusco, Angelo Monti:
  Spanning Trees with Many Leaves in Regular Bipartite Graphs. 904-914
  
• Jiong Guo:
  Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. 915-926
  

Last update Sat May 18 19:04:48 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page