Author:
Mills K. Alex,Chandrasekaran R.,Mittal Neeraj
Publisher
Springer International Publishing
Reference12 articles.
1. Allamigeon, X.: On the complexity of strongly connected components in directed hypergraphs. Algorithmica 69(2), 335–369 (2014)
2. Appel, K., Haken, W.: Every planar map is four colorable. Part I: Discharging illinois J. Math. 21(3), 429–490 (1977)
3. Cole, R., Kowalik, L.: New linear-time algorithms for edge-coloring planar graphs. Algorithmica 50(3), 351–368 (2008)
4. Furnas, G.W., Zacks, J.: Multitrees: enriching and reusing hierarchical structure. In: Proceedings SIGCHI Conference on Human Factors in Computing Systems, CHI 1994, pp. 330–336. ACM (1994)
5. Goemans, M.: Lecture notes for “advanced combinatorial optimization”, Spring 2012. Taught at MIT, Scribed by Zhao, Y.