Update home page index.html

doc/webpage/index.html

@@ -77,18 +77,22 @@ <h3>Howto document and step-by-step examples</h3>
 <div class="citation">
 <h3>Questions / Get involved</h3>
 <p class="text">
-We appreciate comments, questions, issues reported, or suggestions for adding features.
-Please email us at <a href="mailto:p4est@librelist.com">p4est@librelist.com</a>.
-This mailing list is <a href="http://librelist.com/browser/p4est/">archived</a>;
-see <a href="http://librelist.com/">librelist.com</a> for details.
-Your first message will auto-subscribe you and provide instructions to proceed.
-<!-- (it may be necessary to resend your initial mail). -->
+We appreciate comments, bug reports, and suggestions for adding features.
+To this end, we recommend using the
+<a href="https://github.com/cburstedde/p4est/issues">issue tracker</a>.
+We will also consider
+<a href="https://github.com/cburstedde/p4est/pulls">pull requests</a>.
+For further questions, please email us at <a href="info@p4est.org">info@p4est.org</a>.
 </p>
 
 &nbsp;
 
 <p class="text">
-We will also consider pull requests posted on <a href="http://www.github.com/">github</a>.
+We had previously used a now-defunct mailing list that is
+<a href="http://librelist.com/browser/p4est/">archived</a>.
+<!-- see <a href="http://librelist.com/">librelist.com</a> for details. -->
+<!-- Your first message will auto-subscribe you and provide instructions to proceed. -->
+<!-- (it may be necessary to resend your initial mail). -->
 </p>
 </div>
 
@@ -111,9 +115,10 @@ <h3>Technical papers / Citations</h3>
 
 <p>
 If you use <tt>p4est</tt> for your publications, please cite it as follows [1a].
-The reference [1b] is for people specifically using the topology iterator and/or the
-high-order node numbering.  [1c] is for people interested in the 2:1 balance
-details or the strong scaling limit.
+The reference [1b] is for people specifically using the topology iterator, the
+high-order node numbering, or the top-down search.
+[1c] is for people interested in the 2:1 balance details, the strong scaling
+limit and/or memory footprint.
 </p>
 <p class="cite">
 [1a]
@@ -138,15 +143,33 @@ <h3>Technical papers / Citations</h3>
   doi = {10.1137/100791634}
 }
 </pre>
+
 &nbsp;
+
 <p class="cite">
 [1b]
 Tobin Isaac, Carsten Burstedde, Lucas C. Wilcox, and Omar Ghattas,<br>
-<em>Recursive algorithms for distributed forests of octrees.</em>
-Submitted
-(<a href="http://arxiv.org/abs/1406.0089">arXiv:1406.0089</a>), 2014.
+<em>Recursive algorithms for distributed forests of octrees.</em><br>
+Published in SIAM Journal on Scientific Computing 37 no. 5 (2015),
+pages C497-C531
+(<a href="http://p4est.github.io/papers/IsaacBursteddeWilcoxEtAl15.pdf">download</a>).
 </p>
+
+<pre class="bibtex">
+@ARTICLE{IsaacBursteddeWilcoxEtAl15,
+  author = {Tobin Isaac and Carsten Burstedde and Lucas C. Wilcox and Omar Ghattas},
+  title = {Recursive algorithms for distributed forests of octrees},
+  journal = {SIAM Journal on Scientific Computing},
+  volume = {37},
+  number = {5},
+  pages = {C497--C531},
+  year = {2015},
+  doi = {10.1137/140970963}
+}
+</pre>
+
 &nbsp;
+
 <p class="cite">
 [1c]
 Tobin Isaac, Carsten Burstedde, and Omar Ghattas,<br>