Beth Novick

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

The threshold strong dimension of a graph.
Discret. Math., 2021

2018
Reconfiguration graphs of shortest paths.
Discret. Math., 2018

2016
What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments.
Am. Math. Mon., 2016

An ABC-Problem for location and consensus functions on graphs.
Discret. Appl. Math., 2016

2015
Five axioms for location functions on median graphs.
Discret. Math. Algorithms Appl., 2015

2013
An axiomatic approach to location functions on finite metric spaces.
Electron. Notes Discret. Math., 2013

A tight axiomatization of the median procedure on median graphs.
Discret. Appl. Math., 2013

2012
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs.
Australas. J Comb., 2012

2011
An axiomatization of the median procedure on the n-cube.
Discret. Appl. Math., 2011

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

Norm statistics and the complexity of clustering problems.
Discret. Appl. Math., 2009

2008
Turán theorems and convexity invariants for directed graphs.
Discret. Math., 2008

2000
On a Contraction-Expansion Closure in Graphs.
Proceedings of the Participants Copies of Fifth International Seminar on Relational Methods in Computer Science, 2000

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

1998
From Hall's Matching Theorem to Optimal Routing on Hypercubes.
J. Comb. Theory B, 1998

1996
On Ideal Clutters, Metrics and Multiflows.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995
On Combinatorial Properties of Binary Spaces.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
Ideal 0, 1 Matrices.
J. Comb. Theory B, 1994

1986
The 2-quasi-greedy algorithm for cardinality constrained matroid bases.
Discret. Appl. Math., 1986


  Loading...