Inne Singgih

According to our database, Inne Singgih authored at least 6 papers between 2017 and 2025.

Collaborative distances:

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

2025

Pairwise rearrangement is fixed-parameter tractable in the Single Cut-and-Join model.

Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, Alexander Wiedemann

Theor. Comput. Sci., 2025

2024

Complexity and enumeration in models of genome rearrangement.

Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann

Theor. Comput. Sci., 2024

2021

Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza.

Éva Czabarka, Inne Singgih, László A. Székely

J. Comb. Theory B, 2021

On the Maximum Diameter of $k$-Colorable Graphs.

Éva Czabarka, Inne Singgih, László A. Székely

Electron. J. Comb., 2021

2020

Antimagic orientations of graphs with large maximum degree.

Donglei Yang, Joshua Carlson, Andrew Owens, K. E. Perry, Inne Singgih, Zi-Xia Song, Fangfang Zhang, Xiaohong Zhang

Discret. Math., 2020

2017

Vertex magic total labelings of 2-regular graphs.

Sylwia Cichacz, Dalibor Froncek, Inne Singgih

Discret. Math., 2017