| 2009 |
|---|
| 14 | EE | Marc Demange,
Tinaz Ekim,
Dominique de Werra:
A tutorial on the use of graph coloring for some problems in robotics.
European Journal of Operational Research 192(1): 41-55 (2009) |
| 2008 |
|---|
| 13 | EE | Marc Demange,
Tinaz Ekim:
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs.
TAMC 2008: 364-374 |
| 12 | EE | Tinaz Ekim,
Nadimpalli V. R. Mahadev,
Dominique de Werra:
Polar cographs.
Discrete Applied Mathematics 156(10): 1652-1660 (2008) |
| 11 | EE | Tinaz Ekim,
Pavol Hell,
Juraj Stacho,
Dominique de Werra:
Polarity of chordal graphs.
Discrete Applied Mathematics 156(13): 2469-2479 (2008) |
| 10 | EE | A. Geinoz,
Tinaz Ekim,
Dominique de Werra:
Construction of balanced sports schedules using partitions into subleagues.
Oper. Res. Lett. 36(3): 279-282 (2008) |
| 2007 |
|---|
| 9 | EE | Tinaz Ekim,
Nadimpalli V. R. Mahadev,
Dominique de Werra:
Polar cographs.
Electronic Notes in Discrete Mathematics 28: 317-323 (2007) |
| 2006 |
|---|
| 8 | EE | Dominique de Werra,
Tinaz Ekim,
C. Raess:
Construction of sports schedules with multiple venues.
Discrete Applied Mathematics 154(1): 47-58 (2006) |
| 7 | EE | Tinaz Ekim,
Dominique de Werra:
Erratum.
J. Comb. Optim. 11(1): 125 (2006) |
| 6 | EE | Marc Demange,
Tinaz Ekim,
Dominique de Werra:
On the approximation of Min Split-coloring and Min Cocoloring.
J. Graph Algorithms Appl. 10(2): 297-315 (2006) |
| 2005 |
|---|
| 5 | EE | Marc Demange,
Tinaz Ekim,
Dominique de Werra:
Partitioning cographs into cliques and stable sets.
Discrete Optimization 2(2): 145-153 (2005) |
| 4 | EE | Marc Demange,
Tinaz Ekim,
Dominique de Werra:
(p, k)-coloring problems in line graphs.
Electronic Notes in Discrete Mathematics 19: 49-55 (2005) |
| 3 | EE | Tinaz Ekim,
Dominique de Werra:
On Split-Coloring Problems.
J. Comb. Optim. 10(3): 211-225 (2005) |
| 2 | EE | Marc Demange,
Tinaz Ekim,
Dominique de Werra:
(p, k)-coloring problems in line graphs.
Theor. Comput. Sci. 349(3): 462-474 (2005) |
| 2004 |
|---|
| 1 | EE | Tinaz Ekim,
Vangelis Th. Paschos:
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation.
Int. J. Comput. Math. 81(5): 569-582 (2004) |
