Abstract is missing.
- Profile of TriesGaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski. 1-11 [doi]
- Random 2-XORSAT at the Satisfiability ThresholdHervé Daudé, Vlady Ravelomanana. 12-23 [doi]
- On Dissemination Thresholds in Regular and Irregular Graph ClassesIvan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte. 24-35 [doi]
- How to Complete a Doubling MetricAnupam Gupta, Kunal Talwar. 36-47 [doi]
- Sorting and Selection with Random CostsStanislav Angelov, Keshav Kunal, Andrew McGregor. 48-59 [doi]
- Guided Search and a Faster Deterministic Algorithm for 3-SATDominik Scheder. 60-71 [doi]
- Comparing and Aggregating Partially Resolved TreesMukul S. Bansal, Jianrong Dong, David Fernández-Baca. 72-83 [doi]
- Computing the Growth of the Number of Overlap-Free Words with Spectra of MatricesRaphael M. Jungers, Vladimir Protasov, Vincent D. Blondel. 84-93 [doi]
- On Stateless Multihead Automata: Hierarchies and the Emptiness ProblemOscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin. 94-105 [doi]
- Myhill-Nerode Theorem for Recognizable Tree Series RevisitedAndreas Maletti. 106-120 [doi]
- The View Selection Problem for Regular Path QueriesSergey Afonin. 121-132 [doi]
- Optimal Higher Order Delaunay Triangulations of PolygonsRodrigo I. Silveira, Marc J. van Kreveld. 133-145 [doi]
- Coloring Geometric Range SpacesGreg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky. 146-157 [doi]
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware NodesJurek Czyzowicz, Stefan Dobrev, Thomas Fevens, H. González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia. 158-169 [doi]
- Spanners of Complete k -Partite Geometric GraphsProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid. 170-181 [doi]
- Minimum Cost Homomorphisms to Reflexive DigraphsArvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey. 182-193 [doi]
- On the Complexity of Reconstructing H -free Graphs from Their Star SystemsFedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle. 194-205 [doi]
- Optimization and Recognition for K 5-minor Free Graphs in Linear TimeBruce A. Reed, Zhentao Li. 206-215 [doi]
- Bandwidth of Bipartite Permutation Graphs in Polynomial TimePinar Heggernes, Dieter Kratsch, Daniel Meister. 216-227 [doi]
- The Online Transportation Problem: On the Exponential Boost of One Extra ServerChristine Chung, Kirk Pruhs, Patchrawat Uthaisombut. 228-239 [doi]
- Average Rate Speed ScalingNikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs. 240-251 [doi]
- Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two BuffersMarcin Bienkowski, Aleksander Madry. 252-263 [doi]
- Maximizing the Minimum Load for Selfish AgentsLeah Epstein, Rob van Stee. 264-275 [doi]
- Approximate Polynomial gcd: Small Degree and Small Height PerturbationsJoachim von zur Gathen, Igor Shparlinski. 276-283 [doi]
- Pseudorandom Graphs from Elliptic CurvesIgor Shparlinski. 284-292 [doi]
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)Ali Akhavi, Damien Stehlé. 293-305 [doi]
- Sparse Approximate Solutions to Semidefinite ProgramsElad Hazan. 306-316 [doi]
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two ConstraintsGérard Cornuéjols, François Margot. 317-328 [doi]
- A Polyhedral Investigation of the LCS Problem and a Repetition-Free VariantCristina G. Fernandes, Carlos Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi. 329-338 [doi]
- Competitive Cost Sharing with Economies of ScaleMartin Hoefer. 339-349 [doi]
- Emergency Connectivity in Ad-Hoc Networks with Selfish NodesGeorge Karakostas, Euripides Markou. 350-361 [doi]
- Fully-Compressed Suffix TreesLuís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira. 362-373 [doi]
- Improved Dynamic Rank-Select Entropy-Bound StructuresRodrigo González, Gonzalo Navarro. 374-386 [doi]
- An Improved Algorithm Finding Nearest Neighbor Using Kd-treesRina Panigrahy. 387-398 [doi]
- List Update with Locality of ReferenceSpyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz. 399-410 [doi]
- Approximating Steiner Networks with Node WeightsZeev Nutov. 411-422 [doi]
- Approximating Minimum-Power Degree and Connectivity ProblemsGuy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko. 423-435 [doi]
- Energy Efficient Monitoring in Sensor NetworksAmol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi. 436-448 [doi]
- Approximation Algorithms for k-Hurdle ProblemsBrian C. Dean, Adam Griffis, Adam Whitley. 449-460 [doi]
- Approximating Crossing Minimization in Radial LayoutsSeok-Hee Hong, Hiroshi Nagamochi. 461-472 [doi]
- New Upper Bound on Vertex Folkman NumbersAndrzej Dudek, Vojtech Rödl. 473-478 [doi]
- Ptolemaic Graphs and Interval Graphs Are Leaf PowersAndreas Brandstädt, Christian Hundt. 479-491 [doi]
- A Representation Theorem for Union-Difference Families and ApplicationBinh-Minh Bui-Xuan, Michel Habib. 492-503 [doi]
- Algorithms to Locate Errors Using Covering ArraysConrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens. 504-519 [doi]
- On Injective Colourings of Chordal GraphsPavol Hell, André Raspaud, Juraj Stacho. 520-530 [doi]
- Spanning Trees with Many Leaves in Graphs without Diamonds and BlossomsPaul S. Bonsma, Florian Zickfeld. 531-543 [doi]
- On 2-Subcolourings of Chordal GraphsJuraj Stacho. 544-554 [doi]
- Collective Additive Tree Spanners of Homogeneously Orderable GraphsFeodor F. Dragan, Chenyu Yan, Yang Xiang. 555-567 [doi]
- The Generalized Median Stable Matchings: Finding Them Is Not That EasyChristine Cheng. 568-579 [doi]
- Stateless Near Optimal Flow Control with Poly-logarithmic ConvergenceBaruch Awerbuch, Rohit Khandekar. 580-592 [doi]
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided PreferencesRichard Matthew McCutchen. 593-604 [doi]
- Randomized Rendez-Vous with Limited MemoryEvangelos Kranakis, Danny Krizanc, Pat Morin. 605-616 [doi]
- Origami Embedding of Piecewise-Linear Two-ManifoldsMarshall W. Bern, Barry Hayes. 617-629 [doi]
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet DistanceSergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu. 630-641 [doi]
- Weighted Rectilinear Approximation of Points in the PlaneMario A. Lopez, Yan Mayster. 642-653 [doi]
- Paths with no Small AnglesImre Bárány, Attila Pór, Pavel Valtr. 654-663 [doi]
- Simpler Constant-Seed CondensersDomingos Dellamonica Jr.. 664-675 [doi]
- Parallel Repetition of the Odd Cycle GameKooshiar Azimian, Mario Szegedy. 676-686 [doi]
- I/O-Efficient Point Location in a Set of RectanglesYakov Nekrich. 687-698 [doi]
- Finding Heavy Hitters over the Sliding Window of a Weighted Data StreamRegant Y. S. Hung, Hing-Fung Ting. 699-710 [doi]
- Fixed-Parameter Algorithms for Cluster Vertex DeletionFalk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier. 711-722 [doi]
- Paths and Trails in Edge-Colored GraphsA. Abouelaoualim, Kinkar Chandra Das, L. Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad. 723-735 [doi]
- Efficient Approximation Algorithms for Shortest Cycles in Undirected GraphsAndrzej Lingas, Eva-Marta Lundell. 736-746 [doi]
- Domination in Geometric Intersection GraphsThomas Erlebach, Erik Jan van Leeuwen. 747-758 [doi]
- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 GroupsGábor Ivanyos, Luc Sanselme, Miklos Santha. 759-771 [doi]
- Quantum Property Testing of Group SolvabilityYoshifumi Inui, François Le Gall. 772-783 [doi]
- Solving NP-Complete Problems with Quantum SearchMartin Fürer. 784-792 [doi]