default search action
Burkay Genç
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j11]Huseyin Tunc
, Burkay Genç:
A column generation based heuristic algorithm for piecewise linear regression. Expert Syst. Appl. 171: 114539 (2021) - [c8]Baris Coskun, Burkay Genç:
Estimating Instrumentation Data Acquired During Flight Test of a Helicopter using Predictor Models. EUROCON 2021: 164-169
2010 – 2019
- 2019
- [j10]Muhammet Serkan Çinar
Identifying criminal organizations from their social network structures. Turkish J. Electr. Eng. Comput. Sci. 27(1): 421-436 (2019) - [j9]Fatih Saglam
Extending a sentiment lexicon with synonym-antonym datasets: SWNetTR++. Turkish J. Electr. Eng. Comput. Sci. 27(3): 1806-1820 (2019) - 2017
- [c7]Muhammet Serkan Çinar, Burkay Genç
Analyzing Structure of Terrorist Networks by Using Graph Metrics. ICBK 2017: 9-16 - 2016
- [j8]Cem Evrendilek, Burkay Genç
Covering points with minimum/maximum area orthogonally convex polygons. Comput. Geom. 54: 32-44 (2016) - [c6]Fatih Saglam, Hayri Sever, Burkay Genç
Developing Turkish sentiment lexicon for sentiment analysis using online news media. AICCSA 2016: 1-5 - 2014
- [j7]Cem Evrendilek, Burkay Genç
Covering points with orthogonal polygons. Discret. Appl. Math. 164: 92-99 (2014) - 2011
- [j6]Burkay Genç
Covering points with orthogonally convex polygons. Comput. Geom. 44(5): 249-264 (2011) - [j5]Therese Biedl, Burkay Genç
Reconstructing orthogonal polyhedra from putative vertex sets. Comput. Geom. 44(8): 409-417 (2011) - [j4]Therese Biedl, Burkay Genç
Stoker's Theorem for Orthogonal Polyhedra. Int. J. Comput. Geom. Appl. 21(4): 383-391 (2011) - 2010
- [j3]Cem Evrendilek, Burkay Genç
Covering oriented points in the plane with orthogonal polygons is NP-complete. Electron. Notes Discret. Math. 36: 303-310 (2010)
2000 – 2009
- 2009
- [c5]Therese Biedl, Burkay Genç:
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. ESA 2009: 71-82 - 2008
- [b1]Burkay Genç:
Reconstruction of Orthogonal Polyhedra. University of Waterloo, Ontario, Canada, 2008 - 2006
- [j2]Ugur Dogrusöz
A multi-graph approach to complexity management in interactive graph visualization. Comput. Graph. 30(1): 86-97 (2006) - [j1]Burkay Genç
A layout algorithm for signaling pathways. Inf. Sci. 176(2): 135-149 (2006) - 2005
- [c4]Therese Biedl, Burkay Genç:
Complexity of Octagonal and Rectangular Cartograms. CCCG 2005: 117-120 - 2004
- [c3]Therese Biedl, Burkay Genç:
When can a graph form an orthogonal polyhedron? CCCG 2004: 53-56 - 2003
- [c2]Burkay Genç, Ugur Dogrusöz
A Constrained, Force-Directed Layout Algorithm for Biological Pathways. GD 2003: 314-319 - 2002
- [c1]Ugur Dogrusöz
A Framework for Complexity Management in Graph Visualization. GD 2002: 368-369
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: