13. COCOON 2007:
Banff,
Alberta,
Canada
Guohui Lin (Ed.):
Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings.
Lecture Notes in Computer Science 4598 Springer 2007, ISBN 978-3-540-73544-1 BibTeX
- Srinivas Aluru:
The Combinatorics of Sequencing the Corn Genome.
1
Electronic Edition (link) BibTeX
- Francis Y. L. Chin:
Online Frequency Assignment in Wireless Communication Networks.
2
Electronic Edition (link) BibTeX
- Ming Li:
Information Distance from a Question to an Answer.
3
Electronic Edition (link) BibTeX
- Danny Z. Chen, Mark A. Healy, Chao Wang, Xiaodong Wu:
A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy.
4-15
Electronic Edition (link) BibTeX
- Yufeng Wu, Dan Gusfield:
A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem.
16-26
Electronic Edition (link) BibTeX
- Jean-Eudes Duchesne, Mathieu Giraud, Nadia El-Mabrouk:
Seed-Based Exclusion Method for Non-coding RNA Gene Search.
27-39
Electronic Edition (link) BibTeX
- Lei Xin, Bin Ma, Kaizhong Zhang:
A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method.
40-50
Electronic Edition (link) BibTeX
- Dan Gusfield, Yelena Frid, Dan Brown:
Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data.
51-64
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Serge Gaspers, Saket Saurabh:
Improved Exact Algorithms for Counting 3- and 4-Colorings.
65-74
Electronic Edition (link) BibTeX
- Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir:
Connected Coloring Completion for General Graphs: Algorithms and Complexity.
75-85
Electronic Edition (link) BibTeX
- Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Quadratic Kernelization for Convex Recoloring of Trees.
86-96
Electronic Edition (link) BibTeX
- Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel:
On the Number of Cycles in Planar Graphs.
97-107
Electronic Edition (link) BibTeX
- Kazuo Iwama, Takuya Nakashima:
An Improved Exact Algorithm for Cubic Graph TSP.
108-117
Electronic Edition (link) BibTeX
- Jan Kratochvíl, Martin Pergel:
Geometric Intersection Graphs: Do Short Cycles Help?
118-128
Electronic Edition (link) BibTeX
- Ryan C. Harkins, John M. Hitchcock:
Dimension, Halfspaces, and the Density of Hard Sets.
129-139
Electronic Edition (link) BibTeX
- Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier:
Isolation Concepts for Enumerating Dense Subgraphs.
140-150
Electronic Edition (link) BibTeX
- Christian Ledergerber, Christophe Dessimoz:
Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O ( n 4) Time.
151-164
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Alexey A. Stepanov:
Counting Minimum Weighted Dominating Sets.
165-175
Electronic Edition (link) BibTeX
- Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Online Interval Scheduling: Randomized and Multiprocessor Cases.
176-186
Electronic Edition (link) BibTeX
- George Christodoulou, Laurent Gourvès, Fanny Pascual:
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.
187-197
Electronic Edition (link) BibTeX
- Sheng Liu, Jian Zhang, Binhai Zhu:
Volume Computation Using a Direct Monte Carlo Method.
198-209
Electronic Edition (link) BibTeX
- Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.
210-221
Electronic Edition (link) BibTeX
- Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf:
Generating Minimal k-Vertex Connected Spanning Subgraphs.
222-231
Electronic Edition (link) BibTeX
- Danny Z. Chen, Ewa Misiolek:
Finding Many Optimal Paths Without Growing Any Optimal Path Trees.
232-242
Electronic Edition (link) BibTeX
- Naoki Katoh, Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Geometric Spanning Trees.
243-253
Electronic Edition (link) BibTeX
- Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings.
254-263
Electronic Edition (link) BibTeX
- Xiaotie Deng, Kazuo Iwama, Qi Qi, Aries Wei Sun, Toyotaka Tasaka:
Properties of Symmetric Incentive Compatible Auctions.
264-273
Electronic Edition (link) BibTeX
- Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Finding Equilibria in Games of No Chance.
274-284
Electronic Edition (link) BibTeX
- Ching-Lueh Chang, Yuh-Dauh Lyuu:
Efficient Testing of Forecasts.
285-295
Electronic Edition (link) BibTeX
- Jan Arpe, Rüdiger Reischuk:
When Does Greedy Learning of Relevant Attributes Succeed?
296-306
Electronic Edition (link) BibTeX
- Christian Glaßer, Alan L. Selman, Liyu Zhang:
The Informational Content of Canonical Disjoint NP-Pairs.
307-317
Electronic Edition (link) BibTeX
- Fuxiang Yu:
On the Representations of NC and Log-Space Real Numbers.
318-326
Electronic Edition (link) BibTeX
- Xizhong Zheng:
Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals.
327-337
Electronic Edition (link) BibTeX
- Shengyu Zhang:
Streaming Algorithms Measured in Terms of the Computed Quantity.
338-348
Electronic Edition (link) BibTeX
- Yunlong Liu, Jianer Chen, Jianxin Wang:
A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem.
349-359
Electronic Edition (link) BibTeX
- Alberto Apostolico, Claudia Tagliacollo:
Optimal Offline Extraction of Irredundant Motif Bases.
360-371
Electronic Edition (link) BibTeX
- Hovhannes A. Harutyunyan, Edward Maraachlian:
Linear Algorithm for Broadcasting in Unicyclic Graphs.
372-382
Electronic Edition (link) BibTeX
- Hamid Zarrabi-Zadeh, Timothy M. Chan:
An Improved Algorithm for Online Unit Clustering.
383-393
Electronic Edition (link) BibTeX
- Noga Alon, Shai Gutner:
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.
394-405
Electronic Edition (link) BibTeX
- Pinar Heggernes, Charis Papadopoulos:
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions.
406-416
Electronic Edition (link) BibTeX
- Alessandro Ferrante, Gopal Pandurangan, Kihong Park:
On the Hardness of Optimization in Power Law Graphs.
417-427
Electronic Edition (link) BibTeX
- Noga Alon, Asaf Shapira, Uri Stav:
Can a Graph Have Distinct Regular Partitions?
428-438
Electronic Edition (link) BibTeX
- Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun:
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games.
439-447
Electronic Edition (link) BibTeX
- Kristoffer Arnsfelt Hansen:
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates.
448-458
Electronic Edition (link) BibTeX
- 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.
459-469
Electronic Edition (link) BibTeX
- Maurice J. Jansen, Kenneth W. Regan:
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas.
470-481
Electronic Edition (link) BibTeX
- Shihyen Chen, Kaizhong Zhang:
An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity.
482-492
Electronic Edition (link) BibTeX
- Lusheng Wang, Zhanyong Wang, Zhi-Zhong Chen:
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.
493-503
Electronic Edition (link) BibTeX
- Yuli Ye, Allan Borodin:
Priority Algorithms for the Subset-Sum Problem.
504-514
Electronic Edition (link) BibTeX
- Andrzej Czygrinow, Michal Hanckowiak:
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.
515-525
Electronic Edition (link) BibTeX
- Francis Y. L. Chin, Yong Zhang, Hong Zhu:
A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs.
526-536
Electronic Edition (link) BibTeX
- Jianer Chen, Songjian Lu:
Improved Algorithms for Weighted and Unweighted Set Splitting Problems.
537-547
Electronic Edition (link) BibTeX
- Robert W. Irving, David Manlove:
An 8/5-Approximation Algorithm for a Hard Variant of Stable Marriage.
548-558
Electronic Edition (link) BibTeX
- Binay K. Bhattacharya, Yuzhuang Hu, Alexander Kononov:
Approximation Algorithms for the Black and White Traveling Salesman Problem.
559-567
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:02:47 2009
by Michael Ley (ley@uni-trier.de)
