StringologyTimes

Data Structures and Algorithms: 2016/10/29-31

1: A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
2: ESCAPE: Efficiently Counting All 5-Vertex Subgraphs
3: Evangelism in Social Networks: Algorithms and Complexity
4: Computing a clique tree with algorithm MLS (Maximal Label Search)
5: Inferring disease causing genes and their pathways: A mathematical perspective
6: Linear-Time Safe-Alternating DFS and SCCs
7: Reconstructing protein and gene phylogenies by extending the framework of reconciliation
8: Subquadratic Submodular Function Minimization
9: The design of efficient algorithms for enumeration