We stand with Ukraine  

Csanád Imreh

Affiliations:
  • University of Szeged, Hungary


According to our database1, Csanád Imreh authored at least 38 papers between 1999 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Total Completion Time Scheduling Under Scenarios.
[BibTeX]
[DOI]
Thomas Bosman
,
Martijn van Ee
,
Ekin Ergen
,
Csanád Imreh
,
Alberto Marchetti-Spaccamela
,
Martin Skutella
,
Leen Stougie
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

2018
Variants of Classical One Dimensional Bin Packing.
[BibTeX]
[DOI]
János Csirik
,
Csanád Imreh
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Editorial.
[BibTeX]
[DOI]
Tibor Csendes
,
Csanád Imreh
,
József Temesi
Central Eur. J. Oper. Res., 2017

2016
Maximizing the Minimum Machine Load.
[BibTeX]
[DOI]
Csanád Imreh
Encyclopedia of Algorithms, 2016

New models of graph-bin packing.
[BibTeX]
[DOI]
Csilla Bujtás
,
György Dósa
,
Csanád Imreh
,
Judit Nagy-György
,
Zsolt Tuza
Theor. Comput. Sci., 2016

2015
Online File Caching with Rejection Penalties.
[BibTeX]
[DOI]
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
,
Judit Nagy-György
Algorithmica, 2015

2014
The online k-server problem with rejection.
[BibTeX]
[DOI]
Emese Bittner
,
Csanád Imreh
,
Judit Nagy-György
Discret. Optim., 2014

2013
The generalization of scheduling with machine cost.
[BibTeX]
[DOI]
György Dósa
,
Csanád Imreh
Theor. Comput. Sci., 2013

Bin covering with cardinality constraints.
[BibTeX]
[DOI]
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
Discret. Appl. Math., 2013

Online Clustering with Variable Sized Clusters.
[BibTeX]
[DOI]
János Csirik
,
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
Algorithmica, 2013

2011
Parameter learning algorithm for the online data acknowledgment problem.
[BibTeX]
[DOI]
Csanád Imreh
,
Tamás Németh
Optim. Methods Softw., 2011

The Graph-Bin Packing Problem.
[BibTeX]
[DOI]
Csilla Bujtás
,
György Dósa
,
Csanád Imreh
,
Judit Nagy-György
,
Zsolt Tuza
Int. J. Found. Comput. Sci., 2011

Online facility location with facility movements.
[BibTeX]
[DOI]
Gabriella Divéki
,
Csanád Imreh
Central Eur. J. Oper. Res., 2011

Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints.
[BibTeX]
[DOI]
Tamás Bartók
,
Csanád Imreh
Acta Cybern., 2011

On Variants of File Caching.
[BibTeX]
[DOI]
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
,
Judit Nagy-György
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Class constrained bin packing revisited.
[BibTeX]
[DOI]
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
Theor. Comput. Sci., 2010

Class Constrained Bin Covering.
[BibTeX]
[DOI]
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
Theory Comput. Syst., 2010

On the sum minimization version of the online bin covering problem.
[BibTeX]
[DOI]
János Csirik
,
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
Discret. Appl. Math., 2010

2009
Online scheduling with general machine cost functions.
[BibTeX]
[DOI]
Csanád Imreh
Discret. Appl. Math., 2009

Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection.
[BibTeX]
[DOI]
Tamás Németh
,
Csanád Imreh
Acta Cybern., 2009

2008
Online hypergraph coloring.
[BibTeX]
[DOI]
Judit Nagy-György
,
Csanád Imreh
Inf. Process. Lett., 2008

Heuristic algorithms for a complex parallel machine scheduling problem.
[BibTeX]
[DOI]
Zoltán Blázsik
,
Csanád Imreh
,
Zoltán Kovács
Central Eur. J. Oper. Res., 2008

On Monogenic Nondeterministic Automata.
[BibTeX]
[DOI]
Csanád Imreh
,
Masami Ito
Acta Cybern., 2008

2007
Learning lexicographic orders.
[BibTeX]
[DOI]
József Dombi
,
Csanád Imreh
,
Nándor Vincze
Eur. J. Oper. Res., 2007

Online scheduling with machine cost and rejection.
[BibTeX]
[DOI]
Judit Nagy-György
,
Csanád Imreh
Discret. Appl. Math., 2007

On Time Lookahead Algorithms for the Online Data Acknowledgement Problem.
[BibTeX]
[DOI]
Csanád Imreh
,
Tamás Németh
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
On-line scheduling with general machine cost functions.
[BibTeX]
[DOI]
Csanád Imreh
Electron. Notes Discret. Math., 2006

2003
More on weighted servers or FIFO is better than LRU.
[BibTeX]
[DOI]
Leah Epstein
,
Csanád Imreh
,
Rob van Stee
Theor. Comput. Sci., 2003

On Monotonic Directable Nondeterministic Automata.
[BibTeX]
[DOI]
Balázs Imreh
,
Csanád Imreh
,
Masami Ito
J. Autom. Lang. Comb., 2003

Scheduling Problems on Two Sets of Identical Machines.
[BibTeX]
[DOI]
Csanád Imreh
Computing, 2003

On directable nondeterministic trapped automata.
[BibTeX]
[DOI]
Balázs Imreh
,
Csanád Imreh
,
Masami Ito
Acta Cybern., 2003

2001
Online strip packing with modifiable boxes.
[BibTeX]
[DOI]
Csanád Imreh
Oper. Res. Lett., 2001

A New Well-Solvable Class of PNS Problems.
[BibTeX]
[DOI]
Csanád Imreh
Computing, 2001

An online scheduling algorithm for a two-layer multiprocessor architecture.
[BibTeX]
[DOI]
Csanád Imreh
Acta Cybern., 2001

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts.
[BibTeX]
[DOI]
Marek Chrobak
,
János Csirik
,
Csanád Imreh
,
John Noga
,
Jirí Sgall
,
Gerhard J. Woeginger
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Buying a Constant Competitive Ratio for Paging.
[BibTeX]
[DOI]
János Csirik
,
Csanád Imreh
,
John Noga
,
Steven S. Seiden
,
Gerhard J. Woeginger
Proceedings of the Algorithms, 2001

1999
On Merging Reduction of the Process Network Synthesis Problem.
[BibTeX]
[DOI]
Cs. Holló
,
Zoltán Blázsik
,
Csanád Imreh
,
Zoltán Kovács
Acta Cybern., 1999

Scheduling with Machine Cost.
[BibTeX]
[DOI]
Csanád Imreh
,
John Noga
Proceedings of the Randomization, 1999


  Loading...