Table of Contents

• The Combinatorics of Sequencing the Corn GenomeSrinivas Aluru. 1 [doi]
• Online Frequency Assignment in Wireless Communication NetworksFrancis Y. L. Chin. 2 [doi]
• Information Distance from a Question to an AnswerMing Li. 3 [doi]
• A New Field Splitting Algorithm for Intensity-Modulated Radiation TherapyDanny Z. Chen, Mark A. Healy, Chao Wang, Xiaodong Wu. 4-15 [doi]
• A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest ProblemYufeng Wu, Dan Gusfield. 16-26 [doi]
• Seed-Based Exclusion Method for Non-coding RNA Gene SearchJean-Eudes Duchesne, Mathieu Giraud, Nadia El-Mabrouk. 27-39 [doi]
• A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining MethodLei Xin, Bin Ma, Kaizhong Zhang. 40-50 [doi]
• Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic DataDan Gusfield, Yelena Frid, Dan Brown. 51-64 [doi]
• Improved Exact Algorithms for Counting 3- and 4-ColoringsFedor V. Fomin, Serge Gaspers, Saket Saurabh. 65-74 [doi]
• Connected Coloring Completion for General Graphs: Algorithms and ComplexityBenny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir. 75-85 [doi]
• Quadratic Kernelization for Convex Recoloring of TreesHans Leo Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer. 86-96 [doi]
• On the Number of Cycles in Planar GraphsKevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel. 97-107 [doi]
• An Improved Exact Algorithm for Cubic Graph TSPKazuo Iwama, Takuya Nakashima. 108-117 [doi]
• Geometric Intersection Graphs: Do Short Cycles Help?Jan Kratochvíl, Martin Pergel. 118-128 [doi]
• Dimension, Halfspaces, and the Density of Hard SetsRyan C. Harkins, John M. Hitchcock. 129-139 [doi]
• Isolation Concepts for Enumerating Dense SubgraphsChristian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier. 140-150 [doi]
• Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in ::::O:::: ( ::::n:::: :::4:::) TimeChristian Ledergerber, Christophe Dessimoz. 151-164 [doi]
• Counting Minimum Weighted Dominating SetsFedor V. Fomin, Alexey A. Stepanov. 165-175 [doi]
• Online Interval Scheduling: Randomized and Multiprocessor CasesStanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng. 176-186 [doi]
• Scheduling Selfish Tasks: About the Performance of Truthful AlgorithmsGeorge Christodoulou, Laurent Gourvès, Fanny Pascual. 187-197 [doi]
• Volume Computation Using a Direct Monte Carlo MethodSheng Liu, Jian Zhang, Binhai Zhu. 198-209 [doi]
• Improved Throughput Bounds for Interference-Aware Routing in Wireless NetworksChiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou. 210-221 [doi]
• Generating Minimal k-Vertex Connected Spanning SubgraphsEndre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf. 222-231 [doi]
• Finding Many Optimal Paths Without Growing Any Optimal Path TreesDanny Z. Chen, Ewa Misiolek. 232-242 [doi]
• Enumerating Constrained Non-crossing Geometric Spanning TreesNaoki Katoh, Shin-ichi Tanigawa. 243-253 [doi]
• Colored Simultaneous Geometric EmbeddingsUlrik 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. 254-263 [doi]
• Properties of Symmetric Incentive Compatible AuctionsXiaotie Deng, Kazuo Iwama, Qi Qi, Aries Wei Sun, Toyotaka Tasaka. 264-273 [doi]
• Finding Equilibria in Games of No ChanceKristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen. 274-284 [doi]
• Efficient Testing of ForecastsChing-Lueh Chang, Yuh-Dauh Lyuu. 285-295 [doi]
• When Does Greedy Learning of Relevant Attributes Succeed?Jan Arpe, Rüdiger Reischuk. 296-306 [doi]
• The Informational Content of Canonical Disjoint NP-PairsChristian Glaßer, Alan L. Selman, Liyu Zhang. 307-317 [doi]
• On the Representations of NC and Log-Space Real NumbersFuxiang Yu. 318-326 [doi]
• Bounded Computable Enumerability and Hierarchy of Computably Enumerable RealsXizhong Zheng. 327-337 [doi]
• Streaming Algorithms Measured in Terms of the Computed QuantityShengyu Zhang. 338-348 [doi]
• A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting ProblemYunlong Liu, Jianer Chen, Jianxin Wang. 349-359 [doi]
• Optimal Offline Extraction of Irredundant Motif BasesAlberto Apostolico, Claudia Tagliacollo. 360-371 [doi]
• Linear Algorithm for Broadcasting in Unicyclic GraphsHovhannes A. Harutyunyan, Edward Maraachlian. 372-382 [doi]
• An Improved Algorithm for Online Unit ClusteringHamid Zarrabi-Zadeh, Timothy M. Chan. 383-393 [doi]
• Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated GraphsNoga Alon, Shai Gutner. 394-405 [doi]
• Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and DeletionsPinar Heggernes, Charis Papadopoulos. 406-416 [doi]
• On the Hardness of Optimization in Power Law GraphsAlessandro Ferrante, Gopal Pandurangan, Kihong Park. 417-427 [doi]
• Can a Graph Have Distinct Regular Partitions?Noga Alon, Asaf Shapira, Uri Stav. 428-438 [doi]
• Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow GamesQizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun. 439-447 [doi]
• Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold GatesKristoffer Arnsfelt Hansen. 448-458 [doi]
• On the Complexity of Finding an Unknown Cut Via Vertex QueriesPeyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh. 459-469 [doi]
• Resistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical FormulasMaurice J. Jansen, Kenneth W. Regan. 470-481 [doi]
• An Improved Algorithm for Tree Edit Distance Incorporating Structural LinearityShihyen Chen, Kaizhong Zhang. 482-492 [doi]
• Approximation Algorithms for Reconstructing the Duplication History of Tandem RepeatsLusheng Wang, Zhanyong Wang, Zhi-Zhong Chen. 493-503 [doi]
• Priority Algorithms for the Subset-Sum ProblemYuli Ye, Allan Borodin. 504-514 [doi]
• Distributed Approximation Algorithms for Weighted Problems in Minor-Closed FamiliesAndrzej Czygrinow, Michal Hanckowiak. 515-525 [doi]
• A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal GraphsFrancis Y. L. Chin, Yong Zhang, Hong Zhu. 526-536 [doi]
• Improved Algorithms for Weighted and Unweighted Set Splitting ProblemsJianer Chen, Songjian Lu. 537-547 [doi]
• An 8/5-Approximation Algorithm for a Hard Variant of Stable MarriageRobert W. Irving, David Manlove. 548-558 [doi]
• Approximation Algorithms for the Black and White Traveling Salesman ProblemBinay K. Bhattacharya, Yuzhuang Hu, Alexander Kononov. 559-567 [doi]