---

My main research interests are combinatorial problems on graphs and networks, social network analysis, and graph mining. If you are an undergraduate or graduate student at Hacettepe University, and you are interested in working with me, please send an email with your interests and your CV.

---

Publications

[Google Scholar] [DBLP]

Graph Mining and Network Analysis

• Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations
  CSoNet 2022 (with Ali Baran Taşdemir, Tuna Karacan, and Emir Kaan Kırmacı).
• Low-Rank Representations Towards Classification Problem of Complex Networks
  SIU 2022 (with Murat Çelik, and Ali Baran Taşdemir).
• Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures
  SIU 2021 (with Ali Baran Taşdemir).
  also accepted for the presentation at the GCLR workshop at AAAI 2022.
• Classification of Complex Networks Using Structural Analysis of Random Graph Models
  SIU 2020 (with Ali Baran Taşdemir, and Barkın Atasay).
  also accepted for the presentation at the GCLR workshop at AAAI 2021.
• A Fast Counting Method for 6-Motifs with Low Connectivity
  MACIS 2019, 324-332 (with Taha Sevim, and Muhammet Selçuk Güvel).

Graph Theory

• Star Coloring of Hypergraphs
  submitted, (with Polat Sarıyerli).
• Coloring Grids Avoiding Bicolored Paths
  Discrete Mathematics & Theoretical Computer Science 28 (3) (2026) (with Derman Keskinkılıç).
• Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length
  Graphs and Combinatorics 40(1) (2024), Article 11 (with Alaittin Kırtışoğlu).
• Minimum Rainbow H-Decompositions of Graphs
  European Journal of Combinatorics 71 (2018), 111-124 (with Yury Person).
• On 3-uniform hypergraphs without a cycle of a given length
  Discrete Applied Mathematics 216 (3) (2017), 582--588 (with Zoltán Füredi).
• On a covering problem in the hypercube
  Graphs and Combinatorics 31 (1) (2015), 235--242 (with Brendon Stanton).
• Anti-Ramsey number of matchings in hypergraphs
  Discrete Mathematics 313 (20) (2013), 2359--2364 (with Michael Young).
• On homometric sets in graphs
  Australas. J. Combin. 55 175--187 (with Maria Axenovich).
• On the ratio of maximum and minimum degree in maximal intersecting families
  Discrete Mathematics 313 (2013), 207--211 (with Zoltán L. Nagy, Balázs Patkós, and Mate Vizer).
• Minimum H-decompositions of graphs: edge-critical case
  Journal of Combinatorial Theory, Series B 102 (2012), 715--725 (with Yury Person).
• Unavoidable subhypergraphs: a-clusters
  Journal of Combinatorial Theory, Series A 118 (2011), 2246--2256 (with Zoltán Füredi).
• On even-cycle-free subgraphs of the hypercube
  Journal of Combinatorial Theory, Series A 118 (2011), 1816--1819 (with Zoltán Füredi).
• Degree-splittability of caterpillars and regular multigraphs
  Congressus Numerantium 202 (2010), 137--148 (with Jeong-Ok Choi, and Douglas West).
• A Brooks-type bound for squares of K₄-minor-free graphs
  Discrete Mathematics 309 (2009), 6572--6584 (with Alexandr Kostochka, and Douglas Woodall).
• On 14-cycle-free subgraphs of the hypercube
  Combinatorics, Probability and Computing 18 (2009), 725--729 (with Zoltán Füredi).

Back to top

---

Present Students

• Derman Keskinkılıç (PhD)

Alumni

• Alaittin Kırtışoğlu (MS), PhD student at Illinois Institute of Technology
• Ali Baran Taşdemir (MS), PhD student at Hacettepe University

Back to top

---

Teaching

Undergraduate Teaching

• BBM205 Discrete Mathematics (Fall 2026).
• BBM402 Theory of Computation (Fall 2026)
• AIN312 Formal Languages and Automata Theory (Spring 2027)
• BBM403 Combinatorics and Graph Theory (Spring 2027)

Some Past Courses

• CMP694 Graph Theory (2024 and 2026 versions)
• CMP741 Advanced Analysis of Algorithms
• BBM301 Programming Languages (Fall 2024).
• BBM462 Social and Economic Networks
• BBM 401 Automata Theory and Formal Languages
• BBM402 Theory of Computation
• BBM403 Combinatorics and Graph Theory (2020 version)

Back to top