Research I am interested in Graph Theory, particularly, but not limited to, graph labeling. My Erdős number is 2. Some of my favorite problems are in magic/antimagic-type labelings and DNA graph labeling. For descriptions of my recent research along with a survey of some of my past results, check out my research statement.

Researchgate	Collaboration Distance	Elliot Scholarship in Science

Publications

• Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model
  In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024), Leibniz International Proceedings in Informatics (LIPIcs)
  Volume 294, pp. 3:1-3:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
  L. Bailey, H.S. Blake, G. Cochran, N. Fox, M. Levet, R. Mahmoud, I. Singgih, G. Stadnyk, and A. Wiedemann.
• Edge Magic Total Labeling of \((n, t)\)-Kites.
  Advances in Computer Science Research Vol 96 (2022), pp.26-31. [doi]
  I. Singgih.
• On the maximum diameter of \(k\)-colorable graphs.
  Electronic Journal of Combinatorics Vol 28, Issue 3 (2021), P3.52.
  É. Czabarka [1] [2], I. Singgih, L.A. Székely [1].
• Counterexamples to a conjecture of Erdös, Pach, Pollack and Tuza.
  Journal of Combinatorial Theory, Series B Vol 151 (2021), pp. 38-45.
  É. Czabarka [1] [2], I. Singgih, L.A. Székely [1].
• Antimagic orientations of graphs with large maximum degree.
  Discrete Mathematics Vol 343, Issue 12, article 112123 (Dec 2020).
  D. Yang [1], J. Carlson, A. Owens [1], K. E. Perry, Z-X. Song [1], F. Zhang [1], X. Zhang
• Some remarks on the midrange crossing constant.
  Studia Scientiarum Mathematicarum Hungarica Vol 57, Issue 2, pp. 187-192 (Jun 2020).
  É. Czabarka [1] [2], I. Singgih, L.A. Székely [1], Z. Wang [1][2].
• Edge Magic Total Labeling of Lexicographic Product \(C_{4(2r+1)}\circ \overline{K_2}\),
  Cycles with Chords, Unions of Paths, and Unions of Cycles and Paths.
  Indonesian Journal of Combinatorics, Vol 2, No.2 (2018), pp. 111-122.
  I. Singgih.
• Vertex Magic Total Labeling for 2-regular Graphs.
  Discrete Mathematics Vol 340, Issue 1 (2017), pp. 3117-3124.
  S. Cichacz [1], D. Froncek [1][2], I. Singgih.
• DNA Graph Characterization for Line Digraph of Dicycle with One Chord.
  AKCE International Journal of Graphs and Combinatorics , Vol 10, No.2 (2013), pp. 157-167.
  I. Singgih, K.A. Sugeng [1], D.R. Silaban.

Conference Paper

• Being a ‘Lenient’ Math Professor
  Proceedings of the 1^st International Conference on Education, Humanities, Health and Agriculture (ICEHHA 2021)
  DOI: 10.4108/eai.3-6-2021.2310772
  I. Singgih.

Grants

• Research Launch Award
  (Summer 2021) Office of Research, University of Cincinnati.

Preprints

• Complexity and Enumeration in Models of Genome Rearrangement (arXiv)
• DNA graph characterization for the line digraph of dicycle with \(\left\lfloor\frac{n}{3} \right \rfloor\) chords, \(\infty\)-digraph \(C_n\cdot C_p\),
  and 3-blade-propeller \(C_n\cdot C_p \cdot C_q\). (arXiv)

Ongoing Projects

• (With N. B. Herawati [1]) Edge Magic Total Labeling for \((n, t)\)-Kites [cont'd].
• (With J. Reiswig [1] and Z. Wang [1][2]) Skolem sequences.
• Subtractive Magic and Antimagic Total Labelings. (arXiv)

Posters, Flyers, etc.

• Flyer: SIAM Math Matters, Apply it! 2017 - The Math behind... Pleasant and Unpleasant Music.
• Poster: IWOCA 2014