|
|
Reinhardt EULER Professor
Department of Computer
Science 20 avenue Le Gorgeu, BP 817 Tel. :
(33)(0)2.98.01.62.09 Email : reinhardt.euler@univ-brest.fr |
|
Research Interests :
Combinatorial Algorithms and Optimization
Others :
Contemporary Art and Photography
Recent Publications :
Characterizing Bipartite
Toeplitz-graphs
R. Euler
Theoretical Computer Science 263 (2001) 47-58
Special Issue: 10th French-Japanese and 5th French-Chinese Conference Combinatorics and Computer Science,
LIX-Ecole Polytechnique,
Palaiseau, July 1997.
Coloring Planar Toeplitz
Graphs and the Stable Set Polytope
R. Euler
Discrete Mathematics 276 (2004) 183-200
Special Issue: 6th International Conference
on Graph Theory, Marseille, September 2000.
Hajòs' Construction and Polytopes
R. Euler
in: Combinatorial Optimization - Eureka, You Shrink!, Papers
dedicated to Jack Edmonds,
5th Combinatorial Optimization Workshop, Aussois,
France, March 2001,
Lecture Notes in Computer Science Nr. 2570, Springer, 2003, 39-47.
A Bipartite Graph
Simplex Method
R. Euler
in: Operations Research Proceedings 2003 - Selected papers of the International Conference on Operations Research (OR 2003)
The Fibonacci Number of
a Grid Graph and a New Class of Integer Sequences
R. Euler
Journal of Integer Sequences 8 (2005), article 05.2.6.
Counting Bases in Hyperpaths
R. Euler
Technical Report, University of Brest, September
2005.
On the completability of incomplete latin squares
R.Euler
European Journal of Combinatorics 31 (2010),
535-552
Special Issue dedicated to Michel Deza on the
occasion of his 70th birthday.
When is an incomplete (3,n) - latin rectangle completable?
R.Euler
To be presented at the 24th European
Conference on Operational Research,
Counting maximal
independent sets in grid graphs - Some extensions
R.Euler
Presented at the 17th Workshop '3in1' Graphs,
On planar Toeplitz graphs
R.Euler, T.Zamfirescu
Presented at the 11th International Conference on Discrete Mathematics,
and at the 13th Workshop on Graph Theory CID,