[1]

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall/Pearson, 2005.

[2]

Daniel Brélaz. New methods to color the vertices of a graph. Communications of the ACM, 22(4):251–256, 1979.

[3]

C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In ACM/IEEE Design Automation Conference (DAC), pages 175–181, 1982.

[4]

Yibo Lin, Xiaoqing Xu, Bei Yu, Ross Baldick, and David Z. Pan. Triple/quadruple patterning layout decomposition via novel linear programming and iterative rounding. In SPIE Advanced Lithography, volume 9781, 2016.

[5]

Yibo Lin, Bei Yu, Yi Zou, Zhuo Li, Charles J. Alpert, and David Z. Pan. Stitch aware detailed placement for multiple e-beam lithography. In IEEE/ACM Asia and South Pacific Design Automation Conference (ASPDAC), pages 186–191, 2016.

[6]

Bei Yu, Kun Yuan, Duo Ding, and David Z. Pan. Layout decomposition for triple patterning lithography. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), 34(3):433–446, March 2015.