dense outliers

postdoc position at the university of sydney

2009-06-19T12:35:00.002+10:00

The University of Sydney is offering 10 postdoctoral fellowships in 2010.
short summary:

up to 3 years,
for phds awarded after 1-Jan-2004,
research grant up to 25,000 aud, plus some relocation expenses
salary around 72,000 aud
(i think... that's USyd level A8 according to this pdf, linked from this page)
fellowship might involve up to 6h per week of "other duties" (teaching)
research proposal for the application is 4 pages

Applicants need to contact the Head of the proposed school/department before august 7 (for computer science that's sanjay chawla at hos@it.usyd.edu.au).
more details in this pdf.

Copying the announcement from the University of Sydney website:

Postdoctoral Research Fellowships

CLOSING DATE TO RESEARCH OFFICE: 11 September 2009

Applicants must contact the Head of the host School/Department before 7 August 2009.

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.

Eligibility

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.
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.
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

Assessment Criteria

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.

Journal of Computational Geometry

2009-06-11T16:43:00.001+10:00

The Journal of Computational Geometry (jocg.org) is now accepting submissions.

Scope and Focus
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.

Editors-in-Chief
Ken Clarkson, IBM, United States
Günter Rote, Freie Universität Berlin

Editorial Board
Hee-Kap Ahn, Postech, Korea, Republic of
Oswin Aichholzer, Graz University of Technology, Austria
Nancy M. Amato, Texas A&M University, United States
Lars Arge, University of Aarhus, Denmark
Boris Aronov, Polytechnic University, United States
Mark de Berg, TU Eindhoven, Netherlands
Jean-Daniel Boissonnat, INRIA Sophia-Antipolis, France
Peter Brass, City College of New York, United States
Sergio Cabello, University of Ljubljana, Slovenia
Bernard Chazelle, Princeton University, United States
Otfried Cheong, KAIST, Korea, Republic Of
Ken Clarkson, IBM, United States
Tamal K. Dey, The Ohio State University, United States
Vida Dujmovic, Carleton University, Canada
Jeff Erickson, University of Illinois, Urbana-Champaign, United States
Hazel Everett, Université Nancy, France
Xavier Goaoc, INRIA, France
Anupam Gupta, Carnegie Mellon University, United States
Dan Halperin, Tel Aviv University, Israel
John Hershberger, Mentor Graphics, United States
Ferran Hurtado, Universitat Politècnica de Catalunya, Spain
Piotr Indyk, MIT, United States
Marc van Kreveld, Utrecht University, Netherlands
Stefan Langerman, Université Libre de Bruxelles
Joseph S. B. Mitchell, Stony Brook University, United States
Günter Rote, Freie Universität Berlin
Christian Sohler, TU Dortmund, Germany
Takeshi Tokuyama, Tohoku University, Japan
Jan Vahrenhold, Technische Universität Dortmund, Germany
Yusu Wang, The Ohio State University, United States
David R. Wood, The University of Melbourne, Australia

Managing Editors
Joachim Gudmundsson, NICTA, Australia
Pat Morin, Carleton University, Canada

CATS 2010

2009-06-02T17:55:00.002+10:00

Call for Papers
CATS 2010 -- Computing: The Australasian Theory Symposium
Brisbane, Australia, January 2010
http://cats.it.usyd.edu.au/

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.

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.

Deadlines and other dates:
Paper submission deadline: Monday August 17, 2009
Acceptance notification: Monday October 5, 2009
Final version of accepted papers due: Monday November 2, 2009
Early registration: Monday December 7, 2009
Conference dates: January 18-21, 2010

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.

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.

For more information about CATS please visit http://cats.it.usyd.edu.au/
Contact: cats2010@easychair.org

The birth of a new CG journal

2009-05-30T09:33:00.002+10:00

So 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 webpage (which is still under construction).

We hope to be ready to accept paper in a couple of weeks. More details to follow in a later post.

Should we start a free CG journal?

2009-02-16T10:36:00.003+11:00

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.

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.

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.

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.

Progress report 1: open CG journal

2009-02-04T11:59:00.003+11:00

After a bit of work and a lot of help from Pat we've made some progress.

- The Open Journal System seems to be a usable journal management system (although far from optimal). To get it going one needs to rewrite most of the information pages and pre-prepared mails, but it's possible.

- The most suitable copyright agreement we could find is the Creative Common Attribution 3.0. The only restriction is "Whenever a work is copied or redistributed under a Creative Commons licence, credit must always be given to the creator.".

- We need a latex style file. Any suggestions on what needs to be included in the style file? Theorem-environments, paper size, font size, font, figures...

- Name of the journal? Any suggestions? Journal on Computational Geometry (JoCG)? When the name has been decided we can easily get a domain name and an ISSN.

Anything else?

A free CG journal?

2009-01-27T13:42:00.002+11:00

For the last few years I've been discussing the possibility of setting up a free computational geometry journal with my colleagues. For me the two main reasons of having a free journal is the price we pay for a subscription (CGTA costs EUR 1,041/year) and the copyright transfer.

The idea would be to make the journal completely free which would require it to be as low maintenance as possible. The aim is to make the journal belong to the community and hence minimize the workload on individuals. How can this be achieved and what are the issues that must be considered?

The journal should work as a traditional journal with the difference that papers are only published on-line and are free to access by anyone.
The editorial board (including the Editors-in Chief) should be changed regularly. I believe 3-5 years is a reasonable time to serve as an editor.
Fairly large editorial board, say 30 (reliable) researchers. Try to distribute the papers among the editors.
The editors have to take greater responsibility throughout the process - from submission to publication. For example, the editor has to check that the final version is in the required format. One should also allow the editors to have more power, for example, if authors don't follow the stated procedures then the editor should have the right (within reason) to reject it, all to minimize work for the editors.
Aim to only accept high quality research since this will decrease the number of submissions (at least in the long run). Since the journal isn't making any money it doesn't have to publish any issues if there are no papers accepted.
Where to host it? If we buy a domain name then it doesn't really matter where we host it and we could move it if necessary. A domain name is cheap so this isn't a problem.
Free Journal management systems are available. I played around with Open Journal Systems which might be adequate (needs to be investigated further).
How to get ranked? If the journal is successful it will get ranked sooner or later. Is this a problem initially?
Name of the journal? Suggestions?

It doesn't sound hard, but I'm sure I forgot lots of issues. Comments and ideas are highly appreciated.

2008 - the year of reviewing

2009-01-02T16:46:00.003+11:00

The other day I thought about what I've been up to in 2008. Looking back I felt that I've been very busy but haven't had enough time for research. At the same time last year I had approximately 12 months of exciting "2008-time" in front of me to do something new and intersting, so how did I waste it:

- 1 month vacation
(I miss the 43 vacation days I had while doing my postdoc in the Netherlands...if it wasn't for the weather and the food I might even consider going back)

- I spent almost 2 months travelling (research visits and conferences).

- 2 months reviewing papers!!!
Yes it's true! I spent almost two months of 2008 reviewing papers. I'm sure you wonder how it can add up to two whole months. Well, I reviewed 9-10 journal papers. Each of them required 2-3 days of full time work (on average). I reviewed roughly 60 conference papers - each of them took 2-3 hours to review (on average). In total 25 days of journal reviewing and roughly the same amount of conference reviewing. Scary stuff! This is almost 20% of my work time in 2008! What do I have to show for it? Well, I actually got a free book from Springer (reviewing for DMKD) and a "Certificate of Recognition" from CGTA as a "Top reviewer"...Yeah!

This left me with 7 months for research, teaching and administration. Obviously this has to change in 2009. Either I decrease my vacation (don't think so) or the amount of time I spend on travelling and reviewing. If you read this far then you probably realised that this post is just a long excuse on why I have to turn down review requests in 2009.

- My four 2008 highlights were SWAT (I really enjoyed being the pc chair even though it took a lot of my time), Mohammad Farshi's and Damian Merrick's PhD graduations and that I had a record number of journal publications (7).

Happy New Year!

Computer Science in Lund dissappears

2008-11-25T23:05:00.008+11:00

I should have written this post a long time ago but for some reason I was hoping the decision would change.

I did my undergrad and PhD at the computer science department at Lund University in Sweden. Sadly it seems as the department will be closed down. The decision (Swedish) was taken by the faculty board in November 2007. As far as I can tell the decision was taken purely on a financial basis (even though the department is tiny compared the departments of biology, chemistry and physics).

The research at the department focused on algorithmics and AI and the small algorithms group was headed by Andrzej Lingas. The group, that among others also includes Thore Husfeldt and my former supervisor Christos Levcopoulos, has always been very active and produced high quality research and PhDs. When I was a PhD student there was a rather big group of successful students, for example, Andreas Björklund, Anna Pagh, Jesper Jansson, Mikael Hammar and Jesper Larsson.

From next year there will be no Computer Science education in Lund (however, there will still be a computer engineering program at the faculty of engineering). As far as I know it is unique for a large university. It will be very sad not to be able to visit my old department when I go back to Sweden.

CATS 2009 accepted papers

2008-11-11T09:50:00.000+11:00

CATS 2009 list of accepted papers is out.

I heard rumours (Prabhu and Tasos) that CATS got roughly 50 submissions this year. This is a huge increase from recent years when we've had approximately 30 papers per year.

The conference will take place in Wellington the 20-23 of January.

Attending ACM GIS 2008

2008-11-09T15:24:00.003+11:00

The last stop on my around the world trip is Los Angeles and ACM GIS. The conference venue is in a big hotel complex in Irvine somewhere. If I look out the window of my room I see a lot of big buildings but not a single person...scary. I arrived on Thursday afternoon but I was so jet lagged that I fell asleep and missed the last session and the banquet. I woke up at 2:30am on Friday morning and could finish my slides well before my presentation at 9am.

I attended all the talks on Friday. Not much to report, some interesting talks but nothing that stood out. Should try to remember to write a post discussing conference venues, i.e., (remote) hotels vs. universities. Looking forward to get back to Sydney after all the travelling.

Dagstuhl - moving objects

2008-11-08T10:15:00.002+11:00

In Dagstuhl for a workshop on moving objects. As usual I'm enjoying myself. It's something special about spending one week (unfortunately only three days in this case since I have to fly to ACM GIS) on a remote castle with lots of smart people and working on new and interesting problems.

This workshop is very diverse with people from computational geometry, data bases, GIScience, geography, visualisation... Which is good in the sense that I learn something new from every presentation. The drawback is, of course, that it's sometimes hard to communicate across areas, but it's getting better and better.

On Wednesday we did the "compulsory" hike and as usual (except when hiking with Helmut Alt) we got lost (I'm not blaming anyone).

Project performance

2008-11-04T09:19:00.003+11:00

NICTA has come up with a new great project performance indicator...the number of visitors to its project webpage. Needless to say that our project is not among the top performers. So if you want to support the algorithms people at NICTA please visit our webpage!

ARC future fellowships

2008-10-03T22:05:00.002+10:00

The Australian Research Council has announced the ARC Future Fellowships. This is a new scheme of research funding for mid-career researchers.

the interesting bits in the announcement:

applicant must be 5 to 15 years from PhD
up to 140,000AUD salary
4 years
1000 fellowships available over 5 years (across all research fields)
deadline november 26

according to the announcement one of the aims of this scheme is "to attract australian researchers currently based overseas to return to australia".

It will be interesting to see how many of these fellowships will go to computer science (and if any will go to theoretical computer science).

the assessment criteria are as follows:

applicant 50% (that's the applicant's CV)
strategic alignment 15% (alignment with host institution's research strengths)
collaboration 15%
national priorities 10%
... and the least significant, least important aspect: the proposed research for which you will be funded for four years, 10%

so, 90% of the weight of the assessment criteria is not related to the proposed research.

The ARC will look at the technical part of the research proposal last, if at all.

SoCG call-for-papers

2008-09-29T11:02:00.002+10:00

SoCG 2009 will take place on the 8-10 of June in Aarhus, Denmark. I'm sure it will be a lot of fun to visit Aarhus and Lars, especially since Sweden is playing against Denmark in the football world cup qualification on the 6th of June!

Here's the CFP.

Btw, why is Århus the city spelt with an `Å' while Aarhus University is spelt with `Aa’?

Algoritmics in NZ

2008-09-10T18:27:00.003+10:00

The algorithmic activities in New Zealand continues. At the 7th Australia – New Zealand Mathematics Convention in Christchurch there will be a special algoritmics session. This special session is part of the thematic programme on Algorithmics funded by the New Zealand Institute for Mathematics and its Applications (NZIMA).

Also, Bernard Chazelle will give a series of public lectures in the period 13-22 March 2009.

Clustering trajectories

2008-09-07T18:57:00.002+10:00

Late last year I attended a (great) workshop in the Netherlands organised by Marc van Kreveld. From that workshop a few (!) papers came out. One of them was just accepted to ISAAC - "Detecting Commuting Patterns by Clustering Subtrajectories" by Kevin Buchin, Maike Buchin, Jun Luo, Maarten Löffler and me.

The problem of clustering trajectories is surprisingly hard. In the data mining/database community there are several papers on this problem that are fairly fast but not very accurate (useful?).

In the paper we focus on finding subtrajectories of a single trajectory that forms a cluster (can easily be extended to the general clustering problem). This is useful for detecting, e.g., commuting patterns or seasonal migration behaviour. Our approach builds on the Frechet distance and heavily makes use of the freespace diagram. This gives an accurate definition of a trajectory cluster (imho) but it is very costly to compute (both in time and space). The running time is roughly quadratic (for most settings) and a (non-optimised) implementation can handle 10K points in roughly 20 minutes.

The obvious open problem is: Is there an accurate definition of a trajectory cluster that would allow for a more efficient implementation?

ISAAC 2008 accepted papers

2008-08-25T11:00:00.001+10:00

the list of accepted papers for ISAAC 2008 is available here.

Pay to get published?

2008-08-01T20:14:00.003+10:00

Recently I was kindly offered to become an editor for a new open access journal called ALGORITHMS published by MDPI. At first sight it looked as a great idea, and the editorial board contains some very impressive researchers. However, when I started to read the instructions for call for papers more closely I realised that the authors of an accepted paper have to pay roughly 1000 CHF (roughly the same in Australian/US dollars).

So instead of letting the readers pay for the journal the authors have to pay for their articles to get published. In the theory community we don't have the tradition of paying for our publications. On one hand this approach is much cheaper for the community but can you guarantee quality in this system? It's not obvious that one system is better than the other but personally I rather pay to read a paper than to publish it. However, I'm very curious to hear what other researchers think about this.

SWAT - Day 2

2008-07-24T10:07:00.003+10:00

I wrote this entry about two weeks ago but haven't had a chance to post it. Better late than never...

Today's highlight was definitely the invited talk by Michael Mitzenmacher on deletion channels (his talk, and a survey, is available). Again a topic that I didn't know much about, but Michael's presentation gave me a good understanding of the basic problem and the questions that are important in this area. A deletion channel is a channel where n bits are sent, but each bit is independently deleted with fixed probability p. (Different from the erasure channel where each bit can be replaced by a `?', or the symmetric channel where each bit can be flipped). The main question is to decide the capacity of the channel. Michael showed that the lower bound (which is really an upper bound) is at least (1-p)/9. However, he also stated several interesting fundamental problems during his talk. For example, how do random subsequences of random sequences behave?

The conference dinner (I, & II) was held in a beautiful location just to the south of Gothenburg looking out on the archipelago. While the sun was setting we had good food and tried to come up with a new name for SWAT (I, II & III). The local organisers did a great job finding the place and arranging a historic tram trip to the venue.

SWAT - Day 1

2008-07-13T11:12:00.001+10:00

A bit late but here's a short summary of SWAT day 1:

I'm in Gothenburg attending SWAT 2008. I haven't been in Gothenburg since I was a kid but it's a beautiful city this time of the year. Due to the long and warm summer evening there are heaps of people everywhere. Apart from SWAT there's also the worlds largest youth handball tournament going on with 900 teams from all around the world.

The local organisers of SWAT seem to have everything under control. I don't have to worry about anything (except a nasty cold). The first day included some very nice talks. John Hershberger gave the first talk of the conference, "Simplified planar coresets for data streams" which gives a simple way of producing coresets for computing the extent of a point set in the plane. He (and Subhash Suri) combined several known techniques with a few nice ideas to obtain an optimal size coreset.
Another talk I enjoyed was on placing wireless devices in an internet cafe such that customers inside the cafe can be distinguished from people outside the cafe. The talk was given by Tobias Christ and they show that for a simple polygon with n vertices 3n/5 devices is sometimes necessary and that 4n/5 is always sufficient.

Vijay Vazirani gave a great invited talk on the relation between Nash bargaining and flexible markets. I don't know the area very well but Vijay gave a very good survey focussing on the fact that some of these problems can be stated as a convex program which can be shown to have a rational optimal solution which can be solved in polynomial time by using primal-dual techniques.

After the technical program there was a business meeting where various issues were discussed (more on that in an upcoming post), followed by a reception at the city hall (provided by the city of Gothenburg) and the PC dinner (for details of what was discussed see Michael's post).

postdoc positions in USyd

2008-07-11T03:26:00.002+10:00

University of Sydney is inviting applications for postdoc fellowships in any department/research area. The closing date for applications is september 12. if i'm reading the information on the web correctly, these postdoc fellowships provide a salary of about 70K, 25K research funding, some relocation expenses and have a max duration of 3 years.

The prisoners dilemma

2008-06-11T19:55:00.004+10:00

A few weeks ago Taso (new fancy homepage), Tony and I organised the Sydney Theory Day. Among the invited speakers were Peter Bro Miltersen who gave a talk on "Names in boxes". The abstract of the talk can be found here. The short version is:

"The names of one hundred prisoners are placed in one hundred wooden boxes, one name to each box, and the boxes are lined up on a table in a room. One by one, the prisoners are led into the room; they may look into up to fifty of the boxes to try to find their own name but must leave the room exactly as it was. They are permitted no further communication after leaving the room. The prisoners have a chance to plot a strategy in advance and they are going to need it, because unless they all find their own names they will all be executed. There is a strategy that has a probability of success exceeding thirty percent - find it"

If each prisoner examines a random set of 50 boxes, their probability of survival is close to zero. It turns out that there is a very simple schedule that gives the prisoners a 30% chance of surviving. It sounds almost impossible but there's a simple proof that anyone can understand in "7 Puzzles You Think You Must Not Have Heard Correctly" by Peter Winkler.

This semester I've been teaching computational geometry at USyd and I find it hard to get them to properly understand the beauty of expected running times. However, this year I started the lecture by discussing the "Prisoners dilemma" for 20 minutes before I talked about the expected running time of low dimensional LP. And I really believe it had a positive effect. The students seemed to appreciate the simplicity of the arguments a bit more than usual.

Now the challenge is to find a puzzle like this for each lecture. Any tips?

ESA accepted papers

2008-06-11T18:58:00.002+10:00

I'm about two weeks late, but better late than never.

The list of accepted papers at ESA is out. I was in the PC for the applied track where we got 53 submissions out of which 16 were accepted. As a whole the papers were of high quality and even though I was pretty tired of reviewing papers I enjoyed reading many of them (well at least a few).

In the theory track there were a some papers that look interesting, for example: "Fitting a step function to a point set" by Fournier and Vigneron, "An optimal dynamic spanner for doubling metric spaces" by Gottlieb and Roditty (finally an optimal algorithm!) and "Deterministic Sampling Algorithms" by van Zuylen.

Our group also got a paper accepted, "Detecting Regular Visit Patterns" by Bojan Djordjevic, Anh Pham, Thomas Wolle and me. I quite like this paper. As the title suggests the original motivation comes from detecting regular visit patterns. However, the problem boils down to a nice little problem on bitstrings.

Given a bitstring S and a constant 0 < c < 1 find the longest substring of S containing at least a fraction c of 1's. We give a linear time algorithm and then we apply it to our original problem.

ISAAC deadline approaching

2008-06-10T14:40:00.002+10:00

Call for Papers

The 19th International Symposium on Algorithms and Computation
(ISAAC 2008) December 15 - 17, 2008, Gold Coast, Australia
http://www-or.amp.i.kyoto-u.ac.jp/isaac08/

The 19th International Symposium on Algorithms and Computation (ISAAC 2008) will be held in Gold Coast, Australia, December 15-17, 2008. The symposium is intended to provide a forum for researchers working in algorithms and theory of computation. Papers presenting original research in the areas of algorithms and theory of computation are sought. Papers in relevant applied areas are also welcome.

Topics

The topics include, but are not limited to:
- Algorithms and data structures
- Approximation algorithms
- Combinatorial optimization
- Computational biology
- Computational complexity
- Computational geometry
- Cryptography
- Experimental algorithms
- Graph drawing
- Graph algorithms
- Internet algorithms
- Online algorithms
- Parallel and distributed algorithms
- Quantum computing
- Randomized algorithms

Important Dates

Submission deadline: June 25, 2008 (12pm, US Pacific Time)
Notification of acceptance: August 18, 2008
Camera-ready submission: September 15, 2008

Invited Speakers

Prof. Tetsuo Asano (JAIST, Japan)
Prof. Peter Eades (University of Sydney, Australia)
Prof. Robert Tarjan (Princeton University, HP, USA)

Paper Submission

The submission should contain a scholarly exposition of ideas, techniques, and results, including motivation and a clear comparison with related work. The length of the submission should not exceed twelve pages in LNCS style.
If the authors feel that more details are essential to substantiate the main claim of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee.
Only electronic submission (pdf) will be allowed.
Submitted papers must describe work not previously published.
They must not be submitted simultaneously to another conference with refereed proceedings or a journal. At least one of the authors of accepted papers is expected to present their work at the conference.

Publication

The symposium proceedings will be published by Springer-Verlag in Lecture Notes in Computer Science (LNCS) series. Selected papers will be invited to special issues of Algorithmica and International Journal on Computational Geometry and Applications.

Awards

The Best Paper and the Best Student Paper will be awarded.
The Best Student Paper Award will be given to the best paper written solely by one or more students. A paper is eligible if all authors are full-time students at the time of submission.
To indicate that a submission is eligible, please add the phrase "Eligible for best student paper" as the last sentence in the "Abstract" field in the web form on the submission server as well as in the paper. The program committee may decline to make the award, or may split it among several papers.