Türker Bı́yı́koğlu

808 total citations
22 papers, 541 citations indexed

About

Türker Bı́yı́koğlu is a scholar working on Geometry and Topology, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Türker Bı́yı́koğlu has authored 22 papers receiving a total of 541 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Geometry and Topology, 10 papers in Computational Theory and Mathematics and 8 papers in Computer Networks and Communications. Recurrent topics in Türker Bı́yı́koğlu's work include Graph theory and applications (13 papers), Advanced Graph Theory Research (8 papers) and Synthesis and Properties of Aromatic Compounds (3 papers). Türker Bı́yı́koğlu is often cited by papers focused on Graph theory and applications (13 papers), Advanced Graph Theory Research (8 papers) and Synthesis and Properties of Aromatic Compounds (3 papers). Türker Bı́yı́koğlu collaborates with scholars based in Türkiye, Austria and Germany. Türker Bı́yı́koğlu's co-authors include Josef Leydold, Fatihcan M. Atay, Ercan Solak, Olcay Taner Yıldız, Peter F. Stadler, Jürgen Jost, Slobodan K. Simić, Zoran Stanić, Tomaž Pisanski and Wim Hordijk and has published in prestigious journals such as Bioinformatics, Physica D Nonlinear Phenomena and Linear Algebra and its Applications.

In The Last Decade

Türker Bı́yı́koğlu

21 papers receiving 514 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Türker Bı́yı́koğlu Türkiye 11 199 177 149 115 110 22 541
Simon R. Blackburn⋆ United Kingdom 18 137 0.7× 285 1.6× 90 0.6× 151 1.3× 43 0.4× 55 743
Jean Martinet France 13 119 0.6× 53 0.3× 357 2.4× 22 0.2× 184 1.7× 49 712
Paul Balister United States 19 32 0.2× 498 2.8× 145 1.0× 351 3.1× 192 1.7× 79 1.2k
Stefano Galatolo Italy 15 38 0.2× 105 0.6× 57 0.4× 57 0.5× 275 2.5× 59 537
Sueli I. R. Costa Brazil 10 56 0.3× 129 0.7× 61 0.4× 94 0.8× 16 0.1× 69 456
Lei Yu China 12 161 0.8× 70 0.4× 64 0.4× 104 0.9× 8 0.1× 71 507
Bruce Kitchens United States 16 30 0.2× 493 2.8× 188 1.3× 95 0.8× 592 5.4× 38 893
Bing Yao China 14 53 0.3× 392 2.2× 106 0.7× 100 0.9× 17 0.2× 137 626
Alexey Stakhov Russia 17 68 0.3× 148 0.8× 105 0.7× 20 0.2× 260 2.4× 34 834

Countries citing papers authored by Türker Bı́yı́koğlu

Since Specialization
Citations

This map shows the geographic impact of Türker Bı́yı́koğlu's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Türker Bı́yı́koğlu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Türker Bı́yı́koğlu more than expected).

Fields of papers citing papers by Türker Bı́yı́koğlu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Türker Bı́yı́koğlu. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Türker Bı́yı́koğlu. The network helps show where Türker Bı́yı́koğlu may publish in the future.

Co-authorship network of co-authors of Türker Bı́yı́koğlu

