Skip to main content
  • Conference proceedings
  • © 2006

SOFSEM 2006: Theory and Practice of Computer Science

32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 21-27, 2006, Proceedings

Conference proceedings info: SOFSEM 2006.

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 (55 papers)

  1. Front Matter

  2. Invited Talks

    1. How Can Nature Help Us Compute?

      • S. Barry Cooper
      Pages 1-13
    2. Evolving Ontology Evolution

      • Giorgos Flouris, Dimitris Plexousakis, Grigoris Antoniou
      Pages 14-29
    3. A Formal Comparison of Visual Web Wrapper Generators

      • Georg Gottlob, Christoph Koch
      Pages 30-48
    4. Selfish Routing in Networks

      • Burkhard Monien
      Pages 61-62
    5. New Physics and Hypercomputation

      • Istvan Németi, Hajnal Andreka
      Pages 63-63
    6. SomeWhere in the Semantic Web

      • M. -C. Rousset, P. Adjiman, P. Chatalic, F. Goasdoué, L. Simon
      Pages 84-99
    7. Mobility in Wireless Networks

      • Christian Schindelhauer
      Pages 100-116
    8. Group Communication: From Practice to Theory

      • André Schiper
      Pages 117-136
  3. Regular Papers

    1. A General Data Reduction Scheme for Domination in Graphs

      • Jochen Alber, Britta Dorn, Rolf Niedermeier
      Pages 137-147
    2. Non-intersecting Complexity

      • Aleksandrs Belovs
      Pages 158-165
    3. Constructing Interference-Minimal Networks

      • Marc Benkert, Joachim Gudmundsson, Herman Haverkort, Alexander Wolff
      Pages 166-176
    4. Matching Points with Rectangles and Squares

      • Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff
      Pages 177-186
    5. Searching Paths of Constant Bandwidth

      • Bernd Borchert, Klaus Reinhardt
      Pages 187-196
    6. Graph Searching and Search Time

      • Franz J. Brandenburg, Stephanie Herrmann
      Pages 197-206
    7. Simple Algorithm for Sorting the Fibonacci String Rotations

      • Manolis Christodoulakis, Costas S. Iliopoulos, Yoan José Pinzón Ardila
      Pages 218-225

Other Volumes

  1. SOFSEM 2006: Theory and Practice of Computer Science

Editors and Affiliations

  • Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague 8, Czech Republic

    Jiří Wiedermann, Július Štuller

  • Department of Information and Computer Sciences, University of Utrecht, Utrecht, The Netherlands

    Gerard Tel

  • Faculty of Mathematics and Physics, Charles University, Prague

    Jaroslav Pokorný

  • Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Bratislava

    Mária Bieliková

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