Airat Bekmetjev

According to our database, Airat Bekmetjev authored at least 6 papers between 2003 and 2019.

Collaborative distances:

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

2019

Two-pebbling and odd-two-pebbling are not equivalent.

Charles A. Cusack, Airat Bekmetjev, Mark Powers

Discret. Math., 2019

Graph pebbling algorithms and Lemke graphs.

Charles A. Cusack, Aaron Green, Airat Bekmetjev, Mark Powers

Discret. Appl. Math., 2019

2018

Doppelgangers and Lemke graphs.

Charles A. Cusack, Mark Powers, Airat Bekmetjev

Discret. Math., 2018

2009

Pebbling Algorithms in Diameter Two Graphs.

Airat Bekmetjev, Charles A. Cusack

SIAM J. Discret. Math., 2009

2008

The pebbling threshold of the square of cliques.

Airat Bekmetjev, Glenn Hurlbert

Discret. Math., 2008

2003

Thresholds for families of multisets, with an application to graph pebbling.

Airat Bekmetjev, Graham R. Brightwell, Andrzej Czygrinow, Glenn Hurlbert

Discret. Math., 2003