Abstract is missing.
- Interactive Proofs for Quantum ComputationAndrew Chi-Chih Yao. 1 [doi]
- Drawing Plane GraphsTakao Nishizeki. 2-5 [doi]
- Linear Time Algorithm for Approximating a Curve by a Single-Peaked CurveJinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama. 6-15 [doi]
- A Dynamic Dictionary for Priced Information with ApplicationAnil Maheshwari, Michiel H. M. Smid. 16-25 [doi]
- Voronoi Diagram in the Flow FieldTetsushi Nishida, Kokichi Sugihara. 26-35 [doi]
- Polygonal Path Approximation: A Query Based ApproachOvidiu Daescu, Ningfang Mi. 36-46 [doi]
- A Vertex Incremental Approach for Dynamically Maintaining Chordal GraphsAnne Berry, Pinar Heggernes, Yngve Villanger. 47-57 [doi]
- Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning TreesAtsuko Yamaguchi, Hiroshi Mamitsuka. 58-67 [doi]
- Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract)Ornan Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg. 68-77 [doi]
- Finding a Length-Constrained Maximum-Density Path in a TreeRung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao. 78-87 [doi]
- The Intractability of Computing the Hamming DistanceBodo Manthey, Rüdiger Reischuk. 88-97 [doi]
- Infinitely-Often Autoreducible SetsRichard Beigel, Lance Fortnow, Frank Stephan. 98-107 [doi]
- Limiting Negations in Bounded-Depth Circuits: An Extension of Markov s TheoremShao Chin Sung, Keisuke Tanaka. 108-116 [doi]
- Computational Complexity Measures of Multipartite Quantum EntanglementTomoyuki Yamakami. 117-128 [doi]
- A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle GraphsGabriel Valiente. 129-137 [doi]
- Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover ProblemHiroshi Nagamochi, Kohei Okada. 138-147 [doi]
- Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard ProblemsJianer Chen, Iyad A. Kanj, Ge Xia. 148-157 [doi]
- A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching ProblemHiroaki Yamamoto. 158-167 [doi]
- The Quantum Query Complexity of 0-1 Knapsack and Associated Claw ProblemsVikraman Arvind, Rainer Schuler. 168-177 [doi]
- Non-interactive Quantum Perfect and Statistical Zero-KnowledgeHirotada Kobayashi. 178-188 [doi]
- Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami. 189-198 [doi]
- A Faster Lattice Reduction Method Using Quantum SearchChristoph Ludwig. 199-208 [doi]
- Three Sorting Algorithms Using Priority QueuesAmr Elmasry. 209-220 [doi]
- Lower Bounds on Correction NetworksGrzegorz Stachowiak. 221-229 [doi]
- Approximate Regular Expression Searching with Arbitrary Integer WeightsGonzalo Navarro. 230-239 [doi]
- Constructing Compressed Suffix Arrays with Large AlphabetsWing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung. 240-249 [doi]
- On the Geometric Dilation of Finite Point SetsAnnette Ebbers-Baumann, Ansgar Grüne, Rolf Klein. 250-259 [doi]
- On Computing All Immobilizing Grasps of a Simple Polygon with Few ContactsJae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen. 260-269 [doi]
- Optimal Point Set Projections onto Regular GridsJosé Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, Joan Antoni Sellarès. 270-279 [doi]
- An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified AreasHiroshi Nagamochi, Yuusuke Abe. 280-289 [doi]
- A Faster Algorithm for Two-Variable Integer ProgrammingFriedrich Eisenbrand, Sören Laue. 290-299 [doi]
- Efficient Algorithms for Generation of Combinatorial Covering SuitesAdrian Dumitrescu. 300-308 [doi]
- A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time LagsYoshiyuki Karuno, Hiroshi Nagamochi. 309-318 [doi]
- On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release DatesAleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli. 319-328 [doi]
- Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional MeshesDeshi Ye, Guochuan Zhang. 329-338 [doi]
- Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial GenomeYaw-Ling Lin, Tsan-sheng Hsu. 339-351 [doi]
- Settling the Intractability of Multiple AlignmentIsaac Elias. 352-363 [doi]
- Efficient Algorithms for Optimizing Whole Genome Alignment with NoiseTak Wah Lam, N. Lu, Hing-Fung Ting, Prudence W. H. Wong, Siu-Ming Yiu. 364-374 [doi]
- Segmenting Doughnut-Shaped Objects in Medical ImagesXiaodong Wu. 375-384 [doi]
- On the Locality Properties of Space-Filling CurvesHo-Kwok Dai, Hung-Chi Su. 385-394 [doi]
- Geometric Restrictions on Producible Polygonal Protein ChainsErik D. Demaine, Stefan Langerman, Joseph O Rourke. 395-404 [doi]
- Symmetric Layout of Disconnected GraphsSeok-Hee Hong, Peter Eades. 405-414 [doi]
- Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal MatchingMiroslav Chlebík, Janka Chlebíková. 415-424 [doi]
- Enumerating Global Roundings of an Outerplanar GraphNadia Takki-Chebihi, Takeshi Tokuyama. 425-433 [doi]
- Augmenting Forests to Meet Odd Diameter RequirementsToshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi. 434-443 [doi]
- On the Existence and Determination of Satisfactory Partitions in a GraphCristina Bazgan, Zsolt Tuza, Daniel Vanderpooten. 444-453 [doi]
- A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory ModelTom Altman, Yoshihide Igarashi, Michiko Omori. 454-463 [doi]
- An Optimal Parallel Algorithm for c-Vertex-Ranking of TreesAbul Kashem, M. Ziaur Rahman. 464-473 [doi]
- The Student-Project Allocation ProblemDavid J. Abraham, Robert W. Irving, David Manlove. 474-484 [doi]
- Algorithms for Enumerating Circuits in MatroidsEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan. 485-494 [doi]
- A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage ModelAkinobu Eguchi, Satoru Fujishige, Akihisa Tamura. 495-504 [doi]
- Succinct Data Structures for Searchable Partial SumsWing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung. 505-516 [doi]
- Range Mode and Range Median Queries on Lists and TreesDanny Krizanc, Pat Morin, Michiel H. M. Smid. 517-526 [doi]
- Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable TestsFerdinando Cicalese, Christian Deppe. 527-536 [doi]
- New Ways to Construct Binary Search TreesTravis Gagie. 537-543 [doi]
- Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic TreewidthArtur Czumaj, Andrzej Lingas, Johan Nilsson. 544-553 [doi]
- Biconnectivity on Symbolically Represented Graphs: A Linear SolutionRaffaella Gentilini, Alberto Policriti. 554-564 [doi]
- A Dynamic Data Structure for Maintaining Disjoint Paths Information in DigraphsTorsten Tholey. 565-574 [doi]
- Deterministic Algorithm for the t-Threshold Set ProblemJérémy Barbay, Claire Kenyon. 575-584 [doi]
- Energy-Efficient Wireless Network DesignIoannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos. 585-594 [doi]
- Wavelength Conversion in Shortest-Path All-Optical NetworksThomas Erlebach, Stamatis Stefanakos. 595-604 [doi]
- A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely ExactAmin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff. 605-614 [doi]
- Flexible Train RosteringStephan Eidenbenz, Aris Pagourtzis, Peter Widmayer. 615-624 [doi]
- Counting Complexity Classes over the Reals I: The Additive CasePeter Bürgisser, Felipe Cucker. 625-634 [doi]
- Some Properties of One-Pebble Turing Machines with Sublogarithmic SpaceAtsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki. 635-644 [doi]
- Hypergraph Decomposition and Secret SharingGiovanni Di Crescenzo, Clemente Galdi. 645-654 [doi]
- A Promising Key Agreement ProtocolEun-Kyung Ryu, Kee-Won Kim, Kee-Young Yoo. 655-662 [doi]
- Rapid Mixing of Several Markov Chains for a Hard-Core ModelRavi Kannan, Michael W. Mahoney, Ravi Montenegro. 663-675 [doi]
- Polynomial Time Approximate Sampler for Discretized Dirichlet DistributionTomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani. 676-685 [doi]
- Fair Cost Allocations under Conflicts - A Game-Theoretic Point of ViewYoshio Okamoto. 686-695 [doi]
- Equilibria for Networks with Malicious UsersGeorge Karakostas, Anastasios Viglas. 696-704 [doi]
- Quasi-optimal Arithmetic for Quaternion PolynomialsMartin Ziegler. 705-715 [doi]
- Upper Bounds on the Complexity of Some Galois Theory ProblemsVikraman Arvind, Piyush P. Kurur. 716-725 [doi]
- Unfolded Modular MultiplicationWieland Fischer, Jean-Pierre Seifert. 726-735 [doi]
- Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small CharacteristicSoonhak Kwon, Chang Hoon Kim, Chun-Pyo Hong. 736-745 [doi]