Qraf Nəzəriyyəsi Və Onun Tətbiqləri Qrupu - Baş Elmi Işçi
Tədqiqat maraqlarıma Qraf Nəzəriyyəsi, Qraf Modelləşdirmə və Qraf Tətbiqləri daxildir.
Qısa məlumat
2000-ci ildə TU Grazdan (Avstriya) Gerhard J Woegingerin rəhbərliyi altında riyaziyyat üzrə bakalavr və magistratura diplom dərəcəsini və 2003-cü ildə Vyana Universitetində (Avstriya) Peter F. Stadler və Josef Leydoldun rəhbərliyi altında doktorantura dərəcəsini almışam.
Mən Leypsiqdəki (Almaniya) Maks Plank adına Riyaziyyat İnstitutunda iki il, Katolik de Louvain Universitetinin (Belçika) Riyaziyyat Mühəndisliyi Departamentində bir il doktoranturadan sonra elmi işçi kimi fəaliyyət göstərmişəm. İstanbulda İşık Universitetinin Riyaziyyat kafedrasında və İzmirdə İzmir Texnologiya İnstitutunun Riyaziyyat kafedrasında altı ildən çox dosent vəzifəsində çalışmışam. Son yeddi il Ankarada iki startap şirkətində baş elmi işçi kimi fəaliyyət göstərmişəm.
Mükafatlar
Türk Matematik Vakfı (Turkish Mathematical Foundation) - Masatoshi Gündüz İkeda Research Award, 2015
Distinguished Young Scholar Award, Turkish Academy of Sciences, 2009 (TUBA-GEBIP/2009)
Fondla Tədqiqat Layihələri
“Geometric representations and symmetries of graphs, maps and other discrete structures and applications in science” (GReGAS) supported by TUBITAK and the European Science Foundation (EUROCORES Programme EUROGIGA), 2011-2014, Principal Researcher. Lale Ozkahya (post-doc)
“Castelnuovo-Mumford Regularity of Graphs and Topology of Decycling Complexes” supported by TUBITAK, 2012-2014. This is a joint project with Yusuf Civan (Suleyman Demirel University, Isparta,Turkey).
“Bionetalign: Global Alignment of Biochemical Networks Regularity for Functional Orthology” supported by TUBITAK 2012-2014. This is a joint project with Cesim Erten (Kadir Has University Istanbul, Turkey).
Nəşrlər
Kitab
T. Biyikoglu, J. Leydold and P. F. Stadler, Laplacian Eigenvectors of Graphs, Lecture Notes in Mathematics 1915, Springer (2007).
Jurnal Nəşrləri
Alkan, T. Biyikoglu, M. Demange and C. Erten, Structure of conflict graphs in constraint alignment problems and algorithms,
Discrete Mathematics & Theoretical Computer Science, 21 no.4 Sep 11 (2019).
Biyikoglu and Y. Civan, Prime Graphs, Matching and the Castelnuovo-Mumford Regularity, J. Commutative Algebra, 11: 1-27 (2019).
Biyikoglu and Y. Civan, Castelnuovo-Mumford Regularity of Graphs, Combinatorica, 38: 1353-1383 (2018).
Biyikoglu and Y. Civan, Vertex Decomposable Graphs, Codismantlability, Cohen-Macaulayness and Castelnuovo-Mumford Regularity,
Electronic Journal of Combinatorics, 21: #P1.1 (2014).
Abaka, T. Biyikoglu, C. Erten, CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways,
Bioinformatics, 29: 145-153 (2013).
Biyikoglu and Y. Civan, Four-cycled graphs with topological applications, Annals of Combinatorics, 16: 37-56 (2012).
Biyikoglu and J. Leydold, Dendrimers are the unique chemical trees with maximum spectral radius,
MATCH Communications in Mathematical and in Computer Chemistry, 68: 851-854 (2012).
Biyikoglu and J. Leydold, Graphs of given order and size and minimum algebraic connectivity,
Linear Algebra and its Applications, 436: 2067-2077 (2012).
Biyikoglu, S. Simic, Z. Stanic, Some Notes on Spectra of Cographs, Ars Combinatoria, 100: 421-434 (2011).
Solak, C. Cokal, O.T. Yildiz, T. Biyikoglu, Cryptanalysis of Fridrich’s image encryption, International Journal of Bifurcation and Chaos, 20:
1405-1413 (2010).
Biyikoglu and J. Leydold, Semiregular trees with minimal Laplacian spectral radius,
Linear Algebra and its Applications, 432: 2335-2341 (2010).
Mosig, T. Biyikoglu, S.J. Prohaska, and P.F. Stadler, Discovering Cis-Regulatory Modules by optimizing Barbecues, Discrete Applied
Mathematics, 157: 2458-2468 (2009).
Biyikoglu, M. Hellmuth, and J Leydold, Largest Eigenvalues of the Discrete p-Laplacian of Trees with Degree Sequences, Electronic
Journal of Linear Algebra, 18: 202-210 (2009).
Biyikoglu and J. Leydold, Algebraic Connectivity and Degree Sequences of Trees, Linear Algebra and its Applications, 430: 811-817
(2009).
Biyikoglu and J. Leydold, Graphs with given degree sequence and maximal spectral radius, Electronic Journal of Combinatorics, 15: R119 (2008).
Biyikoglu and J. Leydold, Faber-Krahn Type Inequalities for Trees, Journal of Combinatorial Theory, Series B., 97: 159-174 (2007).
F. M. Atay, T. Biyikoglu, J. Jost, Network synchronization: Spectral versus statistical properties, Physica D, 224: 35-41 (2006).
M. Atay, T. Biyikoglu, J. Jost, Synchronization of Networks with Prescribed Degree Distributions, IEEE Transactions on Circuits and Systems I, 53: 92-98 (2006).
M. Atay, T. Biyikoglu, Synchronization of Complex Networks under Graph Operations, Physical Review E, 72: 016217 (2005).
Biyikoglu, J. Leydold, and P. F. Stadler, Nodal Domains and Bipartite Subgraphs, Electronic Journal of Linear Algebra, 13: 344-351 (2005).
Biyikoglu, Degree sequences of Halin graphs and forcibly cograph graphic sequences, Ars Combinatoria, 75: 205-210 (2005).
Biyikoglu, W. Hordijk, J. Leydold, T. Pisanski, P. F. Stadler, Graph Laplacians, Nodal Domain, and Hyperplane Arrangements,
Linear Algebra and its Applications, 390: 155-174 (2004).
Biyikoglu, A Discrete Nodal Domain Theorem for Trees, Linear Algebra and its Appications, 360: 197-205 (2003).
Biyikoglu, A counterexample to a conjecture of Erd˝os, Discrete Mathematics, 250: 231-232 (2002)
Konfransın materialları
Baksi, O. Kaya and T. Biyikoglu, Enabling Cooperation, Resource Allocation and Receiver Selection Across Cells: Complementary Fractional Frequency Reuse. IEEE PIMRC 2013, London, UK, Sept. 2013.
Baksi, O. Kaya, T. Biyikoglu, Optimal and Near-optimal Partner Selection Algorithms in Cooperative OFDMA, IEEE WCNC 2012, Paris, France, April 2012.
Preprints
Biyikoglu and Y. Civan, Bounding the collapsibility number of simplicial complexes and graphs, Preprint (2023). [pdf]
Biyikoglu and Y. Civan, Projective dimension of (hyper)graphs and the Castelnuovo-Mumford regularity of bipartite graphs, Preprint (2016). [pdf]
Biyikoglu and Y. Civan, A note on the recognition of codismantlable graphs and posets, Preprint (2016). [pdf]
T. Biyikoglu and Y. Civan, Bounding Castelnuovo-Mumford regularity of graphs via Lozin's transformation, Preprint (2013). [pdf]
T. Biyikoglu, and J Leydold, Semiregular Trees with Minimal Index, Preprint (2009). [pdf]
T. Biyikoglu, M. Hellmuth, J Leydold, Largest Laplacian Eigenvalue and Degree Sequences of Trees, Preprint (2007). [pdf]
T. Biyikoglu; Rank and number of nodal domains of cographs; Preprint (2002). [ps]
Hazırlıq Mərhələsində Olan Məqalələr
Biyikoglu, Y. Civan, M. Demir and H. G¨uler, Helly number, domination and homology, submitted (2024).
Allmer, T. Biyikoglu and C. Has, De Novo Sequencing of Tandem Mass Spectra using a Novel Graph Modeling Approach, in preparation
M. Atay and T. Biyikoglu, Graph entropy, degree assortativity, and hierarchical structures in networks, in preparation.
Sənaye Tədqiqatları
2015-2017-ci illərdə konsaltinq şirkətinin qurucularından biri olmuşam. Biz Türkiyə su elektrik stansiyası sektoru üçün xüsusi tədqiqata əsaslanan buxar axınını proqnozlaşdırma modelləri və məhsulları hazırlamışıq.
Seminar və Konfranslar
Monthly Istanbul Discrete Mathematics Meetings, Istanbul Center for Mathematical Sciences, Bo˘gazi¸ci University, 2009-2012 (with T. Ekim).
Workshop on Graph Theory and its Applications I, II, III, Istanbul, 2010, 2011 and 2012 (with T. Ekim).
Xidmət
Türkiyənin məşhur riyaziyyat jurnalının qonaq redaktoru journal ”Matematik D¨ unyası”, 2017–2020.