Nadimpalli V. R. Mahadev

31 papers A 1B 2Journal 26Unranked 2
YearRankTypeTitle / Venue / Authors
2017 B conf
Building a Secure Hacking Lab in a Small University.
ITiCSE
Nadimpalli V. R. Mahadev
2017 B conf
Developing a Holistic Understanding of Systems and Algorithms through Research Papers.
ITiCSE
Ali Erkan, John Barr, Tony Clear, Cruz Izu, Cristian Jose Lopez Del Alamo, Hanan Mohammed, Nadimpalli V. R. Mahadev
2017 — conf
Developing a Holistic Understanding of Systems and Algorithms through Research Papers.
ITiCSE-WGR
Ali Erkan, John Barr, Tony Clear, Cruz Izu, Cristian Jose Lopez Del Alamo, Hanan Mohammed, Nadimpalli V. R. Mahadev
2015 J jnl
Sound localization by robot using inter-aural time differences.
J. Comput. Sci. Coll.
Nadimpalli V. R. Mahadev, Kevin B. Austin
2014 J jnl
Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660].
Discret. Appl. Math.
Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra
2012 A conf
A PC based robot for learning computer vision and advanced programming (abstract only).
SIGCSE
Xuzhou Chen, Nadimpalli V. R. Mahadev
2012 J jnl
Enhancing the undergraduate teaching and research using robotic programming.
J. Comput. Sci. Coll.
Xuzhou Chen, Nadimpalli V. R. Mahadev
2008 J jnl
Polar cographs.
Discret. Appl. Math.
Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra
2007 J jnl
Polar cographs.
Electron. Notes Discret. Math.
Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra
2004 J jnl
On simplicial and co-simplicial vertices in graphs.
Discret. Appl. Math.
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
2001 — conf
Consensus list colorings of graphs and physical mapping of DNA.
Bioconsensus
Nadimpalli V. R. Mahadev, Fred S. Roberts
2000 J jnl
Feasible edge colorings of trees with cardinality constraints.
Discret. Math.
Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev
1999 J jnl
A note on vertex orders for stability number.
J. Graph Theory
Nadimpalli V. R. Mahadev, Bruce A. Reed
1999 J jnl
On uniquely intersectable graphs.
Discret. Math.
Nadimpalli V. R. Mahadev, Tao-Ming Wang
1998 J jnl
On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?
Oper. Res.
Nadimpalli V. R. Mahadev, Aleksandar Sasa Pekec, Fred S. Roberts
1997 J jnl
Amenable Colorings.
Discret. Appl. Math.
Nadimpalli V. R. Mahadev, Fred S. Roberts
1997 J jnl
Preassignment Requirements in Chromatic Scheduling.
Discret. Appl. Math.
Dominique de Werra, Nadimpalli V. R. Mahadev
1996 J jnl
Restrictions and Preassignments in Preemptive open Shop Scheduling.
Discret. Appl. Math.
Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled
1994 J jnl
Equistable graphs.
J. Graph Theory
Nadimpalli V. R. Mahadev, Uri N. Peled, Feng Sun
1994 J jnl
Longest cycles in threshold graphs.
Discret. Math.
Nadimpalli V. R. Mahadev, Uri N. Peled
1993 J jnl
Bipartite bithreshold graphs.
Discret. Math.
Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
1993 J jnl
Edge-Chromatic Scheduling with Simultaneity Constraints.
SIAM J. Discret. Math.
Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled
1993 J jnl
The cyclic compact open-shop scheduling problem.
Discret. Math.
Nadimpalli V. R. Mahadev, Ph. Solot, Dominique de Werra
1991 J jnl
On a conjecture of wang and williams.
J. Graph Theory
Nadimpalli V. R. Mahadev, Uri N. Peled
1989 J jnl
A note on perfect orders.
Discret. Math.
Chính T. Hoàng, Nadimpalli V. R. Mahadev
1989 J jnl
Some properties of 2-threshold graphs.
Networks
Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
1988 J jnl
Strict 2-threshold graphs.
Discret. Appl. Math.
Nadimpalli V. R. Mahadev, Uri N. Peled
1987 J jnl
Four classes of perfectly orderable graphs.
J. Graph Theory
Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra
1986 J jnl
A note on superbrittle graphs.
Discret. Math.
Myriam Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev
1985 J jnl
Stability in CAN-free graphs.
J. Comb. Theory B
Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra
1985 J jnl
The struction of a graph: Application to CN-free graphs.
Comb.
Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra