Y. Daniel Liang 梁勇
Emeritus Professor of Computer Science
Department of Computer Science
Georgia Southern University
Email: y(dot)daniel(dot)liang(at)gmail.com

Pearson Revel for Liang Programming Videos

    Pearson Liang Revel Videos

Recent Articles/Talks

  1. Y. D. Liang, Lixin Li, Weitian Tong. Using Animations to Teach String Matching Effectively, in The Journal of Computing Sciences in Colleges, Volume 35, Number 10, April 2020, pp 27-32.
  2. Y. D. Liang, Effective and Innovative Interactives for icseBooks, in the series "Advances in Intelligent Systems and Computing", Springer, 2019. ISBN: 978-3-030-32522-0.
  3. Y. D. Liang, Teaching and Learning Programming Using Code Animation, in The 14th International Conference on Frontiers in Education: Computer Science and Computer Engineering (FECS'18: July 30 - August 2, 2018, Las Vegas, USA).
  4. Y. D. Liang, Teaching and Learning Graph Algorithms Using Animation, in Journal of Computational Science Education, Volume 9, Issue 2, December 2018.
  5. Y. D. Liang, Visualizing Recursion Using Code and Stack Animation, manuscript, summer, 2020.
  6. Y. D. Liang, Teaching and Learning Linked List Implementation Using Code Animation, manuscript, summer, 2020.
  7. Y. D. Liang, A Webinar on Teaching Programming Effectively Using Revel for Liang Java and C++. April 2018.
  8. Y. D. Liang, A talk on JavaFX Tutorials, University of North Carolina at Ashville, November 2016.
  9. Y. D. Liang, A talk on Teaching and Learning Programming Using Interactives, Fudan University,  summer, 2015.

Journal Articles

   (see also DBLP)
  1. Y. D. Liang. Parallel algorithms for domination problems in trapezoid graphs. Discrete Applied Mathematics, 74 (1997) 241-249.
  2. Y. D. Liang, M-S Chang. Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs . Acta Informatics, 34 (1997) 337-346.
  3. Y. D. Liang and C. Rhee. Finding biconnected components in O(n) time for a class of graphs. Information Processing Letters, 60 (1996) 159-163.
  4. C. Rhee, Y. D. Liang, S. K. Dhall and S. Lakshmivarahan. An O(m + n) algorithm for finding a minimum weight dominating set in permutation graphs. SIAM Journal on Computing, 25 (2) (1996) 404-419.
  5. C. Rhee and Y. D. Liang. An NC algorithm for the clique cover problem in cocomparability graphs and its applications. Information Processing Letters , 57 (1996) 287-290.
  6. C. Rhee and Y. D. Liang. Finding a maximum matching in permutation graphs. Acta Informatica, 32 (1995) 779-792.
  7. Y. D. Liang and N. Blum. Circular convex bipartite graphs: maximum matching and hamiltonian circuits. Information Processing Letters, 56 (1995) 215-219.
  8. Y. D. Liang. Steiner set and connected domination in trapezoid graphs. Information Processing Letters, 56 (1995) 101-108.
  9. Y. D. Liang, S. K. Dhall and S. Lakshmivarahan. A new class of parallel algorithms for finding connected components on machines with bit-vector operations. Information Sciences, 76 (1994) 177-195.
  10. C. Rhee, Y. D. Liang, S. K. Dhall and S. Lakshmivarahan. Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs. Information Processing Letters, 49 (1994) 45-50.
  11. Y. D. Liang. On the feedback vertex set problem in permutation graphs. Information Processing Letters, 52 (1994) 123-129.
  12. Y. D. Liang. Dominations on trapezoid graphs. Information Processing Letters, 52 (1994) 309-315.
  13. Y. D. Liang and C. Rhee. Finding a maximum matching in a circular-arc graph. Information Processing Letters, 45 (1993) 185-190.
  14. Y. D. Liang, C. Rhee, S. K. Dhall and S. Lakshmivarahan. A new approach for the domination on permutation graphs. Information Processing Letters, Vol. 37, (1991) 219-224.