Skip to main content
  • Conference proceedings
  • © 2000

LATIN 2000: Theoretical Informatics

4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings

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

Conference series link(s): LATIN: Latin American Symposium on Theoretical Informatics

Conference proceedings info: LATIN 2000.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • 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

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

Table of contents (47 papers)

  1. Front Matter

    Pages I-XIV
  2. Random Structures and Algorithms

    1. Algorithmic Aspects of Regularity

      • Y. Kohayakawa, V. Rödl
      Pages 1-17
    2. Small Maximal Matchings in Random Graphs

      • Michele Zito
      Pages 18-27
    3. Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs

      • Vlady Ravelomanana, Loÿs Thimonier
      Pages 28-37
    4. Equivalent Conditions for Regularity  (Extended Abstract)

      • Y. Kohayakawa, V. Rödl, J. Skokan
      Pages 48-57
  3. Algorithms I

    1. Cube Packing

      • F. K. Miyazawa, Y. Wakabayashi
      Pages 58-67
    2. Approximation Algorithms for Flexible Job Shop Problems

      • Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
      Pages 68-77
    3. The LCA Problem Revisited

      • Michael A. Bender, Martín Farach-Colton
      Pages 88-94
  4. Web Graph, Graph Theory I

    1. Graph Structure of the Web: A Survey

      • Prabhakar Raghavan
      Pages 123-125
    2. Polynomial Time Recognition of Clique-Width ≤  3 Graphs

      • Derek G. Corneil, Michel Habib, Jean-Marc Lanligne, Bruce Reed, Udi Rotics
      Pages 126-134
    3. On Dart-Free Perfectly Contractile Graphs Extended Abstract

      • Cláudia Linhares Sales, Frédéric Maffray
      Pages 135-144
  5. Graph Theory II

    1. Edge Colouring Reduced Indifference Graphs

      • Celina M. H. de Figueiredo, Célia Picinin de Mello, Carmen Ortiz
      Pages 145-153
    2. Two Conjectures on the Chromatic Polynomial

      • David Avis, Caterina De Simone, Paolo Nobili
      Pages 154-162
    3. Finding Skew Partitions Efficiently

      • Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
      Pages 163-172
  6. Competitive Analysis, Complexity

    1. On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract)

      • Allan Borodin, Ran El-Yaniv, Vincent Gogan
      Pages 173-196

Other Volumes

  1. LATIN 2000: Theoretical Informatics

Editors and Affiliations

  • ETH Zurich, Institute of Computational Science, CH-8092 Zurich and, Swiss Institute of Bioinformatics, Switzerland

    Gaston H. Gonnet

  • Pedeciba Informática, Uruguay

    Alfredo Viola

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • 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