The struction of a graph: Application to CN-free graphs. - Peter L. Hammer; Nadimpalli V. R. Mahadev; Dominique de Werra (Comb., 1985)

Stability in CAN-free graphs. - Peter L. Hammer; Nadimpalli V. R. Mahadev; Dominique de Werra (J. Comb. Theory B, 1985)

A note on superbrittle graphs. - Myriam Preissmann; Dominique de Werra; Nadimpalli V. R. Mahadev (Discret. Math., 1986)

Four classes of perfectly orderable graphs. - Vasek Chvátal; Chính T. Hoàng; Nadimpalli V. R. Mahadev; Dominique de Werra (J. Graph Theory, 1987)

Strict 2-threshold graphs. - Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Appl. Math., 1988)

A note on perfect orders. - Chính T. Hoàng; Nadimpalli V. R. Mahadev (Discret. Math., 1989)

Some properties of 2-threshold graphs. - Peter Ladislaw Hammer; Nadimpalli V. R. Mahadev; Uri N. Peled (Networks, 1989)

On a conjecture of wang and williams. - Nadimpalli V. R. Mahadev; Uri N. Peled (J. Graph Theory, 1991)

Bipartite bithreshold graphs. - Peter L. Hammer; Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Math., 1993)

The cyclic compact open-shop scheduling problem. - Nadimpalli V. R. Mahadev; Ph. Solot; Dominique de Werra (Discret. Math., 1993)

Edge-Chromatic Scheduling with Simultaneity Constraints. - Dominique de Werra; Nadimpalli V. R. Mahadev; Uri N. Peled (SIAM J. Discret. Math., 1993)

Longest cycles in threshold graphs. - Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Math., 1994)

Equistable graphs. - Nadimpalli V. R. Mahadev; Uri N. Peled; Feng Sun (J. Graph Theory, 1994)

Restrictions and Preassignments in Preemptive open Shop Scheduling. - Dominique de Werra; Alan J. Hoffman; Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Appl. Math., 1996)

Amenable Colorings. - Nadimpalli V. R. Mahadev; Fred S. Roberts (Discret. Appl. Math., 1997)

Preassignment Requirements in Chromatic Scheduling. - Dominique de Werra; Nadimpalli V. R. Mahadev (Discret. Appl. Math., 1997)

On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal? - Nadimpalli V. R. Mahadev; Aleksandar Pekec; Fred S. Roberts (Oper. Res., 1998)

On uniquely intersectable graphs. - Nadimpalli V. R. Mahadev; Tao-Ming Wang (Discret. Math., 1999)

A note on vertex orders for stability number. - Nadimpalli V. R. Mahadev; Bruce A. Reed (J. Graph Theory, 1999)

Feasible edge colorings of trees with cardinality constraints. - Dominique de Werra; Alain Hertz; Daniel Kobler; Nadimpalli V. R. Mahadev (Discret. Math., 2000)

Consensus list colorings of graphs and physical mapping of DNA. - Nadimpalli V. R. Mahadev; Fred S. Roberts (Bioconsensus, 2001)

On simplicial and co-simplicial vertices in graphs. - Chính T. Hoàng; Stefan Hougardy; Frédéric Maffray; Nadimpalli V. R. Mahadev (Discret. Appl. Math., 2004)

Polar cographs. - Tínaz Ekim; Nadimpalli V. R. Mahadev; Dominique de Werra (Discret. Appl. Math., 2008)

A PC based robot for learning computer vision and advanced programming (abstract only). - Xuzhou Chen; Nadimpalli V. R. Mahadev (SIGCSE, 2012)

Enhancing the undergraduate teaching and research using robotic programming. - Xuzhou Chen; Nadimpalli V. R. Mahadev (J. Comput. Sci. Coll., 2012)

Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660]. - Tínaz Ekim; Nadimpalli V. R. Mahadev; Dominique de Werra (Discret. Appl. Math., 2014)

Sound localization by robot using inter-aural time differences. - Nadimpalli V. R. Mahadev; Kevin B. Austin (J. Comput. Sci. Coll., 2015)

Developing a Holistic Understanding of Systems and Algorithms through Research Papers. - Ali Erkan; John Barr 001; Tony Clear; Cruz Izu; Cristian Jose Lopez Del Alamo; Hanan Mohammed; Nadimpalli V. R. Mahadev (ITiCSE-WGR, 2017)

Building a Secure Hacking Lab in a Small University. - Nadimpalli V. R. Mahadev (ITiCSE, 2017)