Conferences in DBLP
Franco P. Preparata The Unpredictable Deviousness of Models. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:1- [Conf ] Mikhail J. Atallah Security Issues in Collaborative Computing. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:2- [Conf ] Xi Chen , Xiaotie Deng A Simplicial Approach for Discrete Fixed Point Theorems. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:3-12 [Conf ] Xi Chen , Xiaotie Deng , Becky Jie Liu On Incentive Compatible Competitive Selection Protocol. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:13-22 [Conf ] George Karakostas , Stavros G. Kolliopoulos Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:23-32 [Conf ] Shigeaki Harada , Eiji Takimoto , Akira Maruoka Aggregating Strategy for Online Auctions. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:33-41 [Conf ] Chandan K. Dubey , Shashank K. Mehta On Indecomposability Preserving Elimination Sequences. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:42-51 [Conf ] Hung-I Yu , Tzu-Chin Lin , Biing-Feng Wang Improved Algorithms for the Minmax Regret 1-Median Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:52-62 [Conf ] Takehiro Ito , Kazuya Goto , Xiao Zhou , Takao Nishizeki Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:63-72 [Conf ] Min Chih Lin , Jayme Luiz Szwarcfiter Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:73-82 [Conf ] Marats Golovkins , Jean-Eric Pin Varieties Generated by Certain Models of Reversible Finite Automata. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:83-93 [Conf ] Ian McQuillan , Kai Salomaa , Mark Daley Iterated TGR Languages: Membership Problem and Effective Closure Properties. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:94-103 [Conf ] Takayuki Sato , Kazuyuki Amano , Akira Maruoka On the Negation-Limited Circuit Complexity of Sorting and Inverting k -tonic Sequences. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:104-115 [Conf ] Tomoya Suzuki , Shigeru Yamashita , Masaki Nakanishi , Katsumasa Watanabe Robust Quantum Algorithms with epsilon -Biased Oracles. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:116-125 [Conf ] Vikraman Arvind , Bireswar Das , Partha Mukhopadhyay The Complexity of Black-Box Ring Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:126-135 [Conf ] Xiuzhen Huang Lower Bounds and Parameterized Approach for Longest Common Subsequence. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:136-145 [Conf ] M. Sohel Rahman , Costas S. Iliopoulos , Inbok Lee , Manal Mohamed , William F. Smyth Finding Patterns with Variable Length Gaps or Don't Cares. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:146-155 [Conf ] Xin Dou , Xiaodong Wu , John E. Bayouth , John M. Buatti The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:156-165 [Conf ] Marc Benkert , Joachim Gudmundsson , Christian Knauer , Esther Moet , René van Oostrum , Alexander Wolff A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:166-175 [Conf ] Sergey Bereg , Ovidiu Daescu , Minghui Jiang A PTAS for Cutting Out Polygons with Lines. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:176-185 [Conf ] Sheung-Hung Poon On Unfolding Lattice Polygons/Trees and Diameter-4 Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:186-195 [Conf ] Mattias Andersson , Joachim Gudmundsson , Christos Levcopoulos Restricted Mesh Simplification Using Edge Contractions. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:196-204 [Conf ] David Avis , Naoki Katoh , Makoto Ohsaki , Ileana Streinu , Shin-ichi Tanigawa Enumerating Non-crossing Minimally Rigid Frameworks. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:205-215 [Conf ] Zvi Lotker , Debapriyo Majumdar , N. S. Narayanaswamy , Ingmar Weber Sequences Characterizing k -Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:216-225 [Conf ] Yong Gao On the Threshold of Having a Linear Treewidth in Random Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:226-234 [Conf ] Wen-Chieh Chang , Oliver Eulenstein Reconciling Gene Trees with Apparent Polytomies. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:235-244 [Conf ] Zhixiang Chen , Richard H. Fowler , Bin Fu , Binhai Zhu Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:245-254 [Conf ] Fredrik Bengtsson , Jingsen Chen Computing Maximum-Scoring Segments in Almost Linear Time. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:255-264 [Conf ] Daniel Mölle , Stefan Richter , Peter Rossmanith Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:265-273 [Conf ] Hiroshi Nagamochi A Detachment Algorithm for Inferring a Graph from Path Frequency. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:274-283 [Conf ] Ying Xiao , Christoforos N. Hadjicostis , Krishnaiyan Thulasiraman The d -Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:284-298 [Conf ] Iyad A. Kanj , Luay Nakhleh , Ge Xia Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:299-308 [Conf ] Wun-Tat Chan , Prudence W. H. Wong , Fencol C. C. Yung On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:309-319 [Conf ] Feifeng Zheng , Stanley P. Y. Fung , Wun-Tat Chan , Francis Y. L. Chin , Chung Keung Poon , Prudence W. H. Wong Improved On-Line Broadcast Scheduling with Deadlines. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:320-329 [Conf ] Regant Y. S. Hung , H. F. Ting A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:330-339 [Conf ] Mingen Lin , Yang Yang , Jinhui Xu On Lazy Bin Covering and Packing Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:340-349 [Conf ] Vlady Ravelomanana , Alphonse Laza Rijamamy Creation and Growth of Components in a Random Hypergraph Process. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:350-359 [Conf ] Rahul Muthu , N. Narayanan , C. R. Subramanian Optimal Acyclic Edge Colouring of Grid Like Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:360-367 [Conf ] Hongbing Fan , Robert Kalbfleisch An Edge Ordering Problem of Regular Hypergraphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:368-377 [Conf ] Zheng Gong , Xiangxue Li , Kefei Chen Efficient Partially Blind Signature Scheme with Provable Security. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:378-386 [Conf ] Eitan Bachmat , Tao-Kai Lam , Avner Magen A Rigorous Analysis for Set-Up Time Models - A Metric Perspective. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:387-397 [Conf ] L. Sunil Chandran , Naveen Sivadasan Geometric Representation of Graphs in Low Dimension. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:398-407 [Conf ] Gill Barequet , Alina Shaikhet The On-Line Heilbronn's Triangle Problem in d Dimensions. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:408-417 [Conf ] Gadi Aleksandrowicz , Gill Barequet Counting d -Dimensional Polycubes and Nonrectangular Planar Polyominoes. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:418-427 [Conf ] Hassene Aissi , Cristina Bazgan , Daniel Vanderpooten Approximating Min-Max (Regret) Versions of Some Polynomial Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:428-438 [Conf ] E. C. Xavier , Flávio Keidi Miyazawa The Class Constrained Bin Packing Problem with Applications to Video-on-Demand. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:439-448 [Conf ] Sun-Yuan Hsieh , Shih-Cheng Yang MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:449-458 [Conf ] Jianbo Li , Mingxia Chen , Jianping Li , Weidong Li Minimum Clique Partition Problem with Constrained Weight for Interval Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:459-468 [Conf ] Yo-Sub Han , Derick Wood Overlap-Free Regular Languages. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:469-478 [Conf ] Joel Ratsaby On the Combinatorial Representation of Information. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:479-488 [Conf ] Jesper Torp Kristensen , Peter Bro Miltersen Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:489-496 [Conf ] Christoph Buchheim , Michael Jünger , Annette Menze , Merijam Percan Bimodal Crossing Minimization. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:497-506 [Conf ] Christoph Buchheim , Lanbo Zheng Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:507-516 [Conf ] Dae-Sik Choi , In-Chan Choi On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:517-526 [Conf ]