Nadimpalli V. R. Mahadev

According to our database, Nadimpalli V. R. Mahadev authored at least 26 papers between 1985 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2017

Building a Secure Hacking Lab in a Small University.

Nadimpalli V. R. Mahadev

Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education, 2017

2014

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

2012

A PC based robot for learning computer vision and advanced programming (abstract only).

Xuzhou Chen, Nadimpalli V. R. Mahadev

Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

2007

Polar cographs.

Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra

Electron. Notes Discret. Math., 2007

2004

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

2001

Consensus list colorings of graphs and physical mapping of DNA.

Nadimpalli V. R. Mahadev, Fred S. Roberts

Proceedings of the Bioconsensus, 2001

2000

Feasible edge colorings of trees with cardinality constraints.

Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev

Discret. Math., 2000

1999

A note on vertex orders for stability number.

Nadimpalli V. R. Mahadev, Bruce A. Reed

J. Graph Theory, 1999

On uniquely intersectable graphs.

Nadimpalli V. R. Mahadev, Tao-Ming Wang

Discret. Math., 1999

1998

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

1997

Preassignment Requirements in Chromatic Scheduling.

Dominique de Werra, Nadimpalli V. R. Mahadev

Discret. Appl. Math., 1997

Amenable Colorings.

Nadimpalli V. R. Mahadev, Fred S. Roberts

Discret. Appl. Math., 1997

1996

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

1994

Equistable graphs.

Nadimpalli V. R. Mahadev, Uri N. Peled, Feng Sun

J. Graph Theory, 1994

Longest cycles in threshold graphs.

Nadimpalli V. R. Mahadev, Uri N. Peled

Discret. Math., 1994

1993

Edge-Chromatic Scheduling with Simultaneity Constraints.

Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled

SIAM J. Discret. Math., 1993

The cyclic compact open-shop scheduling problem.

Nadimpalli V. R. Mahadev, Ph. Solot, Dominique de Werra

Discret. Math., 1993

Bipartite bithreshold graphs.

Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled

Discret. Math., 1993

1991

On a conjecture of wang and williams.

Nadimpalli V. R. Mahadev, Uri N. Peled

J. Graph Theory, 1991

1989

Some properties of 2-threshold graphs.

Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled

Networks, 1989

A note on perfect orders.

Chính T. Hoàng, Nadimpalli V. R. Mahadev

Discret. Math., 1989

1988

Strict 2-threshold graphs.

Nadimpalli V. R. Mahadev, Uri N. Peled

Discret. Appl. Math., 1988

1987

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

1986

A note on superbrittle graphs.

Myriam Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev

Discret. Math., 1986

1985

Stability in CAN-free graphs.

Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra

J. Comb. Theory, Ser. B, 1985

The struction of a graph: Application to CN-free graphs.

Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra

Comb., 1985