Burkay Genç

21 papers A 3C 1Journal 12Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Mobile games success and failure: mining the hidden factors.
Neural Comput. Appl.
Abdulrahman Kerim, Burkay Genç
2021 J jnl
A column generation based heuristic algorithm for piecewise linear regression.
Expert Syst. Appl.
Huseyin Tunc, Burkay Genç
2021 — conf
Estimating Instrumentation Data Acquired During Flight Test of a Helicopter using Predictor Models.
EUROCON
Baris Coskun, Burkay Genç
2019 J jnl
Extending a sentiment lexicon with synonym-antonym datasets: SWNetTR++.
Turkish J. Electr. Eng. Comput. Sci.
Fatih Saglam, Burkay Genç, Hayri Sever
2019 J jnl
Identifying criminal organizations from their social network structures.
Turkish J. Electr. Eng. Comput. Sci.
Muhammet Serkan Çinar, Burkay Genç, Hayri Sever
2017 — conf
Analyzing Structure of Terrorist Networks by Using Graph Metrics.
ICBK
Muhammet Serkan Çinar, Burkay Genç, Hayri Sever, Vijay V. Raghavan
2016 J jnl
Covering points with minimum/maximum area orthogonally convex polygons.
Comput. Geom.
Cem Evrendilek, Burkay Genç, Brahim Hnich
2016 C conf
Developing Turkish sentiment lexicon for sentiment analysis using online news media.
AICCSA
Fatih Saglam, Hayri Sever, Burkay Genç
2014 J jnl
Covering points with orthogonal polygons.
Discret. Appl. Math.
Cem Evrendilek, Burkay Genç, Brahim Hnich
2011 J jnl
Covering points with orthogonally convex polygons.
Comput. Geom.
Burkay Genç, Cem Evrendilek, Brahim Hnich
2011 J jnl
Reconstructing orthogonal polyhedra from putative vertex sets.
Comput. Geom.
Therese Biedl, Burkay Genç
2011 J jnl
Stoker's Theorem for Orthogonal Polyhedra.
Int. J. Comput. Geom. Appl.
Therese Biedl, Burkay Genç
2010 J jnl
Covering oriented points in the plane with orthogonal polygons is NP-complete.
Electron. Notes Discret. Math.
Cem Evrendilek, Burkay Genç, Brahim Hnich
2009 A conf
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0.
ESA
Therese Biedl, Burkay Genç
2008 — —
Reconstruction of Orthogonal Polyhedra.
Burkay Genç
2006 J jnl
A layout algorithm for signaling pathways.
Inf. Sci.
Burkay Genç, Ugur Dogrusöz
2006 J jnl
A multi-graph approach to complexity management in interactive graph visualization.
Comput. Graph.
Ugur Dogrusöz, Burkay Genç
2005 — conf
Complexity of Octagonal and Rectangular Cartograms.
CCCG
Therese Biedl, Burkay Genç
2004 — conf
When can a graph form an orthogonal polyhedron?
CCCG
Therese Biedl, Burkay Genç
2003 A conf
A Constrained, Force-Directed Layout Algorithm for Biological Pathways.
GD
Burkay Genç, Ugur Dogrusöz
2002 A conf
A Framework for Complexity Management in Graph Visualization.
GD
Ugur Dogrusöz, Burkay Genç