Beth Novick - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2021

The threshold strong dimension of a graphNadia Benakli, Novi H. Bong, Shonda Dueck, Linda Eroh, Beth Novick, Ortrud R. Oellermann. DM, 344(7):112402, 2021. [doi]

Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiomFred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers. mss, 109:164-174, 2021. [doi]

2018

Reconfiguration graphs of shortest pathsJohn Asplund, Kossi D. Edoh, Ruth Haas, Yulia Hristova, Beth Novick, Brett Werner. DM, 341(10):2938-2948, 2018. [doi]

2016

What Moser Could Have Asked: Counting Hamilton Cycles in TournamentsNeil J. Calkin, Beth Novick, Hayato Ushijima-Mwesigwa. tamm, 123(4):382-386, 2016. [doi]

An ABC-Problem for location and consensus functions on graphsFred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers. DAM, 207:15-28, 2016. [doi]

2015

Five axioms for location functions on median graphsFred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers. dmaa, 7(2), 2015. [doi]

2013

An axiomatic approach to location functions on finite metric spacesFred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers. endm, 43:213-219, 2013. [doi]

A tight axiomatization of the median procedure on median graphsHenry Martyn Mulder, Beth Novick. DAM, 161(6):838-846, 2013. [doi]

2012

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphsRenu C. Laskar, Henry Martyn Mulder, Beth Novick. ajc, 52:185-196, 2012. [doi]

2011

An axiomatization of the median procedure on the n-cubeHenry Martyn Mulder, Beth Novick. DAM, 159(9):939-944, 2011. [doi]

2009

On irreducible no-hole ::::L::::(2, 1)-coloring of treesRenu C. Laskar, Gretchen L. Matthews, Beth Novick, John Villalpando. networks, 53(2):206-211, 2009. [doi]

Norm statistics and the complexity of clustering problemsBeth Novick. DAM, 157(8):1831-1839, 2009. [doi]

2008

Turán theorems and convexity invariants for directed graphsRobert E. Jamison, Beth Novick. DM, 308(20):4544-4550, 2008. [doi]

2000

On a Contraction-Expansion Closure in GraphsRobert E. Jamison, Beth Novick. RelMiCS 2000: 113-119

1998

From Hall s Matching Theorem to Optimal Routing on HypercubesShuhong Gao, Beth Novick, Ke Qiu. JCT, 74(2):291-301, 1998. [doi]

1996

On Ideal Clutters, Metrics and MultiflowsBeth Novick, András Sebö. ipco 1996: 275-287

1995

On Combinatorial Properties of Binary SpacesBeth Novick, András Sebö. ipco 1995: 212-227

1994

Ideal 0, 1 MatricesGérard Cornuéjols, Beth Novick. JCT, 60(1):145-157, 1994. [doi]

1986

The 2-quasi-greedy algorithm for cardinality constrained matroid basesFred Glover, Beth Novick. DAM, 13(2-3):277-286, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL