default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNadimpalli V. R. Mahadev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c3]Nadimpalli V. R. Mahadev:
Building a Secure Hacking Lab in a Small University. ITiCSE 2017: 371- 2014
- [j24]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: 158 (2014) - 2012
- [c2]Xuzhou Chen, Nadimpalli V. R. Mahadev:
A PC based robot for learning computer vision and advanced programming (abstract only). SIGCSE 2012: 664
2000 – 2009
- 2008
- [j23]Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra:
Polar cographs. Discret. Appl. Math. 156(10): 1652-1660 (2008) - 2007
- [j22]Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra:
Polar cographs. Electron. Notes Discret. Math. 28: 317-323 (2007) - 2004
- [j21]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): 117-132 (2004) - 2001
- [c1]Nadimpalli V. R. Mahadev, Fred S. Roberts:
Consensus list colorings of graphs and physical mapping of DNA. Bioconsensus 2001: 83-95 - 2000
- [j20]Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev:
Feasible edge colorings of trees with cardinality constraints. Discret. Math. 222(1-3): 61-72 (2000)
1990 – 1999
- 1999
- [j19]Nadimpalli V. R. Mahadev, Tao-Ming Wang:
On uniquely intersectable graphs. Discret. Math. 207(1-3): 149-159 (1999) - [j18]Nadimpalli V. R. Mahadev, Bruce A. Reed:
A note on vertex orders for stability number. J. Graph Theory 30(2): 113-120 (1999) - 1998
- [j17]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): S120-S134 (1998) - 1997
- [j16]Dominique de Werra, Nadimpalli V. R. Mahadev:
Preassignment Requirements in Chromatic Scheduling. Discret. Appl. Math. 76(1-3): 93-101 (1997) - [j15]Nadimpalli V. R. Mahadev, Fred S. Roberts:
Amenable Colorings. Discret. Appl. Math. 76(1-3): 225-238 (1997) - 1996
- [j14]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): 169-188 (1996) - 1994
- [j13]Nadimpalli V. R. Mahadev, Uri N. Peled:
Longest cycles in threshold graphs. Discret. Math. 135(1-3): 169-176 (1994) - [j12]Nadimpalli V. R. Mahadev, Uri N. Peled, Feng Sun:
Equistable graphs. J. Graph Theory 18(3): 281-299 (1994) - 1993
- [j11]Nadimpalli V. R. Mahadev, Ph. Solot, Dominique de Werra:
The cyclic compact open-shop scheduling problem. Discret. Math. 111(1-3): 361-366 (1993) - [j10]Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled:
Bipartite bithreshold graphs. Discret. Math. 119(1-3): 79-96 (1993) - [j9]Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled:
Edge-Chromatic Scheduling with Simultaneity Constraints. SIAM J. Discret. Math. 6(4): 631-641 (1993) - 1991
- [j8]Nadimpalli V. R. Mahadev, Uri N. Peled:
On a conjecture of wang and williams. J. Graph Theory 15(2): 115-120 (1991)
1980 – 1989
- 1989
- [j7]Chính T. Hoàng, Nadimpalli V. R. Mahadev:
A note on perfect orders. Discret. Math. 74(1-2): 77-84 (1989) - [j6]Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled:
Some properties of 2-threshold graphs. Networks 19(1): 17-23 (1989) - 1988
- [j5]Nadimpalli V. R. Mahadev, Uri N. Peled:
Strict 2-threshold graphs. Discret. Appl. Math. 21(2): 113-131 (1988) - 1987
- [j4]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): 481-495 (1987) - 1986
- [j3]Myriam Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev:
A note on superbrittle graphs. Discret. Math. 61(2-3): 259-267 (1986) - 1985
- [j2]Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra:
The struction of a graph: Application to CN-free graphs. Comb. 5(2): 141-147 (1985) - [j1]Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra:
Stability in CAN-free graphs. J. Comb. Theory B 38(1): 23-30 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
