Csanád Imreh

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 4

Top Topics

Dynamic Scheduling

Top Venues

Discret. Optim.

Central Eur. J. Oper. Res.

Theor. Comput. Sci.

Publications

Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie
Total Completion Time Scheduling Under Scenarios. CoRR (2024)
Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie
Total Completion Time Scheduling Under Scenarios. WAOA (2023)
Tibor Csendes, Csanád Imreh, József Temesi
Editorial. Central Eur. J. Oper. Res. 25 (4) (2017)
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
New models of graph-bin packing. Theor. Comput. Sci. 640 (2016)
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
Online File Caching with Rejection Penalties. Algorithmica 71 (2) (2015)
E. Bittner, Csanád Imreh, Judit Nagy-György
The online k-server problem with rejection. Discret. Optim. 13 (2014)
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
Online Clustering with Variable Sized Clusters. Algorithmica 65 (2) (2013)
György Dósa, Csanád Imreh
The generalization of scheduling with machine cost. Theor. Comput. Sci. 510 (2013)
Leah Epstein, Csanád Imreh, Asaf Levin
Bin covering with cardinality constraints. Discret. Appl. Math. 161 (13-14) (2013)
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
On Variants of File Caching. ICALP (1) (2011)
Gabriella Divéki, Csanád Imreh
Online facility location with facility movements. Central Eur. J. Oper. Res. 19 (2) (2011)
Tamás Bartók, Csanád Imreh
Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints. Acta Cybern. 20 (1) (2011)
Csanád Imreh, Tamás Németh
Parameter learning algorithm for the online data acknowledgment problem. Optim. Methods Softw. 26 (3) (2011)
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) (2011)
Leah Epstein, Csanád Imreh, Asaf Levin
Class constrained bin packing revisited. Theor. Comput. Sci. 411 (34-36) (2010)
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
On the sum minimization version of the online bin covering problem. Discret. Appl. Math. 158 (13) (2010)
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
Online Clustering with Variable Sized Clusters. MFCS (2010)
Leah Epstein, Csanád Imreh, Asaf Levin
Class Constrained Bin Covering. Theory Comput. Syst. 46 (2) (2010)
Tamás Németh, Csanád Imreh
Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection. Acta Cybern. 19 (1) (2009)
Csanád Imreh
Online scheduling with general machine cost functions. Discret. Appl. Math. 157 (9) (2009)
Csanád Imreh, Masami Ito
On Monogenic Nondeterministic Automata. Acta Cybern. 18 (4) (2008)
Judit Nagy-György, Csanád Imreh
Online hypergraph coloring. Inf. Process. Lett. 109 (1) (2008)
Zoltán Blázsik, Csanád Imreh, Zoltán Kovács
Heuristic algorithms for a complex parallel machine scheduling problem. Central Eur. J. Oper. Res. 16 (4) (2008)
József Dombi, Csanád Imreh, Nándor Vincze
Learning lexicographic orders. Eur. J. Oper. Res. 183 (2) (2007)
Judit Nagy-György, Csanád Imreh
Online scheduling with machine cost and rejection. Discret. Appl. Math. 155 (18) (2007)
Csanád Imreh, Tamás Németh
On Time Lookahead Algorithms for the Online Data Acknowledgement Problem. MFCS (2007)
Csanád Imreh
On-line scheduling with general machine cost functions. Electron. Notes Discret. Math. 27 (2006)
Leah Epstein, Csanád Imreh, Rob van Stee
More on weighted servers or FIFO is better than LRU. Theor. Comput. Sci. 306 (1-3) (2003)
Balázs Imreh, Csanád Imreh, Masami Ito
On directable nondeterministic trapped automata. Acta Cybern. 16 (1) (2003)
Csanád Imreh
Scheduling Problems on Two Sets of Identical Machines. Computing 70 (4) (2003)
Balázs Imreh, Csanád Imreh, Masami Ito
On Monotonic Directable Nondeterministic Automata. J. Autom. Lang. Comb. 8 (3) (2003)
Leah Epstein, Csanád Imreh, Rob van Stee
More on Weighted Servers or FIFO is Better than LRU. MFCS (2002)
Csanád Imreh
Online strip packing with modifiable boxes. Oper. Res. Lett. 29 (2) (2001)
Csanád Imreh
An online scheduling algorithm for a two-layer multiprocessor architecture. Acta Cybern. 15 (2) (2001)
Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jirí Sgall, Gerhard J. Woeginger
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP (2001)
János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger
Buying a Constant Competitive Ratio for Paging. ESA (2001)
Csanád Imreh
A New Well-Solvable Class of PNS Problems. Computing 66 (3) (2001)
Csanád Imreh, John Noga
Scheduling with Machine Cost. RANDOM-APPROX (1999)
Cs. Holló, Zoltán Blázsik, Csanád Imreh, Zoltán Kovács
On Merging Reduction of the Process Network Synthesis Problem. Acta Cybern. 14 (2) (1999)