8. LATIN 2008: Búzios, Brazil

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