Csanád Imreh

42 papers A* 1A 1B 4Journal 32Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Total Completion Time Scheduling Under Scenarios.
Theory Comput. Syst.
Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie
2024 J jnl
Total Completion Time Scheduling Under Scenarios.
CoRR
Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie
2023 B conf
Total Completion Time Scheduling Under Scenarios.
WAOA
Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie
2018 — ch.
Variants of Classical One Dimensional Bin Packing.
Handbook of Approximation Algorithms and Metaheuristics (1)
János Csirik, Csanád Imreh
2017 J jnl
Editorial.
Central Eur. J. Oper. Res.
Tibor Csendes, Csanád Imreh, József Temesi
2016 — ch.
Maximizing the Minimum Machine Load.
Encyclopedia of Algorithms
Csanád Imreh
2016 J jnl
New models of graph-bin packing.
Theor. Comput. Sci.
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
2015 J jnl
Online File Caching with Rejection Penalties.
Algorithmica
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
2014 J jnl
The online k-server problem with rejection.
Discret. Optim.
Emese Bittner, Csanád Imreh, Judit Nagy-György
2013 J jnl
Bin covering with cardinality constraints.
Discret. Appl. Math.
Leah Epstein, Csanád Imreh, Asaf Levin
2013 J jnl
Online Clustering with Variable Sized Clusters.
Algorithmica
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
2013 J jnl
The generalization of scheduling with machine cost.
Theor. Comput. Sci.
György Dósa, Csanád Imreh
2011 — conf
On Variants of File Caching.
ICALP (1)
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
2011 J jnl
Online facility location with facility movements.
Central Eur. J. Oper. Res.
Gabriella Divéki, Csanád Imreh
2011 J jnl
Parameter learning algorithm for the online data acknowledgment problem.
Optim. Methods Softw.
Csanád Imreh, Tamás Németh
2011 J jnl
Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints.
Acta Cybern.
Tamás Bartók, Csanád Imreh
2011 J jnl
The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci.
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
2010 J jnl
Class Constrained Bin Covering.
Theory Comput. Syst.
Leah Epstein, Csanád Imreh, Asaf Levin
2010 J jnl
Class constrained bin packing revisited.
Theor. Comput. Sci.
Leah Epstein, Csanád Imreh, Asaf Levin
2010 J jnl
On the sum minimization version of the online bin covering problem.
Discret. Appl. Math.
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
2010 B conf
Online Clustering with Variable Sized Clusters.
MFCS
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
2009 J jnl
Online scheduling with general machine cost functions.
Discret. Appl. Math.
Csanád Imreh
2009 J jnl
Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection.
Acta Cybern.
Tamás Németh, Csanád Imreh
2008 J jnl
Heuristic algorithms for a complex parallel machine scheduling problem.
Central Eur. J. Oper. Res.
Zoltán Blázsik, Csanád Imreh, Zoltán Kovács
2008 J jnl
On Monogenic Nondeterministic Automata.
Acta Cybern.
Csanád Imreh, Masami Ito
2008 J jnl
Online hypergraph coloring.
Inf. Process. Lett.
Judit Nagy-György, Csanád Imreh
2007 J jnl
Learning lexicographic orders.
Eur. J. Oper. Res.
József Dombi, Csanád Imreh, Nándor Vincze
2007 B conf
On Time Lookahead Algorithms for the Online Data Acknowledgement Problem.
MFCS
Csanád Imreh, Tamás Németh
2007 J jnl
Online scheduling with machine cost and rejection.
Discret. Appl. Math.
Judit Nagy-György, Csanád Imreh
2006 J jnl
On-line scheduling with general machine cost functions.
Electron. Notes Discret. Math.
Csanád Imreh
2003 J jnl
More on weighted servers or FIFO is better than LRU.
Theor. Comput. Sci.
Leah Epstein, Csanád Imreh, Rob van Stee
2003 J jnl
On Monotonic Directable Nondeterministic Automata.
J. Autom. Lang. Comb.
Balázs Imreh, Csanád Imreh, Masami Ito
2003 J jnl
On directable nondeterministic trapped automata.
Acta Cybern.
Balázs Imreh, Csanád Imreh, Masami Ito
2003 J jnl
Scheduling Problems on Two Sets of Identical Machines.
Computing
Csanád Imreh
2002 B conf
More on Weighted Servers or FIFO is Better than LRU.
MFCS
Leah Epstein, Csanád Imreh, Rob van Stee
2001 J jnl
A New Well-Solvable Class of PNS Problems.
Computing
Csanád Imreh
2001 J jnl
An online scheduling algorithm for a two-layer multiprocessor architecture.
Acta Cybern.
Csanád Imreh
2001 A conf
Buying a Constant Competitive Ratio for Paging.
ESA
János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger
2001 J jnl
Online strip packing with modifiable boxes.
Oper. Res. Lett.
Csanád Imreh
2001 A* conf
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts.
ICALP
Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jirí Sgall, Gerhard J. Woeginger
1999 J jnl
On Merging Reduction of the Process Network Synthesis Problem.
Acta Cybern.
Cs. Holló, Zoltán Blázsik, Csanád Imreh, Zoltán Kovács
1999 — conf
Scheduling with Machine Cost.
RANDOM-APPROX
Csanád Imreh, John Noga