1: An Optimized Sparse Approximate Matrix Multiply for Matrices with Decay
2: Known algorithms for EDGE CLIQUE COVER are probably optimal
3: On an optimization technique using Binary Decision Diagram
4: Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!
5: Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs
6: Worst-case Optimal Join Algorithms
7: Techniques for Solving Sudoku Puzzles
8: An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings
9: Sorting and preimages of pattern classes
10: Spanning trees and the complexity of flood-filling games
11: Biclique-colouring verification complexity and biclique-colouring power graphs
12: FDB: A Query Engine for Factorised Relational Databases
13: On Exact Algorithms for Permutation CSP
14: A Fast Algorithm Finding the Shortest Reset Words
15: BitPath – Label Order Constrained Reachability Queries over Large Graphs