Abstract is missing.
- Algorithmic Problems in Wireless Ad Hoc NetworksF. Frances Yao. 1 [doi]
- Probability and RecursionKousha Etessami, Mihalis Yannakakis. 2-4 [doi]
- Embedding Point Sets into Plane Graphs of Small DilationAnnette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas. 5-16 [doi]
- The Layered Net Surface Problems in Discrete Geometry and Medical Image SegmentationXiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka. 17-27 [doi]
- Separability with OutliersSariel Har-Peled, Vladlen Koltun. 28-39 [doi]
- Casting an Object with a CoreHee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa. 40-49 [doi]
- Sparse Geometric Graphs with Small DilationBoris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron. 50-59 [doi]
- Multiple Polyline to Polygon MatchingMirela Tanase, Remco C. Veltkamp, Herman J. Haverkort. 60-70 [doi]
- Minimizing a Monotone Concave Function with Laminar Covering ConstraintsMariko Sakashita, Kazuhisa Makino, Satoru Fujishige. 71-81 [doi]
- Almost Optimal Solutions for Bin Coloring ProblemsMingen Lin, Zhiyong Lin, Jinhui Xu. 82-91 [doi]
- GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive ConstraintsYing Xiao, Krishnaiyan Thulasiraman, Guoliang Xue. 92-105 [doi]
- Simultaneous MatchingsKhaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan. 106-115 [doi]
- An Optimization Problem Related to VoD BroadcastingTsunehiko Kameda, Yi Sun, Luis A. Goddyn. 116-125 [doi]
- A Min-Max Relation on Packing Feedback Vertex SetsXujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang. 126-135 [doi]
- Average Case Analysis for Tree Labelling SchemesMing-Yang Kao, Xiang-Yang Li, Weizhao Wang. 136-145 [doi]
- Revisiting T. Uno and M. Yagiura s Algorithm Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. 146-155 [doi]
- Generating Cut Conjunctions and Bridge Avoiding Extensions in GraphsLeonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. 156-165 [doi]
- Orthogonal Drawings of Series-Parallel Graphs with Minimum BendsXiao Zhou, Takao Nishizeki. 166-175 [doi]
- Bisecting a Four-Connected Graph with Three Resource SetsToshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi. 176-185 [doi]
- Laminar Structure of Ptolemaic Graphs and Its ApplicationsRyuhei Uehara, Yushi Uno. 186-195 [doi]
- On the Complexity of the ::::G::::-Reconstruction ProblemZdenek Dvorak, Vít Jelínek. 196-205 [doi]
- Hybrid Voting Protocols and Hardness of ManipulationEdith Elkind, Helger Lipmaa. 206-215 [doi]
- On the Complexity of Rocchio s Similarity-Based Relevance Feedback AlgorithmZhixiang Chen, Bin Fu. 216-225 [doi]
- Correlation Clustering and Consensus ClusteringPaola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang. 226-235 [doi]
- An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence ConstraintsKlaus Jansen, Hu Zhang. 236-245 [doi]
- A 1.5-Approximation of the Minimal Manhattan Network ProblemSebastian Seibert, Walter Unger. 246-255 [doi]
- Hardness and Approximation of Octilinear Steiner TreesMatthias Müller-Hannemann, Anna Schulze. 256-265 [doi]
- Dense Subgraph Problems with Output-Density ConditionsAkiko Suzuki, Takeshi Tokuyama. 266-276 [doi]
- A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without FeedbackYvo Desmedt, Yongge Wang, Mike Burmester. 277-287 [doi]
- Network Game with Attacker and Protector EntitiesMarios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis. 288-297 [doi]
- SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional DataSaeed Alaei, Mohammad Toossi, Mohammad Ghodsi. 298-307 [doi]
- The Phase MatrixPeter Høyer. 308-317 [doi]
- ISB-Tree: A New Indexing Scheme with Efficient Expected BehaviourAlexis C. Kaporis, Christos Makris, George Mavritsakis, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis. 318-327 [doi]
- External Data Structures for Shortest Path Queries on Planar DigraphsLars Arge, Laura Toma. 328-338 [doi]
- Improved Approximate String Matching Using Compressed Suffix Data StructuresTak Wah Lam, Wing-Kin Sung, Swee-Seong Wong. 339-348 [doi]
- Monitoring Continuous Band-Join Queries over Dynamic DataPankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu. 349-359 [doi]
- Approximate Colored Range QueriesYing Kit Lai, Chung Keung Poon, Benyun Shi. 360-369 [doi]
- Complexity and Approximation of the Minimum Recombination Haplotype Configuration ProblemLan Liu, Xi Chen, Jing Xiao, Tao Jiang. 370-379 [doi]
- Space Efficient Algorithms for Ordered Tree ComparisonLusheng Wang, Kaizhong Zhang. 380-391 [doi]
- A 1.75-Approximation Algorithm for Unsigned Translocation DistanceYun Cui, Lusheng Wang, Daming Zhu. 392-401 [doi]
- Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic NetworksNguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung. 402-411 [doi]
- Improved Algorithms for Largest Cardinality 2-Interval Pattern ProblemHao Yuan, Linji Yang, Erdong Chen. 412-421 [doi]
- Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial InformationYong He, Yiwei Jiang. 422-432 [doi]
- On-Line Computation and Maximum-Weighted Hereditary Subgraph ProblemsMarc Demange, Bernard Kouakou, Éric Soutif. 433-442 [doi]
- A Novel Adaptive Learning Algorithm for Stock Market PredictionLean Yu, Shouyang Wang, Kin Keung Lai. 443-452 [doi]
- Uniformization of Discrete DataLei Yang. 453-462 [doi]
- A Practical Algorithm for the Computation of Market Equilibrium with Logarithmic Utility FunctionsLi-Sha Huang. 463-472 [doi]
- Boosting Spectral Partitioning by Sampling and IterationJoachim Giesen, Dieter Mitsche. 473-482 [doi]
- Smoothed Analysis of Binary Search TreesBodo Manthey, Rüdiger Reischuk. 483-492 [doi]
- Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection GraphsChristoforos Raptopoulos, Paul G. Spirakis. 493-504 [doi]
- Counting Distinct Items over Update StreamsSumit Ganguly. 505-514 [doi]
- Randomized Algorithm for the Sum Selection ProblemTien-Ching Lin, D. T. Lee. 515-523 [doi]
- An Improved Interval Routing Scheme for Almost All Networks Based on Dominating CliquesMartin Nehéz, Daniel Olejár. 524-532 [doi]
- Basic Computations in Wireless NetworksIoannis Caragiannis, Clemente Galdi, Christos Kaklamanis. 533-542 [doi]
- A Simple Optimal Randomized Algorithm for Sorting on the PDMSanguthevar Rajasekaran, Sandeep Sen. 543-552 [doi]
- Efficient Parallel Algorithms for Constructing a ::::k::::-Tree Center and a ::::k::::-Tree Core of a Tree NetworkYan Wang, Deqiang Wang, Wei Liu, Baoyu Tian. 553-562 [doi]
- A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability Among Dominating ConfigurationsSatoshi Fujita. 563-572 [doi]
- Bounding the Number of Minimal Dominating Sets: A Measure and Conquer ApproachFedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov. 573-582 [doi]
- Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-WidthFeodor F. Dragan, Chenyu Yan. 583-592 [doi]
- Sampling Unlabeled Biconnected Planar GraphsManuel Bodirsky, Clemens Gröpl, Mihyun Kang. 593-603 [doi]
- Configurations with Few Crossings in Topological GraphsChristian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff. 604-613 [doi]
- On Bounded Load Routings for Modeling ::::k::::-Regular Connection TopologiesAdrian Kosowski, Michal Malafiejski, Pawel Zylinski. 614-623 [doi]
- On the Complexity of Global Constraint SatisfactionCristina Bazgan, Marek Karpinski. 624-633 [doi]
- Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, Carme Àlvarez, Joaquim Gabarró, Maria J. Serna. 634-643 [doi]
- An Improved O(1.234:::m:::)-Time Deterministic Algorithm for SATMasaki Yamamoto. 644-653 [doi]
- Solving Minimum Weight Exact Satisfiability in Time ::::O::::(2:::0.2441::::n:::::::)Stefan Porschen. 654-664 [doi]
- Efficient Algorithms for Finding a Longest Common Increasing SubsequenceWun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu. 665-674 [doi]
- Decision Making Based on Approximate and Smoothed Pareto CurvesHeiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking. 675-684 [doi]
- Computing Optimal Solutions for the min 3-set covering ProblemFederico Della Croce, Vangelis Th. Paschos. 685-692 [doi]
- Efficient Algorithms for the Weighted 2-Center Problem in a Cactus GraphBoaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi. 693-703 [doi]
- Algorithms for Local Forest SimilarityZeshan Peng. 704-713 [doi]
- Fast Algorithms for Finding Disjoint Subsequences with Extremal DensitiesAnders Bergkvist, Peter Damaschke. 714-723 [doi]
- A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a SequenceHiroki Arimura, Takeaki Uno. 724-737 [doi]
- 5-th Phylogenetic Root Construction for Strictly Chordal GraphsWilliam Kennedy, Guohui Lin. 738-747 [doi]
- Recursion Theoretic Operators for Function Complexity ClassesKenya Ueno. 748-756 [doi]
- From Balls and Bins to Points and VerticesRalf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes. 757-766 [doi]
- Simulating Undirected ::::st::::-Connectivity Algorithms on Uniform JAGs and NNJAGsPinyan Lu, Jialin Zhang, Chung Keung Poon, Jin-yi Cai. 767-776 [doi]
- Upper Bounds on the Computational Power of an Optical Model of ComputationDamien Woods. 777-788 [doi]
- Complexity of the Min-Max (Regret) Versions of Cut ProblemsHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. 789-798 [doi]
- Improved Algorithms for the ::::k:::: Maximum-Sums ProblemsChih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao. 799-808 [doi]
- Network Load GamesIoannis Caragiannis, Clemente Galdi, Christos Kaklamanis. 809-818 [doi]
- Minimum Entropy ColoringJean Cardinal, Samuel Fiorini, Gwenaël Joret. 819-828 [doi]
- Algorithms for Max Hamming Exact SatisfiabilityVilhelm Dahllöf. 829-838 [doi]
- Counting Stable Strategies in Random Evolutionary GamesSpyros C. Kontogiannis, Paul G. Spirakis. 839-848 [doi]
- Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and CyclesRolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid. 849-858 [doi]
- On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal PolygonsChris Worman, Boting Yang. 859-868 [doi]
- Optimal Paths for Mutually Visible AgentsJoel Fenwick, Vladimir Estivill-Castro. 869-881 [doi]
- Stacking and Bundling Two Convex PolygonsHee-Kap Ahn, Otfried Cheong. 882-891 [doi]
- Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation OperationsProsenjit Gupta. 892-901 [doi]
- A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage ProblemKazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi. 902-914 [doi]
- Approximating the Traffic Grooming ProblemMichele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. 915-924 [doi]
- Scheduling to Minimize Makespan with Time-Dependent Processing TimesLiying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao. 925-933 [doi]
- On Complexity and Approximability of the Labeled Maximum/Perfect Matching ProblemsJérôme Monnot. 934-943 [doi]
- Finding a Weight-Constrained Maximum-Density Subtree in a TreeSun-Yuan Hsieh, Ting-Yu Chou. 944-953 [doi]
- Finding Two Disjoint Paths in a Network with Normalized ::::alpha:::::::+:::-MIN-SUM Objective FunctionBing Yang, S. Q. Zheng, Enyue Lu. 954-963 [doi]
- Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann TimeSeth Pettie. 964-973 [doi]
- Approximation Algorithms for Layered Multicast SchedulingQingbo Cai, Vincenzo Liberatore. 974-983 [doi]
- Minimum Weight Triangulation by Cutting Out TrianglesMagdalene Grantson, Christian Borgelt, Christos Levcopoulos. 984-994 [doi]
- Multi-directional Width-Bounded Geometric Separator and Protein FoldingBin Fu, Sorinel Adrian Oprisan, Lizhe Xu. 995-1006 [doi]
- Shortest Paths and Voronoi Diagrams with Transportation Networks Under General DistancesSang Won Bae, Kyung-Yong Chwa. 1007-1018 [doi]
- Approximation Algorithms for Computing the Earth Mover s Distance Under TransformationsOliver Klein, Remco C. Veltkamp. 1019-1028 [doi]
- Fast k-Means Algorithms with Constant ApproximationMingjun Song, Sanguthevar Rajasekaran. 1029-1038 [doi]
- On Efficient Weighted Rectangle Packing with Large ResourcesAleksei V. Fishkin, Olga Gerber, Klaus Jansen. 1039-1050 [doi]
- On Routing in VLSI Design and Communication NetworksTamás Terlaky, Anthony Vannelli, Hu Zhang. 1051-1060 [doi]
- The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a TreeAndrew Lim, Fan Wang, Zhou Xu. 1061-1070 [doi]
- Distance Labeling in Hyperbolic GraphsCyril Gavoille, Olivier Ly. 1071-1079 [doi]
- Multi-source Trees: Algorithms for Minimizing Eccentricity Cost MetricsParaskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios. 1080-1089 [doi]
- Edge-Pancyclicity of Twisted CubesJianxi Fan, Xiaola Lin, Xiaohua Jia, Rynson W. H. Lau. 1090-1099 [doi]
- Combinatorial Network Abstraction by Trees and DistancesStefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke. 1100-1109 [doi]
- Drawing Phylogenetic TreesChristian Bachmaier, Ulrik Brandes, Barbara Schlieper. 1110-1121 [doi]
- Localized and Compact Data-Structure for Comparability GraphsFabrice Bazzaro, Cyril Gavoille. 1122-1131 [doi]
- Representation of Graphs by OBDDsRobin Nunkesser, Philipp Woelfel. 1132-1142 [doi]
- Space-Efficient Construction of LZ-IndexDiego Arroyuelo, Gonzalo Navarro. 1143-1152 [doi]
- Longest Increasing Subsequences in Windows Based on Canonical Antichain PartitionErdong Chen, Hao Yuan, Linji Yang. 1153-1162 [doi]
- Pareto Optimality in House Allocation ProblemsDavid J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn. 1163-1175 [doi]
- Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation TherapyDanny Z. Chen, Xiaobo Sharon Hu, Shuang (Sean) Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu. 1176-1186 [doi]