The full ACSW program will be available shortly

  • Session 1: Wed 1 Feb 14:30 - 15:30
    • Decomposing a Multigraph into Split Components. Yung Tsin.
    • The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights. Cong Zhang and Hiroshi Nagamochi.
    • Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs.Tadao Takaoka.

  • Session 2: Wed 1 Feb 16:00 - 17:00
    • Franz J. Brandenburg. On the Curve Complexity of Upward Planar Drawings
    • Radwa El Shawi, Joachim Gudmundsson and Christos Levcopoulos. Quickest Path queries on transportation network
    • Pavel Valtr. On empty pentagons and hexagons in planar point sets

  • Session 3: Wed 1 Feb 17:00 - 18:00
    • Logic Programming: From Underspecification to Undefinedness. Lee Naish, Harald Sondergaard and Benjamin Horsfall.
    • Counting paths in planar width 2 branching programs. Meena Mahajan, Nitin Saurabh and Karteek Sreenivasaiah.
    • Computational Complexity of String Puzzles. Chuzo Iwamoto, Kento Sasaki and Kenichi Morita.

  • Session 4: Thu 2 Feb 10:30 - 11:30
    • Approximating The Reliable Resource Allocation Problem Using Inverse Dual Fitting. Kewen Liao and Hong Shen.
    • Matching Problems with Delta-Matroid Constraints. Naonori Kakimura and Mizuyo Takamatsu.
    • How to guard a graph against tree movements. Toshihiro Fujito and Takayoshi Sakamaki.

  • Session 5: Thu 2 Feb 11:30 - 12:30
    • On Defining and Computing Communities. Martin Olsen.
    • Weak-Heap Family of Priority Queues in Theory and Praxis. Stefan Edelkamp, Amr Elmasry and Jyrki Katajainen.
    • Solving infinite games on trees with back-edges. Aniruddh Gandhi, Bakhadyr Khoussainov and Jiamou Liu.

  • Session 6: Thu 2 Feb 14:30 - 15:30
    • Augmenting Outerplanar Graphs to Meet Diameter Requirements. Toshimasa Ishii.
    • Cliques in Odd-Minor-Free Graphs. Ken-Ichi Kawarabayashi and David R. Wood.
    • Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. Yuichi Asahiro, Jesper Jansson, Eiji Miyano and Hirotaka Ono.