ISAAC (2)

Keyphrases

Publications

2010

Pinar Heggernes, Daniel Meister, Yngve Villanger
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) (2010)
Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon
Plane. ISAAC (2) (2010)
Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher
Maximum Overlap of Convex Polytopes under Translation. ISAAC (2) (2010)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
On Greedy Algorithms for Decision Trees. ISAAC (2) (2010)
Siu-Wing Cheng, Jiongxin Jin, Antoine Vigneron, Yajun Wang
Approximate Shortest Homotopic Paths in Weighted Regions. ISAAC (2) (2010)
Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin Han, Hing-Fung Ting, Yung H. Tsin
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing. ISAAC (2) (2010)
Minghui Jiang
Approximability of Constrained LCS. ISAAC (2) (2010)
Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) (2010)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
)-total Labeling Problem for Trees. ISAAC (2) (2010)
Arash Farzan, Travis Gagie, Gonzalo Navarro
Entropy-Bounded Representation of Point Grids. ISAAC (2) (2010)
Sebastian Stiller, Andreas Wiese
Increasing Speed Scheduling and Flow Scheduling. ISAAC (2) (2010)
Clemens Thielen, Stephan Westphal
Approximating the Traveling Tournament Problem with Maximum Tour Length 2. ISAAC (2) (2010)
Qian-Ping Gu, Hisao Tamaki
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ISAAC (2) (2010)
Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw
Testing Simultaneous Planarity When the Common Graph Is 2-Connected. ISAAC (2) (2010)
Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) (2010)
Britta Peis, Sebastian Stiller, Andreas Wiese
Policies for Periodic Packet Routing. ISAAC (2) (2010)
Matthew J. Patitz, Scott M. Summers
Identifying Shapes Using Self-assembly - (Extended Abstract). ISAAC (2) (2010)
Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
Alphabet Partitioning for Compressed Rank/Select and Applications. ISAAC (2) (2010)
Anna Adamaszek, Alexandru Popa
-coloring Problem. ISAAC (2) (2010)
Binay K. Bhattacharya, Yuzhuang Hu
Approximation Algorithms for the Multi-Vehicle Scheduling Problem. ISAAC (2) (2010)
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, Jean-Louis Roch, Julien Bernard
A Tighter Analysis of Work Stealing. ISAAC (2) (2010)
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis
-Tree: A New Overlay with Deterministic Bounds. ISAAC (2) (2010)
Sun-Yuan Hsieh, Chun-An Chen
)-Diagnosability of Component-Composition Graphs and Its Application. ISAAC (2) (2010)
Henning Meyerhenke
Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization. ISAAC (2) (2010)
Amr Elmasry
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs. ISAAC (2) (2010)
Yakov Nekrich
Dynamic Range Reporting in External Memory. ISAAC (2) (2010)
John Augustine, Nick Gravin
On the Continuous CNN Problem. ISAAC (2) (2010)
Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer
/2-Angle Yao Graphs Are Spanners. ISAAC (2) (2010)
Juraj Stacho
3-Colouring AT-Free Graphs in Polynomial Time. ISAAC (2) (2010)
Sang Won Bae, Chan-Su Shin
The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract). ISAAC (2) (2010)
Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki
-cyclic Orientations of Graphs. ISAAC (2) (2010)
Weiwei Wu, Wanyong Tian, Minming Li, Chun Jason Xue, Enhong Chen
Single and Multiple Device DSA Problem, Complexities and Online Algorithms. ISAAC (2) (2010)
Chih-Chiang Yu, Biing-Feng Wang, Chung-Chin Kuo
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets. ISAAC (2) (2010)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
On Coloring Graphs without Induced Forests. ISAAC (2) (2010)
Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
Identifying Approximate Palindromes in Run-Length Encoded Strings. ISAAC (2) (2010)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) (2010)
Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen
A Cache-Oblivious Implicit Dictionary with the Working Set Property. ISAAC (2) (2010)
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman
On the Approximability of the Maximum Interval Constrained Coloring Problem. ISAAC (2) (2010)
Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides
Connectivity Graphs of Uncertainty Regions. ISAAC (2) (2010)

volume 6507, 2010

Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II ISAAC (2) 6507 (2010)