[go: up one dir, main page]
Skip to main content
Springer Nature Link
Account

LATIN 2010: Theoretical Informatics

9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010, Proceedings

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Alejandro López-Ortiz

    1. Faculty of Mathematics, Department of Computer Science, University of Waterloo, Waterloo, Canada

  • Fast track conference proceeding
  • Unique visibility
  • State of the art resarch

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6034)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: LATIN 2010.

  • 67k Accesses

  • 2 Citations

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook EUR 85.59
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 105.49
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (60 papers)

  1. Front Matter

    Download chapter PDF

  2. Continuous and Discrete Methods in Computer Science

    • Cristopher Moore
    Pages 1-1

  3. Colorful Strips

    • Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman et al.
    Pages 2-13

  4. The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions

    • Jonathan Backer, J. Mark Keil
    Pages 14-25

  5. Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set

    • Qianping Gu, Navid Imani
    Pages 26-37

  6. Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines

    • Eric Angel, Evripidis Bampis, Nicolas Thibault
    Pages 38-48

  7. Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width

    • Martin Fürer
    Pages 49-59

  8. Average Parameterization and Partial Kernelization for Computing Medians

    • Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier
    Pages 60-71

  9. Sharp Separation and Applications to Exact and Parameterized Algorithms

    • Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh
    Pages 72-83

  10. Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight

    • Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang
    Pages 84-95

  11. The Language Theory of Bounded Context-Switching

    • Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato
    Pages 96-107

  12. Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling

    • Diego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld
    Pages 108-119

  13. Packet Routing on the Grid

    • Britta Peis, Martin Skutella, Andreas Wiese
    Pages 120-130

  14. Faithful Representations of Graphs by Islands in the Extended Grid

    • Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomáš Vyskočil
    Pages 131-142

  15. The I/O Complexity of Sparse Matrix Dense Matrix Multiplication

    • Gero Greiner, Riko Jacob
    Pages 143-156

  16. Sparse Recovery Using Sparse Random Matrices

    • Piotr Indyk
    Pages 157-157

  17. Optimal Succinctness for Range Minimum Queries

    • Johannes Fischer
    Pages 158-169

  18. Compact Rich-Functional Binary Relation Representations

    • Jérémy Barbay, Francisco Claude, Gonzalo Navarro
    Pages 170-183

  19. Radix Cross-Sections for Length Morphisms

    • Sylvain Lombardy, Jacques Sakarovitch
    Pages 184-195

  20. Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata

    • Viliam Geffert, Giovanni Pighizzini
    Pages 196-207
Back to top

Other volumes

  1. LATIN 2010: Theoretical Informatics

Editors and Affiliations

  • Faculty of Mathematics, Department of Computer Science, University of Waterloo, Waterloo, Canada

    Alejandro López-Ortiz

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top