Peter N. Malkin

According to our database¹, Peter N. Malkin authored at least 5 papers between 2008 and 2014.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2014

Sherali-Adams relaxations of graph isomorphism polytopes.

[BibT_eX]

[DOI]

Peter N. Malkin

Discret. Optim., 2014

2011

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

2010

Recognizing Graph Theoretic Properties with Polynomial Ideals.

[BibT_eX]

[DOI]

Jesús A. De Loera

Christopher J. Hillar

Peter N. Malkin

Mohamed Omar

Electron. J. Comb., 2010

2009

Computing generating sets of lattice ideals and Markov bases of lattices.

[BibT_eX]

[DOI]

Raymond Hemmecke

Peter N. Malkin

J. Symb. Comput., 2009

2008

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

Peter N. Malkin

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...