I 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 the next few days.
I am attending the CCC Leadership in Science Policy Institute next month.
Thanks to Salil Vadhan's kind invitation, I will join the SIGACT Committtee for the Advancement of Theoretical Computer Science this summer.
Dear SoCG community,
As you will recall, we recently held a poll about the ACM affiliation of SoCG. The alternatives were
A. I prefer to stay with ACM.
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.
In total 87 votes were cast. 1 vote was invalid, the other 86 votes were distributed as follows:
Option A: 36 votes (42%)
Option B: 50 votes (58%)
Some other statistics: of the 86 valid votes, 67 were by faculty, 12 by postdocs, 4 by phd students, and 3 by others.
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.
We would like to thank everyone who participated in the poll.
The SoCG Steering Committee: Mark de Berg (secretary), Joe Mitchell, Gunter Rote, Jack Snoeyink (chair), Monique Teillaud.
When I posted this email on Google+, one well-known ACM member thundered:
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:
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.
Although it had been raised informally before, the issue of whether to leave ACM was first formally 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.
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.
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.
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:
I prefer to stay with ACM.
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.
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.
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 http://computational-geometry.org/
Others may disagree, but my impression is that the steering committee itself did not 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.)
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 no public vote or discussion. (Yes, these are much less significant decisions, but similar decisions at SOCG without a vote would raise howls of protest.)
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 January 15, 2013. Please feel free to contact me for more information; I'm co-chairing the search subcommittee. Here's the official advertisement:
The CS department also has three open-rank faculty positions, in the broad areas of software engineering, scientific computing, and "big data". Please (ask your students to) apply!
The Departments of Computer Science (CS) and Advertising (ADV) at the University of Illinois at Urbana-Champaign invite applications for a joint faculty position in Computational Advertising. 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.
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 National Center for Supercomputing Applications, the Coordinated Science Laboratory, the Information Trust Institute, and the Illinois Informatics Institute, 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 Department of Advertising, 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 Institute for Communications Research (ICR) doctoral program in the College of Media.
In order to ensure full consideration by the Search Committee, applications must be received by January 15, 2012. Salary will be commensurate with qualifications. Preferred starting date is August 16, 2013, but is negotiable. Applications can be submitted by going to http://jobs.illinois.edu (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 HR@cs.illinois.edu.
Illinois is an Affirmative Action /Equal Opportunity Employer and welcomes individuals with diverse backgrounds, experiences, and ideas who embrace and value diversity and inclusivity (www.inclusiveillinois.illinois.edu).
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
There will be opportunities for contributed talks. Titles and abstracts should be send to Gunnar Carlsson at firstname.lastname@example.org.
The conference website is located at http://www.icms.org.uk/workshops/atmcs5. Those interested should register there as soon as possible so that we can obtain an idea of the number of participants.
For the organizing committee,
(Posted at the request of Mikael Vejdemo-Johansson.)
(Ha, ha, only serious.)
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.
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:
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
Here'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.
Yes, most data structure papers count.
Yes, most planar graph papers count.
Congratulations to all the authors, but especially to my PhD student Kyle Fox on his first solo paper, his second student-only paper, and his second paper!
Mohammad Ali Abam, Mark De Berg, and Amirali Khosravi.
Piecewise-Linear Approximations of Uncertain Functions
Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, and Claudio Squarcella.
On the Area Requirements of Euclidean Minimum Spanning Trees
Spyros Angelopoulos, Alejandro Lopez-Ortiz, and Konstantinos Panagiotou.
Multi-target Ray Searching Problems
Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, and Shang Yang.
Boris Aronov and Muriel Dulieu.
How to Cover a Point Set with a V-Shape of Minimum Width
Boris Aronov, Muriel Dulieu, and Ferran Hurtado.
Witness Rectangle Graphs
Mark de Berg, Amirali Khosravi, Sander Verdonschot, and Vincent Van Der Weele.
On Rectilinear Partitions with Minimum Stabbing Number
Therese Biedl, Stephane Durocher, Celine Engelbeen, Samuel Fiorini, and Maxwell Young.
Faster Optimal Algorithms For Segment Minimization With Small Maximal Value
Therese Biedl and Lesvia Elena Ruiz Velázquez.
Orthogonal cartograms with few corners per face
Markus Bläser, Bodo Manthey, and B. V. Raghavendra Rao.
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Flatland, Matthew Katz, and Anil Maheshwari.
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance
Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, and Rodrigo Silveira.
Adjacency-Preserving Spatial Treemaps
Erin Chambers, Sandor Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph Mitchell, Venkatesh Srinivasan, Ulrike Stege, and Sue Whitesides.
Connecting a Set of Circles with Minimum Sum of Radii
Timothy M. Chan and Vinayak Pathak.
Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions
Danny Z. Chen and Haitao Wang.
New Algorithms for 1-D Facility Location and Path Equipartition Problems
Beyond Triangulation: Covering Polygons with Triangles
Atlas F. Cook IV, Anne Driemel, Sariel Har-Peled, Jessica Sherette, and Carola Wenk.
Computing the Fréchet Distance Between Folded Polygons
Anne Driemel, Herman Haverkort, Maarten Löffler, and Rodrigo Silveira.
Flow Computations on Imprecise Terrains
David Eppstein, Michael Goodrich, and Maarten Löffler.
Tracking Moving Objects with Few Handovers
P. Thomas Fletcher, John Moeller, Jeff Phillips, and Suresh Venkatasubramanian.
Horoball Hulls and Extents in Positive Definite Space
Jie Gao and Dengpan Zhou.
Resilient and Low Stretch Routing Through Embedding into Tree Metrics
Andreas Gemsa, Martin Nöllenburg and Ignaz Rutter.
Consistent Labeling of Rotating Maps
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba Toth, and Emo Welzl.
Counting Plane Graphs: Flippability and its Applications
Allan Jorgensen, Maarten Löffler, and Jeff Phillips.
Geometric Computations on Indecisive Points
Pegah Kamousi, Timothy Chan, and Subhash Suri.
Closest Pair and the Post Office Problem for Stochastic Points
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
Valentin Polishchuk and Mikko Sysikaski.
Faster algorithms for minimum-link paths with restricted orientations
The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light
Paul Christiano, Erik D. Demaine, and Shaunak Kishore.
Lossless Fault-Tolerant Data Structures with Additive Overhead
Pooya Davoodi, Gerth Stølting Brodal, and Srinivasa Rao Satti.
Path Minima Queries in Dynamic Weighted Trees
Inducing the LCP-Array
Upper Bounds for Maximally Greedy Binary Search Trees
On the matter of dynamic optimality in an extended model for tree access operations
Jing He, Hongyu Liang, and Guang Yang.
Reversing Longest Previous Factor Tables is Hard
Meng He and Ian Munro.
Space Efficient Data Structures for Dynamic Orthogonal Range Counting
Brent Heeringa, Marius Cătălin Iordan, and Louis Theran.
Searching in Dynamic Tree-Like Partial Orders
Shoshana Neuburger and Dina Sokol.
Succinct 2D Dictionary Matching With No Slowdown
Improved Distance Queries in Planar Graphs
I was asked to post this on behalf of Dick Karp, the conference organizer. Sounds like a fun conference; I wish I could go!
Registration for this conference will begin on Thursday, March 31 at http://www.eecs.berkeley.edu/IPRO/lensconference2011. There is no charge for registration. We hope you will be able to attend.
The conference will explore the theme that many processes in the physical, biological, engineering, and social sciences involve information processing at a fundamental level and can be studied through computational models. A conference held in Berkeley in May, 2002 helped crystallize this theme as a promising direction of research, and this second conference will highlight the impact of the computational lens on areas such as quantum information science, statistical physics, social networks, economics and game theory, genetics, molecular biology, evolutionary biology, cognitive science, mathematics, statistics and machine learning.
Professor Leslie Valiant, Harvard University
Evolution as a Form of Learning
Professor Ehud Kalai, Northwestern University
Robustness and Complexity in Games
Professor Christos Papadimitriou, UC Berkeley
Algorithms, Games, and the Internet
Professor Michael Kearns, University of Pennsylvania
Analysis of Social Networks
Professor Mark Newman, University of Michigan
Structure and Dynamics of Networks in the Real World
Professor Michael Jordan, UC Berkeley
On Joint Inference of Phylogeny and Alignment
Professor David Haussler, UC Santa Cruz
Professor Andrea Montanari, Stanford
Statistical Physics and Computation
Professor Daniel Fisher, Stanford
Dynamics of Evolutionary Processes
Dr. Jonathan Oppenheim, University of Cambridge
Computer Science as a Lens on Quantum Theory
Professor Umesh Vazirani, UC Berkeley
How Does Quantum Mechanics Scale?
Professor Lior Pachter, UC Berkeley
A Computational Approach to Discovery in Biology
Professor Tandy Warnow, UT, Austin
Ultra-Large Phylogenetic Estimation
Professor Sebastien Roch, UCLA
Large Phylogenies from Short Sequences: Recent Theoretical Insights
If you have questions, please contact Heather Levien, assistant to Professor Richard Karp, email@example.com, (510) 642-3497.