<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML>
Trasmetto la modifica della data relativa al seminario comunicatovi dal
Prof. Bini il 17/7/2003:
<P>>X-Original-To: paola.favati@iit.cnr.it
<BR>>Delivered-To: paola.favati@iit.cnr.it
<BR>>X-Sender: marco.pellegrini@iit.cnr.it@mx.iit.cnr.it
<BR>>X-Mailer: QUALCOMM Windows Eudora Version 5.1
<BR>>Date: Fri, 18 Jul
2003 14:51:35 +0200
<BR>>Reply-To: "mailing list dell'Istituto di Matematica Computazionale"
<BR>><IMCLIST@IMC.PI.CNR.IT>
<BR>>Sender: "mailing list dell'Istituto di Matematica Computazionale"
<BR>><IMCLIST@IMC.PI.CNR.IT>
<BR>>From: Marco Pellegrini <marco.pellegrini@IIT.CNR.IT>
<BR>>Subject: CHANGE OF DATE: Thursday July 24th,
<BR>> Talk on Graph
Coloring by Prof.J. Nesetril, Charles Univ. Prage
<BR>>Comments: To: IIT@iit.cnr.it, bacheca@isti.cnr.it, imclist@iit.cnr.it
<BR>>Comments: cc: Jaroslav Nesetril <nesetril@kam-enterprise.ms.mff.cuni.cz>
<BR>>To: IMCLIST@IMC.PI.CNR.IT
<BR>>X-Virus-Scanned: by Virus Scanner at iit.cnr.it
<BR>>
<BR>>APOLOGIES FOR MULTIPLE COPIES
<BR>>
<BR>><B>CHANGE OF DATE:</B>
<BR><B>></B>
<BR><B>>10.30 am Thursday, July 24th 2003. Istituto di Informatica
e Telematica.</B>
<BR><B>>Seminar room B63A</B>
<BR><B>></B>
<BR><B>>Prof. Jaroslav Nesetril</B>
<BR><B>></B>
<BR><B>>ITI Charles University - Prague</B>
<BR><B>></B>
<BR><B>>Title: Some Coloring Problems - characterizing good
characterizations</B>
<BR><B>></B>
<BR><B>>Abstract: We present an algebraic scheme for coloring problems</B>
<BR><B>>(generalized Galai-Hasse-Witt Theorem) and show how finitary</B>
<BR><B>>good characterizations can be characterized.</B>
<BR><B>>This leads to some paradoxical complexity issues.</B>
<BR><B>></B>
<BR><B>>Vita:</B>
<BR><B>>Professor Jaroslav Nesetril of the Department of</B>
<BR><B>>Applied Mathematics, Faculty of Mathematics and Physics,</B>
<BR><B>>Charles University in Prague is the</B>
<BR><B>>director of the Institute of Theoretical</B>
<BR><B>>Computer Science, Charles University, Prague</B>
<BR><B>>and of the DIMATIA Centre, Prague.</B>
<BR><B>>He is author of over 250 publications</B>
<BR><B>>(including some books), mainly in Graph Theory and
Combinatorics.</B>
<BR><B>></B>
<BR><B>></B>
<BR><B>>Contact:</B>
<BR><B>>Prof. Nesetril at J.Nesetril@iit.cnr.it</B>
<BR><B>>or</B>
<BR><B>>Dr. Marco Pellegrini at Marco.Pellegrini@iit.cnr.it</B>
<BR><B>></B>
<BR><B>></B>
<BR><B>>Marco Pellegrini</B>
<BR><B>>IIT - CNR</B>
<BR><B>>Area della Ricerca.</B>
<BR><B>>Via Moruzzi 1</B>
<BR><B>>56124 Pisa ITALY</B>
<BR><B>></B>
<BR><B>>tel: (+39) 050 315 2410</B>
<BR><B>>fax: (+39) 050 315 2333</B>
<BR><B>>e-mail: marco.pellegrini@iit.cnr.it</B>
<BR><B>>web: <A HREF="http://www.imc.pi.cnr.it/~pellegrini">http://www.imc.pi.cnr.it/~pellegrini</A></B>
<BR><B></B>
<BR><B></B>
<BR><B></B>
<BR><B></B>
<P>----- Original Message -----
<BR>From: "Dario Bini" <bini@dm.unipi.it>
<BR>To: <settimanale@dm.unipi.it>
<BR>Sent: Thursday, July 17, 2003 12:01 PM
<BR>Subject: Avviso di Seminario
<BR>
<P>> Trasmetto il seguente avviso di seminario
<BR>>
<BR>>
<BR>> 10.30 am Tuesday, July 22nd 2003.
<BR>> Istituto di Informatica e Telematica CNR Pisa
<BR>> Seminar room B63A
<BR>>
<BR>> Prof. Jaroslav Nesetril, ITI Charles University - Prague
<BR>>
<BR>> Title: Some Coloring Problems - characterizing good characterizations
<BR>>
<BR>> Abstract: We present an algebraic scheme for coloring problems
<BR>> (generalized Galai-Hasse-Witt Theorem) and show how finitary
<BR>> good characterizations can be characterized.
<BR>> This leads to some paradoxical complexity issues.
<BR>>
<BR>> Contact:
<BR>> Prof. Nesetril: J.Nesetril@iit.cnr.it
<BR>> Dr. Marco Pellegrini: Marco.Pellegrini@iit.cnr.it
<BR>>
<BR>
<BR> </HTML>