2008 |
17 | EE | Judith Nagy-György,
Csanád Imreh:
Online hypergraph coloring.
Inf. Process. Lett. 109(1): 23-26 (2008) |
2007 |
16 | EE | Csanád Imreh,
Tamás Németh:
On Time Lookahead Algorithms for the Online Data Acknowledgement Problem.
MFCS 2007: 288-297 |
15 | EE | Judith Nagy-György,
Csanád Imreh:
Online scheduling with machine cost and rejection.
Discrete Applied Mathematics 155(18): 2546-2554 (2007) |
14 | EE | József Dombi,
Csanád Imreh,
Nándor Vincze:
Learning lexicographic orders.
European Journal of Operational Research 183(2): 748-756 (2007) |
2006 |
13 | EE | Csanád Imreh:
On-line scheduling with general machine cost functions.
Electronic Notes in Discrete Mathematics 27: 49-50 (2006) |
2003 |
12 | EE | Balázs Imreh,
Csanád Imreh,
Masami Ito:
On directable nondeterministic trapped automata.
Acta Cybern. 16(1): 37-45 (2003) |
11 | EE | Csanád Imreh:
Scheduling Problems on Two Sets of Identical Machines.
Computing 70(4): 277-294 (2003) |
10 | | Balázs Imreh,
Csanád Imreh,
Masami Ito:
On Monotonic Directable Nondeterministic Automata.
Journal of Automata, Languages and Combinatorics 8(3): 539-547 (2003) |
9 | EE | Leah Epstein,
Csanád Imreh,
Rob van Stee:
More on weighted servers or FIFO is better than LRU.
Theor. Comput. Sci. 306(1-3): 305-317 (2003) |
2002 |
8 | EE | Leah Epstein,
Csanád Imreh,
Rob van Stee:
More on Weighted Servers or FIFO is Better than LRU.
MFCS 2002: 257-268 |
2001 |
7 | EE | János Csirik,
Csanád Imreh,
John Noga,
Steven S. Seiden,
Gerhard J. Woeginger:
Buying a Constant Competitive Ratio for Paging.
ESA 2001: 98-108 |
6 | EE | Marek Chrobak,
János Csirik,
Csanád Imreh,
John Noga,
Jiri Sgall,
Gerhard J. Woeginger:
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts.
ICALP 2001: 862-874 |
5 | EE | Csanád Imreh:
An online scheduling algorithm for a two-layer multiprocessor architecture.
Acta Cybern. 15(2): (2001) |
4 | EE | Csanád Imreh:
A New Well-Solvable Class of PNS Problems.
Computing 66(3): 289-296 (2001) |
3 | EE | Csanád Imreh:
Online strip packing with modifiable boxes.
Oper. Res. Lett. 29(2): 79-85 (2001) |
1999 |
2 | | Csanád Imreh,
John Noga:
Scheduling with Machine Cost.
RANDOM-APPROX 1999: 168-176 |
1 | EE | Cs. Holló,
Z. Blázsik,
Csanád Imreh,
Z. Kovacs:
On Merging Reduction of the Process Network Synthesis Problem.
Acta Cybern. 14(2): 251-262 (1999) |