Welcome at CreativeCouple

About us

We, Nannette and Peter Liske, were born and bred in Berlin (Germany) and are both graduate computer scientists.
Our area of expertise is theoretical computer science.
Job-related we often work in e-commerce or web projects.

On this page we want to inform about some of our private projects.
From time to time we may put something new here.

Have fun
— CreativeCouple

Project: jquery-timing

This jQuery plugin aims to help developers building clean JavaScript code concerning timeouts, intervals, and timed animations.
With the meaning of jQuery – write less. do more.

Download

Project: Graphenspiele

In computer science you will find a special kind of data structure – so called graphs.
A graph is a set of nodes, connected to each other with edges.
With our «Graphenspiele» (graph games) it is easy to create and manipulate graphs.
You can save your results to load it from disk later.
Furthermore many basic algorithmic problems for graph structures are explained clearly and provided as a game to the user.

Algorithms

Traveling Salesman Problem

Steiner's tree problem

Finding minimum spanning trees

Graph Colouring

Finding long cycles

Download

You need JRE 1.5 or higher to run the Java-Application.
The executable archive is available at graphenspiele.jar, version 2.1.1.

Project: PlanarityGame

The Planarity Game is a selfstanding algorithmic game from the Graphenspiele. With a little skill and fortune you can even come to the highscore list.

Goal of the Game

For a given graph with a selected number of nodes one has move the nodes until no two edges cross.

Download

You need JRE 1.4 or higher to run the Java-Application.
The executable archive is available at planar.jar, version 2.1.beta.

Project: TSP – The TravellingSalesman Problem

The TSP Game is a selfstanding part of the Graphenspiele. With a little skill and fortune you can get into the highscore list.

Goal of the Game

You will see a set of nodes, that you have to connect in a single tour by manually inserting edges. Try to find the shortest tour possible - the current length of the tour is updated constantly. When you're done you can check out how good your result is.

Download

You need JRE 1.4 or higher to run the Java-Application.
The executable archive is available at tsp.jar, version 2.1.beta.