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