Ernie's 3D Pancakes
http://3dpancakes.typepad.com/ernie/
Let Σ be a combinatorial surface with n vertices, genus g, and b boundaries. Amen.en-USTue, 21 Jun 2016 10:38:01 -0500http://www.typepad.com/http://www.rssboard.org/rss-specificationEight brass monkeys from the ancient, sacred, holy crypts of Egypt
http://3dpancakes.typepad.com/ernie/2016/06/eight-brass-monkeys-from-the-ancient-sacred-holy-crypts-of-egypt.html
http://3dpancakes.typepad.com/ernie/2016/06/eight-brass-monkeys-from-the-ancient-sacred-holy-crypts-of-egypt.htmlHello? Hello? Is this thing still on? I've been a bit quiet here for the last few years, partly as a new parent, learning to deal with children, and more recently as an associate department head, learning to deal with...<p>Hello?  Hello?  Is this thing still on?</p>
<p>I've been a bit quiet here for the last few years, partly as a new parent, learning to deal with children, and more recently as an associate department head, learning to deal with bureaucracy.  (The two skills are remarkably similar!)  But now that my kids are now well into their transformation from cute gobs of poo into full-fledged independent human beings, and my three-year <span style="text-decoration: line-through;">sentence</span> term as an administrator is coming to a close, I find myself wondering what I'm going to do when I'm no longer a grown-up.</p>
<p>My main job as associate head was hiring tenure-track faculty.  Illinois CS just had an <em>excellent</em> year—five new faculty are joining us this fall and several more are starting in Fall 2017—but I need to wait for the ink to dry on our final offers before talking about the hiring process in any detail.</p>
<p>My other job was helping to launch a major revision of our undergraduate theory courses, as part of a wider curriculum revision.  Our new required theory course (<a href="https://courses.engr.illinois.edu/cs374/sp2016">CS 374</a>) has a steady-state enrollment of 400 students per semester.  This curriculum change, combined with our skyrocketing enrollments (just like everyone else's) has had some interesting side-effects, which I'm sure I'll talk more about later.</p>
<p>One side-effect of the change is that my <a href="http://algorithms.wtf">algorithms lecture notes</a> no longer mirror the structure of the courses I teach, so I'm starting a major revision. With videos. Stay tuned.</p>
<p>But enough about me.  The title of this post is a line from a 1940's cold-reading test for prospective radio announcers, popularized by Jerry Lewis (“<a href="https://www.youtube.com/watch?v=06D1F5-4Atc">The Announcer's Test</a>”), Flo and Eddie (“<a href="https://www.youtube.com/watch?v=w52AS1q3kqM">The Tibetan Memory Trick</a>”), and many others. The test has the same cumulative structure as “The Twelve Days of Christmas” or some versions of “Old MacDonald Had a Farm”; the <em>k</em>th “verse” consists of the first <em>k</em> lines from the following list (with “and” inserted between like <em>k–</em>1 and <em>k</em>):</p>
<ul>
<li>One hen</li>
<li>Two ducks</li>
<li>Three squawking geese</li>
<li>Four limerick oysters</li>
<li>Five corpulent porpoises</li>
<li>Six pairs of Don Alverzo's tweezers</li>
<li>Seven thousand Macedonian warriors in full battle array</li>
<li>Eight brass monkeys from the ancient, sacred, holy crypts of Egypt</li>
<li>Nine sympathetic, apathetic, diabetic, old men on roller skates, with a marked propensity towards procrastination and sloth</li>
<li>Ten lyrical, spherical, diabolical denizens of the deep who all stall around the corner on the quo of the quay of the quivvey, all at the same time.</li>
</ul>
<p>Roughly, the length of each line increases linearly, which means the length of each verse increases quadratically, which means the length of the entire announcement is <em>cubic</em> in the number of lines.  This is the only "song" I know that requires Θ(<em>n</em><sup>3</sup>) time to "sing" the first <em>n</em> verses.  On the other hand, just writing down <em>n</em> lines requires Θ(<em>n</em><sup>2</sup>) space, so in terms of Knuth's infamous paper <a href="https://en.wikipedia.org/wiki/The_Complexity_of_Songs">“The Complexity of Songs”</a>, the Announcer's Test has complexity Θ(<em>N</em><sup>2/3</sup>).  This is the only example I know of a "song" with this complexity.</p>
<p>Do you know of any other songs with complexity Θ(<em>N</em><sup>2/3</sup>)? How about Θ(<em>N<sup>c</sup></em>) for any constant <em>c</em> other than 0, 1/2, 2/3, or 1?  I look forward to reading your compositions in the comments.</p>AdministriviaAlgorithmsTeachingJeff EricksonTue, 21 Jun 2016 10:38:01 -0500Three talks at SOCG
http://3dpancakes.typepad.com/ernie/2013/06/three-talks-at-socg.html
http://3dpancakes.typepad.com/ernie/2013/06/three-talks-at-socg.htmlI just came back from a lovely trip to Rio de Janeiro for SOCG. This year's meeting was quite a bit busier than usual, with three different presentations lasting in total almost three hours. In order of increasing importance: On...I just came back from a lovely trip to Rio de Janeiro for SOCG. This year's meeting was quite a bit busier than usual, with three different presentations lasting in total almost three hours. In order of increasing importance:
<ul>
<li> On Monday morning, I presented my paper "<a href="http://www.cs.uiuc.edu/~jeffe/pubs/hexmesh.html">Efficiently hex-meshing things with topology</a>" (<a href="http://www.cs.uiuc.edu/~jeffe/pubs/talks/hexmesh-socg.pdf">slides</a>). The paper answers the following question: When can a polyhedron with quadrilateral faces be partitioned into a complex of topological cubes, without refining the boundary? It is not hard to see that the number of quads must be even. For even surface meshes, I prove that the following equivalent conditions are necessary and sufficient:
<ul>
<li> No odd cycle in the surface graph is the boundary an <a href="http://en.wikipedia.org/wiki/Immersion_(mathematics)">immersed surface</a> in the interior.
<li> The dual of the surface graph is the boundary of an immersed surface in the interior.
</ul>
The paper says "null-homologous" instead of "the boundary of an immersed surface", but these two phrases are synonymous. This generalizes earlier results by <a href="http://www.ics.uci.edu/~eppstein/gina/Thurston-hexahedra.html">Thurston</a> and <a href="http://www.sandia.gov/~samitch/exist-abstract.html">Mitchell</a> for polyhedra with genus zero, where an even number of quads is sufficient, and by <a href="http://www.ics.uci.edu/~eppstein/pubs/p-hexmesh.html">Eppstein</a> for bipartite surface meshes, which always have an even number of facets. The proof is constructive.
<p>
<li> On Monday afternoon, in a fantastic <a href="http://zeus.mat.puc-rio.br/~socg2013/index.php/workshops/mesh-generation">workshop on mesh generation</a> organized by <a href="http://www.dimap.ufrn.br/~mfsiqueira/Marcelo_Siqueiras_Web_Spot/Home.html">Marcelo Siqueira</a>, I gave a one-hour survey talk on theoretical hexahedral meshing (<a href="http://www.cs.uiuc.edu/~jeffe/pubs/talks/hexmesh-survey-socg.pdf">slides</a>). The first chunk of the talk establishes some basic definitions, which are usually left unstated by both computational geometers and mesh generators. In particular, in <i>actual</i> hexahedral finite-element meshes, the word "hexahedron" does not mean a convex polyhedron with six planar facets, but the multilinear hull of eight labeled points; the facets of a "hex element" are ruled surface patches. There are <em>lots</em> of good practical heuristics for building hex meshes, but no fully automatic methods, or as I usually call them, <em>algorithms</em>. If we allow boundary refinement, hex meshing is actually easy — just triangulate and then refine each tet into four hexes — but only if we don't care about mesh quality. If we don't allow boundary refinement, even the existence of hex meshes is a more subtle open problem, leading to lots of interesting geometry and topology, but again, even where we have algorithms, we have nothing with useful quality guarantees. The big open problem is to define a general class of input domains, define a useful quality measure, and then describe an algorithm that <em>provably</em> generates a high-quality mesh for <em>any</em> domain in the class, as Bern, Eppstein, Ruppert, Shewchuk, and many others have done for triangular and tetrahedral meshing.
<p>
<li> Finally, on Tuesday evening, I ran my first SOCG business meeting as steering commitee chair. David Eppstein's <a href="http://www.computational-geometry.org/documents/minutes-SoCG13.txt">official minutes</a> and <a href="http://computational-geometry.org/documents/SOCG2013-business.pdf">the complete meeting slides</a> (<a href="http://computational-geometry.org/documents/SOCG2013-business.pdf">mirror</a>) are now available on <a href="http://www.computational-geometry.org">www.computational-geometry.org</a>, but here are some highlights:
<p>
<ul>
<li> There were 150 attendees, which is less than Paris in 2011 and Chapel Hill in 2012, but more than the six years before that. Thanks to incredibly low student registration fees, there were 66 registered students.
<p>
<li> The Best Paper award went to <a href="http://www.victoralvarez.net/">Victor Alvarez</a> and <a href="http://www-tcs.cs.uni-saarland.de/">Raimund Seidel</a>, for their excellent paper "<a href="http://www.victoralvarez.net/papers/A%20Simple%20Aggregative%20Algorithm%20for%20Counting%20Triangulations%20of%20Planar%20Point%20Sets%20and%20Related%20Problems%20-%20SoCG%202013.pdf">A simple aggregative algorithm for counting triangulations of planar point sets and related problems</a>".
<p>
<li> The video and multimedia committee raised the awesomeness standard for submissions. They also distributed this year's videos much more widely, not only on the <a href="http://www.computational-geometry.org/SoCG-videos/socg13video/">SOCG web page</a> and in the <a href="http://dl.acm.org/citation.cfm?id=2493132&CFID=223876648&CFTOKEN=92751645">Digital Library</a>, but also on YouTube and at <a href="http://imaginary.org/">imaginary.org</a>.
<p>
<li> The SOCG 2014 PC chairs are <a href="http://www.cse.ust.hk/~scheng/">Siu-Wing Cheng</a> and <a href="http://www-sop.inria.fr/members/Olivier.Devillers/">Olivier Devillers</a>.
<p>
<li> Starting with Victor and Raimund this year, SOCG Best Paper Award winners will be invited to submit a full version of their paper to <cite>Journal of the ACM</cite>.
<p>
<li> Starting next year, we expect to offer NSF travel support to SOCG for US students and postdocs.
<p>
<li> There was strong support for the idea of co-locating SOCG with STOC in 2016, moderated by lots of pertinent logistical questions. I said "I don't know yet; we'll have to work that out" a lot.
<p>
<li> SOCG 2015 will be held at TU Eindhoven, in the Netherlands. The other bidders, which all tied for second place in the first voting round, were Braunschweig, Germany; Brisbane, Australia; and Portland, Oregon.
<p>
<li> There will be a third and final vote regarding the future relationship between SOCG and ACM, which will take place in October. I've set up a <a href="http://makingsocg.wordpress.org">discussion blog</a>, where I will describe issues related to the vote. I will also invite posts from other members of the SOCG community, ACM representatives, and organizers of other conferences. My goal is to ensure that all relevant stakeholders have a voice before voting begins.</p>
</ul>
<p>
Whew!
<p>
One important item was not announced at the business meeting. The Best Student Presentation award was shared by two students:
<ul>
<li> <a href="http://zeus.mat.puc-rio.br/jarpao/">João Peixão</a>, for his presentation of "<a href="http://arxiv.org/abs/1303.7037">Parameterized Complexity of Discrete Morse Theory</a>"
<li> <a href="http://cg.scs.carleton.ca/~lfbarba/">Luis Barba</a>, for his presentation of "<a href="http://arxiv.org/abs/1207.2375">Bichromatic Compatible Matchings</a>"</p>
</ul>
<p>
These two winners were announced Thursday morning, after all student speakers had presented their papers. The award is based on audience evaluations.
</ul>Computational GeometryJeff EricksonMon, 24 Jun 2013 01:24:03 -0500Computational topology at SOCG 2013
http://3dpancakes.typepad.com/ernie/2013/03/computational-topology-at-socg-2013.html
http://3dpancakes.typepad.com/ernie/2013/03/computational-topology-at-socg-2013.htmlAs usual, the list of papers accepted to the 2013 Symposium on Computational Geometry includes several papers on computational topology — by my count, at least 12 papers out of 48, which is not as overwhelming as last year, but...As usual, the list of <a href="http://www.uniriotec.br/~socg2013/index.php/calls/call-for-papers/accepted-papers">papers accepted to the 2013 Symposium on Computational Geometry</a> includes several papers on computational topology — by my count, at least 12 papers out of 48, which is not as <a href="http://3dpancakes.typepad.com/ernie/2012/02/socgt-2012.html" target="_self">overwhelming as last year</a>, but still a healthy fraction of the conference.  Here is a (likely incomplete) list, with links to as many preprints as I could find.
<ul>
<li>
<p><a href="http://arxiv.org/abs/1212.1441" target="_self">A new approach to crushing 3-manifold triangulations</a>
<br /> by <a href="http://www.maths.uq.edu.au/~bab/">Benjamin A. Burton</a></p>
</li>
<li>
<p><a href="http://arxiv.org/abs/1212.1531" target="_self"> Computing closed essential surfaces in knot complements</a>
<br /> by <a href="http://www.maths.uq.edu.au/~bab/">Benjamin A. Burton</a>, <a href="http://www.maths.usyd.edu.au/u/coward/">Alexander Coward</a>, and <a href="http://www.maths.usyd.edu.au/u/tillmann/">Stephan Tillmann</a>
</p>
</li>
<li>
<p><a href="http://web.engr.illinois.edu/~kylefox2/publications/counting-cuts.pdf" target="_self">Counting and sampling minimum cuts in genus <em>g</em> graphs</a>
<br /> by <a href="http://mathcs.slu.edu/~chambers">Erin Chambers</a>,
<a href="http://www.cs.uiuc.edu/~kylefox2/">Kyle Fox</a>,
and <a href="http://www.cs.cmu.edu/~amirn/">Amir Nayyeri</a>
</p>
</li>
<li>
<p><a href="http://www.cs.illinois.edu/~jeffe/pubs/hexmesh.html" target="_self">Efficiently hex-meshing things(,) with topology</a>
<br /> by <a href="http://www.cs.uiuc.edu/~jeffe">Jeff Erickson</a>
</p>
</li>
<li>
<p><a href="http://www.math.rutgers.edu/~vidit/source/pgeom1.pdf" target="_self"> Geometry in the space of persistence modules and diagrams</a>
<br /> by <a href="http://pages.pomona.edu/~vds04747/public/index.html" target="_self">Vin de Silva</a> and <a href="http://www.math.rutgers.edu/~vidit/" target="_self">Vidit Nanda</a></p>
</li>
<li>
<p> Graph induced complex on point data <em>[no preprint available]</em><br /> by <a href="http://www.cse.ohio-state.edu/~tamaldey">Tamal Dey</a>,
<a href="http://engineering.osu.edu/content/fengtao-fan" target="_self">Fengtao Fan</a>,
and <a href="http://www.cse.ohio-state.edu/~yusu/">Yusu Wang</a>
</p>
</li>
<li>
<p><a href="http://hal.inria.fr/hal-00761208/en" target="_self">Homological reconstruction and simplification in R<sup>3</sup></a> <br /> by <a href="http://www.gipsa-lab.grenoble-inp.fr/~dominique.attali/" target="_self">Dominique Attali</a>,
<a href="http://pub.ist.ac.at/~bauer/">Ulrich Bauer</a>,
<a href="http://www-sop.inria.fr/members/Olivier.Devillers/">Olivier Devillers</a>,
<a href="http://geometrica.saclay.inria.fr/team/Marc.Glisse/" target="_self">Marc Glisse</a>,
and <a href="https://www.researchgate.net/profile/Andre_Lieutier2/">André Lieutier</a>.
</p>
</li>
<li>
<p> Localized Delaunay refinement for piecewise-smooth complexes <em>[no preprint available]</em><br /> by <a href="http://www.cse.ohio-state.edu/~tamaldey/">Tamal Dey</a>
and <a href="http://www.cse.ohio-state.edu/~slatton/">Andrew Slatton</a>.
</p>
</li>
<li>
<p><a href="http://mathcs.slu.edu/~chambers/papers/notes-nocycles.pdf" target="_self"> Measuring similarity between curves on 2-manifolds via homotopy area</a><br /> by <a href="http://mathcs.slu.edu/~chambers" target="_blank">Erin Chambers</a>
and <a href="http://www.cse.ohio-state.edu/~yusu/">Yusu Wang</a>
</p>
</li>
<li>
<p><a href="http://arxiv.org/abs/1303.7037" target="_self"> Parameterized complexity of discrete Morse theory</a>
<br /> by <a href="http://zeus.mat.puc-rio.br/jarpao/">João Paixão</a>,
<a href="http://www.tacet.de/Jonathan/">Jonathan Spreer</a>,
<a href="http://www.maths.uq.edu.au/~bab/">Benjamin A. Burton</a>,
and <a href="http://thomas.lewiner.org/">Thomas Lewiner</a></p>
</li>
<li>
<p> Topological graphs: Empty triangles and disjoint matchings <em>[no preprint available]</em><br /> by <a href="http://dcg.epfl.ch/page-56296.html">Andres J. Ruiz-Vargas</a>
and <a href="http://dcg.epfl.ch/page-18454-en.html">Radoslav Fulek</a>
</p>
</li>
<li>
<p><a href="http://hal.inria.fr/hal-00755280/" target="_self"> Zigzag zoology: Rips zigzags for homology inference</a><br /> by <a href="http://geometrica.saclay.inria.fr/team/Steve.Oudot/index.html">Steve Oudot</a> and <a href="http://www.cs.cmu.edu/~dsheehy">Don Sheehy</a>
</p>
</li>
</ul>Jeff EricksonSat, 30 Mar 2013 14:30:30 -0500Busy busy
http://3dpancakes.typepad.com/ernie/2013/03/busy-busy.html
http://3dpancakes.typepad.com/ernie/2013/03/busy-busy.htmlI am the chair of the newly elected computational geometry steering committee; the other members are Mark de Berg, David Eppstein (secretary), Joe Mitchell, and Günter Rote. There should be an official announcement on the computational geometry mailing list in...<ul>
<li>
<p>I am the chair of the newly elected <a href="http://www.computational-geometry.org/steering.html">computational geometry steering committee</a>; the other members are Mark de Berg, David Eppstein (secretary), Joe Mitchell, and Günter Rote. There should be an official announcement on the <a href="https://sympa.inria.fr/sympa/arc/compgeom-announce">computational geometry mailing list</a> in the next few days.</p>
</li>
<li>
<p>I am attending the <a href="http://cra.org/ccc/spi.php">CCC Leadership in Science Policy Institute</a> next month.</p>
</li>
<li>
<p>Thanks to Salil Vadhan's kind invitation, I will join the <a href="http://thmatters.wordpress.com/catcs/">SIGACT Committtee for the Advancement of Theoretical Computer Science</a> this summer.</p>
</li>
</ul>
Whew! I'll post more about each of these activities in the coming months.
Jeff EricksonSat, 16 Mar 2013 16:44:16 -0500SOCG votes to leave ACM
http://3dpancakes.typepad.com/ernie/2012/11/socg-votes-to-leave-acm.html
http://3dpancakes.typepad.com/ernie/2012/11/socg-votes-to-leave-acm.htmlThe following message was recently sent to the computational geometry mailing list by the SOCG steering committee. (SOCG is the Symposium on Computational Geometry, which has been affiliated with ACM since its inception in 1985.) Dear SoCG community, As you...The following message was recently sent to the computational geometry mailing list by the SOCG steering committee. (SOCG is the Symposium on Computational Geometry, which has been affiliated with ACM since its inception in 1985.)
<blockquote><small>
<p>Dear SoCG community,</p>
<p>As you will recall, we recently held a poll about the ACM affiliation of SoCG. The alternatives were</p>
<p>A. I prefer to stay with ACM.</p>
<p>B. I prefer to leave ACM, and organize SoCG as an independent conference with proceedings published in LIPIcs and with financial backing provided through other means.</p>
<p>In total 87 votes were cast. 1 vote was invalid, the other 86 votes were distributed as follows:</p>
<p>Option A: 36 votes (42%)
<br>Option B: 50 votes (58%)</p>
<p>Some other statistics: of the 86 valid votes, 67 were by faculty, 12 by postdocs, 4 by phd students, and 3 by others.</p>
<p>Following this outcome the SoCG Steering Committee will start taking further steps to implement the separation from ACM. (Note that SoCG 2013, and most likely also SoCG 2014, will still be organized with ACM affiliation.) These further steps will be taken by the new Steering Committee, for which there will be elections soon.</p>
<p>We would like to thank everyone who participated in the poll.</p>
<p>The SoCG Steering Committee: Mark de Berg (secretary), Joe Mitchell, Gunter Rote, Jack Snoeyink (chair), Monique Teillaud.</p>
</small></blockquote>
<p>
When I posted this email on Google+, one well-known ACM member <a href="http://cacm.acm.org/magazines/2012/9/154590-why-acm/fulltext">thundered</a>:
<blockquote><small><p>
This is "pretend democracy", IMHO. There are way more than 87 people who consider themselves to be computational geometers. It is not clear to me that this vote really represent the sense of the community.
</p></small></blockquote>
I agree that the small number of votes is disappointing, but I believe the vote was fair and reflect the opinion of the community: A majority in favor of leaving ACM, but not an overwhelming one. This decision has been brewing for at least two years, with several iterations of voting, using precisely the same voting procedures that we use to elect the SOCG steering committee. Specifically:</p>
<ul>
<li>
<p>
Although it had been raised informally before, the issue of whether to leave ACM was first <em>formally</em> raised at the SOCG 2011 business meeting in Paris. (Among other issues, the local organizers estimated that ACM sponsorship increased the conference registration fee by 100 euros.) A near-unanimous majority of the attendees supported a motion for the steering committee to investigate moving the proceedings to LIPIcs, drawing up a concrete proposal, and polling the larger computational geometry community via the well-established community mailing list.</p>
</li>
<li>
<p>
In October 2011, the steering committee sent a detailed message to the computational geometry mailing list, outlining the costs and benefits of ACM membership versus publication through LIPIcs and asking for votes on three options: (A) Stay with ACM. (B) Stay with ACM iff their role can be limited to publishing the proceedings at low cost. (C) Leave ACM. The final was 29 for option A, 48 for option B, and 47 for option C. The steering committee took the vote as a mandate to approach ACM investigating the possibility of a publisher-only relationship.</p>
</li>
<li>
<p>
At SOCG 2012 in Chapel Hill, the steering committee reported that although ACM was willing to offer some concessions, they were not willing to publish proceedings without formally sponsoring the conference. They announced at the business meeting that there would be a second and final vote on the community mailing list this fall. No vote was taken at the business meeting, because it was rightly felt that the attendees at one iteration of SOCG did not constitute a quorum.</p>
</li>
<li>
<p>
In October 2012, the steering committee sent a detailed proposal to the community mailing list, again outlining costs and benefits, describing the results of their negotiations with ACM, and cautioning that a decision to leave has serious and complex consequences. The proposal asked for a vote for two options:
</p>
<ol>
<li>
<p>I prefer to stay with ACM.</p>
</li>
<li>
<p>I prefer to leave ACM, and organize SoCG as an independent conference with proceedings published in LIPIcs and with financial backing provided through other means.</p>
</li>
</ol>
<p>
The ballot also warned that if the vote was too close or there were too few votes altogether, the steering committee would decide on its own. The final vote passed both these hurdles.</p>
</li>
</ul>
<p>
Both votes were publicized at the SOCG business meetings, on the web/blogs/twitter/facebook/google+, and by direct email to more than 800 community members. You can read the proposals yourself at <a href="http://computational-geometry.org/">http://computational-geometry.org/</a></p>
<p>
Others may disagree, but my impression is that the steering committee itself did <em>not</em> push for leaving ACM. Indeed, some of the staunchest defenders of ACM sponsorship are steering committee members. Moreover, the transition away from ACM will require significant work on their part. (More accurately, since we are about to have another steering committee election, on the part of the new steering committee, but there is usually significant overlap from one election cycle to the next.)
</p>
<p>
In short, this is as close to "real democracy" as the SOCG community knows how to enact, and closer than I've seen at any other conference. For comparison, both SODA's decision to increase the length of camera-ready papers to 20 pages (which has significant effect on later journal publication) and STOC's recent decision to move to a significantly larger, two-tier program committee were enacted with <em>no</em> public vote or discussion. (Yes, these are much less significant decisions, but similar decisions at SOCG without a vote would raise howls of protest.)Jeff EricksonThu, 22 Nov 2012 13:30:34 -0600Computational Advertising at UIUC
http://3dpancakes.typepad.com/ernie/2012/11/computational-advertising-at-uiuc.html
http://3dpancakes.typepad.com/ernie/2012/11/computational-advertising-at-uiuc.htmlJoint computer science/advertising senior faculty position in computational advertising at UIUC. Application deadline January 15, 2013. See https://jobs.illinois.edu/search-jobs/job-details?jobID=26890 for details.<p>The Departments of Advertising and Computer Science at Illinois are running a search for a joint senior faculty position in computational advertising. The position is tenured on arrival and will be shared between the two departments. The application deadline is <b>January 15, 2013</b>. Please feel free to contact me for more information; I'm co-chairing the search subcommittee. Here's the official advertisement:</p>
<blockquote><small>
<p>The Departments of <a href="http://cs.illinois.edu">Computer Science</a> (CS) and <a href="http://media.illinois.edu/advertising/">Advertising</a> (ADV) at the University of Illinois at Urbana-Champaign invite applications for a joint faculty position in <i>Computational Advertising.</i> This novel position is part of a new multi-year Strategic Excellence Hiring Program at Illinois that focuses on: (a) Information, Technology and Society, (b) Human Health and Wellness, (c) Energy and Sustainability, and (d) Culture, Communication, and Global Issues. We seek candidates with CS skills in areas such as “big data”, data-mining, or algorithmic game theory, and with advertising interests or experience in areas such as online /contextual advertising, digital privacy, behavioral targeting, and social media analytics. Applications are encouraged from candidates whose research programs are in traditional as well as in nontraditional areas that would support novel research and teaching across the emerging discipline of Computational Advertising. Each department is engaged in exciting new and expanding programs for research, education, and professional development, and each has strong ties to industry, across a wide landscape of technology and media partners.</p>
<p>Faculty in the CS department carry out research in a broad spectrum of areas and are supported by world-class facilities, starting with our department’s home in the Siebel Center for Computer Science, and including collaborations with the <a href="http://www.ncsa.illinois.edu/">National Center for Supercomputing Applications</a>, the <a href="http://www.csl.illinois.edu/">Coordinated Science Laboratory</a>, the <a href="http://www.iti.illinois.edu/">Information Trust Institute</a>, and the <a href="http://www.informatics.uiuc.edu/">Illinois Informatics Institute</a>, as well as several industrial centers and programs that foster international collaborations. The CS department has one of the leading programs in the United States, granting approximately 200 B.S. degrees, 70 M.S. degrees, and 60 Ph.D. degrees annually. The <a href="http://media.illinois.edu/advertising/">Department of Advertising</a>, the first such academic department in the country, was established in 1959 by Charles H. Sandage, considered to be the father of advertising education. Today, the top-ranked department celebrates Sandage's legacy with scholarship and teaching focused on understanding, evaluating and communicating the many facets of advertising. Approximately 150 B.S. degrees and 20 M.S. degrees are granted annually. Faculty can also teach in the <a href="http://media.illinois.edu/icr/">Institute for Communications Research</a> (ICR) doctoral program in the <a href="http://media.illinois.edu/">College of Media</a>.</p>
<p>In order to ensure full consideration by the Search Committee, applications must be received by <b>January 15, 2012</b>. Salary will be commensurate with qualifications. Preferred starting date is August 16, 2013, but is negotiable. Applications can be submitted by going to <a href="https://jobs.illinois.edu/search-jobs/job-details?jobID=26890">http://jobs.illinois.edu</a> (jobid: 26890) and uploading a cover letter, CV, research statement, and teaching statement, along with names of three references. For inquiry, please call 217-244-7949 or email <a href="mailto:HR@cs.illinois.edu">HR@cs.illinois.edu</a>.</p>
<p><i>Illinois is an Affirmative Action /Equal Opportunity Employer and welcomes individuals with diverse backgrounds, experiences, and ideas who embrace and value diversity and inclusivity (<a href="http://www.inclusiveillinois.illinois.edu">www.inclusiveillinois.illinois.edu</a>).</i></p>
</small></blockquote>
The CS department also has <a href="http://cs.illinois.edu/csillinois/employment/CS-tenure-track-faculty-positions#csopen">three open-rank faculty positions</a>, in the broad areas of software engineering, scientific computing, and "big data". Please (ask your students to) apply!AcademiaComputer scienceJeff EricksonMon, 19 Nov 2012 10:19:30 -0600Applied and computational topology: ATMCS 5
http://3dpancakes.typepad.com/ernie/2012/03/applied-and-computational-topology-atmcs-5.html
http://3dpancakes.typepad.com/ernie/2012/03/applied-and-computational-topology-atmcs-5.htmlSecond Announcement This meeting will take place in the period July 2-6, at the ICMS in Edinburgh, Scotland. The theme will be applications of topological methods in various domains. Invited speakers include Jean-Daniel Boissonnat (INRIA Sophia Antipolis) (Confirmed) Rien Van...<p><b>Second Announcement</b>
<p>This meeting will take place in the period July 2-6, at the ICMS in Edinburgh, Scotland. The theme will be applications of topological methods in various domains. Invited speakers include
<ul>
<li> Jean-Daniel Boissonnat (INRIA Sophia Antipolis) (Confirmed)
<li> Rien Van de Weijgaert (Groningen) (Confirmed)
<li> Nati Linial (Hebrew University, Jerusalem) (Confirmed)
<li> Shmuel Weinberger (University of Chicago) (Confirmed)
<li> Stephen Smale (City University of Hong Kong) (Confirmed)
<li> Herbert Edelsbrunner (IST, Austria) (Confirmed)
<li> Eric Goubault (Commissariat à l’énergie atomique, Paris) (Confirmed)
<li> Sanjeevi Krishnan (University of Pennsylvania) (Confirmed)
<li> Matthew Kahle (The Ohio State University) (Confirmed)
<li> Leo Guibas (Stanford University) (Confirmed)
<li> Robert Macpherson (IAS Princeton) (Tentative)
<li> Andrej Szymczak (Colorado School of Mines) (Confirmed)
<li> Primož Škraba / Mikael Vejdemo-Johansson (Ljubljana/St. Andrews) (Confirmed)
<li> Yuriy Mileyko (Duke University) (Confirmed)
<li> Daniel Cohen (Louisiana State)
<li> Vin de Silva (Confirmed)
</ul>
<p>There will be opportunities for contributed talks. Titles and abstracts should be send to Gunnar Carlsson at <a href="mailto:gunnar@math.stanford.edu">gunnar@math.stanford.edu</a>.
<p>The conference website is located at <a href="http://www.icms.org.uk/workshops/atmcs5">http://www.icms.org.uk/workshops/atmcs5</a>. Those interested should register there as soon as possible so that we can obtain an idea of the number of participants.
<p>For the organizing committee,</p>
<p>Gunnar Carlsson</p>
<p>(Posted at the request of <a title="Mikael Vejdemo-Johansson on Google+" href="https://plus.google.com/117556286967461368490/posts/CHz3KfQ5qvo" target="_self">Mikael Vejdemo-Johansson</a>.)</p>Jeff EricksonThu, 22 Mar 2012 03:12:26 -0500SOCG(T) 2012
http://3dpancakes.typepad.com/ernie/2012/02/socgt-2012.html
http://3dpancakes.typepad.com/ernie/2012/02/socgt-2012.htmlThe list of accepted papers for SOCG 2012 has been released. By my admittedly liberal count, 21 of the 44 accepted papers qualify as computational topology. Maybe it's time to add "...and Topology" to the name of the conference! (Ha,...The list of <a href="http://www.computational-geometry.org/documents/accepted_12.html">accepted papers</a> for <a href="http://socg2012.web.unc.edu/">SOCG 2012</a> has been released. By my admittedly liberal count, 21 of the 44 accepted papers qualify as computational <em>topology</em>. Maybe it's time to add "...and Topology" to the name of the conference!
<p>
(Ha, ha, only serious.)
<ul>
<li> Michal Adamaszek and Juraj Stacho.
<br> <a href="http://www.cs.toronto.edu/~stacho/public/indmatchdom7.pdf">Algorithmic complexity of finding cross-cycles in flag complexes</a>
<li> Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen Kobourov and Torsten Ueckerdt.
<br> <a href="http://kam.mff.cuni.cz/~torsten/Cartograms.pdf">Computing Cartograms with Optimal Complexity</a>
<li> Therese Biedl and Martin Vatshelle. <br><a href="http://www.cs.uwaterloo.ca/research/tr/2011/CS-2011-27.pdf">The point-set embeddability problem for plane graphs</a>
<li> Jean-Daniel Boissonnat, Ramsay Dyer and Arijit Ghosh. <br><a href="http://cgl.uni-jena.de/pub/Workshops/WebHome/stabdel.pdf">Stability of Delaunay-type structures for manifolds</a>
<li> Ciprian Borcea, Ileana Streinu, and Shin-Ichi Tanigawa. <br> <a href="http://arxiv.org/abs/1110.4660">Periodic body-and-bar frameworks</a>
<li> Guillermo D. Canas and Steven Gortler. <br><a href="http://arxiv.org/abs/1102.3673">Duals of Orphan-Free Anisotropic Voronoi Diagrams are Triangulations</a>
<li> Siu-Wing Cheng, Jiongxin Jin, and Man-Kit Lau. <br>A Fast and Simple Surface Reconstruction Algorithm
<li> Éric Colin De Verdière, Grégory Ginot, and Xavier Goaoc. <br><a href="http://arxiv.org/abs/1101.6006">Multinerves and Helly numbers of acyclic families</a>
<li> Éric Colin De Verdière and Arnaud De Mesmay. <br>Testing graph isotopy on surfaces
<li> Herbert Edelsbrunner, Brittany Terese Fasy, and Günter Rote. <br>Add Isotropic Gaussian Kernels at Own Risk: More and More Resiliant Modes in Higher Dimensions
<li> Herbert Edelsbrunner and Michael Kerber. <br><a href="http://arxiv.org/abs/1109.5052">Alexander Duality for Functions: the Persistent Behavior of Land and Water and Shore</a>
<li> Jeff Erickson and Amir Nayyeri. <br><a href="http://www.cs.uiuc.edu/~jeffe/pubs/tracing.html">Tracing Compressed Curves in Triangulated Surfaces</a>
<li> Silvia Fernandez, Bernardo M. Abrego, Oswin Aichholzer, Pedro Ramos, and Gelasio Salazar. <br>The 2-page crossing number of $K_{n}$
<li> Anna Gundert and Uli Wagner. <br>On Laplacians of Random Complexes
<li> Sariel Har-Peled, Amir Nayyeri, Mohammad Salavatipour, and Anastasios Sidiropoulos. <br>How to Walk Your Dog in the Mountains with No Magic Leash
<li> Salman Parsa. <br>A Deterministic O(m log m) Time Algorithm for the Reeb Graph
<li> Jens M. Schmidt and Pavel Valtr. <br>Cubic Plane Graphs on a Given Point Set.
<li> Micha Sharir, Adam Sheffer, and Emo Welzl. <br><a href="http://arxiv.org/abs/1109.5596">Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique</a>
<li> Don Sheehy. <br>Linear-Size Approximations to the Vietoris-Rips Filtration
<li> Andrew Suk. <br><a href="http://arxiv.org/abs/1110.5684">Disjoint edges in complete topological graphs</a>
<li> Amit Chattopadhyay, Gert Vegter, and Chee Yap. <br><a href="http://dissertations.ub.rug.nl/faculties/science/2011/a.chattopadhyay/">Certified Computation of planar Morse-Smale Complexes of Smooth Functions</a>
</ul>
Computational GeometryJeff EricksonFri, 17 Feb 2012 08:41:37 -0600SOCG 2012 call for papers, videos, and multimedia
http://3dpancakes.typepad.com/ernie/2011/10/socg-2012-call-for-papers-videos-and-multimedia.html
http://3dpancakes.typepad.com/ernie/2011/10/socg-2012-call-for-papers-videos-and-multimedia.htmlAt Tamal Dey's request, here is the CALL FOR PAPERS, VIDEOS, and MULTIMEDIA 28th Annual Symposium on Computational Geometry (SoCG 2012) June 17-20, 2012 (tentative) University of North Carolina, Chapel Hill In cooperation with ACM SIGACT and SIGGRAPH Web-page: http://socg2012.web.unc.edu...At Tamal Dey's request, here is the
<h1 align=center>CALL FOR PAPERS, VIDEOS, and MULTIMEDIA</h1>
<h2 align=center>
28th Annual Symposium on Computational Geometry (SoCG 2012)</h2>
<center>
June 17-20, 2012 (tentative)<br>
University of North Carolina, Chapel Hill<br>
In cooperation with ACM SIGACT and SIGGRAPH<br>
Web-page: <a href=" http://socg2012.web.unc.edu"> http://socg2012.web.unc.edu </a>
</center>
<p>The Twenty-Eighth Annual Symposium on Computational Geometry will be held in University of North Carolina, Chapel Hill. We invite submissions of high-quality papers that describe original research on issues related to computational problems arising from geometric considerations. We also invite submissions of original videos and multimedia on these same themes. This year, SoCG will be collocated with a workshop, Computational Geometry: Applications, Practice, and Theory (CG:APT), whose call for submissions (due Feb 27) will be distributed separately.
<p>
The topics of the SoCG 2012 Symposium reflect the rich diversity of research interests in computational geometry. They are intended to highlight both the depth and scope of computational geometry, and to invite fruitful interactions with other disciplines. Topics of interest include, but are not limited to:
<ul>
<li> design, analysis, and implementation of geometric algorithms and data structures; lower bounds on the computational complexity of geometric problems;
<li> mathematical, numerical, algebraic, and experimental issues arising in geometric algorithms and heuristics; discrete and combinatorial geometry; computational topology;
<li> novel applications of computational geometry in computer graphics, geometric modeling, computer-aided design and manufacturing, scientific computing, geographic information systems, database systems, robotics, computational biology, machine learning, sensor networks, biomedical imaging, combinatorial optimization, statistical analysis, discrete differential geometry, theoretical computer science, graph drawing, pure mathematics, and other fields; novel problems in computational geometry arising from these fields.
</ul>
<h3> Important Dates </h3>
<ul>
<li> November 22, 2011: Paper titles and abstracts (at most 300 words) due (23:59, Honolulu time)
<li> December 2, 2011: Paper submissions due (23:59, Honolulu time)
<li> February 17, 2012: Notification of acceptance/rejection of papers
<li> February 27, 2012 : Submissions of videos and multimedia due (23:59, Honolulu Time)
<li> March 8, 2012: Notification of acceptance/rejection of video/multimedia
<li> March 22, 2012: Camera-ready versions due for papers and video/multimedia abstracts
<li> April 26, 2012: Final versions of video/multimedia due
<li> June 17-20, 2012 (tentative): Symposium in Chapel Hill, North Carolina
</ul>
<h2> Call for Papers </h2>
We invite submissions of high-quality papers describing original research on geometric algorithms and data structures, their mathematical foundations and correctness, their implementation, and their applications.
<p>
Final versions of accepted papers will be published by ACM in the symposium proceedings. Proceedings will be distributed to symposium participants and will also be available from ACM for purchase and through the ACM digital library. An author of each accepted paper will be expected to attend the Symposium and give a presentation (approximately 20 minutes) of the paper. Authors of a selection of papers from the conference will be invited to submit extended versions of their papers to a special issue of one or more journals. This year we also plan to confer two Best Paper Awards, and a Best Student Presentation Award. The Student Presentation award will be based on the quality of the presentation of a paper by a student during the conference.
<h3>Paper Submission</h3>
All submissions should be made electronically; see the EasyChair SoCG2012 web page https://www.easychair.org/conferences/?conf=socg2012 for detailed submission instructions (to be available shortly). If electronic submission is not feasible, please contact the program committee chairs, Tamal Dey and Sue Whitesides, well in advance of the submission deadlines.
<h3>Submission Guidelines</h3>
Papers should be submitted in the form of an extended abstract, which begins with the title and abstract page that contains the title of the paper, each author's name, affiliation, and e-mail address followed by a short abstract. The main body of the extended abstract should begin with a precise statement of the problem considered, a succinct summary of the results obtained (emphasizing the significance, novelty, and potential impact of the research), and a clear comparison with related work. The remainder of the extended abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. Clarity of presentation is very important; the whole extended abstract should be written carefully, taking into consideration that it will be read and evaluated by both experts and non-experts, often under tight time constraints.
<p>
Submissions should be typeset in single column format, using 11-point or larger font, with at least 1 inch/2.54 cm margins and single line spacing. Excluding the title page and bibliography, the extended abstract must not exceed 10 pages. Submissions deviating from these guidelines risk rejection without consideration of their merits.
<p>
All necessary details to verify the results must be provided. If they cannot fit within the 10-page limit, a clearly marked appendix containing omitted details should be included. Appendices are not counted in the 10 page limit, so while they may serve as a reference, they will be read by the program committee members at their discretion. The paper excluding the appendix should clearly describe the results and the approach to achieve them, and give sufficient confidence for their validity. The appendix should then give all the necessary details to verify correctness.
<p>
Anticipating the usual high overall quality of submissions, the program committee intends to interpret the scope of the conference broadly, and will seriously consider all papers that are of significant interest to our research community.
<p>
Authors must submit the title and an abstract (at most 300 words) of their papers by November 22, 2011. This pre-submission will be used to help make program committee reading assignments. Extended abstracts must be received by December 2, 2011 (23:59, Honolulu time). There will be no extension of these deadlines; late submissions will not be considered. Authors will be notified of acceptance or rejection by February 17, 2012. The final proceedings papers must be formatted in accordance with ACM proceedings guidelines; LaTeX style files will be made available to authors of accepted papers.
<p>
Concurrent submission of the same (or essentially the same) abstract to SoCG and to another conference with published proceedings is not allowed. An extended abstract of a paper that is under journal review, or scheduled for publication in a journal after June 2012, may be submitted, when it is clear that the extended abstract differs substantially from the journal version. In such cases, the authors must include the journal version in an appendix that clearly identifies the status of the journal submission.
<h3>Program Committee </h3>
<ul>
<li> Pankaj Agarwal (Duke University)
<li> Dominique Attali (Gipsa-Lab, Grenoble)
<li> Gill Barequet (Technion-Israel Institute of Technology)
<li> Mark de Berg (Technische Universiteit, Eindhoven)
<li> Danny Chen (University of Notre Dame)
<li> Tamal Dey (The Ohio State University) (co-chair)
<li> Vida Dujmović (Carleton University)
<li> David Eppstein (University of California, Irvine)
<li> Leonidas Guibas (Stanford University)
<li> Sylvain Lazard (INRIA, Nancy Grand Est)
<li> Dinesh Manocha (The University of North Carolina at Chapel Hill)
<li> Steve Oudot (INRIA Saclay)
<li> Konrad Polthier (Freie Universität Berlin)
<li> Edgar Ramos (Universidad Nacional de Colombia, Medellín)
<li> Jian Sun (Tsinghua University)
<li> Takeshi Tokuyama (Tohoku University)
<li> Yusu Wang (The Ohio State University)
<li> Max Wardetzky (University of Göttingen)
<li> Sue Whitesides (University of Victoria, British Columbia) (co-chair)
</ul>
<hr>
<h2>Call for Video and Multimedia Presentations</h2>
Video and multimedia presentations are sought for the 21st Annual Video and Multimedia Review of Computational Geometry, to accompany the 28th Annual Symposium on Computational Geometry. This review showcases the use of visualization in computational geometry for exposition and education, for visual exploration of geometry in research, and as an interface and a debugging tool in software development. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate.
<p>
Three to five minutes is ideal for most presentations; eight minutes is the upper limit. Accepted video and multimedia presentations will have an abstract in the published conference proceedings; video/multimedia authors will have an opportunity to present their work at the Symposium during a dedicated video session. Accepted presentations will be available online in various formats in a web proceedings. See http://www.computational-geometry.org/ for examples of previous years' proceedings.
<p>
Submissions of video clips in QuickTime or MPEG-4 compressed formats (e.g., XviD or DivX version 6) are encouraged. We also encourage submissions of Macromedia Flash, Java applets, and limited forms of other multimedia or software. These formats must come with a script that will allow them to be distributed in both interactive and canned Quicktime or MPEG video formats. In case of doubt, please email the Video and Multimedia Program chair.
<p>
Each submission should include a one or two-page description of the material shown in the presentation, and where applicable, the techniques used in the implementation. The final two-page descriptions must be formatted according to the guidelines for proceedings. LaTeX style files will be provided to authors of accepted presentations.
<h3>Submission</h3>
Submissions should be deposited online where they are accessible through the web or via FTP. Send email to the Video/Multimedia committee chair, Christian Knauer <christian.knauer@uni-bayreuth.de> by 23:59 Honolulu Time, Monday, February 27, 2012, with the following information: the names and institutions of the authors, the email address of the corresponding author, and instructions for downloading the submission. For ease of sharing and viewing, we encourage (but do not require) that each submission be uploaded to YouTube, and that the corresponding URL be included with the submission.
<p>
We explicitly encourage video/multimedia submissions that support papers submitted to the Symposium. Submitted papers and associated video/multimedia submissions will be treated entirely separately by the respective committees: acceptance or rejection of one will not influence acceptance or rejection of the other.
<p>
Authors will be notified of acceptance or rejection, and given reviewers' comments by March 8, 2012. For each accepted submission, the final version of the 2-page textual description will be due by March 22, 2012 (electronically) for inclusion in the proceedings. Final versions of accepted video/multimedia presentations will be due April 26, 2012 in the best format available.
<h3>Important Dates</h3>
<ul>
<li> Feb. 27, 2012: Video and Multimedia submissions due
<li> Mar. 8, 2012: Notification for Video/MM submissions (23:59 Honolulu time)
<li> Mar. 22, 2012: Camera-ready video/MM abstracts due
<li> Apr. 26, 2012: Final versions of video/MM presentations due
</ul>
<h3>Video and Multimedia Presentation Program Committee</h3>
<ul>
<li> Helmut Alt -Freie Universität Berlin
<li> Sandor Fekete - TU Braunschweig
<li> Panos Giannopoulos - Universität Bayreuth
<li> Xavier Goaoc - INRIA Nancy Grand Est
<li> Rolf Klein - Universität Bonn
<li> Christian Knauer (chair) - Universität Bayreuth
<li> Joseph S. B. Mitchell - SUNY Stony Brook
<li> Bettina Speckmann - TU Eindhoven
<li> Fabian Stehn - Universität Bayreuth
<li> Alexander Wolff - Universität Würzburg
</ul>
<hr>
<h3>SOCG 2012 Local Arrangements</h3>
Jack Snoeyink, Chair
<h3>SOCG Steering Committee (2009-2012)</h3>
<ul>
<li> Jack Snoeyink, chair (University of North Carolina)
<li> Mark de Berg, secretary (TU Eindhoven)
<li> Joe Mitchell (SUNY Stony Brook)
<li> Guenter Rote (FU Berlin)
<li> Monique Teillaud (INRIA Sophia Antipolis - Méditerranée)
</ul>
Computational GeometryJeff EricksonWed, 12 Oct 2011 09:46:40 -0500Geometry and topology at SODA 2012
http://3dpancakes.typepad.com/ernie/2011/09/geometry-and-topology-at-soda-2012.html
http://3dpancakes.typepad.com/ernie/2011/09/geometry-and-topology-at-soda-2012.htmlHere's a selection of computational geometry and topology papers accepted to SODA 2012. As usual, this list is neither exclusive nor exhaustive; for many papers, I'm just guessing about the content from the title and/or authors. Geometry Yes, most data...<p>Here's a selection of computational geometry and topology <a href="http://www.siam.org/meetings/da12/da12accepted.pdf">papers accepted to SODA 2012</a>. As usual, this list is neither exclusive nor exhaustive; for many papers, I'm just guessing about the content from the title and/or authors.</p>
<h2>Geometry</h2>
<p>Yes, most data structure papers count.</p>
<ul>
<li> The maximum number of faces of the Minkowski sum of two convex polytopes<br /> Menelaos I. Karavelas and Eleni Tzanaki </li>
<li> Physarum Can Compute Shortest Paths<br /> Vincenzo Bonifaci, Kurt Mehlhorn, and Girish Varma </li>
<li> A Near-Linear Algorithm for Projective Clustering Integer Points<br /> Kasturi Varadarajan and Xin Xiao </li>
<li> On a Linear Program for Minimum-Weight Triangulation<br /> Arman Yousefi and Neal Young </li>
<li> Jaywalking your Dog - Computing the Fréchet Distance with Shortcuts<br /> Anne Driemel and Sariel Har-Peled </li>
<li> I/O-Efficient Data Structures for Colored Range and Prefix Reporting<br /> Kasper Green Larsen and Rasmus Pagh </li>
<li> Sparser Johnson-Lindenstrauss Transforms<br /> Daniel Kane and Jelani Nelson </li>
<li> Information Dissemination via Random Walks in d-Dimensional Space<br /> Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, and Yajun Wang </li>
<li> Fast zeta transforms for point lattices<br /> Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, and Pekka Parviainen </li>
<li> Partial match queries in random quadtrees<br /> Nicolas Broutin, Ralph Neininger, and Henning Sulzbach </li>
<li> Packing anchored rectangles<br /> Adrian Dumitrescu and Csaba Toth </li>
<li> Confluent Persistence Revisited<br /> Sebastien Collette, John Iacono, and Stefan Langerman </li>
<li> Using Hashing to Solve the Dictionary Problem (In External Memory)<br /> John Iacono and Mihai Patrașcu </li>
<li> Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications<br /> Haim Kaplan, Shay Mozes, Yahav Nussbaum, and Micha Sharir </li>
<li> Computing distance between piecewise linear bivariate functions<br /> Boris Aronov and Guillaume Moroz </li>
<li> Algorithms and Data Structures for the Transportation Problem in Geometric Settings<br /> R Sharathkumar and Pankaj Agarwal </li>
<li> Fully Persistent B-trees<br /> Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas </li>
<li> Dimension reduction for finite trees in l_1<br /> James Lee, Arnaud De Mesmay, and Mohammad Moharrami </li>
<li> Bidimensionality and Geometric Graphs<br /> Fedor V. Fomin, Daniel Lokshtanov, and Saket Saurabh </li>
</ul>
<h2>Topology</h2>
<p>Yes, most planar graph papers count.</p>
<ul>
<li> Computing all maps into a sphere<br /> Martin Cǎdek, Marek Krčál, Jiří Matoušek, Francis Sergeraert, Lukáš Vokřínek, and Uli Wagner </li>
<li> Exact Distance Oracles for Planar Graphs<br /> Shay Mozes and Christian Sommer </li>
<li> Spanning closed walks and TSP in 3-connected planar graphs<br /> Ken-Ichi Kawarabayashi and Kenta Ozeki </li>
<li> Approximate Tree Decompositions of Planar Graphs in Linear Time<br /> Frank Kammer and Torsten Tholey </li>
<li> Finding an induced path of given parity in planar graphs in polynomial time<br /> Marcin Kaminski and Naomi Nishimura </li>
<li> Near optimal distance oracle for planar digraphs avoiding a failed node or link<br /> Utkarsh Lath, Surender Baswana, and Anuradha Mehta </li>
<li> Global Minimum Cuts in Surface Embedded Graphs<br /> Jeff Erickson, Kyle Fox, and Amir Nayyeri </li>
<li> The Maximum Degree of Random Planar Graphs<br /> Michael Drmota, Omer Gimenez, Marc Noy, Konstantinos Panagiotou, and Angelika Steger </li>
<li> Local Homology Transfer and Stratification Learning<br /> Paul Bendich, Bei Wang, and Sayan Mukherjee </li>
</ul>Computational GeometryTheoretical computer scienceJeff EricksonTue, 13 Sep 2011 03:02:06 -0500