BCTCS’14 Programme
BCTCS’14 Programme
All sessions take place in the Stewart Mason Building (SMB). All lunch breaks, coffee breaks and registration will take place in the ground floor foyer of SMB.
| Wednesday 09/04/14 | Session A (SMB.017) | Session B (SMB.104) |
|---|---|---|
| 11:30 | Registration Open (SMB Foyer) | |
| 12:00 | Lunch | |
| 13:00 | BCTCS Welcome (Faron Moller) | |
| 13:15 | Invited Talk Leszek Gąsieniec – Distributed maintenance of mobile entities |
|
| 14:15 | Michele Zito – Relaxation and rounding for appliance allocation in the smart grid | |
| 14:45 | Coffee Break | |
| 15:15 | William Whistler – The counting complexity of planar graph homomorphism problems | Leroy Chew – The complexity of theorem proving in circumscription and minimal entailment |
| 15:45 | Carl Feghali – On the complexity of partitioning graphs into disjoint cliques and a triangle-free subgraph | Karoliina Lehtinen – Syntactic surgery on modal mu |
| 16:15 | Jannis Bulian – Graph isomorphism parameterized by elimination distance to bounded degree | Jean-Jose Raza findrakoto – Provably total search problems in fragments of bounded arithmetic below polynomial-time |
| 16:45 | Close | |
| 18:00 | Drinks Reception (Hazlerigg Lounge, Hazlerigg Building) | |
| Thursday 10/04/14 | Session A (SMB.017) | Session B (SMB.104) |
| 09:30 | The LMS-sponsored Keynote Speaker in Discrete Mathematics Jeffrey Shallit – Open problems in automata theory |
|
| 10:30 | Markus Pfeiffer – The rational hierarchy of semigroups | |
| 11:00 | Coffee Break | |
| 11:30 | Theofanis Apostolopoulos – Sparse signal recovery as a non-linear problem | Eleni Akrida – Ephemeral networks with random availability of links: diameter and connectivity |
| 12:00 | Chalita Toopsuwan – Maximal anti-exponent of gapped palindromes | Michalis Christofi – Worst-case behavior of distributed algorithms for the maximum concurrent flow problem |
| 12:30 | Paolo Serafino – Heterogeneous facility location without money | Yiannis Siantos – Inferring network properties and embedded structure using random walks |
| 13:00 | Lunch | |
| 14:00 | Invited Talk Timo Kötzing – Recent advances in inductive inference |
|
| 15:00 | Rob van Stee – An optimal online bin packing algorithm | |
| 15:30 | Coffee Break | |
| 16:00 | Michael Gale – Solving an existential crisis in Haskell | Iain McBride – Modelling practical placement of trainee teachers to schools |
| 16:30 | Steffen Loesch – A nominal domain theory for the concurrent metalanguage HOPLA | Augustine Kwanashie – Profile-based optimal matchings in the student/project allocation problem |
| 17:00 | Open General Meeting of BCTCS | |
| 18:30 | BCTCS Dinner (Hazlerigg Council Chamber, Hazlerigg Building) | |
| Friday 11/04/14 | Session A (SMB.017) | Session B (SMB.104) |
| 09:30 | Invited Talk Achim Jung – A modal Belnap logic |
|
| 10:30 | Alejandro Erickson – Computer science takes back data centre networks from engineering | |
| 11:00 | Coffee Break | |
| 11:30 | Christopher Bak – Towards an implementation of rooted graph programs | Thomas Gorry – The evacuation problem: group search on the line |
| 12:00 | Anthony Stewart – Parallel knock-out schemes for special graph classes | Hsiang-Hsuan Liu – Scheduling for electricity cost in smart grid |
| 12:30 | Ivaylo Hristakiev – Analysing graph programs for confluence | Nihan Tokac – Fixed parameter tractability of rooted subtree prune and regraft distance and hybridization number |
| 13:00 | Lunch | |
| 14:00 | Close of conference | |
