Elham Roshanbin

According to our database, Elham Roshanbin authored at least 8 papers between 2014 and 2021.

Collaborative distances:

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

2021

A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees.

Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi

Electron. J. Comb., 2021

2018

Burning number of graph products.

Dieter Mitsche, Pawel Pralat, Elham Roshanbin

Theor. Comput. Sci., 2018

Bounds on the burning number.

Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin

Discret. Appl. Math., 2018

2017

Burning Graphs: A Probabilistic Perspective.

Dieter Mitsche, Pawel Pralat, Elham Roshanbin

Graphs Comb., 2017

Burning a graph is hard.

Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin

Discret. Appl. Math., 2017

2016

How to Burn a Graph.

Anthony Bonato, Jeannette C. M. Janssen, Elham Roshanbin

Internet Math., 2016

2014

Burning a Graph as a Model of Social Contagion.

Anthony Bonato, Jeannette C. M. Janssen, Elham Roshanbin

Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

The Competitive Diffusion Game in Classes of Graphs.

Elham Roshanbin

Proceedings of the Algorithmic Aspects in Information and Management, 2014