Amitava Bhattacharya. Alternating Reachability and Integer Sum of Closed Alternating Trails - The 3rd Annual Uri N. Peled Memorial Lecture. In Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern, editors, Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. Volume 7551 of Lecture Notes in Computer Science, pages 3, Springer, 2012. [doi]
@inproceedings{Bhattacharya12-0, title = {Alternating Reachability and Integer Sum of Closed Alternating Trails - The 3rd Annual Uri N. Peled Memorial Lecture}, author = {Amitava Bhattacharya}, year = {2012}, doi = {10.1007/978-3-642-34611-8_3}, url = {http://dx.doi.org/10.1007/978-3-642-34611-8_3}, researchr = {https://researchr.org/publication/Bhattacharya12-0}, cites = {0}, citedby = {0}, pages = {3}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, volume = {7551}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-34610-1}, }