Assoc. Prof. Emre KOLOTOĞLU

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

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

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

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

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

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

Metrics

Assoc. Prof. Emre KOLOTOĞLU

Publications & Works

Block-Graceful Designs

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

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

QUANTUM CODES WITH IMPROVED MINIMUM DISTANCE

Optimal Groomings with Grooming Ratios Six and Seven

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

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

Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs

On large sets of projective planes of orders 3 and 4

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

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

Line-Graceful Designs

A Different Construction for Some Classes of Quantum MDS Codes

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

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

An application of constacyclic codes to entanglement-assisted quantum codes

On large sets of projective planes of orders 3 and 4

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

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

Decomposing the Higman-Sims Graph into Double Petersen Graphs

On minimal defining sets of self-complementary designs

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

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

Publication

Citation (WoS)

H-Index (WoS)

Citation (Scopus)

H-Index (Scopus)

Citiation (Sum Other)

Project

Thesis Advisory