Homepage
My research interests are in the area of algorithms and
data structures.
Some of the topics that I am mostly
interested in are:
- Selection and Sorting Problems
- String Problems
- Data Structures
-
Craig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dimitrios Michail
and Evangelia Pyrga.
Cycle bases of graphs and sampled manifolds.
In journal: Computer Aided Geometric Design,
volume 24(8-9),
pages 464-480,
Elsevier, 2007
-
Kanela Kaligosi and Peter Sanders. How Branch Mispredictions
Affect Quicksort. In Proc. 14th Annual European Symposium on
Algorithms (ESA 2006). Lecture Notes in Computer Science 4168, pages 780-791, Springer, 2006.
- Gerth Stoelting Brodal, Kanela Kaligosi, Irit Katriel and Martin
Kutz.
Faster Algorithms for Computing Longest Common Increasing
Subsequences.
In Proc. 17th Annual Symposium on Combinatorial Pattern
Matching (CPM 2006), Lecture Notes in Computer Scinece. Springer
Verlang, 2006.
- Kanela Kaligosi, Kurt Mehlhorn, J.Ian Munro and Peter Sanders.
Towards optimal multiple selection.
In Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), Lecture Notes in Computer Science 3580, pages 103-114, Springer, 2005.
-
Kanela Kaligosi.
Length bounded network flows.
Master thesis.
University of Saarland, January 2004,
Advisor: Prof. Martin Skutella.
Also, I enjoy teaching. Here are some courses for which I was a teaching assistant:
- Optimization course (Teaching Assistant, Summer Semester 2003)
- Data Structures and Algorithms (Teaching Assistant, Winter Semester
2003/2004)
- Large Scale Optimization (Teaching Assistant, Summer Semester 2004)
- Complexity Theory (Teaching Assistant, Winter Semester 2005/2006)
- traveling and geting to know other cultures
- Reading literature and dancing
