Türker Bíyíkoglu

According to our database1, Türker Bíyíkoglu authored at least 15 papers between 2002 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Structure of conflict graphs in constraint alignment problems and algorithms.
Discret. Math. Theor. Comput. Sci., 2019

2018
Castelnuovo-Mumford Regularity of Graphs.
Comb., 2018

2014
Constrained Alignments of a Pair of Graphs.
CoRR, 2014

Vertex-decomposable Graphs, Codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford Regularity.
Electron. J. Comb., 2014

2013
CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways.
Bioinform., 2013

Enabling cooperation, resource allocation and receiver selection across cells: Complementary fractional frequency reuse.
Proceedings of the 24th IEEE Annual International Symposium on Personal, 2013

2012
Optimal and near-optimal partner selection algorithms in cooperative OFDMA.
Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

2011
Some Notes On Spectra Of Cographs.
Ars Comb., 2011

2010
Cryptanalysis of Fridrich's Chaotic Image Encryption.
Int. J. Bifurc. Chaos, 2010

2009
Discovering cis-regulatory modules by optimizing barbecues.
Discret. Appl. Math., 2009

2008
Graphs with Given Degree Sequence and Maximal Spectral Radius.
Electron. J. Comb., 2008

2007
Faber-Krahn type inequalities for trees.
J. Comb. Theory, Ser. B, 2007

2006
Synchronization of networks with prescribed degree distributions.
IEEE Trans. Circuits Syst. I Regul. Pap., 2006

2005
Degree Sequences of Halin Graphs, and Forcibly Cograph-graphic Sequences.
Ars Comb., 2005

2002
A counterexample to a conjecture of Erdõs.
Discret. Math., 2002


  Loading...