Beth Novick

According to our database, Beth Novick authored at least 20 papers between 1986 and 2021.

Collaborative distances:

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

2021

Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom.

Fred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers

Math. Soc. Sci., 2021

The threshold strong dimension of a graph.

Nadia Benakli, Novi H. Bong, Shonda Dueck, Linda Eroh, Beth Novick, Ortrud R. Oellermann

Discret. Math., 2021

2018

Reconfiguration graphs of shortest paths.

John Asplund, Kossi D. Edoh, Ruth Haas, Yulia Hristova, Beth Novick, Brett Werner

Discret. Math., 2018

2016

What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments.

Neil J. Calkin, Beth Novick, Hayato Ushijima-Mwesigwa

Am. Math. Mon., 2016

An ABC-Problem for location and consensus functions on graphs.

Fred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers

Discret. Appl. Math., 2016

2015

Five axioms for location functions on median graphs.

Fred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers

Discret. Math. Algorithms Appl., 2015

2013

An axiomatic approach to location functions on finite metric spaces.

Fred R. McMorris, Henry Martyn Mulder, Beth Novick, Robert C. Powers

Electron. Notes Discret. Math., 2013

A tight axiomatization of the median procedure on median graphs.

Henry Martyn Mulder, Beth Novick

Discret. Appl. Math., 2013

2012

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs.

Renu C. Laskar, Henry Martyn Mulder, Beth Novick

Australas. J Comb., 2012

2011

An axiomatization of the median procedure on the n-cube.

Henry Martyn Mulder, Beth Novick

Discret. Appl. Math., 2011

2009

On irreducible no-hole <i>L</i>(2, 1)-coloring of trees.

Renu C. Laskar, Gretchen L. Matthews, Beth Novick, John Villalpando

Networks, 2009

Norm statistics and the complexity of clustering problems.

Beth Novick

Discret. Appl. Math., 2009

2008

Turán theorems and convexity invariants for directed graphs.

Robert E. Jamison, Beth Novick

Discret. Math., 2008

2000

On a Contraction-Expansion Closure in Graphs.

Robert E. Jamison, Beth Novick

Proceedings of the Participants Copies of Fifth International Seminar on Relational Methods in Computer Science, 2000

1999

Discrete Optimization.

Beth Novick, S. Louis Hakimi, Sunil Chopra, David Simchi-Levi, Salah E. Elmaghraby, Michael Mesterton-Gibbons, Joseph R. Barr

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

1998

From Hall's Matching Theorem to Optimal Routing on Hypercubes.

Shuhong Gao, Beth Novick, Ke Qiu

J. Comb. Theory B, 1998

1996

On Ideal Clutters, Metrics and Multiflows.

Beth Novick, András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

On Combinatorial Properties of Binary Spaces.

Beth Novick, András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Ideal 0, 1 Matrices.

Gérard Cornuéjols, Beth Novick

J. Comb. Theory B, 1994

1986

The 2-quasi-greedy algorithm for cardinality constrained matroid bases.

Fred W. Glover, Beth Novick

Discret. Appl. Math., 1986