ISAAC B

76 papers

YearTitle / Authors
2006A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees.
Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
2006A New Approximation Algorithm for Multidimensional Rectangle Tiling.
Katarzyna E. Paluch
2006A Simple Message Passing Algorithm for Graph Partitioning Problems.
Mikael Onsjö, Osamu Watanabe
2006Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
2006Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
Tetsuo Asano
2006Algorithms for Computing Variants of the Longest Common Subsequence Problem.
M. Sohel Rahman, Costas S. Iliopoulos
2006Algorithms on Graphs with Small Dominating Targets.
Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta
2006Analyzing Disturbed Diffusion on Networks.
Henning Meyerhenke, Thomas Sauerwald
2006Approximability of Partitioning Graphs with Supply and Demand.
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
2006Approximating Tree Edit Distance Through String Edit Distance.
Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu
2006Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures.
Lukasz Kowalik
2006Balanced Cut Approximation in Random Geometric Graphs.
Josep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela
2006Branching and Treewidth Based Exact Algorithms.
Fedor V. Fomin, Serge Gaspers, Saket Saurabh
2006Constructing Labeling Schemes Through Universal Matrices.
Amos Korman, David Peleg, Yoav Rodeh
2006Convex Grid Drawings of Plane Graphs with Rectangular Contours.
Akira Kamada, Kazuyuki Miura, Takao Nishizeki
2006Delaunay Meshing of Surfaces.
Tamal K. Dey
2006Deterministic Random Walks on the Two-Dimensional Grid.
Benjamin Doerr, Tobias Friedrich
2006Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees.
Tobias Lenz
2006Diamond Triangulations Contain Spanners of Bounded Degree.
Prosenjit Bose, Michiel H. M. Smid, Daming Xu
2006Effective Elections for Anonymous Mobile Agents.
Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro
2006Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems.
Telikepalli Kavitha, Chintan D. Shah
2006Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications.
Xiaodong Wu
2006Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem.
Tien-Ching Lin, D. T. Lee
2006Efficient Prüfer-Like Coding and Counting Labelled Hypertrees.
Saswata Shannigrahi, Sudebkumar Prasant Pal
2006Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.
Patrick Briest, Christian Gunia
2006Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs.
Chunmei Liu, Yinglei Song
2006Faster Centralized Communication in Radio Networks.
Ferdinando Cicalese, Fredrik Manne, Qin Xin
2006Field Splitting Problems in Intensity-Modulated Radiation Therapy.
Danny Z. Chen, Chao Wang
2006Finite-State Online Algorithms and Their Automated Competitive Analysis.
Takashi Horiyama, Kazuo Iwama, Jun Kawahara
2006Flexible Word Design and Graph Labeling.
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
2006Frequency Allocation Problems for Linear Cellular Networks.
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu
2006Gathering Asynchronous Oblivious Mobile Robots in a Ring.
Ralf Klasing, Euripides Markou, Andrzej Pelc
2006How Much Independent Should Individual Contacts Be to Form a Small-World?
Gennaro Cordasco, Luisa Gargano
2006Improved Algorithms for the Minmax-Regret 1-Center Problem.
Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang
2006Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems.
Mingen Lin, Yang Yang, Jinhui Xu
2006Improved Approximation for Single-Sink Buy-at-Bulk.
Fabrizio Grandoni, Giuseppe F. Italiano
2006Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems.
Yunhong Zhou
2006Improving Time and Space Complexity for Compressed Pattern Matching.
Shirou Maruyama, Hiromitsu Miyagawa, Hiroshi Sakamoto
2006Intuitive Algorithms and t-Vertex Cover.
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2006Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete.
Michael Krüger, Harald Hempel
2006Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency.
Dirk Sudholt
2006Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems.
Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
2006Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions.
Pinar Heggernes, Federico Mancini, Charis Papadopoulos
2006Minimal Interval Completion Through Graph Exploration.
Karol Suchan, Ioan Todinca
2006Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications.
George Tsaggouris, Christos D. Zaroliagis
2006Negation-Limited Complexity of Parity and Inverters.
Kazuo Iwama, Hiroki Morizumi, Jun Tarui
2006Non-cooperative Facility Location and Covering Games.
Martin Hoefer
2006Offline Sorting Buffers on Line.
Rohit Khandekar, Vinayaka Pandit
2006On 2-Query Codeword Testing with Near-Perfect Completeness.
Venkatesan Guruswami
2006On Approximating the Maximum Simple Sharing Problem.
Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu
2006On Approximating the TSP with Intersecting Neighborhoods.
Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters
2006On Estimating Path Aggregates over Streaming Graphs.
Sumit Ganguly, Barna Saha
2006On Isomorphism and Canonization of Tournaments and Hypertournaments.
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
2006On Locating Disjoint Segments with Maximum Sum of Densities.
Hsiao-Fei Liu, Kun-Mao Chao
2006On the On-Line
Weimin Ma, Ke Wang
2006On the Runtime and Robustness of Randomized Broadcasting.
Robert Elsässer, Thomas Sauerwald
2006Online Multi-path Routing in a Maze.
Stefan Rührup, Christian Schindelhauer
2006Online Packet Admission and Oblivious Routing in Sensor Networks.
Mohamed Aly, John Augustine
2006Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules.
Yefim Dinitz, Shay Solomon
2006Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees.
Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir
2006Optimal Construction of the City Voronoi Diagram.
Sang Won Bae, Jae-Hoon Kim, Kyung-Yong Chwa
2006Parameterized Problems on Coincidence Graphs.
Sylvain Guillemot
2006Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii.
Guido Proietti, Peter Widmayer
2006Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance.
Jussi Kujala, Tapio Elomaa
2006Politician's Firefighting.
Allan E. Scott, Ulrike Stege, Norbert Zeh
2006Provably Secure Steganography and the Complexity of Sampling.
Christian Hundt, Maciej Liskiewicz, Ulrich Wölfel
2006Quality Tetrahedral Mesh Generation for Macromolecules.
Ho-Lun Cheng, Xinwei Shi
2006Relations Between Two Common Types of Rectangular Tilings.
Yusu Wang
2006Resources Required for Preparing Graph States.
Peter Høyer, Mehdi Mhalla, Simon Perdrix
2006Runtime Analysis of a Simple Ant Colony Optimization Algorithm.
Frank Neumann, Carsten Witt
2006Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy.
Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Chao Wang
2006Stable Matching Problems.
Kazuo Iwama
2006Tessellation of Quadratic Elements.
Scott E. Dillard, Vijay Natarajan, Gunther H. Weber, Valerio Pascucci, Bernd Hamann
2006The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem.
Vikraman Arvind, Jacobo Torán
2006The Interval Liar Game.
Benjamin Doerr, Johannes Lengler, David Steurer
2006Two-Tier Relaxed Heaps.
Amr Elmasry, Claus Jensen, Jyrki Katajainen