Assoc. Prof. Emre KOLOTOĞLU

Publication Network

Articles 14

1. Line-Graceful Designs

Erdemir D., Kolotoğlu E.

ACTA MATHEMATICA UNIVERSITATIS COMENIANAE , vol.93, no.3, pp.129-136, 2024 (ESCI, Scopus)

2. Block-Graceful Designs

Erdemir D., Kolotoğlu E.

Journal of Mathematics , vol.2023, pp.1-8, 2023 (SCI-Expanded, Scopus)

3. A complete solution to the spectrum problem for graphs with six vertices and up to nine edges

Kolotoğlu E.

Contributions to Discrete Mathematics , vol.15, no.3, pp.1-24, 2020 (SCI-Expanded, Scopus)

4. A Different Construction for Some Classes of Quantum MDS Codes

Sari M., Kolotoğlu E.

MATHEMATICS IN COMPUTER SCIENCE , vol.14, pp.35-44, 2020 (ESCI, Scopus)

5. An application of constacyclic codes to entanglement-assisted quantum MDS codes

Sarı M., Kolotoğlu E.

COMPUTATIONAL & APPLIED MATHEMATICS , vol.38, 2019 (SCI-Expanded, Scopus)

6. QUANTUM CODES WITH IMPROVED MINIMUM DISTANCE

Kolotoğlu E., Sarı M.

BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY , vol.56, pp.609-619, 2019 (SCI-Expanded, Scopus)

7. Optimal Groomings with Grooming Ratios Six and Seven

Ge G., Kolotoğlu E., Wei H.

JOURNAL OF COMBINATORIAL DESIGNS , vol.23, pp.400-415, 2015 (SCI-Expanded, Scopus)

8. A Complete Solution to Spectrum Problem for Five-Vertex Graphs with Application to Traffic Grooming in Optical Networks

Ge G., Hu S., Kolotoglu E., Wei H.

JOURNAL OF COMBINATORIAL DESIGNS , vol.23, pp.233-273, 2015 (SCI-Expanded, Scopus)

9. On the Possible Automorphism Groups of a Steiner Quintuple System of Order 21

Kolotoglu E., Magliveras S. S.

JOURNAL OF COMBINATORIAL DESIGNS , vol.22, pp.495-505, 2014 (SCI-Expanded, Scopus)

10. Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs

Kolotoglu E.

JOURNAL OF COMBINATORIAL DESIGNS , vol.21, pp.524-530, 2013 (SCI-Expanded, Scopus)

11. On large sets of projective planes of orders 3 and 4

Kolotoglu E., Magliveras S. S.

DISCRETE MATHEMATICS , vol.313, pp.2247-2252, 2013 (SCI-Expanded, Scopus)

12. The Existence and Construction of (K-5\e)-Designs of Orders 27, 135, 162, and 216

Kolotoglu E.

JOURNAL OF COMBINATORIAL DESIGNS , vol.21, pp.280-302, 2013 (SCI-Expanded, Scopus)

13. Related decompositions and new constructions of the Higman-Sims and Hall-Janko graphs

Kolotoğlu E., Pace N., Magliveras S. S.

AUSTRALASIAN JOURNAL OF COMBİNATORICS , vol.54, pp.217-230, 2012 (Scopus)

14. On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs

Kolotoglu E., Yazici E. S.

GRAPHS AND COMBINATORICS , vol.26, pp.259-281, 2010 (SCI-Expanded, Scopus)

Papers Presented at Peer-Reviewed Scientific Conferences 9

1. A Survey on the Existence of G-factorizations of λKn

Çelik E., Kolotoğlu E.

8th ISPEC International Conferences on Engineering and Natural Sciences, Ankara, Turkey, 12 - 14 June 2020, pp.155, (Summary Text)

2. An application of constacyclic codes to entanglement-assisted quantum codes

Sarı M., Kolotoğlu E.

International Conference on Mathematics and Mathematics Education, Ordu, Turkey, 27 - 29 June 2018, pp.29-30, (Summary Text)

3. On large sets of projective planes of orders 3 and 4

Kolotoğlu E., Magliveras S.

Antalya Algebra Days XVI, Antalya, Turkey, 9 - 13 May 2014, pp.20-21, (Summary Text)

4. On the possible automorphism groups of a Steiner quintuple system of order 21

KOLOTOĞLU E., Magliveras S.

44th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton / Florida, United States Of America, 04 March 2013, pp.1, (Summary Text)

5. The existence and construction of K5\e-designs of orders 27, 135, 162 and 216

KOLOTOĞLU E.

43rd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton / Florida, United States Of America, 05 March 2012, pp.1, (Summary Text)

6. Decomposing the Higman-Sims Graph into Double Petersen Graphs

Pace N., KOLOTOĞLU E., Magliveras S.

2nd Istanbul Designs Theory, Graph Theory and Combinatorics Conference, İstanbul, Turkey, 27 June 2011, pp.52, (Summary Text)

7. On minimal defining sets of self-complementary designs

Kolotoğlu E., Yazıcı E. Ş.

39th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida, United States Of America, 03 March 2008, pp.1, (Summary Text)

8. A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs

Yazıcı E. Ş., Kolotoğlu E.

21st British Combinatorial Conference, Reading, United Kingdom, 08 July 2007, pp.68, (Summary Text)

9. A new algorithm for finding the complete list of minimal defining sets of t-designs

Kolotoğlu E., Yazıcı Yuret E. Ş.

Design Theory of Alex Rosa, Bratislava, Slovakia, 2 - 06 July 2007, pp.1, (Summary Text)

Metrics

Assoc. Prof. Emre KOLOTOĞLU

Publications & Works

1. Line-Graceful Designs

2. Block-Graceful Designs

3. A complete solution to the spectrum problem for graphs with six vertices and up to nine edges

4. A Different Construction for Some Classes of Quantum MDS Codes

5. An application of constacyclic codes to entanglement-assisted quantum MDS codes

6. QUANTUM CODES WITH IMPROVED MINIMUM DISTANCE

7. Optimal Groomings with Grooming Ratios Six and Seven

8. A Complete Solution to Spectrum Problem for Five-Vertex Graphs with Application to Traffic Grooming in Optical Networks

9. On the Possible Automorphism Groups of a Steiner Quintuple System of Order 21

10. Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs

11. On large sets of projective planes of orders 3 and 4

12. The Existence and Construction of (K-5\e)-Designs of Orders 27, 135, 162, and 216

13. Related decompositions and new constructions of the Higman-Sims and Hall-Janko graphs

14. On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs

1. A Survey on the Existence of G-factorizations of λKn

2. An application of constacyclic codes to entanglement-assisted quantum codes

3. On large sets of projective planes of orders 3 and 4

4. On the possible automorphism groups of a Steiner quintuple system of order 21

5. The existence and construction of K5\e-designs of orders 27, 135, 162 and 216

6. Decomposing the Higman-Sims Graph into Double Petersen Graphs

7. On minimal defining sets of self-complementary designs

8. A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs

9. A new algorithm for finding the complete list of minimal defining sets of t-designs

Publication

Publication (WoS)

Publication (Scopus)

Citation (WoS)

H-Index (WoS)

Citation (Scopus)

H-Index (Scopus)

Citation (Sum Other)

Project

Thesis Advisory