László F. Papp

According to our database, László F. Papp authored at least 8 papers between 2015 and 2024.

Collaborative distances:

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

2024

Restricted optimal pebbling is NP-hard.

László F. Papp

Discret. Appl. Math., 2024

2020

Optimal Pebbling Number of the Square Grid.

Ervin Györi, Gyula Y. Katona, László F. Papp

Graphs Comb., 2020

2019

The optimal pebbling number of staircase graphs.

Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins

Discret. Math., 2019

Optimal pebbling and rubbling of graphs with given diameter.

Ervin Györi, Gyula Y. Katona, László F. Papp

Discret. Appl. Math., 2019

Optimal pebbling number of graphs with given minimum degree.

Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp

Discret. Appl. Math., 2019

2017

Constructions for the Optimal Pebbling of Grids.

Ervin Györi, Gyula Y. Katona, László F. Papp

Period. Polytech. Electr. Eng. Comput. Sci., 2017

2016

The optimal rubbling number of ladders, prisms and Möbius-ladders.

Gyula Y. Katona, László F. Papp

Discret. Appl. Math., 2016

2015

Optimal pebbling of grids.

Ervin Györi, Gyula Y. Katona, László F. Papp

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015