|
|
|
Programme
Keynote speaker
Professor Jens Palsberg
University of California, Los Angeles
Accepted papers
- (4,g)-cages for $gge 5$ are tightly supconnected by Jianmin Tang, Yuqing Lin, Camino Balbuena and Mirka Miller
- Computing a Minimum-Dilation Spanning Tree is NP-hard by Otfried Cheong, Herman Haverkort and Mira Lee
- A Linear Time Algorithm for Pricing Sequential Barrier European Options by Peng Gao and Ron van der Meyden
- Probabilistic Logic under Uncertainty by Audun Josang
- Some Structural and Geometric Properties of Two-Connected Steiner Networks by Kenneth Hvam,Line Reinhardt, Pawel Winter and Martin Zachariasen
- Analysis of Busy Beaver Machines via Induction Proofs by James Harland
- Constructing Strictly Positive Families by Peter Morris, Thorsten Altenkirch and Neil Ghani
- On the Power of Structural Violations in Priority Queues by Amr Elmasry, Claus Jensen and Jirki Katajainen
- Effective Prediction and its Computational Complexity by Richard Taylor
- On The Complexity of Manipulating Elections by Tom Coleman and Vanessa Teague
- Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes by Heidi Gebauer and Yoshio Okamoto
- Planning with Time Limits in BDI Agent Programming Languages by Lavindra de Silva, Anthony Dekker and James Harland
- Minimum Augmentation of Edge-Connectivity with Monotone Requirements by in Undirected Graphs Toshimasa Ishii
- Quantumly Corrupted Codewords and Quantum List Decoding by Tomoyuki Yamakami
- An efficient solution method for relaxed variants of the nesting problem by Benny Kjær Nielsen
- Constructing Optimal Highways by H.-K. Ahn, H. Alt, T. Asano, S. W. Bae, P. Brass, O. Cheong, C. Knauer, H.-S. Na, C.-S. Shin and A. Wolff
- An optimal broadcasting protocol for mobile video-on-demand by Regant Hung and Hing-Fung Ting
- Termination of Abstract Reduction Systems by Jeremy Dawson and Rajeev Gore