Tınaz Ekim
Naslov
Navedeno
Navedeno
Leto
Attentional factorization machines: Learning the weight of feature interactions via attention networks
J Xiao, H Ye, X He, H Zhang, F Wu, TS Chua
arXiv preprint arXiv:1708.04617, 2017
2412017
Partitioning cographs into cliques and stable sets
M Demange, TN Ekim, D De Werra
Discrete Optimization 2 (2), 145-153, 2005
392005
Construction of sports schedules with multiple venues
D de Werra, T Ekim, C Raess
Discrete Applied Mathematics 154 (1), 47-58, 2006
372006
On some applications of the selective graph coloring problem
M Demange, T Ekim, B Ries, C Tanasescu
European Journal of Operational Research 240 (2), 307-314, 2015
332015
Polarity of chordal graphs
T Ekim, P Hell, J Stacho, D de Werra
Discrete Applied Mathematics 156 (13), 2469-2479, 2008
332008
A tutorial on the use of graph coloring for some problems in robotics
M Demange, T Ekim, D de Werra
European Journal of Operational Research 192 (1), 41-55, 2009
302009
Computing minimum geodetic sets of proper interval graphs
T Ekim, A Erey, P Heggernes, P van’t Hof, D Meister
Latin American Symposium on Theoretical Informatics, 279-290, 2012
292012
Polar cographs
T Ekim, NVR Mahadev, D de Werra
Discrete Applied Mathematics 156 (10), 1652-1660, 2008
272008
Minimum maximal matching is NP-hard in regular bipartite graphs
M Demange, T Ekim
Theory and Applications of Models of Computation, 364-374, 2008
262008
On split-coloring problems
T Ekim, D de Werra
Journal of Combinatorial Optimization 10 (3), 211-225, 2005
182005
Block decomposition approach to compute a minimum geodetic set∗∗∗
T Ekim, A Erey
RAIRO-Operations Research 48 (4), 497-507, 2014
152014
Efficient recognition of equimatchable graphs
M Demange, T Ekim
Information Processing Letters 114 (1-2), 66-71, 2014
152014
Recognizing line-polar bipartite graphs in time O (n)
T Ekim, J Huang
Discrete applied mathematics 158 (15), 1593-1598, 2010
122010
Polar permutation graphs
T Ekim, P Heggernes, D Meister
International Workshop on Combinatorial Algorithms, 218-229, 2009
122009
Partitioning graphs into complete and empty graphs
T Ekim, J Gimbel
Discrete Mathematics 309 (19), 5849-5856, 2009
112009
Polar permutation graphs are polynomial-time recognisable
T Ekim, P Heggernes, D Meister
European Journal of Combinatorics 34 (3), 576-592, 2013
92013
On the approximation of Min Split-coloring and Min Cocoloring
M Demange, T Ekim, D De Werra
92006
Integer programming formulations for the minimum weighted maximal matching problem
ZC Taşkın, T Ekim
Optimization Letters 6 (6), 1161-1171, 2012
82012
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I
A Boyacı, T Ekim, M Shalom, S Zaks
Discrete Applied Mathematics 215, 47-60, 2016
72016
On the minimum and maximum selective graph coloring problems in some graph classes
M Demange, T Ekim, B Ries
Discrete Applied Mathematics 204, 77-89, 2016
72016
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20