Csanád Imreh

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Variants of Classical One Dimensional Bin Packing.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Editorial.
CEJOR, 2017

2016
Maximizing the Minimum Machine Load.
Encyclopedia of Algorithms, 2016

New models of graph-bin packing.
Theor. Comput. Sci., 2016

2015
Online File Caching with Rejection Penalties.
Algorithmica, 2015

2014
The online k-server problem with rejection.
Discret. Optim., 2014

2013
The generalization of scheduling with machine cost.
Theor. Comput. Sci., 2013

Bin covering with cardinality constraints.
Discret. Appl. Math., 2013

Online Clustering with Variable Sized Clusters.
Algorithmica, 2013

2011
Parameter learning algorithm for the online data acknowledgment problem.
Optimization Methods and Software, 2011

The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci., 2011

Online facility location with facility movements.
CEJOR, 2011

Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints.
Acta Cybern., 2011

On Variants of File Caching.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Class constrained bin packing revisited.
Theor. Comput. Sci., 2010

Class Constrained Bin Covering.
Theory Comput. Syst., 2010

On the sum minimization version of the online bin covering problem.
Discret. Appl. Math., 2010

2009
Online scheduling with general machine cost functions.
Discret. Appl. Math., 2009

Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection.
Acta Cybern., 2009

2008
Online hypergraph coloring.
Inf. Process. Lett., 2008

Heuristic algorithms for a complex parallel machine scheduling problem.
CEJOR, 2008

On Monogenic Nondeterministic Automata.
Acta Cybern., 2008

2007
Learning lexicographic orders.
Eur. J. Oper. Res., 2007

Online scheduling with machine cost and rejection.
Discret. Appl. Math., 2007

On Time Lookahead Algorithms for the Online Data Acknowledgement Problem.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
On-line scheduling with general machine cost functions.
Electron. Notes Discret. Math., 2006

2003
More on weighted servers or FIFO is better than LRU.
Theor. Comput. Sci., 2003

On Monotonic Directable Nondeterministic Automata.
Journal of Automata, Languages and Combinatorics, 2003

Scheduling Problems on Two Sets of Identical Machines.
Computing, 2003

On directable nondeterministic trapped automata.
Acta Cybern., 2003

2001
Online strip packing with modifiable boxes.
Oper. Res. Lett., 2001

A New Well-Solvable Class of PNS Problems.
Computing, 2001

An online scheduling algorithm for a two-layer multiprocessor architecture.
Acta Cybern., 2001

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Buying a Constant Competitive Ratio for Paging.
Proceedings of the Algorithms, 2001

1999
On Merging Reduction of the Process Network Synthesis Problem.
Acta Cybern., 1999

Scheduling with Machine Cost.
Proceedings of the Randomization, 1999


  Loading...