This Wednesday’s algolunch will be about some special cases of the Feedback Arc Set problem and its relation to Hypergraph Vertex Cover. Nikos Mutsanas will talk about two such problems: one scheduling problem and one ranking problem.
See you there…
This Wednesday’s algolunch will be about some special cases of the Feedback Arc Set problem and its relation to Hypergraph Vertex Cover. Nikos Mutsanas will talk about two such problems: one scheduling problem and one ranking problem.
See you there…
As of Wed, October 6th, Algolunches are back. Come and join us!
This year, Greg Aloupis is back (FNRS Postdoc), and we have a new PhD student applying to FRIA, Christophe Dumeunier.
From May to July, Prosenjit Bose, from the Computational Geometry lab at Carleton (Ottawa, Canada) will be working with us at ULB. Meet him at algolunch
Vida Dujmovic, also from Carleton, will be there as well, but only for a month.
Ferran Hurtado, from UPC Barcelona, will be visiting us for the whole month of April!
Tomorrow, wednesday 24th, Matias will tell us about Amidakuji, also known as permutation ladders, or ghost leg. It’s a popular way, in Japan, to decide who is going to fetch what for lunch. And also an interesting mathematical object. See you there!
Next week, Perouz will recap our best bounds on the “Matching point with things” problem: given a set of points and of geometric objects, is it possible to draw non-crossing segments connecting each point to its corresponding object?
We studied this problem, but there is still a lot to improve, in particular the complexity of some of our algorithms is far from tight.
There will be no AlgoLunch until 2010. So, Merry Christmas and Happy New Year to all AlgoLunchers!
This wednesday, Matias will tell us about some recent results and new challenges on a combinatorial optimization problem involving intervals. Be there!
Also, for those who are interested in quantum algorithms, there is an interesting talk at the Académie at 4pm.
On October 28, Marcin will talk at algo lunch. The topic will be “Some irrelevant (vertex) and (graph) minor results”. See you there…
This week, there will be no algolunch as most of us are going to the Dutch CG Day.