( en | de | ru )

 

Disambiguation of "Bülbül, Kerem"

Author of the publication

copydeleteadd this publication to your clipboard
A Practical Routing and MAC Framework for Maximum Lifetime Sensor Telemetry.

, , , , and . IEICE Trans. Commun., 90-B (11): 3146-3157 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dilek Bülbül

Mehmet Bülbül

Ragip Serhat Bülbül

kerem

Kerem Varici

 

Other publications of authors with the same name

A linear programming-based method for job shop scheduling., and . J. Sched., 16 (2): 161-183 (2013)A Practical Routing and MAC Framework for Maximum Lifetime Sensor Telemetry., , , , and . IEICE Trans. Commun., 90-B (11): 3146-3157 (2007)Multi-stage stochastic programming models for provisioning cloud computing resources., , and . Eur. J. Oper. Res., 288 (3): 886-901 (2021)Delay Constrained Minimum Power Broadcasting in Wireless Networks., , and . WiOpt, page 1-9. IEEE, (2007)Joint Sensor Selection and Data Routing in Sensor Networks., , , and . NETWORKING, volume 3462 of Lecture Notes in Computer Science, page 828-839. Springer, (2005)Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting., , , and . Int. J. Interdiscip. Telecommun. Netw., 1 (2): 46-65 (2009)Trade-offs Computing Minimum Hub Cover toward Optimized Graph Query Processing., , , and . CoRR, (2013)Minimum Power Multicasting with delay Bound Constraints in Ad Hoc Wireless Networks., , , , and . New Trends in Computer Networks, volume 1 of Advances in Computer Science and Engineering : Reports and Monographs, Imperial College Press, (2005)An exact extended formulation for the unrelated parallel machine total weighted completion time problem., and . J. Sched., 20 (4): 373-389 (2017)Solving a robust airline crew pairing problem with column generation., , , , , , and . Comput. Oper. Res., 40 (3): 815-830 (2013)