Kutucu, Hakan

Profile URL
https://hdl.handle.net/11147/16156
Name Variants
Kutucu, H
Kutucu, H.
KUTUCU, Hakan
Hakan, Kutucu
Job Title
Email Address
Main Affiliation
04.02. Department of Mathematics
Status
Former Staff
Website
ORCID ID
0000-0001-7144-7246
Scopus Author ID
35100398600
Turkish CoHE Profile ID
Google Scholar ID
flcU4ZMAAAAJ
WoS Researcher ID
AAB-7857-2022

Sustainable Development Goals

SDG data is not available
Documents

47

Citations

235

h-index

8

Go to Scopus profile
Documents

36

Citations

118

Go to WoS profile
Scholarly Output

5

Articles

3

Views / Downloads

7826/2000

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

9

Scopus Citation Count

18

Patents

0

Projects

0

WoS Citations per Publication

1.80

Scopus Citations per Publication

3.60

Open Access Source

5

Supervised Theses

0

JournalCount
14th National Biomedical Engineering Meeting, BIYOMUT 20091
4th International Conference "Problems of Cybernetics and Informatics", PCI 20121
Biotechnology and Biotechnological Equipment1
Electronic Notes in Discrete Mathematics1
Mathematical and Computer Modelling1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2009 - 200912010 - 20124

Settings

search.filters.applied.f.isAuthorOfPublication: search.filters.isAuthorOfPublication.ed65b93e-dc95-40b7-b53e-9cf5ced48d04

Scholarly Output Search Results

Now showing 1 - 5 of 5
  • Article
    Citation - WoS: 2
    Citation - Scopus: 2
    A Biomathematical Model for Phoma Tracheiphila Citrus Resistance Screening
    (Taylor and Francis Ltd., 2012) Khanchouch, Khaled; Hajlaoui, Mohamed Rabeh; Kutucu, Hakan
    The causal agent of Mal Secco, Phoma tracheiphila, is responsible for many important losses in the Citrus crop worldwide. The resistance enhancement of Citrus susceptible to the pathogen infection depends on the availability of a valid test for disease assessment. However, the resistance analysis tests used give controversial results. In this paper, we propose a new mathematical model to conduct a rapid and efficient resistance screening test. This model has the advantage to give a strict evaluation of the resistance and not a relative estimation as in the usual tests. The results obtained by this model are in concordance with those observed in the orchards.
  • Article
    Citation - WoS: 7
    Citation - Scopus: 7
    Mathematical Models of the Bandpass Problem and Ordermatic Computer Game
    (Elsevier Ltd., 2011) Nuriyev, Urfat G.; Kutucu, Hakan; Kurt, Mehmet
    A new combinatorial optimization problem, the Bandpass problem, was defined in Bell and Babayev (2004) [4]. Recently, this problem was investigated in detail in Babayev et al. (2009) [5]. In this paper, we first present some new mathematical models of the Bandpass problem. Then related to this problem, we introduce a software called OrderMatic which is very useful for teaching permutations.
  • Conference Object
    Citation - Scopus: 1
    Hipokampüsün El ve Atlas Tabanlı Otomatik Bölütlenmesinin Hacimsel Olarak Karşılaştırılması
    (Institute of Electrical and Electronics Engineers Inc., 2009) Kutucu, Hakan; Eker, Çağdaş; Kitiş, Ömer; Gönül, Ali Saffet
    High-resolution Magnetic resonance imaging (MRI) is helpful in diagnosing diseases such as schizophrenia, alzheimer, dementia etc. Brain segmentation is an important preprocess in medical imaging applications. In this study we compare atlas based segmentation and manual segmentation of hippocampus for volumetric measures. A statistically difference was obtained between automatic and manual measurement. We conclude that contemporary techniques are not adequate to obtain sensitive data in some barin structures such as hippocampus core.
  • Article
    Citation - Scopus: 1
    Minimum cost ? k edges connected subgraph problems
    (Elsevier Ltd., 2010) Sharifov, Firdovsi; Kutucu, Hakan
    The minimum-cost network design problem is considered in the case where an optimum network remains connected, after deleting any ≤ k edges which form a matching in the optimum network. For the case k=1, we develop heuristic algorithms to compute a lower and an upper bounds for optimal value of objective function. These algorithms are used in the branch and bound methods to find a solution to the considered problem. We also present computational results. © 2010 Elsevier B.V.
  • Conference Object
    Citation - Scopus: 7
    New Mathematical Model for Finding Minimum Vertex Cut Set
    (Institute of Electrical and Electronics Engineers Inc., 2012) Beşeri Sevim, Tina; Kutucu, Hakan; Berberler, Murat Erşen
    In this paper, we consider the vertex separator problem. Given an undirected graph G, the vertex separator problem consists in identifying a minimum number of vertex set whose removal disconnects G. We present a new mathematical model for solving this problem and also present computational results on graphs with various density. © 2012 IEEE.