Table of Contents

• Completeness for Parity ProblemsLeslie G. Valiant. 1-8 [doi]
• Monotony and SurpriseAlberto Apostolico. 9 [doi]
• Smoothed Analysis of Algorithms and HeuristicsShang-Hua Teng. 10-11 [doi]
• Gene Network: Model, Dynamics and SimulationShiquan Wu, Xun Gu. 12-21 [doi]
• Conserved Interval Distance Computation Between Non-trivial GenomesGuillaume Blin, Romeo Rizzi. 22-31 [doi]
• RNA Multiple Structural Alignment with Longest Common SubsequencesSergey Bereg, Binhai Zhu. 32-41 [doi]
• Perfect Sorting by ReversalsMarie-France Sagot, Eric Tannier. 42-51 [doi]
• Genome Rearrangements with Partially Ordered ChromosomesChunfang Zheng, David Sankoff. 52-62 [doi]
• Quartet-Based Phylogeny Reconstruction from Gene OrdersTao Liu, Jijun Tang, Bernard M. E. Moret. 63-73 [doi]
• Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data AnalysisJinsong Tan, Kok Seng Chua, Louxin Zhang. 74-83 [doi]
• RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene TransferLuay Nakhleh, Derek A. Ruths, Li-San Wang. 84-93 [doi]
• A New Pseudoknots Folding Algorithm for RNA Structure PredictionHengwu Li, Daming Zhu. 94-103 [doi]
• Rapid Homology Search with Two-Stage Extension and Daughter SeedsMiklós Csürös, Bin Ma. 104-114 [doi]
• On the Approximation of Computing Evolutionary TreesVincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul. 115-125 [doi]
• Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc NetworksXiang-Yang Li, Peng-Jun Wan. 126-135 [doi]
• Improved Approximation Algorithms for the Capacitated Multicast Routing ProblemZhipeng Cai, Guohui Lin, Guoliang Xue. 136-145 [doi]
• Construction of Scale-Free Networks with Partial InformationJianyang Zeng, Wen-Jing Hsu, Suiping Zhou. 146-155 [doi]
• Radio Networks with Reliable CommunicationYvo Desmedt, Yongge Wang, Reihaneh Safavi-Naini, Huaxiong Wang. 156-166 [doi]
• Geometric Network Design with Selfish AgentsMartin Hoefer, Piotr Krysta. 167-178 [doi]
• Bicriteria Network Design via Iterative RoundingPiotr Krysta. 179-187 [doi]
• Interference in Cellular Networks: The Minimum Membership Set Cover ProblemFabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger. 188-198 [doi]
• Routing and Coloring for Maximal Number of TreesXujin Chen, Xiao-Dong Hu, Tianping Shuai. 199-209 [doi]
• Share the Multicast Payment FairlyWeizhao Wang, Xiang-Yang Li, Zheng Sun. 210-219 [doi]
• On Packing and Coloring Hyperedges in a CycleJianping Li, Kang Li, Ken C. K. Law, Hao Zhao. 220-229 [doi]
• Fault-Tolerant Relay Node Placement in Wireless Sensor NetworksHai Liu, Peng-Jun Wan, Xiaohua Jia. 230-239 [doi]
• Best Fitting Fixed-Length Substring Patterns for a Set of StringsHirotaka Ono, Yen Kaow Ng. 240-250 [doi]
• String Coding of Trees with Locality and HeritabilitySaverio Caminiti, Rossella Petreschi. 251-262 [doi]
• Finding Longest Increasing and Common Subsequences in Streaming DataDavid Liben-Nowell, Erik Vee, An Zhu. 263-272 [doi]
• O(n:::2:::log n) Time On-Line Construction of Two-Dimensional Suffix TreesJoong Chae Na, Raffaele Giancarlo, Kunsoo Park. 273-282 [doi]
• Min-Energy Voltage Allocation for Tree-Structured TasksMinming Li, Becky Jie Liu, Frances F. Yao. 283-296 [doi]
• Semi-online Problems on Identical Machines with Inexact Partial InformationZhiyi Tan, Yong He. 297-307 [doi]
• On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals SchedulesFabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault. 308-317 [doi]
• Off-Line Algorithms for Minimizing Total Flow Time in Broadcast SchedulingWun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong. 318-328 [doi]
• Oblivious and Adaptive Strategies for the Majority and Plurality ProblemsFan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao. 329-338 [doi]
• A Note on Zero Error Algorithms Having Oracle Access to One NP QueryJin-yi Cai, Venkatesan T. Chakaravarthy. 339-348 [doi]
• On the Complexity of Computing the Logarithm and Square Root Functions on a Complex DomainKer-I Ko, Fuxiang Yu. 349-358 [doi]
• Solovay Reducibility on D-c.e Real NumbersRobert Rettinger, Xizhong Zheng. 359-368 [doi]
• Algorithms for Terminal Steiner TreesFábio Viduani Martinez, José Coelho de Pina, José Soares. 369-379 [doi]
• Simple Distributed Algorithms for Approximating Minimum Steiner TreesParinya Chalermsook, Jittat Fakcharoenphol. 380-389 [doi]
• A Truthful (2-2/::::k::::)-Approximation Mechanism for the Steiner Tree Problem with ::::k:::: TerminalsLuciano Gualà, Guido Proietti. 390-400 [doi]
• Radial Coordinate Assignment for Level GraphsChristian Bachmaier, Florian Fischer, Michael Forster. 401-410 [doi]
• A Theoretical Upper Bound for IP-Based FloorplanningGuowu Yang, Xiaoyu Song, Hannah Honghua Yang, Fei Xie. 411-419 [doi]
• Quantum Noisy Rational Function ReconstructionSean Hallgren, Alexander Russell, Igor Shparlinski. 420-429 [doi]
• Promised and Distributed Quantum SearchShengyu Zhang. 430-439 [doi]
• Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree SequenceFabien Viger, Matthieu Latapy. 440-449 [doi]
• Randomized Quicksort and the Entropy of the Random SourceBeatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler. 450-460 [doi]
• Subquadratic Algorithm for Dynamic Shortest DistancesPiotr Sankowski. 461-470 [doi]
• Randomly Generating Triangulations of a Simple PolygonQ. Ding, J. Qian, W. Tsang, C. Wang. 471-480 [doi]
• Triangulating a Convex Polygon with Small Number of Non-standard BarsYin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki. 481-489 [doi]
• A PTAS for a Disc Covering Problem Using Width-Bounded SeparatorsZhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu. 490-503 [doi]
• Efficient Algorithms for Intensity Map Splitting Problems in Radiation TherapyXiaodong Wu. 504-513 [doi]
• Distributions of Points in ::::d:::: Dimensions and Large ::::k::::-Point SimplicesHanno Lefmann. 514-523 [doi]
• Exploring Simple Grid PolygonsChristian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe. 524-533 [doi]
• Approximation Algorithms for Cutting Out Polygons with Lines and RaysXuehou Tan. 534-543 [doi]
• Efficient Non-intersection Queries on Aggregated Geometric DataProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid. 544-553 [doi]
• An Upper Bound on the Number of Rectangulations of a Point SetEyal Ackerman, Gill Barequet, Ron Y. Pinter. 554-559 [doi]
• Opportunistic Data Structures for Range QueriesChung Keung Poon, Wai Keung Yiu. 560-569 [doi]
• Generating Combinations by Prefix ShiftsFrank Ruskey, Aaron Williams. 570-576 [doi]
• Error-Set Codes and Related ObjectsAn Braeken, Ventzislav Nikov, Svetla Nikova. 577-585 [doi]
• On Walrasian Price of CPU TimeXiaotie Deng, Li-Sha Huang, Minming Li. 586-595 [doi]
• On-Line Algorithms for Market EquilibriaSpyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas. 596-607 [doi]
• Interval Subset Sum and Uniform-Price Auction ClearingAnshul Kothari, Subhash Suri, Yunhong Zhou. 608-620 [doi]
• Improved Algorithms for the ::::K::::-Maximum Subarray Problem for Small ::::K::::Sung Eun Bae, Tadao Takaoka. 621-631 [doi]
• Server Allocation Algorithms for Tiered SystemsKamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou. 632-643 [doi]
• An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with PenaltiesGuang Xu, Jinhui Xu. 644-653 [doi]
• The Reverse Greedy Algorithm for the Metric ::::K::::-Median ProblemMarek Chrobak, Claire Kenyon, Neal E. Young. 654-660 [doi]
• On Approximate Balanced Bi-clusteringGuoxuan Ma, Jiming Peng, Yu Wei. 661-670 [doi]
• Toroidal Grids Are Anti-magicTao-Ming Wang. 671-679 [doi]
• Optimally Balanced Forward Degree SequenceXiaomin Chen, Mario Szegedy, Lei Wang. 680-689 [doi]
• Conditionally Critical Indecomposable GraphsChandan K. Dubey, Shashank K. Mehta, Jitender S. Deogun. 690-700 [doi]
• A Tight Analysis of the Maximal Matching HeuristicJean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot. 701-709 [doi]
• New Streaming Algorithms for Counting Triangles in GraphsHossein Jowhari, Mohammad Ghodsi. 710-716 [doi]
• A New Approach and Faster Exact Methods for the Maximum Common Subgraph ProblemW. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, Christopher T. Symons, Nagiza F. Samatova, Michael A. Langston. 717-727 [doi]
• On the Power of Lookahead in On-Line Vehicle Routing ProblemsLuca Allulli, Giorgio Ausiello, Luigi Laura. 728-736 [doi]
• Efficient Algorithms for Simplifying Flow NetworksEwa Misiolek, Danny Z. Chen. 737-746 [doi]
• Approximation Algorithms for the ::::b::::-Edge Dominating Set Problem and Its Related ProblemsTakuro Fukunaga, Hiroshi Nagamochi. 747-756 [doi]
• Bounded Degree Closest ::::k::::-Tree Power Is NP-CompleteMichael Dom, Jiong Guo, Rolf Niedermeier. 757-766 [doi]
• A New Algorithm for the Hypergraph Transversal ProblemLeonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich. 767-776 [doi]
• On Finding a Shortest Path in Circulant Graphs with Two JumpsDomingo Gómez, Jaime Gutierrez, Álvar Ibeas, Carmen Martínez, Ramón Beivide. 777-786 [doi]
• A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-TreesWen-Lian Hsu. 787-797 [doi]
• Algorithms for Finding Distance-Edge-Colorings of GraphsTakehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki. 798-807 [doi]
• On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect GraphsMaw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng. 808-817 [doi]
• Power Domination Problem in GraphsChung-Shou Liao, Der-Tsai Lee. 818-828 [doi]
• Complexity and Approximation of Satisfactory Partition ProblemsCristina Bazgan, Zsolt Tuza, Daniel Vanderpooten. 829-838 [doi]
• Distributed Weighted Vertex Cover via Maximal MatchingsFabrizio Grandoni, Jochen Könemann, Alessandro Panconesi. 839-848 [doi]
• On the Complexity of the Balanced Vertex Ordering ProblemJan Kára, Jan Kratochvíl, David R. Wood. 849-858 [doi]
• An O(2:::O(k):::n:::3:::) FPT Algorithm for the Undirected Feedback Vertex Set ProblemFrank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens. 859-869 [doi]
• Approximating the Longest Cycle Problem on Graphs with Bounded DegreeGuantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang. 870-884 [doi]
• Bin Packing and Covering Problems with RejectionYong He, György Dósa. 885-894 [doi]
• Query-Monotonic Turing ReductionsLane A. Hemaspaandra, Mayur Thakur. 895-904 [doi]
• On Sequential and 1-Deterministic P SystemsOscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang. 905-914 [doi]
• Global Optimality Conditions and Near-Perfect Optimization in CodingXiaofei Huang. 915-924 [doi]
• Angel, Devil, and KingMartin Kutz, Attila Pór. 925-934 [doi]
• Overlaps Help: Improved Bounds for Group Testing with Interval QueriesFerdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth. 935-944 [doi]
• New Efficient Simple Authenticated Key Agreement ProtocolEun-Jun Yoon, Kee-Young Yoo. 945-954 [doi]
• A Quadratic Lower Bound for Rocchio s Similarity-Based Relevance Feedback AlgorithmZhixiang Chen, Bin Fu. 955-964 [doi]
• The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(k a::1::)Sebastian Böcker, Zsuzsanna Lipták. 965-974 [doi]
• ::::W::::-Hardness Under Linear FPT-Reductions: Structural Properties and Further ApplicationsJianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia. 975-984 [doi]
• Some New Results on Inverse Sorting ProblemsXiao-guang Yang, Jian-zhong Zhang. 985-992 [doi]