default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBeth Novick
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j16]Nadia Benakli
, Novi H. Bong, Shonda Dueck, Linda Eroh, Beth Novick, Ortrud R. Oellermann:
The threshold strong dimension of a graph. Discret. Math. 344(7): 112402 (2021)- [j15]Fred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers:
Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom. Math. Soc. Sci. 109: 164-174 (2021) - 2018
- [j14]John Asplund, Kossi D. Edoh, Ruth Haas, Yulia Hristova, Beth Novick, Brett Werner:
Reconfiguration graphs of shortest paths. Discret. Math. 341(10): 2938-2948 (2018) - 2016
- [j13]Fred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers:
An ABC-Problem for location and consensus functions on graphs. Discret. Appl. Math. 207: 15-28 (2016) - [j12]Neil J. Calkin, Beth Novick, Hayato Ushijima-Mwesigwa:
What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments. Am. Math. Mon. 123(4): 382-386 (2016) - 2015
- [j11]Fred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers:
Five axioms for location functions on median graphs. Discret. Math. Algorithms Appl. 7(2): 1550013:1-1550013:30 (2015) - 2013
- [j10]Henry Martyn Mulder, Beth Novick:
A tight axiomatization of the median procedure on median graphs. Discret. Appl. Math. 161(6): 838-846 (2013) - [j9]Fred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers:
An axiomatic approach to location functions on finite metric spaces. Electron. Notes Discret. Math. 43: 213-219 (2013) - 2012
- [j8]Renu C. Laskar, Henry Martyn Mulder, Beth Novick:
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs. Australas. J Comb. 52: 185-196 (2012) - 2011
- [j7]Henry Martyn Mulder, Beth Novick:
An axiomatization of the median procedure on the n-cube. Discret. Appl. Math. 159(9): 939-944 (2011) - 2009
- [j6]Beth Novick:
Norm statistics and the complexity of clustering problems. Discret. Appl. Math. 157(8): 1831-1839 (2009) - [j5]Renu C. Laskar, Gretchen L. Matthews, Beth Novick, John Villalpando:
On irreducible no-hole L(2, 1)-coloring of trees. Networks 53(2): 206-211 (2009) - 2008
- [j4]Robert E. Jamison, Beth Novick:
Turán theorems and convexity invariants for directed graphs. Discret. Math. 308(20): 4544-4550 (2008) - 1998
- [j3]Shuhong Gao, Beth Novick, Ke Qiu:
From Hall's Matching Theorem to Optimal Routing on Hypercubes. J. Comb. Theory B 74(2): 291-301 (1998) - 1994
- [j2]Gérard Cornuéjols, Beth Novick:
Ideal 0, 1 Matrices. J. Comb. Theory B 60(1): 145-157 (1994) - 1986
- [j1]Fred W. Glover, Beth Novick:
The 2-quasi-greedy algorithm for cardinality constrained matroid bases. Discret. Appl. Math. 13(2-3): 277-286 (1986)
Conference and Workshop Papers
- 2000
- [c3]Robert E. Jamison, Beth Novick:
On a Contraction-Expansion Closure in Graphs. RelMiCS 2000: 113-119 - 1996
- [c2]Beth Novick, András Sebö:
On Ideal Clutters, Metrics and Multiflows. IPCO 1996: 275-287 - 1995
- [c1]Beth Novick, András Sebö:
On Combinatorial Properties of Binary Spaces. IPCO 1995: 212-227
Reference Works
- 1999
- [r1]Beth Novick, S. Louis Hakimi, Sunil Chopra, David Simchi-Levi, Salah E. Elmaghraby, Michael Mesterton-Gibbons, Joseph R. Barr:
Discrete Optimization. Handbook of Discrete and Combinatorial Mathematics 1999
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 20:27 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:
