 | 2011 |
|---|
| 27 |       | Leah Epstein,
Csanád Imreh,
Asaf Levin,
Judit Nagy-György:
On Variants of File Caching.
ICALP (1) 2011: 195-206 |
| 26 | | Csilla Bujtás,
György Dósa,
Csanád Imreh,
Judit Nagy-György,
Zsolt Tuza:
The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci. 22(8): 1971-1993 (2011) |
| 25 | | Csanád Imreh,
Tamás Németh:
Parameter learning algorithm for the online data acknowledgment problem.
Optimization Methods and Software 26(3): 397-404 (2011) |
| 2010 |
|---|
| 24 | | János Csirik,
Leah Epstein,
Csanád Imreh,
Asaf Levin:
Online Clustering with Variable Sized Clusters.
MFCS 2010: 282-293 |
| 23 | | János Csirik,
Leah Epstein,
Csanád Imreh,
Asaf Levin:
On the sum minimization version of the online bin covering problem.
Discrete Applied Mathematics 158(13): 1381-1393 (2010) |
| 22 | | Leah Epstein,
Csanád Imreh,
Asaf Levin:
Class constrained bin packing revisited.
Theor. Comput. Sci. 411(34-36): 3073-3089 (2010) |
| 21 | | Leah Epstein,
Csanád Imreh,
Asaf Levin:
Class Constrained Bin Covering.
Theory Comput. Syst. 46(2): 246-260 (2010) |
| 2009 |
|---|
| 20 | | Tamás Németh,
Csanád Imreh:
Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection.
Acta Cybern. 19(1): 125-133 (2009) |
| 19 | | Csanád Imreh:
Online scheduling with general machine cost functions.
Discrete Applied Mathematics 157(9): 2070-2077 (2009) |
| 2008 |
|---|
| 18 | | Csanád Imreh,
Masami Ito:
On Monogenic Nondeterministic Automata.
Acta Cybern. 18(4): 777-782 (2008) |
| 17 | | Judit Nagy-György,
Csanád Imreh:
Online hypergraph coloring.
Inf. Process. Lett. 109(1): 23-26 (2008) |
| 2007 |
|---|
| 16 | | Csanád Imreh,
Tamás Németh:
On Time Lookahead Algorithms for the Online Data Acknowledgement Problem.
MFCS 2007: 288-297 |
| 15 | | Judit Nagy-György,
Csanád Imreh:
Online scheduling with machine cost and rejection.
Discrete Applied Mathematics 155(18): 2546-2554 (2007) |
| 14 | | József Dombi,
Csanád Imreh,
Nándor Vincze:
Learning lexicographic orders.
European Journal of Operational Research 183(2): 748-756 (2007) |
| 2006 |
|---|
| 13 | | Csanád Imreh:
On-line scheduling with general machine cost functions.
Electronic Notes in Discrete Mathematics 27: 49-50 (2006) |
| 2003 |
|---|
| 12 | | Balázs Imreh,
Csanád Imreh,
Masami Ito:
On directable nondeterministic trapped automata.
Acta Cybern. 16(1): 37-45 (2003) |
| 11 | | 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 | | 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 | | Leah Epstein,
Csanád Imreh,
Rob van Stee:
More on Weighted Servers or FIFO is Better than LRU.
MFCS 2002: 257-268 |
| 2001 |
|---|
| 7 | | 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 | | 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 | | Csanád Imreh:
An online scheduling algorithm for a two-layer multiprocessor architecture.
Acta Cybern. 15(2): (2001) |
| 4 | | Csanád Imreh:
A New Well-Solvable Class of PNS Problems.
Computing 66(3): 289-296 (2001) |
| 3 | | 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 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page