tag:blogger.com,1999:blog-58389303747478673272017-10-19T19:40:40.828+11:00dense outlierson theoretical computer science. from australia.taso viglashttp://www.blogger.com/profile/17986331474506555422noreply@blogger.comBlogger95125tag:blogger.com,1999:blog-5838930374747867327.post-1863055526526558132012-07-23T21:23:00.000+10:002012-07-23T21:23:03.378+10:00JoCG financial statementPat put together the financial statements for JoCG.<p> "In order to help others understand what the real cost of running an open access journal are, JoCG has released their financial statements for <a href="http://jocg.org/index.php/jocg/pages/view/finances2010">2010</a>, <a href="http://jocg.org/index.php/jocg/pages/view/finances2011">2011</a>, and <a href="http://jocg.org/index.php/jocg/pages/view/finances2012">2012 (YTD)</a>."<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/4WO3QAOu3Ak" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com1http://denseoutliers.blogspot.com/2012/07/jocg-financial-statement.htmltag:blogger.com,1999:blog-5838930374747867327.post-59791240069279415652012-06-01T14:55:00.000+10:002012-06-01T14:57:20.687+10:00JoCG renewing editorial boardJoCG has a policy to renew the editorial board regularly. This year the editorial board got seven new members while eight will be leaving during the year. The new members are: Joachim Giesen, Yoshio Okamoto, Herman Haverkort, Dominique Attali, John Iacono, Janos Pach, Uli Wagner. I'm sure they'll do a great job for JoCG!<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/f8NLLKbH0_4" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2012/06/jocg-renewing-editorial-board.htmltag:blogger.com,1999:blog-5838930374747867327.post-84582459043124314942012-01-24T10:10:00.001+11:002012-01-24T10:11:39.755+11:00COCOON 2012: 1st call for papersCALL FOR PAPERS: COCOON 2012<br /><br />The 18th Annual International Computing and Combinatorics Conference<br />20-22 August 2012, Sydney, Australia.<br />http://cocoon.it.usyd.edu.au/<br /><br />Original research papers in the areas of algorithms, theory of computation,<br />computational complexity, and combinatorics related to computing are<br />solicited. In addition to theoretical results, we are interested in submissions<br />that report on experimental and applied research of general algorithmic<br />interest. The conference proceedings will be published by Springer-Verlag<br />in the Lecture Notes in Computer Science series. Typical, but not exclusive,<br />topics of interest include:<br /> - Algorithms and Data Structures<br /> - Algorithmic Game Theory<br /> - Approximation and online algorithms<br /> - Automata, Languages, Logic, and Computability<br /> - Combinatorics Related to Algorithms and Complexity<br /> - Complexity Theory<br /> - Computational Learning Theory and Knowledge Discovery<br /> - Cryptography, Reliability and Security, and Database Theory<br /> - Computational Biology and Bioinformatics<br /> - Computational Algebra, Geometry, and Topology<br /> - Graph Drawing and Information Visualization<br /> - Graph Theory, Communication Networks, and Optimization<br /> - Parallel and Distributed Computing<br /><br />Paper Submission<br />Contributors are invited to submit a full paper with a maximum of 12 pages<br />in the Springer LNCS format including title, abstract and references. An<br />appendix, beyond the 12 pages, may be added and may be read at the reviewers'<br />discretion. Please format your paper in the Springer Lecture Notes style<br />according to the LNCS Author Instructions. Submitted papers must describe work not<br />previously published. They must not be submitted simultaneously to another conference with<br />refereed proceedings or to a journal. Only electronic submission (pdf) will be allowed.<br /><br />Publication<br />The conference proceedings will be published by Springer-Verlag in the Lecture Notes in Computer<br />Science (LNCS) series. After the conference, selected papers will be published in special issues.<br /><br />Awards<br />A best paper award and a best student paper award will be given. A paper is eligible for the best<br />student paper award if all authors are full-time students at the time of submission.<br /><br />Student grants<br />There will be a number of student travel awards consisting in free registration. These awards will<br />be granted on the merits of the applicants. Priority will be given to students presenting a paper<br />at the meeting.<br /><br />Invited Speakers<br />Kamal Jain<br />Joseph Mitchell, Stony Brook<br /><br />Important Dates<br />Submission deadline February 18, 2012 (by 11:59:59pm CST)<br />Notification of acceptance April 18, 2012<br />Final version due May 12, 2012<br /><br />Contact: cocoon2012@it.usyd.edu.au<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/Bpul8Wsnbbg" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2012/01/cocoon-2012-1st-call-for-papers.htmltag:blogger.com,1999:blog-5838930374747867327.post-46672022908229375062011-09-20T23:05:00.002+10:002011-09-20T23:09:02.554+10:00Open position in computer systems at USydOur school is currently advertising a (tenure-tracked) position at the Lecturer (Level B)/Senior Lecturer level (Level C) in computer systems.<br /><br />More details at: <a href="http://tinyurl.com/3tzfwqw">http://tinyurl.com/3tzfwqw</a><img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/zwFXLTDsB18" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2011/09/open-position-in-computer-systems-at.htmltag:blogger.com,1999:blog-5838930374747867327.post-46061126143291373842011-03-21T17:50:00.002+11:002011-03-21T17:53:18.798+11:00JoCG indexed<a href="http://jocg.org">JoCG</a> is now included the <a href="http://www.doaj.org/doaj?func=openurl&issn=1920180X&genre=journal">Directory of Open Access Journals</a> and <a href="http://www.ams.org/mathscinet/search/journaldoc.html?jc=JCOGE">MathSciNet</a> (thanks to David Wood).<br /><br />Which other organisations should we aim to get it indexed by?<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/YWWMI5n4Slo" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2011/03/jocg-indexed.htmltag:blogger.com,1999:blog-5838930374747867327.post-65140136870081520532011-01-13T20:07:00.004+11:002011-01-13T20:16:01.980+11:00Thore on theory on TVI just spent the last 22:06 minutes watching a great little <a href="http://itu.dk/da/Forskning/ITView/Da%20Google%20aendrede%20alting">film</a> with <a href="http://thorehusfeldt.net/">Thore Husfeldt</a> where he talks about algorithms, in particular Google’s PageRank.<br /><br />Thore wrote a post about the work that you can find <a href="http://thorehusfeldt.net/2011/01/11/how-google-works%E2%80%94film-at-11/#comment-44">here</a>. <br /><br />Unfortunately it's only available in Danish (a dialect of Swedish).<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/iSby4xo5bMc" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com1http://denseoutliers.blogspot.com/2011/01/thore-on-theory-on-tv.htmltag:blogger.com,1999:blog-5838930374747867327.post-61475139900863968812010-12-09T09:58:00.001+11:002010-12-09T09:58:23.152+11:00Theoretical computer science day in SydneyTheoretical computer science day in Sydney<br />January 28, 2011<br />New Law School Seminar 020, University of Sydney<br /><br />CALL FOR PARTICIPATION<br />The theoretical computer science day will take place in Sydney on<br />January 28, 2011. The aim of this one-day event is to bring together<br />researchers interested in all aspects of theoretical computer science,<br />and discuss current trends and problems in the field, as well as<br />future directions. We would like to invite researchers in theoretical<br />computer science to participate in this event. If you are interested<br />in participating, please register as soon as possible for the event<br />through the website mentioned below. Registration is open to everyone<br />and is free.<br /><br />More information is available on the web at<br />http://sact.it.usyd.edu.au/TDS, including information about the<br />invited presentations, the location and registration.<br /><br />The list of invited speakers includes:<br />Otfried Cheong, KAIST, Korea<br />Catherine Greenhill, UNSW<br />Mohammad Mahdian, Yahoo! research<br />Bernard Mans, Macquarie University<br />Toby Walsh, NICTA<br />David Wood, University of Melbourne<br /><br />ORGANISATION<br />Joachim Gudmundsson, NICTA, joachim.gudmundsson@nicta.com.au<br />Julian Mestre, University of Sydney, mestre@it.usyd.edu.au<br />Taso Viglas, University of Sydney, taso.viglas@sydney.edu.au<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/nInGfHJTWTc" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2010/12/theoretical-computer-science-day-in.htmltag:blogger.com,1999:blog-5838930374747867327.post-48916047603200250652010-11-30T18:04:00.001+11:002010-11-30T18:06:24.322+11:00Another great JoCG articleComputing the Maximum Detour of a Plane Geometric Graph in Subquadratic Time<br />by Christian Wulff-Nilsen <br /><br />Abstract:<br />Let G be a plane geometric graph where each edge is a line segment. We consider the problem of computing the maximum detour of G, defined as the maximum over all pairs of distinct points (vertices as well as interior points of edges) p and q of G of the ratio between the distance between p and q in G and the Euclidean distance ||pq||2. The fastest known algorithm for this problem has Θ(n2) running time where n is the number of vertices. We show how to obtain O(n3/2(log n)3) expected running time. We also show that if G has bounded treewidth, its maximum detour can be computed in O(n(log n)3) expected time.<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/lZaQ--zbMTw" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2010/11/another-great-jocg-article.htmltag:blogger.com,1999:blog-5838930374747867327.post-58262537857436280842010-11-21T19:43:00.001+11:002010-11-21T19:45:01.764+11:00JoCG paperNew <a href="http://jocg.org/index.php/jocg/article/view/19">paper</a> published in JoCG:<br /><br /> <br />COMPUTING MULTIDIMENSIONAL PERSISTENCE<br />Gunnar Carlsson, Gurjeet Singh, Afra J. Zomorodian<br /><br />ABSTRACT<br />The theory of multidimensional persistence captures the topology of a multifiltration - a multiparameter family of increasing spaces. Multifiltrations arise naturally in the topological analysis of scientific data. In this paper, we give a polynomial time algorithm for computing multidimensional persistence. We recast this computation as a problem within computational commutative algebra and utilize algorithms from this area to solve it. While the resulting problem is EXPSPACE-complete and the standard algorithms take doubly-exponential time, we exploit the structure inherent withing multifiltrations to yield practical algorithms. We implement all algorithms in the paper and provide statistical experiments to demonstrate their feasibility.<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/G_trQFKEBw0" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2010/11/jocg-paper.htmltag:blogger.com,1999:blog-5838930374747867327.post-18606412188321132402010-10-19T11:57:00.003+11:002010-10-19T12:12:08.264+11:00Call for papers!Some recent CG related cfp:<br /><br /> - Symposium on Computational Geometry (<a href="http://socg2011.inria.fr/call-for-papers">SoCG'11</a>) will be held on June 13-15 in Paris, France. Deadline: Dec 1 <br /><br />There is also a <a href="http://cgl.uni-jena.de/Workshops/WebHome">CG Learning Summer School</a> (June 9-11) as a satellite event. <br /><br /> - European Workshop on Computational Geometry (<a href="http://eurocg11.inf.ethz.ch/call-for-papers">EuroCG'11</a>) will be held on March 28-30, 2011, in Morschach, Switzerland. Deadline: Jan 9<br /><br />- Conference on Geosensor Networks (<a href="http://geosensor.net/2011/">GSN'11</a>) will be held on July 11-13, 2011, in Melbourne, Australia. Deadline: Mar 4<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/OW7rz9c_X2c" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2010/10/call-for-papers.htmltag:blogger.com,1999:blog-5838930374747867327.post-48791894173475356892010-06-30T19:58:00.005+10:002010-07-03T20:34:19.275+10:00Some SoCG'10 papersSoCG is over for this year. In general I thought that the quality of the accepted papers was very high, and I really enjoyed many of the presentations and the results. There has already been numerous reports from SoCG (Sorelle <a href="http://kdphd.blogspot.com/2010/06/socg-day-1.html">I</a>, <a href="http://kdphd.blogspot.com/2010/06/socg-day-2.html">II</a> and <a href="http://kdphd.blogspot.com/2010/06/socg-day-3-and-massive.html">III</a>, <a href="http://11011110.livejournal.com/198487.html">David</a>, <a href="http://valis.cs.uiuc.edu/blog/?p=5081">Sariel</a> and <a href="http://geomblog.blogspot.com/2010/06/its-over.html">Suresh</a>), and below I'm just going to briefly mention three of the ones that I found the most interesting - in order of presentation.<br /><br />Timothy Chan - Optimal Partition Trees (<a href="http://www.cs.uwaterloo.ca/~tmchan/optpt_2_10.pdf">Paper</a>). <br />Timothy improves on a result from 1992 by Matousek. He presents a simpler construction with a better preprocessing time. There are already numerous blog comments on it (<a href="http://valis.cs.uiuc.edu/blog/?p=5081">Sariel</a> and <a href="http://kdphd.blogspot.com/2010/06/socg-day-1.html">Sorelle</a>).<br /><br />Joe Mitchell - A constant factor approximation algorithm for TSP with neighbourhoods in the plane (<a href="http://www.ams.sunysb.edu/~jsbm/papers/tspn09.pdf">paper</a>).<br />This is a problem I've been working on back and forth for a long time. Given a collection of objects (usually polygons) in the plane, called neighbourhoods, find the shortest tour that visits all neighbourhoods. In 2002 we presented a constant factor approximation algorithm for fat disjoint objects of arbitrary size. This was the first constant factor approximation algorithm for arbitrary size objects. Joe has several results on the topic and in his SoCG paper he presents the first constant-factor approximation algorithm for TSPN on an arbitrary set of disjoint, connected neighbourhoods in the plane. This has been an open problem since the mid-90's and Joe's paper is a big step forward. Of course, ultimately we would like a constant-factor approximation for the general case, not necessarily disjoint neighbourhoods. He has several interesting general observations in his paper. One is that skinny neighbourhoods are not longer a big problem. Using “directional hulls”, which are fat, for an appropriate choice of one of two coordinate systems. Then one can partition the regions into two sets (“blue” regions and “red” regions). Separately find approximating tours of each set, and then use the Combination Lemma (Arkin and Hassin) to combine into a tour of the entire set.<br /><br />Anne Driemel, Sariel Har-Peled and Carola Wenk - Approximating the Frechet distance for realistic curves in near linear time (<a href="http://valis.cs.uiuc.edu/~sariel/research/papers/09/frechet/">paper</a>).<br />This is probably my favourite paper at SoCG this year. It's an important problem (imho) and it's great to finally see a subquadratic time algorithm with reasonable assumptions. The aim is to calculate the Frechet distance between two curves. They introduce a notion of k-bounded curvature which means that in a ball of radius r the length of the trajectory inside that ball is bounded by k*r (this family of curves is closed under simplification, a property that is very useful in practice). This sounds like a reasonable assumption for many applications (although not for trajectories generated from football players). They present a (1+eps)-approximation algorithm to compute the Frechet distance between two curves with k-bounded curvature and prove that this can be done in near-linear time. The key idea is that after the curves have been simplified the complexity of the reachable free space is linear for fixed k and epsilon (the free space diagram is the standard tool for computing the Frechet distance between curves but has quadratic complexity).<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/QO7GJKlReqE" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com2http://denseoutliers.blogspot.com/2010/06/some-socg10-papers.htmltag:blogger.com,1999:blog-5838930374747867327.post-1511052132550584782010-06-29T21:17:00.000+10:002010-06-29T21:17:15.009+10:00New position at the university of sydney (algorithmic machine learning)We have a <a href="http://usyd.nga.net.au/cp/index.cfm?event=jobs.checkJobDetailsNewApplication&returnToEvent=jobs.listJobs&jobid=c4a9348c-f84e-50b2-8416-52f624f3280a&JobListID=A218B974-AA19-4889-821F-9BC90126FFAA&jobsListKey=c713cdbe-90f9-437b-a385-cbf565695d27&persistVariables=JobListID,jobsListKey">new position</a> in "algorithmic machine learning" at the university of sydney. <br />The deadline for submitting an application is 12-august-2010.<br /><br />The position is at the level of "lecturer" which is the same as an assistant professor, or "senior lecturer" which is again the same as an assistant professor but usually slightly older, with some gray hair, possibly kids, and a mortgage.<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/E9aSROVa5e0" height="1" width="1" alt=""/>taso viglashttp://www.blogger.com/profile/17986331474506555422noreply@blogger.com1http://denseoutliers.blogspot.com/2010/06/new-position-at-university-of-sydney.htmltag:blogger.com,1999:blog-5838930374747867327.post-8077872737063607952010-06-14T02:56:00.003+10:002010-06-14T03:18:58.561+10:00More JoCG articlesAnother two articles published in JoCG (and currently another 16 under review):<br /><br />On the Stretch Factor of Convex Delaunay Graphs <br />by Prosenjit Bose, Paz Carmi, Sebastien Collette and Michiel Smid<br /><br />Visibility Maps of Realistic Terrains have Linear Smoothed Complexity<br />by Mark de Berg, Herman Haverkort and Constantinos P. Tsirogiannis <br /><br /><br />Just arrived in Snowbird for SoCG'10. I was hoping for a warm summer weather, instead it's raining and there's still snow around the hotel.<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/-_8WJRHxm_I" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2010/06/more-jocg-articles.htmltag:blogger.com,1999:blog-5838930374747867327.post-18804693943182404502010-06-08T22:45:00.003+10:002010-06-08T22:49:47.006+10:00JoCG new articleThe second scientific <a href="http://jocg.org/index.php/jocg/article/viewFile/24/8">article</a> in JoCG was just published. It's an expository of visibility and blockers by Attila Por and David Wood. Enjoy!<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/ImfDSe3-of8" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2010/06/jocg-new-article.htmltag:blogger.com,1999:blog-5838930374747867327.post-60909318726463701722010-05-25T12:01:00.000+10:002010-05-25T12:01:07.085+10:00CATS 2011 call for papers (the australian theory conference)<span class="Apple-style-span" style="color: #111111; font-family: verdana, arial, helvetica, sans-serif; font-size: 13px;">CATS 2011 -- Computing: The Australasian Theory Symposium<br />Perth, Australia, January 17-20, 2011<br />http://cats.it.usyd.edu.au/<br /><br />The 17th Computing: The Australasian Theory Symposium (CATS) will be held in Perth, Australia, January 17-20, 2011. CATS is an annual conference held in the Australia-New Zealand region, dedicated to theoretical computer science.<br /><br />Authors are invited to submit papers that present original and unpublished research on topics including (but not limited to) the following areas: algorithms and data structures, complexity theory, graph theory, graph algorithms and combinatorics, semantics of programming languages, approximation and randomized algorithms, combinatorial optimization, formal program specification and transformation, computational geometry, algorithmic game theory, computational biology, logic and type systems, and computability.<br /><br />Deadlines and other dates:<br />Paper submission deadline:Monday August 16, 2010<br />Acceptance notification:Monday October 4, 2010<br />Final version of accepted papers due:Monday November 5, 2010<br />Early registration: Monday December 6, 2010<br />Conference dates: January 17-20, 2011<br /><br />The proceedings of this event will be published by the Australian Computer Society (ACS) in the CRPIT Series (http://crpit.com/), and will also appear in the ACM digital library.<br /><br />CATS 2011 is part of the Australasian Computer Science Week (ACSW), an international annual conference event, supported by the Computing Research and Education Association (CORE) in Australia. ACSW 2011 is hosted by Curtin University in Perth, Australia.<br /><br />For more information please visit http://cats.it.usyd.edu.au/<br />Contact: taso viglas (aviglas+cats2011@gmail.com)</span><img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/dFiOO1eqqJk" height="1" width="1" alt=""/>taso viglashttp://www.blogger.com/profile/17986331474506555422noreply@blogger.com0http://denseoutliers.blogspot.com/2010/05/cats-2011-call-for-papers-australian.htmltag:blogger.com,1999:blog-5838930374747867327.post-75693925415046727532010-05-11T17:02:00.003+10:002010-05-11T17:17:47.692+10:00Back in the officeToday is my first day back at work after three months daddy leave. It's been great (I highly recommend it!) but it's also good to be back. I feel pretty energetic and motivated, but I'm sure it's just temporary. <br /><br />As part of the new start I refurbished my <a href="http://gudmundsson.biz">homepage</a> (can you guess what the banner depicts?), I bought two new sweaters and I just printed (I really should get an ereader) 6 papers that I have to review. Yes, I'm ready for work!<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/e0iCM2mPS60" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com1http://denseoutliers.blogspot.com/2010/05/back-in-office.htmltag:blogger.com,1999:blog-5838930374747867327.post-4250952822697431382010-02-15T11:08:00.001+11:002010-02-15T21:39:52.657+11:00SoCG paperAs <a href="http://valis.cs.uiuc.edu/blog/?p=4376">Sariel</a> already noted the SoCG notification is out (couldn't find a list of accepted papers). <br /><br />I was lucky to get a paper accepted. The <a href="http://arxiv.org/abs/1001.2734">paper</a> is on visibility testing in the plane and it's together with Pat Morin.<br /><br />In the paper we consider query versions of visibility testing and visibility counting. That is, let S be a set of n disjoint line segments in the plane and let s be an element of S. Visibility testing is to preprocess S so that we can quickly determine if s is visible from a query point q. The counting version involves preprocessing S so that one can quickly estimate the number of segments in S visible from a query point q.<br /><br />The key idea is that one can cover the visibility polygon of a segment with only an expected linear number of triangles (even though its complexity may be quartic), and for all the segments with a quadratic number of triangles, such that given a query point q the number of triangles stabbed is a 2-approximation of the number of segments q can see. Pretty nifty, eh?<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/zYtigPbL_Sc" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com1http://denseoutliers.blogspot.com/2010/02/socg-paper.htmltag:blogger.com,1999:blog-5838930374747867327.post-90392243111812876872010-02-12T09:34:00.003+11:002010-02-12T09:49:15.409+11:00JoCG first publications!I'm sure some of you are wondering what's happening with <a href="http://jocg.org">JoCG</a> (Journal of Computational Geometry). The first papers were published yesterday!<br /><br />The first paper of JoCG is a <a href="http://jocg.org/index.php/jocg/article/view/20">Welcome from the Editors-in-Chief</a> by Ken Clarkson and Günter Rote. And the first contribution to be published is: <a href="http://jocg.org/index.php/jocg/article/view/21">Happy Endings for Flip Graphs</a> by David Eppstein. <br /><br /><br />So far JoCG has received 21 submissions. Of these, 1 has been accepted and published, 4 have been accepted pending (various levels of) revisions, 8 have been rejected, and the remaining 8 papers are still being reviewed. <br /><br />All in all, I think it's a good start of the journal. Hopefully it will get even more submissions now when papers are getting published.<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/zoLnJBMrKkw" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2010/02/jocg-first-publications.htmltag:blogger.com,1999:blog-5838930374747867327.post-86856563310752761902010-01-20T17:42:00.003+11:002010-01-20T17:52:09.184+11:00Computational geometry - main stream convex optimisation?As Tasos pointed out there's an open position in "Large Scale Convex Optimization" at University of Sydney.<br /><br />For that reason I would be very interested to hear if anyone has any ideas on how one can argue that computational geometry is actually "Large Scale Convex Optimization", or even that it's remotely related to it.<br /><br />Really good ideas will be awarded with beer (non-alcoholic of course).<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/obquBcOV95s" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2010/01/computational-geometry-main-stream.htmltag:blogger.com,1999:blog-5838930374747867327.post-70674133651890009752010-01-15T11:53:00.002+11:002010-01-15T12:10:33.548+11:00Position at the University of SydneyThere is a faculty position at the University of Sydney (School of IT). The full ad can be found <a href="http://usyd.nga.net.au/cp/index.cfm?event=jobs.checkJobDetailsNewApplication&returnToEvent=jobs.listJobs&jobid=12c81f18-1e47-b428-87ad-52f62554941d&JobListID=A218B974-AA19-4889-821F-9BC90126FFAA&jobsListKey=d5d48a93-5a62-4e8f-a2f4-8de87349f502&persistVariables=JobListID,jobsListKey">here</a>.<div><div>The position is in the area of optimization and algorithms. </div><div>Applications need to be submitted by January 27. The position is at the Lecturer/Senior Lecturer level which is what an assistant professor is called in australia (senior lecturer can also be considered as an early associate professor level appointment).</div><div><br /></div><div>--taso</div><div><br /></div><div><br /><div><br /></div></div></div><img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/3YJP60-7s24" height="1" width="1" alt=""/>taso viglashttp://www.blogger.com/profile/17986331474506555422noreply@blogger.com0http://denseoutliers.blogspot.com/2010/01/position-at-university-of-sydney.htmltag:blogger.com,1999:blog-5838930374747867327.post-15726399847539359072009-06-19T12:35:00.002+10:002009-06-19T13:12:30.740+10:00postdoc position at the university of sydneyThe University of Sydney is <a href="http://www.usyd.edu.au/research/fellowships/postdoctoral_research.shtml">offering 10 postdoctoral fellowships in 2010</a>.<br />short summary:<br /><ul><li>up to 3 years,</li><li>for phds awarded after 1-Jan-2004, </li><li>research grant up to 25,000 aud, plus some relocation expenses</li><li>salary around 72,000 aud<br />(i think... that's USyd level A8 according to <a href="http://www.usyd.edu.au/hr/eb/march_2009/ACA_rates.pdf">this pdf</a>, linked from <a href="http://www.usyd.edu.au/hr/eb/2006/index.shtml">this page</a>)<br /></li><li>fellowship might involve up to 6h per week of "other duties" (teaching)</li><li>research proposal for the application is 4 pages</li></ul><br />Applicants need to contact the Head of the proposed school/department before august 7 (for computer science that's <a href="http://pmg.it.usyd.edu.au/People.html">sanjay chawla</a> at hos@it.usyd.edu.au).<br />more details in <a href="http://www.usyd.edu.au/research/documents/fellowships/USyd_postdoc_fell_2010_guide.pdf">this pdf</a>.<br /><br />Copying <a href="http://www.usyd.edu.au/research/fellowships/postdoctoral_research.shtml">the announcement</a> from the University of Sydney website:<br /><br /><hr /><br />Postdoctoral Research Fellowships<br /><br />CLOSING DATE TO RESEARCH OFFICE: 11 September 2009<br /><br />Applicants must contact the Head of the host School/Department before 7 August 2009.<br /><br />The University of Sydney Postdoctoral Fellowships were established in 1996 to support excellence in full-time research undertaken in any Department or School at the University. The University will be offering up to 10 new Fellowships in 2010. The Fellowships are extremely prestigious and highly competitive internationally in line with equivalent externally funded fellowships. Applicants must have an outstanding track record relative to opportunity in order to be short-listed. Successful applicants are expected to be based full-time at the University for the duration of the Fellowship and must not hold a concurrent paid appointment.<br /><br />Eligibility<br /><br />Strong preference will be given to applicants seeking to join the University from another organisation in Australia or from overseas. Applicants must have a PhD award dated no earlier than 1 January 2004.. Applicants with a Phd award dated later than 31 December 2008 are extremely unlikely to be competitive and should talk to the host Head of School to assess competitiveness before applying.<br />Applicants with a PhD awarded by the University of Sydney within the timeframe specified above may apply if they have held a position with another organisation subsequent to the award of their PhD. Applicants currently employed at the University of Sydney or other affiliated institutions (including but not limited to medical institutes) who commenced such employment after the award of their PhD AND on or after 1 July 2008 are eligible to apply.<br />Applicants wishing to clarify eligibility must submit a written request by 24 July 2009 to the Research Office. research@usyd.edu.auresearch[at]usyd.edu.au<br /><br />Assessment Criteria<br /><br />Excellence will be the primary criterion, both in terms of the project and the researcher. Equal weight will be given to the quality of the project and the track record of the applicant relative to opportunity. The alignment of the proposed research with existing activity and the environment in the host Department/School will also be an important consideration.<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/wL48u5x0Jr0" height="1" width="1" alt=""/>taso viglashttp://www.blogger.com/profile/17986331474506555422noreply@blogger.com6http://denseoutliers.blogspot.com/2009/06/postdoc-position-at-university-of.htmltag:blogger.com,1999:blog-5838930374747867327.post-53440957328126618272009-06-11T16:43:00.001+10:002009-06-11T16:45:12.665+10:00Journal of Computational GeometryThe <a href="http://jocg.org">Journal of Computational Geometry</a> (jocg.org) is now accepting submissions.<br /><br />Scope and Focus<br />The Journal of Computational Geometry (JoCG) is an international open access electronic journal devoted to original research of the highest quality in all aspects of computational geometry. JoCG publishes papers on the design and analysis of geometric algorithms, the complexity of geometric problems, experimental work on geometric algorithms, applications of computational geometry, and topics at the intersection of geometry and algorithms. Topics include metric space embeddings, graph drawing, computational topology, topological learning, meshing, compressed sensing, manifold learning, computer-aided design, discrete geometry, and combinatorial geometry. Outstanding survey papers in the area are also considered.<br /><br />Editors-in-Chief<br />Ken Clarkson, IBM, United States<br />Günter Rote, Freie Universität Berlin<br /><br />Editorial Board<br />Hee-Kap Ahn, Postech, Korea, Republic of<br />Oswin Aichholzer, Graz University of Technology, Austria<br />Nancy M. Amato, Texas A&M University, United States<br />Lars Arge, University of Aarhus, Denmark<br />Boris Aronov, Polytechnic University, United States<br />Mark de Berg, TU Eindhoven, Netherlands<br />Jean-Daniel Boissonnat, INRIA Sophia-Antipolis, France<br />Peter Brass, City College of New York, United States<br />Sergio Cabello, University of Ljubljana, Slovenia<br />Bernard Chazelle, Princeton University, United States<br />Otfried Cheong, KAIST, Korea, Republic Of<br />Ken Clarkson, IBM, United States<br />Tamal K. Dey, The Ohio State University, United States<br />Vida Dujmovic, Carleton University, Canada<br />Jeff Erickson, University of Illinois, Urbana-Champaign, United States<br />Hazel Everett, Université Nancy, France<br />Xavier Goaoc, INRIA, France<br />Anupam Gupta, Carnegie Mellon University, United States<br />Dan Halperin, Tel Aviv University, Israel<br />John Hershberger, Mentor Graphics, United States<br />Ferran Hurtado, Universitat Politècnica de Catalunya, Spain<br />Piotr Indyk, MIT, United States<br />Marc van Kreveld, Utrecht University, Netherlands<br />Stefan Langerman, Université Libre de Bruxelles<br />Joseph S. B. Mitchell, Stony Brook University, United States<br />Günter Rote, Freie Universität Berlin<br />Christian Sohler, TU Dortmund, Germany<br />Takeshi Tokuyama, Tohoku University, Japan<br />Jan Vahrenhold, Technische Universität Dortmund, Germany<br />Yusu Wang, The Ohio State University, United States<br />David R. Wood, The University of Melbourne, Australia<br /><br />Managing Editors<br />Joachim Gudmundsson, NICTA, Australia<br />Pat Morin, Carleton University, Canada<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/qqMCnhvqETI" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com0http://denseoutliers.blogspot.com/2009/06/journal-of-computational-geometry.htmltag:blogger.com,1999:blog-5838930374747867327.post-63138572212796438312009-06-02T17:55:00.002+10:002009-06-02T18:00:27.677+10:00CATS 2010Call for Papers<br />CATS 2010 -- Computing: The Australasian Theory Symposium<br />Brisbane, Australia, January 2010<br /><a href="http://cats.it.usyd.edu.au/">http://cats.it.usyd.edu.au/</a><br /><br />CATS (Computing: The Australasian Theory Symposium) is an annual conference dedicated to theoretical computer science. In 2010, the 16th Computing: The Australasian Theory Symposium will be held in Brisbane, Australia, January 18-21, 2010.<br /><br />Authors are invited to submit papers that present original and unpublished research on topics including (but not limited to) the following areas: algorithms and data structures, complexity theory, graph theory, graph algorithms and combinatorics, semantics of programming languages, approximation and randomized algorithms, combinatorial optimization, formal program specification and transformation, computational geometry, algorithmic game theory, computational biology, logic and type systems, computability and new paradigms of computation.<br /><br />Deadlines and other dates:<br />Paper submission deadline: Monday August 17, 2009<br />Acceptance notification: Monday October 5, 2009<br />Final version of accepted papers due: Monday November 2, 2009<br />Early registration: Monday December 7, 2009<br />Conference dates: January 18-21, 2010<br /><br />The proceedings of this event will be published by the <a href="http://www.acs.org.au/">Australian Computer Society</a> (ACS) in the CRPIT Series (<a href="http://crpit.com/">http://crpit.com/</a>), and will also appear in the ACM digital library.<br /><br />CATS 2010 is part of the Australasian Computer Society Week (ACSW), an international annual conference event, supported by the Computing Research and Education Association (CORE) in Australia. ACSW 2010 is hosted by the School of Information Technology at the Queensland University of Technology (QUT) in Brisbane, Australia, in January 2010.<br /><br />For more information about CATS please visit <a href="http://cats.it.usyd.edu.au/">http://cats.it.usyd.edu.au/</a><br />Contact: cats2010@easychair.org<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/seSTH_2lYA8" height="1" width="1" alt=""/>taso viglashttp://www.blogger.com/profile/17986331474506555422noreply@blogger.com0http://denseoutliers.blogspot.com/2009/06/cats-2010.htmltag:blogger.com,1999:blog-5838930374747867327.post-45959069870097892892009-05-30T09:33:00.002+10:002009-05-30T09:49:38.836+10:00The birth of a new CG journalSo we finally decided to start a new journal - Journal of Computational Geometry. After a lot of doubts and discussions back and forth we decided to send out invitations to colleagues asking them to join the editorial board. The responds has been amazingly positive. Even though a few declined they were all very supportive. The, almost finalized, editorial board can be found on the journal <a href="http://jocg.org">webpage</a> (which is still under construction). <br /><br />We hope to be ready to accept paper in a couple of weeks. More details to follow in a later post.<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/iFpb9oZ-SBs" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com2http://denseoutliers.blogspot.com/2009/05/birth-of-new-cg-journal.htmltag:blogger.com,1999:blog-5838930374747867327.post-6799242069080130972009-02-16T10:36:00.003+11:002009-02-16T11:30:31.971+11:00Should we start a free CG journal?After a bit of work we believe we have solved most of the practical problems that have to be taken care of before starting a free journal. This is probably the easy part. Now we have to decide if it is a good idea or not.<br /><br />The aim is to have a high quality journal for the CG community that is run by the CG community and free to everyone (really free, no cost to publish and no cost to access). Obviously such a journal needs the support of the CG community to be successful. The work should be shared among the community, i.e., the editorial board and editorial manager(s) should be replaced regularly. <br /><br />Starting it would require a strong commitment from everyone involved (including the editorial board) for the first few years. So do we want a free CG journal? Please let us know what you think by commenting and/or filling in the poll. <br /><br />You can select "Yes", "No" or "No, but someone else should". The third option is there to capture anyone that is positive to the idea but believes that he or someone else is better suited to do it. We're doing this with the aim to get a free journal in the community and if someone else wants to do it we would be happy to give our support.<img src="http://feeds.feedburner.com/~r/DenseOutliers/~4/K-e1b3LXpg4" height="1" width="1" alt=""/>Joachimhttp://www.blogger.com/profile/11662014960399205931noreply@blogger.com8http://denseoutliers.blogspot.com/2009/02/should-we-start-free-cg-journal.html