<html> <head> <meta charset="utf-8"> </head> <title>Bucharest Graph Theory Workshop</title> <br> <font face="palatino linotype" size="5"><center> <b>Bucharest Graph Theory Workshop<br><font face="palatino linotype" size="3"><i>on</i></font><br>How to Span a Graph</b></font><br><br> <font face="palatino linotype" size="4">University of Bucharest, August 15&ndash;17, 2018</font><br> <br> <font face="palatino linotype" size="3"> Updated on: 14 August 2018 &nbsp;&mdash;&nbsp; Contact: <a href="emailto:czamfirescu@gmail.com"><b>czamfirescu@gmail.com</b></a><br> <hr> <i><a href="BGTW_fr.html">Lien la version franaise de cette page</a>.</i> <hr> </center> <IMG STYLE="position:absolute; TOP:55px; LEFT:100px; WIDTH:120px; HEIGHT:120px" SRC="imar_logo.png"> <IMG STYLE="position:absolute; TOP:55px; RIGHT:100px; WIDTH:120px; HEIGHT:120px" SRC="sigla-UB.jpg"> <IMG STYLE="position:absolute; TOP:350px; LEFT:640px; WIDTH:400px;" SRC="garden.jpg"> <IMG STYLE="position:absolute; TOP:350px; LEFT:1050px; WIDTH:400px;" SRC="univ.jpg"> <IMG STYLE="position:absolute; TOP:895px; LEFT:745px; WIDTH:600px; HEIGHT:600px" SRC="map2.png"> <font face="palatino linotype" size="4"> The lectures of the conference will take place at the University of Bucharest, Faculty of Mathematics and Computer Science, shown as a red circle on the map below (or <a href="https://goo.gl/maps/s1qzkrBK9Wo" target="_blank">click here</a>).<br> For evenings: In walking distance (500 m south) is old Bucharest&mdash;<i>Lipscani</i>&mdash;with small restaurants and bars. 500 m further south, still in walking distance, is Calea &#536;erban Vod&#259; 36 (a blue Z on the map below), where we can meet (as earlier usual in the Hilbert space). <br><br> For the programme, please <a href="BGTW-programme.pdf">click here</a>.</font> <!-- <font face="palatino linotype" size="5"><center>Tentative Programme</center></font> <font face="palatino linotype" size="3"><br> <table border="1" width="1500"> <tr> <td width="85"> </td> <td width="355">Monday, September 4</td> <td width="355">Tuesday, September 5</td> <td width="355">Wednesday, September 6</td> <td width="355">Thursday, September 7</td> </tr> <tr> <td>09:00&ndash;09:30</td> <td><center>FRETTLH<br> Bounded distance equivalence of<br> cut-and-project sets</center></td> <td><center>HORJA<br>Applications of zonotopes to<br> resolutions of singularities</center></td> <td><center>HERBURT<br>Intrinsic geometry in hyperspaces</center></td> <td><center>GUU<br>Convex sets, IFS and Borsuk's conjecture</center></td> </tr> <tr> <td>09:40&ndash;10:10</td> <td><center>ROUYER<br>Generic properties of length spaces</center></td> <td><center>ITOH<br>The total mixed curvature of open curves in <i>E</i></td> <td><center>BOGDEWICZ<br>A spherical projection of a convex body and the related quotient space</center></td> <td><center>STUPARIU<br>A comparison of discrete curvature schemes applied for triangle meshes derived from geo-spatial data</td> </tr> <tr> <td>10:10&ndash;10:40</td> <td><center><i>Coffee</i> &nbsp; &#9749;</center></td> <td><center><i>Coffee</i> &nbsp; &#9749;</center></td> <td><center><i>Coffee</i> &nbsp; &#9749;</center></td> <td><center><i>fin</i></td> </tr> <tr> <td>10:40&ndash;11:10</td> <td><center>KINCSES<br>On the representation of finite convex geometries with convex sets</center></td> <td><center>VLCU<br>Envelopes of -sections</center></td> <td><center>PRUNESCU<br>Homomorphisms of abelian <i>p</i>-groups and <i>p</i>-automatic sequences</center></td> <td></td> </tr> <tr> <td>11:10&ndash;11:40</td> <td><br></td> <td></td> <td><center>RIVIRE<br>About endpoints of convex surfaces</center></td> <td></td> </tr> <tr> <td>11:40&ndash;16:00</td> <td><center><i>Lunch</i> &nbsp; &#127869;</center></td> <td><center><i>Lunch</i> &nbsp; &#127869;</center></td> <td><center><i>Lunch</i> &nbsp; &#127869;</center></td> <td></td> </tr> <tr> <td>16:00&ndash;16:30</td> <td><center>BRCZKY<br>Locally inhomogeneous packings of<br> incongruent circles in the Eulidean plane</center></td> <td><center>Protz-up</center></td> <td><center>FREDI<br>Coin-weighting, vector sums and<br> different directions of lines</center></td> <td></td> </tr> <tr> <td>16:40&ndash;17:10</td> <td><center>ZAMFIRESCU<br>Transformation and intersection digraphs<br> and applications</center></td> <td><center>Protz-up</center></td> <td><center>CALUDE<br>A quantum polynomial Time Algorithm for the Graph Isomorphism problem</center></td> <td></td> </tr> </table> --> <br><br> <font face="palatino linotype" size="5">Confirmed Participants</font><br><br> <table> <tr> <td align="right">G.</td> <td>Brinkmann</td> <td>Ghent University, Belgium</td> </tr> <tr> <td align="right">A.</td> <td>Burger</td> <td>University of Stellenbosch, South Africa</td> </tr> <tr> <td align="right">G.</td> <td>Ducoffe</td> <td><p style="font-size:14px">National Institute for Research and Development in Informatics, Roumania</p></td> </tr> <tr> <td align="right"></td> <td></td> <td><p style="font-size:14px">The Research Institute of the University of Bucharest ICUB, Roumania</p></td> </tr> <tr> <td align="right">I.</td> <td>Fabrici</td> <td>P.J. `afrik University, Koaice, Slovakia</td> </tr> <tr> <td align="right">M.</td> <td>Frick</td> <td>University of Pretoria, South Africa</td> </tr> <tr> <td align="right">J.</td> <td>Fujisawa</td> <td>Keio University, Japan</td> </tr> <tr> <td align="right">J.</td> <td>Goedgebeur</td> <td>Ghent University, Belgium</td> </tr> <tr> <td align="right">Y.</td> <td>Guan</td> <td>Hebei Normal University, P.R. China</td> </tr> <tr> <td align="right">J.</td> <td>Harant</td> <td>TU Ilmenau, Germany</td> </tr> <tr> <td align="right">A.</td> <td>Kabela</td> <td>University of West Bohemia, PlzeH, Czech Republic</td> </tr> <tr> <td align="right">B.</td> <td>Klocker</td> <td>TU Wien, Austria</td> </tr> <tr> <td align="right">M.</td> <td>Macekov</td> <td>P.J. `afrik University, Koaice, Slovakia</td> </tr> <tr> <td align="right">R.</td> <td>Marinescu</td> <td>University of Bucharest, Roumania</td> </tr> <tr> <td align="right">K.</td> <td>Ozeki</td> <td>Yokohama National University, Japan</td> </tr> <tr> <td align="right">A.</td> <td>Schmid</td> <td>Max Planck Institute for Informatics, Germany</td> </tr> <tr> <td align="right">J. M.</td> <td>Schmidt</td> <td>TU Ilmenau, Germany</td> </tr> <tr> <td align="right">R. M.</td> <td>Tache</td> <td>University of Bucharest, Roumania</td> </tr> <tr> <td align="right">N.</td> <td>Van Cleemput &nbsp;&nbsp;</td> <td>Ghent University, Belgium</td> </tr> <tr> <td align="right">J.</td> <td>de Wet</td> <td>University of Pretoria, South Africa</td> </tr> <tr> <td align="right">G.</td> <td>Wiener</td> <td>Budapest University of Technology and Economics, Hungary</td> </tr> <tr> <td align="right">L.</td> <td>Yuan</td> <td>Hebei Normal University, P.R. China</td> </tr> </table> <br><br><br> We acknowledge financial support from the<br> <b>Centre Francophone de Mathmatiques</b>,<br> organised by IMAR in cooperation with the<br> <b>Agence Universitaire de la Francophonie</b>,<br> and also from <b>Bitdefender</b>.<br><br> <img src="fr.jpg"><br><br> We also acknowledge logistical help from the<br> <b>Faculty of Mathematics and Computer Science,<br> University of Bucharest</b>.<br><br> <table> <tr> <td align="left"><b>Organisers:</b></td> </tr> <tr> <td>Ruxandra Marinescu</td> </tr> <tr> <td>Costin Vlcu (costin_v@yahoo.com) 0040 771 253 886</td> </tr> <tr> <td>Carol T. Zamfirescu (czamfirescu@gmail.com) 0049 151 230 914 47</td> </tr> <tr> <td>Tudor I. Zamfirescu (tuzamfirescu@gmail.com) 0040 762 188 088</td> </tr> </table> <br><br><br> </font> </center> </body> </html>