Burkay Genç

According to our database, Burkay Genç authored at least 20 papers between 2002 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

A column generation based heuristic algorithm for piecewise linear regression.

Huseyin Tunc, Burkay Genç

Expert Syst. Appl., 2021

Estimating Instrumentation Data Acquired During Flight Test of a Helicopter using Predictor Models.

Baris Coskun, Burkay Genç

Proceedings of the 19th IEEE International Conference on Smart Technologies, 2021

2019

Extending a sentiment lexicon with synonym-antonym datasets: SWNetTR++.

Fatih Saglam, Burkay Genç, Hayri Sever

Turkish J. Electr. Eng. Comput. Sci., 2019

Identifying criminal organizations from their social network structures.

Muhammet Serkan Çinar, Burkay Genç, Hayri Sever

Turkish J. Electr. Eng. Comput. Sci., 2019

2017

Analyzing Structure of Terrorist Networks by Using Graph Metrics.

Muhammet Serkan Çinar, Burkay Genç, Hayri Sever, Vijay V. Raghavan

Proceedings of the IEEE International Conference on Big Knowledge, 2017

2016

Covering points with minimum/maximum area orthogonally convex polygons.

Cem Evrendilek, Burkay Genç, Brahim Hnich

Comput. Geom., 2016

Developing Turkish sentiment lexicon for sentiment analysis using online news media.

Fatih Saglam, Hayri Sever, Burkay Genç

Proceedings of the 13th IEEE/ACS International Conference of Computer Systems and Applications, 2016

2014

Covering points with orthogonal polygons.

Cem Evrendilek, Burkay Genç, Brahim Hnich

Discret. Appl. Math., 2014

2011

Stoker's Theorem for Orthogonal Polyhedra.

Therese Biedl, Burkay Genç

Int. J. Comput. Geom. Appl., 2011

Covering points with orthogonally convex polygons.

Burkay Genç, Cem Evrendilek, Brahim Hnich

Comput. Geom., 2011

Reconstructing orthogonal polyhedra from putative vertex sets.

Therese Biedl, Burkay Genç

Comput. Geom., 2011

2010

Covering oriented points in the plane with orthogonal polygons is NP-complete.

Cem Evrendilek, Burkay Genç, Brahim Hnich

Electron. Notes Discret. Math., 2010

2009

Cauchy's Theorem for Orthogonal Polyhedra of Genus 0.

Therese C. Biedl, Burkay Genç

Proceedings of the Algorithms, 2009

2008

Reconstruction of Orthogonal Polyhedra.

Burkay Genç

PhD thesis, 2008

2006

A layout algorithm for signaling pathways.

Burkay Genç, Ugur Dogrusöz

Inf. Sci., 2006

A multi-graph approach to complexity management in interactive graph visualization.

Ugur Dogrusöz, Burkay Genç

Comput. Graph., 2006

2005

Complexity of Octagonal and Rectangular Cartograms.

Therese C. Biedl, Burkay Genç

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

When can a graph form an orthogonal polyhedron?

Therese C. Biedl, Burkay Genç

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

A Constrained, Force-Directed Layout Algorithm for Biological Pathways.

Burkay Genç, Ugur Dogrusöz

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

A Framework for Complexity Management in Graph Visualization.

Ugur Dogrusöz, Burkay Genç

Proceedings of the Graph Drawing, 10th International Symposium, 2002