Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Csanád Imreh
@article{DBLP:journals/corr/abs-2402-19259,
author = {Thomas Bosman and
Martijn van Ee and
Ekin Ergen and
Csan{\'{a}}d Imreh and
Alberto Marchetti{-}Spaccamela and
Martin Skutella and
Leen Stougie},
title = {Total Completion Time Scheduling Under Scenarios},
journal = {CoRR},
volume = {abs/2402.19259},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.19259},
doi = {10.48550/ARXIV.2402.19259},
eprinttype = {arXiv},
eprint = {2402.19259},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-19259.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BosmanEEIMSS23,
author = {Thomas Bosman and
Martijn van Ee and
Ekin Ergen and
Csan{\'{a}}d Imreh and
Alberto Marchetti{-}Spaccamela and
Martin Skutella and
Leen Stougie},
editor = {Jaroslaw Byrka and
Andreas Wiese},
title = {Total Completion Time Scheduling Under Scenarios},
booktitle = {Approximation and Online Algorithms - 21st International Workshop,
{WAOA} 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14297},
pages = {104--118},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49815-2\_8},
doi = {10.1007/978-3-031-49815-2\_8},
timestamp = {Thu, 11 Jan 2024 22:28:02 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BosmanEEIMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/CsirikI18,
author = {J{\'{a}}nos Csirik and
Csan{\'{a}}d Imreh},
editor = {Teofilo F. Gonzalez},
title = {Variants of Classical One Dimensional Bin Packing},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 1: Methologies and Traditional Applications},
pages = {519--538},
publisher = {Chapman and Hall/CRC},
year = {2018},
url = {https://doi.org/10.1201/9781351236423-29},
doi = {10.1201/9781351236423-29},
timestamp = {Mon, 28 Oct 2019 16:49:19 +0100},
biburl = {https://dblp.org/rec/books/tf/18/CsirikI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/CsendesIT17,
author = {Tibor Csendes and
Csan{\'{a}}d Imreh and
J{\'{o}}zsef Temesi},
title = {Editorial},
journal = {Central Eur. J. Oper. Res.},
volume = {25},
number = {4},
pages = {739--741},
year = {2017},
url = {https://doi.org/10.1007/s10100-017-0482-y},
doi = {10.1007/S10100-017-0482-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/CsendesIT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BujtasDINT16,
author = {Csilla Bujt{\'{a}}s and
Gy{\"{o}}rgy D{\'{o}}sa and
Csan{\'{a}}d Imreh and
Judit Nagy{-}Gy{\"{o}}rgy and
Zsolt Tuza},
title = {New models of graph-bin packing},
journal = {Theor. Comput. Sci.},
volume = {640},
pages = {94--103},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.06.008},
doi = {10.1016/J.TCS.2016.06.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BujtasDINT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Imreh16,
author = {Csan{\'{a}}d Imreh},
title = {Maximizing the Minimum Machine Load},
booktitle = {Encyclopedia of Algorithms},
pages = {1216--1218},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_503},
doi = {10.1007/978-1-4939-2864-4\_503},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Imreh16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinILN15,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {Online File Caching with Rejection Penalties},
journal = {Algorithmica},
volume = {71},
number = {2},
pages = {279--306},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9793-0},
doi = {10.1007/S00453-013-9793-0},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinILN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BittnerIN14,
author = {Emese Bittner and
Csan{\'{a}}d Imreh and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {The online k-server problem with rejection},
journal = {Discret. Optim.},
volume = {13},
pages = {1--15},
year = {2014},
url = {https://doi.org/10.1016/j.disopt.2014.03.002},
doi = {10.1016/J.DISOPT.2014.03.002},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/BittnerIN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CsirikEIL13,
author = {J{\'{a}}nos Csirik and
Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin},
title = {Online Clustering with Variable Sized Clusters},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {251--274},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9586-2},
doi = {10.1007/S00453-011-9586-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CsirikEIL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EpsteinIL13,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin},
title = {Bin covering with cardinality constraints},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1975--1987},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.020},
doi = {10.1016/J.DAM.2013.03.020},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/EpsteinIL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DosaI13,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Csan{\'{a}}d Imreh},
title = {The generalization of scheduling with machine cost},
journal = {Theor. Comput. Sci.},
volume = {510},
pages = {102--110},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.09.009},
doi = {10.1016/J.TCS.2013.09.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DosaI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/BartokI11,
author = {Tam{\'{a}}s Bart{\'{o}}k and
Csan{\'{a}}d Imreh},
title = {Pickup and Delivery Vehicle Routing with Multidimensional Loading
Constraints},
journal = {Acta Cybern.},
volume = {20},
number = {1},
pages = {17--33},
year = {2011},
url = {https://doi.org/10.14232/actacyb.20.1.2011.3},
doi = {10.14232/ACTACYB.20.1.2011.3},
timestamp = {Mon, 15 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/BartokI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/DivekiI11,
author = {Gabriella Div{\'{e}}ki and
Csan{\'{a}}d Imreh},
title = {Online facility location with facility movements},
journal = {Central Eur. J. Oper. Res.},
volume = {19},
number = {2},
pages = {191--200},
year = {2011},
url = {https://doi.org/10.1007/s10100-010-0153-8},
doi = {10.1007/S10100-010-0153-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/DivekiI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BujtasDINT11,
author = {Csilla Bujt{\'{a}}s and
Gy{\"{o}}rgy D{\'{o}}sa and
Csan{\'{a}}d Imreh and
Judit Nagy{-}Gy{\"{o}}rgy and
Zsolt Tuza},
title = {The Graph-Bin Packing Problem},
journal = {Int. J. Found. Comput. Sci.},
volume = {22},
number = {8},
pages = {1971--1993},
year = {2011},
url = {https://doi.org/10.1142/S012905411100915X},
doi = {10.1142/S012905411100915X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BujtasDINT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/ImrehN11,
author = {Csan{\'{a}}d Imreh and
Tam{\'{a}}s N{\'{e}}meth},
title = {Parameter learning algorithm for the online data acknowledgment problem},
journal = {Optim. Methods Softw.},
volume = {26},
number = {3},
pages = {397--404},
year = {2011},
url = {https://doi.org/10.1080/10556788.2010.544313},
doi = {10.1080/10556788.2010.544313},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/ImrehN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EpsteinILN11,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin and
Judit Nagy{-}Gy{\"{o}}rgy},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {On Variants of File Caching},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {195--206},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_17},
doi = {10.1007/978-3-642-22006-7\_17},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EpsteinILN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CsirikEIL10,
author = {J{\'{a}}nos Csirik and
Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin},
title = {On the sum minimization version of the online bin covering problem},
journal = {Discret. Appl. Math.},
volume = {158},
number = {13},
pages = {1381--1393},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.04.005},
doi = {10.1016/J.DAM.2010.04.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CsirikEIL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EpsteinIL10,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin},
title = {Class Constrained Bin Covering},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {246--260},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9129-7},
doi = {10.1007/S00224-008-9129-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EpsteinIL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EpsteinIL10,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin},
title = {Class constrained bin packing revisited},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {34-36},
pages = {3073--3089},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.04.037},
doi = {10.1016/J.TCS.2010.04.037},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EpsteinIL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CsirikEIL10,
author = {J{\'{a}}nos Csirik and
Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Online Clustering with Variable Sized Clusters},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {282--293},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_26},
doi = {10.1007/978-3-642-15155-2\_26},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CsirikEIL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/NemethI09,
author = {Tam{\'{a}}s N{\'{e}}meth and
Csan{\'{a}}d Imreh},
title = {Parameter Learning Online Algorithm for Multiprocessor Scheduling
with Rejection},
journal = {Acta Cybern.},
volume = {19},
number = {1},
pages = {125--133},
year = {2009},
url = {https://doi.org/10.14232/actacyb.19.1.2009.8},
doi = {10.14232/ACTACYB.19.1.2009.8},
timestamp = {Mon, 15 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/NemethI09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Imreh09,
author = {Csan{\'{a}}d Imreh},
title = {Online scheduling with general machine cost functions},
journal = {Discret. Appl. Math.},
volume = {157},
number = {9},
pages = {2070--2077},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2007.10.014},
doi = {10.1016/J.DAM.2007.10.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Imreh09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/ImrehI08,
author = {Csan{\'{a}}d Imreh and
Masami Ito},
title = {On Monogenic Nondeterministic Automata},
journal = {Acta Cybern.},
volume = {18},
number = {4},
pages = {777--782},
year = {2008},
url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3749},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/ImrehI08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/BlazsikIK08,
author = {Zolt{\'{a}}n Bl{\'{a}}zsik and
Csan{\'{a}}d Imreh and
Zolt{\'{a}}n Kov{\'{a}}cs},
title = {Heuristic algorithms for a complex parallel machine scheduling problem},
journal = {Central Eur. J. Oper. Res.},
volume = {16},
number = {4},
pages = {379--390},
year = {2008},
url = {https://doi.org/10.1007/s10100-008-0066-y},
doi = {10.1007/S10100-008-0066-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/BlazsikIK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nagy-GyorgyI08,
author = {Judit Nagy{-}Gy{\"{o}}rgy and
Csan{\'{a}}d Imreh},
title = {Online hypergraph coloring},
journal = {Inf. Process. Lett.},
volume = {109},
number = {1},
pages = {23--26},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.08.009},
doi = {10.1016/J.IPL.2008.08.009},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Nagy-GyorgyI08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Nagy-GyorgyI07,
author = {Judit Nagy{-}Gy{\"{o}}rgy and
Csan{\'{a}}d Imreh},
title = {Online scheduling with machine cost and rejection},
journal = {Discret. Appl. Math.},
volume = {155},
number = {18},
pages = {2546--2554},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.07.004},
doi = {10.1016/J.DAM.2007.07.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Nagy-GyorgyI07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DombiIV07,
author = {J{\'{o}}zsef Dombi and
Csan{\'{a}}d Imreh and
N{\'{a}}ndor Vincze},
title = {Learning lexicographic orders},
journal = {Eur. J. Oper. Res.},
volume = {183},
number = {2},
pages = {748--756},
year = {2007},
url = {https://doi.org/10.1016/j.ejor.2006.10.029},
doi = {10.1016/J.EJOR.2006.10.029},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/DombiIV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ImrehN07,
author = {Csan{\'{a}}d Imreh and
Tam{\'{a}}s N{\'{e}}meth},
editor = {Ludek Kucera and
Anton{\'{\i}}n Kucera},
title = {On Time Lookahead Algorithms for the Online Data Acknowledgement Problem},
booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International
Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
August 26-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4708},
pages = {288--297},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74456-6\_27},
doi = {10.1007/978-3-540-74456-6\_27},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ImrehN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Imreh06,
author = {Csan{\'{a}}d Imreh},
title = {On-line scheduling with general machine cost functions},
journal = {Electron. Notes Discret. Math.},
volume = {27},
pages = {49--50},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.050},
doi = {10.1016/J.ENDM.2006.08.050},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Imreh06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/ImrehII03,
author = {Bal{\'{a}}zs Imreh and
Csan{\'{a}}d Imreh and
Masami Ito},
title = {On directable nondeterministic trapped automata},
journal = {Acta Cybern.},
volume = {16},
number = {1},
pages = {37--45},
year = {2003},
url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3608},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/ImrehII03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Imreh03,
author = {Csan{\'{a}}d Imreh},
title = {Scheduling Problems on Two Sets of Identical Machines},
journal = {Computing},
volume = {70},
number = {4},
pages = {277--294},
year = {2003},
url = {https://doi.org/10.1007/s00607-003-0011-9},
doi = {10.1007/S00607-003-0011-9},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Imreh03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/ImrehII03,
author = {Bal{\'{a}}zs Imreh and
Csan{\'{a}}d Imreh and
Masami Ito},
title = {On Monotonic Directable Nondeterministic Automata},
journal = {J. Autom. Lang. Comb.},
volume = {8},
number = {3},
pages = {539--547},
year = {2003},
url = {https://doi.org/10.25596/jalc-2003-539},
doi = {10.25596/JALC-2003-539},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/ImrehII03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EpsteinIS03,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Rob van Stee},
title = {More on weighted servers or {FIFO} is better than {LRU}},
journal = {Theor. Comput. Sci.},
volume = {306},
number = {1-3},
pages = {305--317},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00287-1},
doi = {10.1016/S0304-3975(03)00287-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EpsteinIS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EpsteinIS02,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Rob van Stee},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {More on Weighted Servers or {FIFO} is Better than {LRU}},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {257--268},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_21},
doi = {10.1007/3-540-45687-2\_21},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EpsteinIS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/Imreh01,
author = {Csan{\'{a}}d Imreh},
title = {An online scheduling algorithm for a two-layer multiprocessor architecture},
journal = {Acta Cybern.},
volume = {15},
number = {2},
pages = {163--172},
year = {2001},
url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3571},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/Imreh01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Imreh01,
author = {Csan{\'{a}}d Imreh},
title = {A New Well-Solvable Class of {PNS} Problems},
journal = {Computing},
volume = {66},
number = {3},
pages = {289--296},
year = {2001},
url = {https://doi.org/10.1007/s006070170026},
doi = {10.1007/S006070170026},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Imreh01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Imreh01,
author = {Csan{\'{a}}d Imreh},
title = {Online strip packing with modifiable boxes},
journal = {Oper. Res. Lett.},
volume = {29},
number = {2},
pages = {79--85},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00081-5},
doi = {10.1016/S0167-6377(01)00081-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Imreh01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CsirikINSW01,
author = {J{\'{a}}nos Csirik and
Csan{\'{a}}d Imreh and
John Noga and
Steven S. Seiden and
Gerhard J. Woeginger},
editor = {Friedhelm Meyer auf der Heide},
title = {Buying a Constant Competitive Ratio for Paging},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {98--108},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_8},
doi = {10.1007/3-540-44676-1\_8},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/CsirikINSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChrobakCINSW01,
author = {Marek Chrobak and
J{\'{a}}nos Csirik and
Csan{\'{a}}d Imreh and
John Noga and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {The Buffer Minimization Problem for Multiprocessor Scheduling with
Conflicts},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {862--874},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_70},
doi = {10.1007/3-540-48224-5\_70},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChrobakCINSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/HolloBIK99,
author = {Cs. Holl{\'{o}} and
Zolt{\'{a}}n Bl{\'{a}}zsik and
Csan{\'{a}}d Imreh and
Zolt{\'{a}}n Kov{\'{a}}cs},
title = {On Merging Reduction of the Process Network Synthesis Problem},
journal = {Acta Cybern.},
volume = {14},
number = {2},
pages = {251--261},
year = {1999},
url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3526},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/HolloBIK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/ImrehN99,
author = {Csan{\'{a}}d Imreh and
John Noga},
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {Scheduling with Machine Cost},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
Third International Workshop on Randomization and Approximation Techniques
in Computer Science, and Second International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
Berkeley, CA, USA, August 8-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1671},
pages = {168--176},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48413-4\_18},
doi = {10.1007/978-3-540-48413-4\_18},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/ImrehN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-03-27 23:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
