lunduniversity.lu.se

Computer Science

Faculty of Engineering, LTH

Denna sida på svenska This page in English

Efficient algorithms and approximation heuristics for combinatorial and geometric problems

2008-01-01

Period: 2008-2011

Funder: Swedish Research Council (Vetenskapsrådet) VR 2008-4649 (2008–2011)

Grant holder: Andrzej Lingas

Affiliated senior researchers:

  • Christos Levcopoulos (docent, Lund University)
  • Bengt Nilsson (professor, Malmö College)

Affiliated junior researchers:

  • Peter Floderus (Ph.D. student Lund University)
  • Eva-Marta Lundell (Ph.D., Lund 2009)
  • Martin Wahlen (Ph.D., Lund 2009)
  • Mattias Andersson (Ph.D., Lund 2007)
  • Mia Persson (Ph.D., Lund 2006)

International collaboration:

  • Antonios Antoniadis, HU Berlin
  • Artur Czumaj, Warwick University
  • Leszek Gasieniec, Liverpool University
  • Joakim Gudmundsson, National ICT Australia in Sydney,
  • Jesper Jansson, Ochanomizu University, Tokyo
  • Kazuo Iwama, Kyoto University
  • Marek Karpinski and Rolf Klein, Bonn University
  • Miroslaw Kowaluk, Warsaw University
  • Pawel Zylinski, Gdansk University

Description: The construction and analysis of algorithms and data structures is a basic and very important part of modern computer science. Its importance increases also by the rapid development of more powerful and faster computers. All computer programs can be described as algorithms that operate on a structured set of data, or as a concatenation of such algorithms. To construct a large program with a reasonable time and space consumption it is essential to have efficient solutions to the problem parts.

The main areas of research studied by the algorithm group fall into five mutually interrelated categories, namely computational geometry, geometric graph algorithms, parallel, distributed and sequential graph algorithms, computational biology, searching

 

 

Computer Science