# Thomas Zaslavsky

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- J. Comb. Theory, Ser. B
- 2016

A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertexâ€¦Â (More)

Is this relevant?

2016

2016

- Sensors
- 2016

Improving farm productivity is essential for increasing farm profitability and meeting the rapidly growing demand for food thatâ€¦Â (More)

Is this relevant?

2015

2015

- Nucleic Acids Research
- 2015

Type material is the taxonomic device that ties formal names to the physical specimens that serve as exemplars for the speciesâ€¦Â (More)

Is this relevant?

Review

2013

Review

2013

- 2013

These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistentlyâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- 2011

In 2008, a group of uninsured low-income adults in Oregon was selected by lottery to be given the chance to apply for Medicaidâ€¦Â (More)

Is this relevant?

2007

2007

- 2007

The function that counts the number of ways to place nonattacking identical chess or fairy chess pieces in a rectangular strip ofâ€¦Â (More)

Is this relevant?

2005

2005

- 2005

This paper applies agents to the highly dynamic and variable context of healthcare emergency decision-support domain. Moreâ€¦Â (More)

Is this relevant?

1998

1998

- Discrete Mathematics
- 1998

Thomas Zaslavsky Binghamton University Binghamton, New York, U.S.A. 13902-6000 September 1991 Revised July 1996 Abstra t We haraâ€¦Â (More)

Is this relevant?

1998

1998

- 1998

We present a new combinatorial method to determine the characteristic polynomial of any subspace arrangement that is defined overâ€¦Â (More)

Is this relevant?

1993

1993

- Discrete Applied Mathematics
- 1993

SolC. P. and T. Zaslavsky, The covering radius of the cycle code of a graph, Discrete Applied Mathematics 45 (I 993) 63-70. Theâ€¦Â (More)

Is this relevant?