Search results for "COCOON"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov	Approximation Algorithms for the Black and White Traveling Salesman Problem.	COCOON	2007	DBLP DOI BibTeX RDF
1	Yuli Ye, Allan Borodin	Priority Algorithms for the Subset-Sum Problem.	COCOON	2007	DBLP DOI BibTeX RDF
1	Jan Kratochvíl, Martin Pergel	Geometric Intersection Graphs: Do Short Cycles Help?	COCOON	2007	DBLP DOI BibTeX RDF
1	Robert W. Irving, David F. Manlove	An 8/5-Approximation Algorithm for a Hard Variant of Stable Marriage.	COCOON	2007	DBLP DOI BibTeX RDF
1	George Christodoulou 0001, Laurent Gourvès, Fanny Pascual	Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.	COCOON	2007	DBLP DOI BibTeX RDF	truthful algorithms, scheduling, algorithmic game theory
1	Naoki Katoh, Shin-ichi Tanigawa	Enumerating Constrained Non-crossing Geometric Spanning Trees.	COCOON	2007	DBLP DOI BibTeX RDF
1	Jean-Eudes Duchesne, Mathieu Giraud, Nadia El-Mabrouk	Seed-Based Exclusion Method for Non-coding RNA Gene Search.	COCOON	2007	DBLP DOI BibTeX RDF
1	Ching-Lueh Chang, Yuh-Dauh Lyuu	Efficient Testing of Forecasts.	COCOON	2007	DBLP DOI BibTeX RDF
1	Kristoffer Arnsfelt Hansen	Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates.	COCOON	2007	DBLP DOI BibTeX RDF
1	Yufeng Wu, Dan Gusfield	A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem.	COCOON	2007	DBLP DOI BibTeX RDF
1	Qizhi Fang, Rudolf Fleischer, Jian Li 0015, Xiaoxun Sun	Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games.	COCOON	2007	DBLP DOI BibTeX RDF
1	Srinivas Aluru	The Combinatorics of Sequencing the Corn Genome.	COCOON	2007	DBLP DOI BibTeX RDF
1	Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier	Isolation Concepts for Enumerating Dense Subgraphs.	COCOON	2007	DBLP DOI BibTeX RDF
1	Shengyu Zhang	Streaming Algorithms Measured in Terms of the Computed Quantity.	COCOON	2007	DBLP DOI BibTeX RDF
1	Jan Arpe, Rüdiger Reischuk	When Does Greedy Learning of Relevant Attributes Succeed?	COCOON	2007	DBLP DOI BibTeX RDF
1	Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz 0001, Raimund Seidel	On the Number of Cycles in Planar Graphs.	COCOON	2007	DBLP DOI BibTeX RDF
1	Christian Glaßer, Alan L. Selman, Liyu Zhang	The Informational Content of Canonical Disjoint NP-Pairs.	COCOON	2007	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001	Improved Exact Algorithms for Counting 3- and 4-Colorings.	COCOON	2007	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer	Quadratic Kernelization for Convex Recoloring of Trees.	COCOON	2007	DBLP DOI BibTeX RDF	Topics Algorithms, Complexity
1	Ming Li 0001	Information Distance from a Question to an Answer.	COCOON	2007	DBLP DOI BibTeX RDF
1	Hovhannes A. Harutyunyan, Edward Maraachlian	Linear Algorithm for Broadcasting in Unicyclic Graphs.	COCOON	2007	DBLP DOI BibTeX RDF
1	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	COCOON	2007	DBLP DOI BibTeX RDF	H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms
1	Lusheng Wang 0001, Zhanyong Wang, Zhi-Zhong Chen	Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.	COCOON	2007	DBLP DOI BibTeX RDF
1	Shihyen Chen, Kaizhong Zhang	An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity.	COCOON	2007	DBLP DOI BibTeX RDF	RNA secondary structure comparison, dynamic programming, Tree edit distance
1	Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh	On the Complexity of Finding an Unknown Cut Via Vertex Queries.	COCOON	2007	DBLP DOI BibTeX RDF
1	Xiaotie Deng, Kazuo Iwama, Qi Qi 0003, Aries Wei Sun, Toyotaka Tasaka	Properties of Symmetric Incentive Compatible Auctions.	COCOON	2007	DBLP DOI BibTeX RDF
1	Ryan C. Harkins, John M. Hitchcock	Dimension, Halfspaces, and the Density of Hard Sets.	COCOON	2007	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Yong Zhang 0001, Hong Zhu 0004	A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs.	COCOON	2007	DBLP DOI BibTeX RDF
1	Xizhong Zheng	Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals.	COCOON	2007	DBLP DOI BibTeX RDF	c.e. sets, c.e. reals, bounded c.e. reals, Ershov’s Hierarchy
1	Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou	Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.	COCOON	2007	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Mark A. Healy, Chao Wang 0002, Xiaodong Wu 0001	A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy.	COCOON	2007	DBLP DOI BibTeX RDF
1	Noga Alon, Asaf Shapira, Uri Stav	Can a Graph Have Distinct Regular Partitions?	COCOON	2007	DBLP DOI BibTeX RDF
1	Fuxiang Yu	On the Representations of NC and Log-Space Real Numbers.	COCOON	2007	DBLP DOI BibTeX RDF	representations of real numbers, Cauchy function, left cut, P, Log-space, Complexity, expressive power, NC
1	E. C. Xavier, Flávio Keidi Miyazawa	The Class Constrained Bin Packing Problem with Applications to Video-on-Demand.	COCOON	2006	DBLP DOI BibTeX RDF
1	Gill Barequet, Alina Shaikhet	The On-Line Heilbronn's Triangle Problem in d Dimensions.	COCOON	2006	DBLP DOI BibTeX RDF
1	L. Sunil Chandran, Naveen Sivadasan	Geometric Representation of Graphs in Low Dimension.	COCOON	2006	DBLP DOI BibTeX RDF
1	Jianbo Li, Mingxia Chen, Jianping Li 0007, Weidong Li 0002	Minimum Clique Partition Problem with Constrained Weight for Interval Graphs.	COCOON	2006	DBLP DOI BibTeX RDF	approximation algorithm, Interval graph, cliques
1	Franco P. Preparata	The Unpredictable Deviousness of Models.	COCOON	2006	DBLP DOI BibTeX RDF
1	Ian McQuillan, Kai Salomaa, Mark Daley	Iterated TGR Languages: Membership Problem and Effective Closure Properties.	COCOON	2006	DBLP DOI BibTeX RDF
1	Yo-Sub Han, Derick Wood	Overlap-Free Regular Languages.	COCOON	2006	DBLP DOI BibTeX RDF
1	Rahul Muthu, N. Narayanan 0001, C. R. Subramanian 0001	Optimal Acyclic Edge Colouring of Grid Like Graphs.	COCOON	2006	DBLP DOI BibTeX RDF	Acyclic Edge Colouring, Acyclic Chromatic Index, Graph, Hypercube, Mesh, Tori
1	Jesper Torp Kristensen, Peter Bro Miltersen	Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard.	COCOON	2006	DBLP DOI BibTeX RDF
1	Xi Chen 0001, Xiaotie Deng	A Simplicial Approach for Discrete Fixed Point Theorems.	COCOON	2006	DBLP DOI BibTeX RDF
1	Shigeaki Harada, Eiji Takimoto, Akira Maruoka	Aggregating Strategy for Online Auctions.	COCOON	2006	DBLP DOI BibTeX RDF
1	Sun-Yuan Hsieh, Shih-Cheng Yang	MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees.	COCOON	2006	DBLP DOI BibTeX RDF
1	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.	COCOON	2006	DBLP DOI BibTeX RDF
1	Vlady Ravelomanana, Alphonse Laza Rijamamy	Creation and Growth of Components in a Random Hypergraph Process.	COCOON	2006	DBLP DOI BibTeX RDF
1	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximating Min-Max (Regret) Versions of Some Polynomial Problems.	COCOON	2006	DBLP DOI BibTeX RDF	min-max regret, approximation, shortest path, minimum spanning tree, min-max, fptas
1	David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa	Enumerating Non-crossing Minimally Rigid Frameworks.	COCOON	2006	DBLP DOI BibTeX RDF
1	Ying Xiao 0001, Christoforos N. Hadjicostis, Krishnaiyan Thulasiraman	The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm.	COCOON	2006	DBLP DOI BibTeX RDF
1	Mattias Andersson 0002, Joachim Gudmundsson, Christos Levcopoulos	Restricted Mesh Simplification Using Edge Contractions.	COCOON	2006	DBLP DOI BibTeX RDF
1	Eitan Bachmat, Tao-Kai Lam, Avner Magen	A Rigorous Analysis for Set-Up Time Models - A Metric Perspective.	COCOON	2006	DBLP DOI BibTeX RDF
1	Regant Y. S. Hung, H. F. Ting	A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast.	COCOON	2006	DBLP DOI BibTeX RDF
1	Iyad A. Kanj, Luay Nakhleh, Ge Xia	Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms.	COCOON	2006	DBLP DOI BibTeX RDF
1	Joel Ratsaby	On the Combinatorial Representation of Information.	COCOON	2006	DBLP DOI BibTeX RDF	Information theory, VC-dimension, combinatorial complexity
1	Zheng Gong, Xiangxue Li, Kefei Chen	Efficient Partially Blind Signature Scheme with Provable Security.	COCOON	2006	DBLP DOI BibTeX RDF
1	Hiroshi Nagamochi	A Detachment Algorithm for Inferring a Graph from Path Frequency.	COCOON	2006	DBLP DOI BibTeX RDF
1	Zvi Lotker, Debapriyo Majumdar, N. S. Narayanaswamy, Ingmar Weber	Sequences Characterizing k-Trees.	COCOON	2006	DBLP DOI BibTeX RDF
1	Chandan K. Dubey, Shashank K. Mehta	On Indecomposability Preserving Elimination Sequences.	COCOON	2006	DBLP DOI BibTeX RDF	indecomposable graph, critically indecomposable graph, elimination sequence, Module
1	Christoph Buchheim, Lanbo Zheng	Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem.	COCOON	2006	DBLP DOI BibTeX RDF
1	Zhixiang Chen 0001, Richard H. Fowler, Bin Fu, Binhai Zhu	Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes.	COCOON	2006	DBLP DOI BibTeX RDF
1	Wen-Chieh Chang 0002, Oliver Eulenstein	Reconciling Gene Trees with Apparent Polytomies.	COCOON	2006	DBLP DOI BibTeX RDF
1	Xi Chen 0001, Xiaotie Deng, Becky Jie Liu	On Incentive Compatible Competitive Selection Protocol.	COCOON	2006	DBLP DOI BibTeX RDF
1	Gadi Aleksandrowicz, Gill Barequet	Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes.	COCOON	2006	DBLP DOI BibTeX RDF	Polycubes, lattice animals, subgraph counting
1	Xiuzhen Huang	Lower Bounds and Parameterized Approach for Longest Common Subsequence.	COCOON	2006	DBLP DOI BibTeX RDF
1	Mingen Lin, Yang Yang 0012, Jinhui Xu 0001	On Lazy Bin Covering and Packing Problems.	COCOON	2006	DBLP DOI BibTeX RDF
1	Tomoya Suzuki, Shigeru Yamashita, Masaki Nakanishi, Katsumasa Watanabe	Robust Quantum Algorithms with epsilon-Biased Oracles.	COCOON	2006	DBLP DOI BibTeX RDF
1	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.	COCOON	2006	DBLP DOI BibTeX RDF
1	George Karakostas, Stavros G. Kolliopoulos	Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.	COCOON	2006	DBLP DOI BibTeX RDF
1	Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan	Bimodal Crossing Minimization.	COCOON	2006	DBLP DOI BibTeX RDF
1	Takehiro Ito, Kazuya Goto, Xiao Zhou 0001, Takao Nishizeki	Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size.	COCOON	2006	DBLP DOI BibTeX RDF
1	Min Chih Lin, Jayme Luiz Szwarcfiter	Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs.	COCOON	2006	DBLP DOI BibTeX RDF	Helly circular-arc graphs, algorithms, forbidden subgraphs, circular-arc graphs
1	Fredrik Bengtsson, Jingsen Chen	Computing Maximum-Scoring Segments in Almost Linear Time.	COCOON	2006	DBLP DOI BibTeX RDF
1	Yong Gao 0001	On the Threshold of Having a Linear Treewidth in Random Graphs.	COCOON	2006	DBLP DOI BibTeX RDF
1	Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang	Improved Algorithms for the Minmax Regret 1-Median Problem.	COCOON	2006	DBLP DOI BibTeX RDF	minmax regret optimization, medians, Location theory
1	Takayuki Sato, Kazuyuki Amano, Akira Maruoka	On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences.	COCOON	2006	DBLP DOI BibTeX RDF
1	Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants.	COCOON	2006	DBLP DOI BibTeX RDF
1	Xin Dou, Xiaodong Wu 0001, John E. Bayouth, John M. Buatti	The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy.	COCOON	2006	DBLP DOI BibTeX RDF
1	Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung	On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis.	COCOON	2006	DBLP DOI BibTeX RDF
1	M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed 0001, William F. Smyth	Finding Patterns with Variable Length Gaps or Don't Cares.	COCOON	2006	DBLP DOI BibTeX RDF
1	Danny Z. Chen, D. T. Lee (eds.)	Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings	COCOON	2006	DBLP DOI BibTeX RDF
1	Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff 0001	A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.	COCOON	2006	DBLP DOI BibTeX RDF
1	Mikhail J. Atallah	Security Issues in Collaborative Computing.	COCOON	2006	DBLP DOI BibTeX RDF
1	Sheung-Hung Poon	On Unfolding Lattice Polygons/Trees and Diameter-4 Trees.	COCOON	2006	DBLP DOI BibTeX RDF	Comput. geom., straightening, convexifying, unfolding
1	Hongbing Fan, Robert Kalbfleisch	An Edge Ordering Problem of Regular Hypergraphs.	COCOON	2006	DBLP DOI BibTeX RDF
1	Marats Golovkins, Jean-Eric Pin	Varieties Generated by Certain Models of Reversible Finite Automata.	COCOON	2006	DBLP DOI BibTeX RDF
1	Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay	The Complexity of Black-Box Ring Problems.	COCOON	2006	DBLP DOI BibTeX RDF
1	Sergey Bereg, Ovidiu Daescu, Minghui Jiang 0001	A PTAS for Cutting Out Polygons with Lines.	COCOON	2006	DBLP DOI BibTeX RDF
1	Hossein Jowhari, Mohammad Ghodsi	New Streaming Algorithms for Counting Triangles in Graphs.	COCOON	2005	DBLP DOI BibTeX RDF
1	Luca Allulli, Giorgio Ausiello, Luigi Laura	On the Power of Lookahead in On-Line Vehicle Routing Problems.	COCOON	2005	DBLP DOI BibTeX RDF
1	Robert Rettinger, Xizhong Zheng	Solovay Reducibility on D-c.e Real Numbers.	COCOON	2005	DBLP DOI BibTeX RDF
1	Martin Kutz, Attila Pór	Angel, Devil, and King.	COCOON	2005	DBLP DOI BibTeX RDF
1	Tao Liu, Jijun Tang, Bernard M. E. Moret	Quartet-Based Phylogeny Reconstruction from Gene Orders.	COCOON	2005	DBLP DOI BibTeX RDF
1	Sung Eun Bae, Tadao Takaoka	Improved Algorithms for the K-Maximum Subarray Problem for Small K.	COCOON	2005	DBLP DOI BibTeX RDF
1	Fábio Viduani Martinez, José Coelho de Pina, José Soares	Algorithms for Terminal Steiner Trees.	COCOON	2005	DBLP DOI BibTeX RDF
1	Lusheng Wang (eds.)	Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings	COCOON	2005	DBLP DOI BibTeX RDF
1	Hirotaka Ono 0001, Yen Kaow Ng	Best Fitting Fixed-Length Substring Patterns for a Set of Strings.	COCOON	2005	DBLP DOI BibTeX RDF
1	Marie-France Sagot, Eric Tannier	Perfect Sorting by Reversals.	COCOON	2005	DBLP DOI BibTeX RDF
1	Ewa Misiolek, Danny Z. Chen	Efficient Algorithms for Simplifying Flow Networks.	COCOON	2005	DBLP DOI BibTeX RDF
1	Zhipeng Cai 0001, Guohui Lin, Guoliang Xue	Improved Approximation Algorithms for the Capacitated Multicast Routing Problem.	COCOON	2005	DBLP DOI BibTeX RDF	Capacitated Multicast Routing, Approximation Algorithm, Tree Partitioning, Steiner Minimum Tree

Publications at "COCOON"( http://dblp.L3S.de/Venues/COCOON )