The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nadimpalli V. R. Mahadev: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra
    The struction of a graph: Application to CN-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:2, pp:141-147 [Journal]
  2. Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
    On simplicial and co-simplicial vertices in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:117-132 [Journal]
  3. Nadimpalli V. R. Mahadev, Fred S. Roberts
    Amenable Colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:225-238 [Journal]
  4. Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled
    Restrictions and Preassignments in Preemptive open Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:169-188 [Journal]
  5. Dominique de Werra, Nadimpalli V. R. Mahadev
    Preassignment Requirements in Chromatic Scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:93-101 [Journal]
  6. Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev
    Feasible edge colorings of trees with cardinality constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:61-72 [Journal]
  7. Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra
    Stability in CAN-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:1, pp:23-30 [Journal]
  8. Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled
    Edge-Chromatic Scheduling with Simultaneity Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:4, pp:631-641 [Journal]
  9. M. Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev
    A note on superbrittle graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:259-267 [Journal]
  10. Chính T. Hoàng, Nadimpalli V. R. Mahadev
    A note on perfect orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:77-84 [Journal]
  11. Nadimpalli V. R. Mahadev, Tao-Ming Wang
    On uniquely intersectable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:207, n:1-3, pp:149-159 [Journal]
  12. Nadimpalli V. R. Mahadev, Ph. Solot, Dominique de Werra
    The cyclic compact open-shop scheduling problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:361-366 [Journal]
  13. Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
    Bipartite bithreshold graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:119, n:1-3, pp:79-96 [Journal]
  14. Nadimpalli V. R. Mahadev, Uri N. Peled
    Longest cycles in threshold graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:135, n:1-3, pp:169-176 [Journal]

  15. Polar cographs. [Citation Graph (, )][DBLP]


  16. Strict 2-threshold graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002