<HTML>
<BODY>

<title>Adam Sheffer's Home Page</title>
<H1> Adam Sheffer</H1>

<hr>

<table border="0" width="1120">
<tbody>
<tr> <td width="470" valign="top">
	<br>
	<dl>
	<dt> <a HREF="http://www.cs.tau.ac.il">
	     The Blavatnik School of Computer Science </a>
	<dt> <a HREF="http://www.tau.ac.il">
     		Tel Aviv University </a>
	<dt> Ramat Aviv, Tel Aviv 69978, Israel
	<dt> Schreiber building, the "algorithmics room" at the Open-Space (directions can be found <a href="./room.html">here</a>).
	<p><dt> Phone: +972-3-640-5231 
 	<dt> Email: sheffera -at- post.tau.ac.il
	</dl>
</td>
<td width="467">
    <img src="./adam2.jpg" alt="" height="320" width="420"> 
</td></tr></tbody></table>

<hr>    

<H2> Recently:</H2>

<p style="font-size:160%" >
                <img src="arrow_w.gif" width="21" height="15" border="0"></span> 
                Check out my new page with up-to-date results on <a href="http://www.cs.tau.ac.il/~sheffera/counting/PlaneGraphs.html" class="b">numbers of plane graphs</a>.<br>
              </p>

<hr>


<br>
I am a Ph.D. candidate under the supervision of Prof. Micha Sharir.

<H3>Current Interests:</H3>
<UL>
<LI> Combinatorical Geometry.
<LI> Computational Geometry.
<LI> Extremal Combinatorics.
</UL>

<P><BR></P>


<H3>Currently Teaching (fall 11/12):</H3>
<UL>
<LI>    <A HREF="http://tau-algorithms.wikidot.com/">
        Algorithms
        </A>
</UL>

<P><BR></P>


<H3>Publications:</H3>

<OL>
<LI>  M. Sharir and A. Sheffer, <BR>
      <a href="http://arxiv.org/abs/0911.3352">Counting Triangulations of Planar Point Sets</a> , <br>
      <i>Electr. J. Comb.</i>, 18(1) (2011)</LI><BR>

<LI>  M. Sharir, A. Sheffer, and E. Welzl, <BR>
      On Degrees in Random Triangulations, <BR>
      <i>Proc. 26th ACM Symp. on Computational Geometry </i> (2010), 297--306.<BR>
      Also in <i>J. Combinat. Theory A</i> 118 (2011), 1979--1999.</LI><BR>

<LI>  A. Dumitrescu, A. Schulz, A. Sheffer, and Cs. D. T&oacute;th, <br />
      <a href="http://arxiv.org/abs/1012.5664">Bounds on the maximum multiplicity of some common geometric graphs</a>, <br />
      <i> Proc. 28th International Symposium on Theoretical Aspects of Computer
               Science</i> (2011), 637--648. </LI><BR>

<LI>  M. Hoffmann, M. Sharir, A. Sheffer, C. D. Tóth, and E. Welzl, <br />
      <a href="http://arxiv.org/abs/1012.0591">Counting Plane Graphs: Flippability and its Applications</a>, <br />
      <i> Proc. 12th Symp. on Algs. and Data structs.</i> (2011), 524--535.  </LI><BR>
      
<LI>  M. Sharir, A. Sheffer, and E. Welzl, <BR>
      <a href="http://arxiv.org/abs/1109.5596">Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique</a>, <BR>
      To appear in <i>proc. 28th ACM Symp. on Computational Geometry </i>.</LI><BR>
      
<LI>  M. Sharir, and A. Sheffer, <BR>
      Counting Plane Graphs: Cross-Graph Charging Schemes, <BR>
      Manuscript.</LI><BR>
</OL>
 

<H3> Other:</H3>

<p style="font-size:120%" >
<UL>
<LI>    Pictures from <a href="http://www.cs.tau.ac.il/~sheffera/micha.html" class="b">SharirFest 2010</a> can be found <a href="http://www.cs.tau.ac.il/~sheffera/SFpics.html" class="b">here</a>.<br>
</UL></p>

<hr>


</BODY>

</HTML>

