The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Csanád Imreh" ( http://dblp.L3S.de/Authors/Csanád_Imreh )

  Author page on DBLP  Author page in RDF  Community of Csanád Imreh in ASPL-2

Publication years (Num. hits)
1999-2007 (16) 2008-2011 (11)
Publication types (Num. hits)
article(20) inproceedings(7)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 4 keywords

Results
Found 27 publication records. Showing 27 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Csanád Imreh, Tamás Németh Parameter learning algorithm for the online data acknowledgment problem. Search on Bibsonomy Optimization Methods and Software The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza The Graph-Bin Packing Problem. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György On Variants of File Caching. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Leah Epstein, Csanád Imreh, Asaf Levin Class constrained bin packing revisited. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Leah Epstein, Csanád Imreh, Asaf Levin Class Constrained Bin Covering. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin On the sum minimization version of the online bin covering problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin Online Clustering with Variable Sized Clusters. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tamás Németh, Csanád Imreh Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection. Search on Bibsonomy Acta Cybern. The full citation details ... 2009 DBLP  BibTeX  RDF
1Csanád Imreh Online scheduling with general machine cost functions. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Judit Nagy-György, Csanád Imreh Online hypergraph coloring. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Csanád Imreh, Masami Ito On Monogenic Nondeterministic Automata. Search on Bibsonomy Acta Cybern. The full citation details ... 2008 DBLP  BibTeX  RDF
1József Dombi, Csanád Imreh, Nándor Vincze Learning lexicographic orders. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Judit Nagy-György, Csanád Imreh Online scheduling with machine cost and rejection. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Csanád Imreh, Tamás Németh On Time Lookahead Algorithms for the Online Data Acknowledgement Problem. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF data acknowledgement, Online algorithms, lookahead
1Csanád Imreh On-line scheduling with general machine cost functions. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Balázs Imreh, Csanád Imreh, Masami Ito On directable nondeterministic trapped automata. Search on Bibsonomy Acta Cybern. The full citation details ... 2003 DBLP  BibTeX  RDF
1Leah Epstein, Csanád Imreh, Rob van Stee More on weighted servers or FIFO is better than LRU. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Csanád Imreh Scheduling Problems on Two Sets of Identical Machines. Search on Bibsonomy Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Scheduling, online algorithms, approximation scheme
1Balázs Imreh, Csanád Imreh, Masami Ito On Monotonic Directable Nondeterministic Automata. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2003 DBLP  BibTeX  RDF
1Leah Epstein, Csanád Imreh, Rob van Stee More on Weighted Servers or FIFO is Better than LRU. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Csanád Imreh Online strip packing with modifiable boxes. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Csanád Imreh An online scheduling algorithm for a two-layer multiprocessor architecture. Search on Bibsonomy Acta Cybern. The full citation details ... 2001 DBLP  BibTeX  RDF
1Csanád Imreh A New Well-Solvable Class of PNS Problems. Search on Bibsonomy Computing The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classifications: 90C27, 94C15
1János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger Buying a Constant Competitive Ratio for Paging. Search on Bibsonomy ESA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Cs. Holló, Z. Blázsik, Csanád Imreh, Z. Kovacs On Merging Reduction of the Process Network Synthesis Problem. Search on Bibsonomy Acta Cybern. The full citation details ... 1999 DBLP  BibTeX  RDF
1Csanád Imreh, John Noga Scheduling with Machine Cost. Search on Bibsonomy RANDOM-APPROX The full citation details ... 1999 DBLP  BibTeX  RDF
Displaying result #1 - #27 of 27 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.