Zugl.: Hamburg, Univ., Diss., 2005
Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs (2001)
Let G be a plane graph whose vertices are to be colored subject to constraints on some of the faces. There are 3 types of constraints: a C indicates that the face must contain two vertices of a...
Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs (2001)
Let G be a plane graph whose vertices are to be colored subject to constraints on some of the faces. There are 3 types of constraints: a C indicates that the face must contain two vertices of a...
Recombination Operators for Evolutionary (1999)
This paper illustrates an evolutionary algorithm for drawing graphs according to a number of esthetic criteria. Tests are carried out on three graphs of increasing difficulty and the performance of...
Modèles biologiques en optimisation combinatoire et modèles mathématiques en génétique / (1999)
Thèse no 2005 sciences EPF Lausanne.
STOL - literate programming in Scheme (1992)
Contents 1 Introduction 1 1.1 How St o L works : : : : : : : : : : : : 2 1.2 Simple example : : : : : : : : : : : : : 2 1.3 Summary of basic features : : : : : : : 2 2 What St o L expects 3 3...
--- Literate Programming in (1992)
Contents 1 Introduction 1 1.1 How St o L works : : : : : : : : : : : : 2 1.2 Simple example : : : : : : : : : : : : : 2 1.3 Summary of basic features : : : : : : : 2 2 What St o L expects 3 3...
--- Literate Programming in (1970)
Contents 1 Introduction 1 1.1 How St o L works : : : : : : : : : : : : 2 1.2 Simple example : : : : : : : : : : : : : 2 1.3 Summary of basic features : : : : : : : 2 2 What St o L expects 3 3...