This figure shows the co-authorship network connecting the top 25 collaborators of Türker Bı́yı́koğlu. A scholar is included among the top collaborators of Türker Bı́yı́koğlu based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Türker Bı́yı́koğlu. Türker Bı́yı́koğlu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bı́yı́koğlu, Türker, et al.. (2014). Vertex-Decomposable Graphs, Codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford Regularity. The Electronic Journal of Combinatorics. 21(1). 9 indexed citations
2.
Bı́yı́koğlu, Türker, et al.. (2013). CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways. Bioinformatics. 29(13). i145–i153. 10 indexed citations
3.
Kaya, Onur, et al.. (2013). Enabling cooperation, resource allocation and receiver selection across cells: Complementary fractional frequency reuse. Akademik Açık Erişim (Işık Üniversitesi). 1190–1195. 1 indexed citations
4.
Bı́yı́koğlu, Türker & Josef Leydold. (2012). Dendrimers are the Unique Chemical Trees with Maximum Spectral Radius. DSpace - Isik (Işık University). 1 indexed citations
5.
Kaya, Onur, et al.. (2012). Optimal and near-optimal partner selection algorithms in cooperative OFDMA. Akademik Açık Erişim (Işık Üniversitesi). 475–479. 5 indexed citations
6.
Bı́yı́koğlu, Türker, Slobodan K. Simić, & Zoran Stanić. (2011). Some notes on spectra of cographs. Ars Combinatoria. 100. 421–434. 20 indexed citations
7.
Bı́yı́koğlu, Türker & Josef Leydold. (2011). Graphs of given order and size and minimum algebraic connectivity. Linear Algebra and its Applications. 436(7). 2067–2077. 8 indexed citations
8.
Bı́yı́koğlu, Türker, et al.. (2011). Four-Cycled Graphs with Topological Applications. Annals of Combinatorics. 16(1). 37–56. 1 indexed citations
9.
Solak, Ercan, et al.. (2010). CRYPTANALYSIS OF FRIDRICH'S CHAOTIC IMAGE ENCRYPTION. International Journal of Bifurcation and Chaos. 20(5). 1405–1413. 181 indexed citations
10.
Bı́yı́koğlu, Türker & Josef Leydold. (2009). Semiregular trees with minimal Laplacian spectral radius. Linear Algebra and its Applications. 432(9). 2335–2341. 5 indexed citations
11.
Bı́yı́koğlu, Türker & Josef Leydold. (2008). Algebraic connectivity and degree sequences of trees. Linear Algebra and its Applications. 430(2-3). 811–817. 12 indexed citations
12.
Bı́yı́koğlu, Türker & Josef Leydold. (2008). Graphs with Given Degree Sequence and Maximal Spectral Radius. The Electronic Journal of Combinatorics. 15(1). 45 indexed citations
13.
Bı́yı́koğlu, Türker, Josef Leydold, & Peter F. Stadler. (2007). Laplacian Eigenvectors of Graphs: Perron-Frobenius and Faber-Krahn Type Theorems. Akademik Açık Erişim (Işık Üniversitesi). 55 indexed citations
14.
Bı́yı́koğlu, Türker & Josef Leydold. (2006). Faber–Krahn type inequalities for trees. Journal of Combinatorial Theory Series B. 97(2). 159–174. 6 indexed citations
15.
Bı́yı́koğlu, Türker, Josef Leydold, & Peter F. Stadler. (2005). Nodal domain theorems and bipartite subgraphs. Electronic Journal of Linear Algebra. 13. 16 indexed citations
16.
Bı́yı́koğlu, Türker. (2005). Degree Sequences of Halin Graphs, and Forcibly Cograph-graphic Sequences.. Ars Combinatoria. 75. 2 indexed citations
17.
Atay, Fatihcan M. & Türker Bı́yı́koğlu. (2005). Graph operations and synchronization of complex networks. Physical Review E. 72(1). 16217–16217. 58 indexed citations
18.
Mosig, Axel, Türker Bı́yı́koğlu, Sonja J. Prohaska, & Peter F. Stadler. (2005). Detecting Phylogenetic Footprint Clusters by Optimizing Barbeques. 1 indexed citations
19.
Bı́yı́koğlu, Türker, Wim Hordijk, Josef Leydold, Tomaž Pisanski, & Peter F. Stadler. (2004). Graph Laplacians, nodal domains, and hyperplane arrangements. Linear Algebra and its Applications. 390. 155–174. 13 indexed citations
20.
Bı́yı́koğlu, Türker. (2002). A discrete nodal domain theorem for trees. Linear Algebra and its Applications. 360. 197–205. 20 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026