Nadimpalli V. R. Mahadev

Publication Activity (10 Years)

Years Active: 1985-2017
Publications (10 Years): 1

Top Topics

Computer Vision

Robot Navigation

Top Venues

Discret. Appl. Math.

Publications

Nadimpalli V. R. Mahadev
Building a Secure Hacking Lab in a Small University. ITiCSE (2017)
Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra
Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660]. Discret. Appl. Math. 171 (2014)
Xuzhou Chen, Nadimpalli V. R. Mahadev
A PC based robot for learning computer vision and advanced programming (abstract only). SIGCSE (2012)
Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra
Polar cographs. Discret. Appl. Math. 156 (10) (2008)
Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra
Polar cographs. Electron. Notes Discret. Math. 28 (2007)
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
On simplicial and co-simplicial vertices in graphs. Discret. Appl. Math. 138 (1-2) (2004)
Nadimpalli V. R. Mahadev, Fred S. Roberts
Consensus list colorings of graphs and physical mapping of DNA. Bioconsensus (2001)
Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev
Feasible edge colorings of trees with cardinality constraints. Discret. Math. 222 (1-3) (2000)
Nadimpalli V. R. Mahadev, Tao-Ming Wang
On uniquely intersectable graphs. Discret. Math. 207 (1-3) (1999)
Nadimpalli V. R. Mahadev, Bruce A. Reed
A note on vertex orders for stability number. J. Graph Theory 30 (2) (1999)
Nadimpalli V. R. Mahadev, Aleksandar Pekec, Fred S. Roberts
On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal? Oper. Res. 46 (3-Supplement-3) (1998)
Nadimpalli V. R. Mahadev, Fred S. Roberts
Amenable Colorings. Discret. Appl. Math. 76 (1-3) (1997)
Dominique de Werra, Nadimpalli V. R. Mahadev
Preassignment Requirements in Chromatic Scheduling. Discret. Appl. Math. 76 (1-3) (1997)
Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled
Restrictions and Preassignments in Preemptive open Shop Scheduling. Discret. Appl. Math. 68 (1-2) (1996)
Nadimpalli V. R. Mahadev, Uri N. Peled
Longest cycles in threshold graphs. Discret. Math. 135 (1-3) (1994)
Nadimpalli V. R. Mahadev, Uri N. Peled, Feng Sun
Equistable graphs. J. Graph Theory 18 (3) (1994)
Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled
Edge-Chromatic Scheduling with Simultaneity Constraints. SIAM J. Discret. Math. 6 (4) (1993)
Nadimpalli V. R. Mahadev, Ph. Solot, Dominique de Werra
The cyclic compact open-shop scheduling problem. Discret. Math. 111 (1-3) (1993)
Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
Bipartite bithreshold graphs. Discret. Math. 119 (1-3) (1993)
Nadimpalli V. R. Mahadev, Uri N. Peled
On a conjecture of wang and williams. J. Graph Theory 15 (2) (1991)
Chính T. Hoàng, Nadimpalli V. R. Mahadev
A note on perfect orders. Discret. Math. 74 (1-2) (1989)
Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
Some properties of 2-threshold graphs. Networks 19 (1) (1989)
Nadimpalli V. R. Mahadev, Uri N. Peled
Strict 2-threshold graphs. Discret. Appl. Math. 21 (2) (1988)
Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra
Four classes of perfectly orderable graphs. J. Graph Theory 11 (4) (1987)
Myriam Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev
A note on superbrittle graphs. Discret. Math. 61 (2-3) (1986)
Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra
The struction of a graph: Application to CN-free graphs. Comb. 5 (2) (1985)
Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra
Stability in CAN-free graphs. J. Comb. Theory, Ser. B 38 (1) (1985)