Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ulrich Pferschy
@article{DBLP:journals/pubtrans/FriessP24,
author = {Nathalie Marion Frie{\ss} and
Ulrich Pferschy},
title = {Planning a zero-emission mixed-fleet public bus system with minimal
life cycle cost},
journal = {Public Transp.},
volume = {16},
number = {1},
pages = {39--79},
year = {2024},
url = {https://doi.org/10.1007/s12469-023-00345-4},
doi = {10.1007/S12469-023-00345-4},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pubtrans/FriessP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-00921,
author = {Nina Chiarelli and
Cl{\'{e}}ment Dallard and
Andreas Darmann and
Stefan Lendl and
Martin Milanic and
Peter Mursic and
Ulrich Pferschy},
title = {Allocation of Indivisible Items with a Common Preference Graph: Minimizing
Total Dissatisfaction},
journal = {CoRR},
volume = {abs/2402.00921},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.00921},
doi = {10.48550/ARXIV.2402.00921},
eprinttype = {arXiv},
eprint = {2402.00921},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-00921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChiarelliKMPPS23,
author = {Nina Chiarelli and
Matjaz Krnc and
Martin Milanic and
Ulrich Pferschy and
Nevena Pivac and
Joachim Schauer},
title = {Fair Allocation of Indivisible Items with Conflict Graphs},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1459--1489},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01079-8},
doi = {10.1007/S00453-022-01079-8},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChiarelliKMPPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cam/ChiarelliKMPS23,
author = {Nina Chiarelli and
Matjaz Krnc and
Martin Milanic and
Ulrich Pferschy and
Joachim Schauer},
title = {Fair allocation algorithms for indivisible items under structured
conflict constraints},
journal = {Comput. Appl. Math.},
volume = {42},
number = {7},
pages = {302},
year = {2023},
url = {https://doi.org/10.1007/s40314-023-02437-0},
doi = {10.1007/S40314-023-02437-0},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cam/ChiarelliKMPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/ArbibMPR23,
author = {Claudio Arbib and
Fabrizio Marinelli and
Ulrich Pferschy and
Fatemeh K. Ranjbar},
title = {One-dimensional stock cutting resilient against singular random defects},
journal = {Comput. Oper. Res.},
volume = {157},
pages = {106280},
year = {2023},
url = {https://doi.org/10.1016/j.cor.2023.106280},
doi = {10.1016/J.COR.2023.106280},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/ArbibMPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChiarelliDDLMMPP23,
author = {Nina Chiarelli and
Cl{\'{e}}ment Dallard and
Andreas Darmann and
Stefan Lendl and
Martin Milanic and
Peter Mursic and
Ulrich Pferschy and
Nevena Pivac},
title = {Allocation of indivisible items with individual preference graphs},
journal = {Discret. Appl. Math.},
volume = {334},
pages = {45--62},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.02.010},
doi = {10.1016/J.DAM.2023.02.010},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ChiarelliDDLMMPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BoeckmannTP23,
author = {Jan Boeckmann and
Clemens Thielen and
Ulrich Pferschy},
title = {Approximating single- and multi-objective nonlinear sum and product
knapsack problems},
journal = {Discret. Optim.},
volume = {48},
number = {Part 1},
pages = {100771},
year = {2023},
url = {https://doi.org/10.1016/j.disopt.2023.100771},
doi = {10.1016/J.DISOPT.2023.100771},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/BoeckmannTP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MalagutiMPP23,
author = {Enrico Malaguti and
Michele Monaci and
Paolo Paronuzzi and
Ulrich Pferschy},
title = {Corrigendum to: 'Integer optimization with penalized fractional values:
The Knapsack case' [European Journal of Operational Research {(2019)}
874-888]},
journal = {Eur. J. Oper. Res.},
volume = {307},
number = {2},
pages = {990},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2022.11.047},
doi = {10.1016/J.EJOR.2022.11.047},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/MalagutiMPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/PferschyRR23,
author = {Ulrich Pferschy and
Julia Resch and
Giovanni Righini},
title = {Algorithms for rescheduling jobs with a {LIFO} buffer to minimize
the weighted number of late jobs},
journal = {J. Sched.},
volume = {26},
number = {3},
pages = {267--287},
year = {2023},
url = {https://doi.org/10.1007/s10951-022-00751-9},
doi = {10.1007/S10951-022-00751-9},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/PferschyRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-09399,
author = {Nina Chiarelli and
Matjaz Krnc and
Martin Milanic and
Ulrich Pferschy and
Joachim Schauer},
title = {Fair Allocation Algorithms for Indivisible Items under Structured
Conflict Constraints},
journal = {CoRR},
volume = {abs/2308.09399},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.09399},
doi = {10.48550/ARXIV.2308.09399},
eprinttype = {arXiv},
eprint = {2308.09399},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-09399.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-13349,
author = {Francesco Corti and
Balz Maag and
Joachim Schauer and
Ulrich Pferschy and
Olga Saukh},
title = {{REDS:} Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints},
journal = {CoRR},
volume = {abs/2311.13349},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.13349},
doi = {10.48550/ARXIV.2311.13349},
eprinttype = {arXiv},
eprint = {2311.13349},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-13349.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-01804,
author = {Nina Chiarelli and
Cl{\'{e}}ment Dallard and
Andreas Darmann and
Stefan Lendl and
Martin Milanic and
Peter Mursic and
Ulrich Pferschy},
title = {Minimizing Maximum Dissatisfaction in the Allocation of Indivisible
Items under a Common Preference Graph},
journal = {CoRR},
volume = {abs/2312.01804},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.01804},
doi = {10.48550/ARXIV.2312.01804},
eprinttype = {arXiv},
eprint = {2312.01804},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-01804.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ors/HesslerIKP22,
author = {Katrin He{\ss}ler and
Stefan Irnich and
Tobias Kreiter and
Ulrich Pferschy},
title = {Bin packing with lexicographic objectives for loading weight- and
volume-constrained trucks in a direct-shipping system},
journal = {{OR} Spectr.},
volume = {44},
number = {2},
pages = {1--43},
year = {2022},
url = {https://doi.org/10.1007/s00291-021-00628-x},
doi = {10.1007/S00291-021-00628-X},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ors/HesslerIKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-04465,
author = {Nina Chiarelli and
Cl{\'{e}}ment Dallard and
Andreas Darmann and
Stefan Lendl and
Martin Milanic and
Peter Mursic and
Ulrich Pferschy and
Nevena Pivac},
title = {Allocation of Indivisible Items with Individual Preference Graphs},
journal = {CoRR},
volume = {abs/2202.04465},
year = {2022},
url = {https://arxiv.org/abs/2202.04465},
eprinttype = {arXiv},
eprint = {2202.04465},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-04465.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/PferschyNPS21,
author = {Ulrich Pferschy and
Gaia Nicosia and
Andrea Pacifici and
Joachim Schauer},
title = {On the Stackelberg knapsack game},
journal = {Eur. J. Oper. Res.},
volume = {291},
number = {1},
pages = {18--31},
year = {2021},
url = {https://doi.org/10.1016/j.ejor.2020.09.007},
doi = {10.1016/J.EJOR.2020.09.007},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/PferschyNPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/PferschyST21,
author = {Ulrich Pferschy and
Joachim Schauer and
Clemens Thielen},
title = {Approximating the product knapsack problem},
journal = {Optim. Lett.},
volume = {15},
number = {8},
pages = {2529--2540},
year = {2021},
url = {https://doi.org/10.1007/s11590-021-01760-x},
doi = {10.1007/S11590-021-01760-X},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/PferschyST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/NicosiaPPRR21,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy and
Julia Resch and
Giovanni Righini},
title = {Optimally rescheduling jobs with a Last-In-First-Out buffer},
journal = {J. Sched.},
volume = {24},
number = {6},
pages = {663--680},
year = {2021},
url = {https://doi.org/10.1007/s10951-021-00707-5},
doi = {10.1007/S10951-021-00707-5},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/NicosiaPPRR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/ChiarelliDDLMMP21,
author = {Nina Chiarelli and
Cl{\'{e}}ment Dallard and
Andreas Darmann and
Stefan Lendl and
Martin Milanic and
Peter Mursic and
Nevena Pivac and
Ulrich Pferschy},
editor = {Dimitris Fotakis and
David R{\'{\i}}os Insua},
title = {Allocating Indivisible Items with Minimum Dissatisfaction on Preference
Graphs},
booktitle = {Algorithmic Decision Theory - 7th International Conference, {ADT}
2021, Toulouse, France, November 3-5, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13023},
pages = {243--257},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-87756-9\_16},
doi = {10.1007/978-3-030-87756-9\_16},
timestamp = {Mon, 06 Nov 2023 15:27:23 +0100},
biburl = {https://dblp.org/rec/conf/aldt/ChiarelliDDLMMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compsac/FriessP21,
author = {Nathalie Frie{\ss} and
Ulrich Pferschy},
title = {Decision-Support System for the Optimal Technology Split of a Decarbonized
Bus Network},
booktitle = {{IEEE} 45th Annual Computers, Software, and Applications Conference,
{COMPSAC} 2021, Madrid, Spain, July 12-16, 2021},
pages = {1279--1284},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/COMPSAC51774.2021.00178},
doi = {10.1109/COMPSAC51774.2021.00178},
timestamp = {Thu, 23 Sep 2021 08:33:11 +0200},
biburl = {https://dblp.org/rec/conf/compsac/FriessP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-15901,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy and
Julia Resch and
Giovanni Righini},
title = {Optimally rescheduling jobs with a {LIFO} buffer},
journal = {CoRR},
volume = {abs/2106.15901},
year = {2021},
url = {https://arxiv.org/abs/2106.15901},
eprinttype = {arXiv},
eprint = {2106.15901},
timestamp = {Mon, 05 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-15901.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/KreiterP20,
author = {Tobias Kreiter and
Ulrich Pferschy},
title = {Integer programming models versus advanced planning business software
for a multi-level mixed-model assembly line problem},
journal = {Central Eur. J. Oper. Res.},
volume = {28},
number = {3},
pages = {1141--1177},
year = {2020},
url = {https://doi.org/10.1007/s10100-019-00642-z},
doi = {10.1007/S10100-019-00642-Z},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/KreiterP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/ChiarelliKMPPS20,
author = {Nina Chiarelli and
Matjaz Krnc and
Martin Milanic and
Ulrich Pferschy and
Nevena Pivac and
Joachim Schauer},
editor = {Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik},
title = {Fair Packing of Independent Sets},
booktitle = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
Bordeaux, France, June 8-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12126},
pages = {154--165},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48966-3\_12},
doi = {10.1007/978-3-030-48966-3\_12},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/ChiarelliKMPPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-11313,
author = {Nina Chiarelli and
Matjaz Krnc and
Martin Milanic and
Ulrich Pferschy and
Nevena Pivac and
Joachim Schauer},
title = {Fair packing of independent sets},
journal = {CoRR},
volume = {abs/2003.11313},
year = {2020},
url = {https://arxiv.org/abs/2003.11313},
eprinttype = {arXiv},
eprint = {2003.11313},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-11313.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/StanekGLP19,
author = {Rostislav Stanek and
Peter Greistorfer and
Klaus Ladner and
Ulrich Pferschy},
title = {Geometric and LP-based heuristics for angular travelling salesman
problems in the plane},
journal = {Comput. Oper. Res.},
volume = {108},
pages = {97--111},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2019.01.016},
doi = {10.1016/J.COR.2019.01.016},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/StanekGLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CrocePS19,
author = {Federico Della Croce and
Ulrich Pferschy and
Rosario Scatamacchia},
title = {New exact approaches and approximation results for the Penalized Knapsack
Problem},
journal = {Discret. Appl. Math.},
volume = {253},
pages = {122--135},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2017.11.023},
doi = {10.1016/J.DAM.2017.11.023},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CrocePS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CrocePS19a,
author = {Federico Della Croce and
Ulrich Pferschy and
Rosario Scatamacchia},
title = {On approximating the Incremental Knapsack Problem},
journal = {Discret. Appl. Math.},
volume = {264},
pages = {26--42},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.02.016},
doi = {10.1016/J.DAM.2019.02.016},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CrocePS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MalagutiMPP19,
author = {Enrico Malaguti and
Michele Monaci and
Paolo Paronuzzi and
Ulrich Pferschy},
title = {Integer optimization with penalized fractional values: The Knapsack
case},
journal = {Eur. J. Oper. Res.},
volume = {273},
number = {3},
pages = {874--888},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2018.09.020},
doi = {10.1016/J.EJOR.2018.09.020},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/MalagutiMPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PferschyNP19,
author = {Ulrich Pferschy and
Gaia Nicosia and
Andrea Pacifici},
title = {A Stackelberg knapsack game with weight control},
journal = {Theor. Comput. Sci.},
volume = {799},
pages = {149--159},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.10.007},
doi = {10.1016/J.TCS.2019.10.007},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PferschyNP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-00695,
author = {Ulrich Pferschy and
Joachim Schauer and
Clemens Thielen},
title = {The Product Knapsack Problem: Approximation and Complexity},
journal = {CoRR},
volume = {abs/1901.00695},
year = {2019},
url = {http://arxiv.org/abs/1901.00695},
eprinttype = {arXiv},
eprint = {1901.00695},
timestamp = {Sun, 03 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-00695.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/NicosiaPP18,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
title = {Competitive multi-agent scheduling with an iterative selection rule},
journal = {4OR},
volume = {16},
number = {1},
pages = {15--29},
year = {2018},
url = {https://doi.org/10.1007/s10288-017-0341-7},
doi = {10.1007/S10288-017-0341-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/NicosiaPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PferschyS18,
author = {Ulrich Pferschy and
Joachim Schauer},
title = {Order Batching and Routing in a Non-Standard Warehouse},
journal = {Electron. Notes Discret. Math.},
volume = {69},
pages = {125--132},
year = {2018},
url = {https://doi.org/10.1016/j.endm.2018.07.017},
doi = {10.1016/J.ENDM.2018.07.017},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PferschyS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PferschyNP18,
author = {Ulrich Pferschy and
Gaia Nicosia and
Andrea Pacifici},
title = {On a Stackelberg Subset Sum Game},
journal = {Electron. Notes Discret. Math.},
volume = {69},
pages = {133--140},
year = {2018},
url = {https://doi.org/10.1016/j.endm.2018.07.018},
doi = {10.1016/J.ENDM.2018.07.018},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PferschyNP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijpr/BognerPUZ18,
author = {Karin Bogner and
Ulrich Pferschy and
Roland Unterberger and
Herwig Zeiner},
title = {Optimised scheduling in human-robot collaboration - a use case in
the assembly of printed circuit boards},
journal = {Int. J. Prod. Res.},
volume = {56},
number = {16},
pages = {5522--5540},
year = {2018},
url = {https://doi.org/10.1080/00207543.2018.1470695},
doi = {10.1080/00207543.2018.1470695},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijpr/BognerPUZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itor/PferschyS18,
author = {Ulrich Pferschy and
Rosario Scatamacchia},
title = {Improved dynamic programming and approximation results for the knapsack
problem with setups},
journal = {Int. Trans. Oper. Res.},
volume = {25},
number = {2},
pages = {667--682},
year = {2018},
url = {https://doi.org/10.1111/itor.12381},
doi = {10.1111/ITOR.12381},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/itor/PferschyS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrocePS18,
author = {Federico Della Croce and
Ulrich Pferschy and
Rosario Scatamacchia},
title = {Approximating the 3-period Incremental Knapsack Problem},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {55--69},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.005},
doi = {10.1016/J.JDA.2018.11.005},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CrocePS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-03698,
author = {Ulrich Pferschy and
Gaia Nicosia and
Andrea Pacifici},
title = {On a Stackelberg Subset Sum Game},
journal = {CoRR},
volume = {abs/1801.03698},
year = {2018},
url = {http://arxiv.org/abs/1801.03698},
eprinttype = {arXiv},
eprint = {1801.03698},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-03698.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-04801,
author = {Federico Della Croce and
Ulrich Pferschy and
Rosario Scatamacchia},
title = {Approximating the Incremental Knapsack Problem},
journal = {CoRR},
volume = {abs/1801.04801},
year = {2018},
url = {http://arxiv.org/abs/1801.04801},
eprinttype = {arXiv},
eprint = {1801.04801},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-04801.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-03681,
author = {Rostislav Stanek and
Peter Greistorfer and
Klaus Ladner and
Ulrich Pferschy},
title = {Geometric and LP-based heuristics for the quadratic travelling salesman
problem},
journal = {CoRR},
volume = {abs/1803.03681},
year = {2018},
url = {http://arxiv.org/abs/1803.03681},
eprinttype = {arXiv},
eprint = {1803.03681},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-03681.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/PferschyS17,
author = {Ulrich Pferschy and
Rostislav Stanek},
title = {Generating subtour elimination constraints for the {TSP} from pure
integer solutions},
journal = {Central Eur. J. Oper. Res.},
volume = {25},
number = {1},
pages = {231--260},
year = {2017},
url = {https://doi.org/10.1007/s10100-016-0437-8},
doi = {10.1007/S10100-016-0437-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/PferschyS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DarmannPS17,
author = {Andreas Darmann and
Ulrich Pferschy and
Joachim Schauer},
title = {On the Shortest Path Game},
journal = {Discret. Appl. Math.},
volume = {217},
pages = {3--18},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.08.003},
doi = {10.1016/J.DAM.2015.08.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DarmannPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DarmannPS17a,
author = {Andreas Darmann and
Ulrich Pferschy and
Joachim Schauer},
title = {The shortest connection game},
journal = {Discret. Appl. Math.},
volume = {231},
pages = {139--154},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.01.024},
doi = {10.1016/J.DAM.2017.01.024},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DarmannPS17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/NicosiaPP17,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
title = {Price of Fairness for allocating a bounded resource},
journal = {Eur. J. Oper. Res.},
volume = {257},
number = {3},
pages = {933--943},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2016.08.013},
doi = {10.1016/J.EJOR.2016.08.013},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/NicosiaPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PferschyS17,
author = {Ulrich Pferschy and
Joachim Schauer},
title = {Approximation of knapsack problems with conflict and forcing graphs},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1300--1323},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0035-7},
doi = {10.1007/S10878-016-0035-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PferschyS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/CrocePS17,
author = {Federico Della Croce and
Ulrich Pferschy and
Rosario Scatamacchia},
editor = {Ljiljana Brankovic and
Joe Ryan and
William F. Smyth},
title = {Approximation Results for the Incremental Knapsack Problem},
booktitle = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017,
Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10765},
pages = {75--87},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-78825-8\_7},
doi = {10.1007/978-3-319-78825-8\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/CrocePS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CrocePS17,
author = {Federico Della Croce and
Ulrich Pferschy and
Rosario Scatamacchia},
title = {Dynamic programming algorithms, efficient solution of the LP-relaxation
and approximation schemes for the Penalized Knapsack Problem},
journal = {CoRR},
volume = {abs/1702.04211},
year = {2017},
url = {http://arxiv.org/abs/1702.04211},
eprinttype = {arXiv},
eprint = {1702.04211},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CrocePS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/NaldiNPP16,
author = {Maurizio Naldi and
Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
title = {Maximin Fairness in Project Budget Allocation},
journal = {Electron. Notes Discret. Math.},
volume = {55},
pages = {65--68},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.10.017},
doi = {10.1016/J.ENDM.2016.10.017},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/NaldiNPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FischerMPS16,
author = {Anja Fischer and
J. Fabian Meier and
Ulrich Pferschy and
Rostislav Stanek},
title = {Linear Models and Computational Experiments for the Quadratic {TSP}},
journal = {Electron. Notes Discret. Math.},
volume = {55},
pages = {97--100},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.10.025},
doi = {10.1016/J.ENDM.2016.10.025},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/FischerMPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/PferschyS16,
author = {Ulrich Pferschy and
Joachim Schauer},
title = {Approximation of the Quadratic Knapsack Problem},
journal = {{INFORMS} J. Comput.},
volume = {28},
number = {2},
pages = {308--318},
year = {2016},
url = {https://doi.org/10.1287/ijoc.2015.0678},
doi = {10.1287/IJOC.2015.0678},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/PferschyS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/centeris/NaldiNPP16,
author = {Maurizio Naldi and
Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
editor = {Jo{\~{a}}o Eduardo Quintela Varaj{\~{a}}o and
Maria Manuela Cruz{-}Cunha and
Ricardo Martinho and
Rui Rijo and
Niels Bj{\o}rn{-}Andersen and
Rodney Turner and
Domingos Alves},
title = {Maximin Fairness-profit Tradeoff in Project Budget Allocation},
booktitle = {International Conference on ENTERprise Information Systems/International
Conference on Project MANagement/International Conference on Health
and Social Care Information Systems and Technologies, CENTERIS/ProjMAN/HCist
2016, Porto, Portugal, October 5-7, 2016},
series = {Procedia Computer Science},
volume = {100},
pages = {313--320},
publisher = {Elsevier},
year = {2016},
url = {https://doi.org/10.1016/j.procs.2016.09.162},
doi = {10.1016/J.PROCS.2016.09.162},
timestamp = {Tue, 23 Apr 2024 23:18:35 +0200},
biburl = {https://dblp.org/rec/conf/centeris/NaldiNPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ems/NaldiNPPL16,
author = {Maurizio Naldi and
Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy and
Bernhard Leder},
title = {A Simulation study of Fairness-Profit Trade-off in Project Selection
based on {HHI} and Knapsack Models},
booktitle = {2016 European Modelling Symposium, {EMS} 2016, Pisa, Italy, November
28-30, 2016},
pages = {85--90},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/EMS.2016.025},
doi = {10.1109/EMS.2016.025},
timestamp = {Wed, 16 Oct 2019 14:14:53 +0200},
biburl = {https://dblp.org/rec/conf/ems/NaldiNPPL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/AgnetisNPP15,
author = {Alessandro Agnetis and
Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
title = {Scheduling two agent task chains with a central selection mechanism},
journal = {J. Sched.},
volume = {18},
number = {3},
pages = {243--261},
year = {2015},
url = {https://doi.org/10.1007/s10951-014-0414-9},
doi = {10.1007/S10951-014-0414-9},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/AgnetisNPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NicosiaPP15,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
title = {Two agent scheduling with a central selection mechanism},
journal = {Theor. Comput. Sci.},
volume = {596},
pages = {109--123},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.051},
doi = {10.1016/J.TCS.2015.06.051},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NicosiaPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/KreiterPS15,
author = {Tobias Kreiter and
Ulrich Pferschy and
Joachim Schauer},
editor = {Karl F. Doerner and
Ivana Ljubic and
Georg Pflug and
Gernot Tragler},
title = {Personnel Planning with Multi-tasking and Structured Qualifications},
booktitle = {Operations Research Proceedings 2015, Selected Papers of the International
Conference of the German, Austrian and Swiss Operations Research Societies
(GOR, {\"{O}}GOR, SVOR/ASRO), University of Vienna, Austria,
September 1-4, 2015},
series = {Operations Research Proceedings},
pages = {597--603},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-42902-1\_81},
doi = {10.1007/978-3-319-42902-1\_81},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/or/KreiterPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/NicosiaPP15,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
editor = {Martin Hoefer},
title = {Brief Announcement: On the Fair Subset Sum Problem},
booktitle = {Algorithmic Game Theory - 8th International Symposium, {SAGT} 2015,
Saarbr{\"{u}}cken, Germany, September 28-30, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9347},
pages = {309--311},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48433-3\_28},
doi = {10.1007/978-3-662-48433-3\_28},
timestamp = {Fri, 26 Mar 2021 08:28:34 +0100},
biburl = {https://dblp.org/rec/conf/sagt/NicosiaPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/NicosiaPP15,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
editor = {Ekrem Duman and
Ali Fuat Alkaya},
title = {Price of Fairness for Multiagent Subset Sum Problems},
booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
Istanbul, Turkey, May 26-28, 2015},
pages = {55--58},
year = {2015},
timestamp = {Thu, 02 Feb 2017 18:00:28 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/NicosiaPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DarmannPS15,
author = {Andreas Darmann and
Ulrich Pferschy and
Joachim Schauer},
title = {On the shortest path game: extended version},
journal = {CoRR},
volume = {abs/1506.00462},
year = {2015},
url = {http://arxiv.org/abs/1506.00462},
eprinttype = {arXiv},
eprint = {1506.00462},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DarmannPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NicosiaPP15,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
title = {Price of Fairness for Allocating a Bounded Resource},
journal = {CoRR},
volume = {abs/1508.05253},
year = {2015},
url = {http://arxiv.org/abs/1508.05253},
eprinttype = {arXiv},
eprint = {1508.05253},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NicosiaPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DarmannPS15a,
author = {Andreas Darmann and
Ulrich Pferschy and
Joachim Schauer},
title = {The Shortest Connection Game},
journal = {CoRR},
volume = {abs/1511.07847},
year = {2015},
url = {http://arxiv.org/abs/1511.07847},
eprinttype = {arXiv},
eprint = {1511.07847},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DarmannPS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DarmannNPS14,
author = {Andreas Darmann and
Gaia Nicosia and
Ulrich Pferschy and
Joachim Schauer},
title = {The Subset Sum game},
journal = {Eur. J. Oper. Res.},
volume = {233},
number = {3},
pages = {539--549},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2013.08.047},
doi = {10.1016/J.EJOR.2013.08.047},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/DarmannNPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icores/PferschySM14a,
author = {Ulrich Pferschy and
Joachim Schauer and
Gerhild Maier},
editor = {Eric Pinson and
Fernando Valente and
Bego{\~{n}}a Vitoriano},
title = {A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional
Campaign},
booktitle = {Operations Research and Enterprise Systems - Third International Conference,
{ICORES} 2014, Angers, France, March 6-8, 2014, Revised Selected Papers},
series = {Communications in Computer and Information Science},
volume = {509},
pages = {251--264},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-17509-6\_17},
doi = {10.1007/978-3-319-17509-6\_17},
timestamp = {Sun, 02 Jun 2019 21:27:51 +0200},
biburl = {https://dblp.org/rec/conf/icores/PferschySM14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icores/PferschySM14,
author = {Ulrich Pferschy and
Joachim Schauer and
Gerhild Maier},
editor = {Bego{\~{n}}a Vitoriano and
Eric Pinson and
Fernando Valente},
title = {Media Mix Optimization - Applying a Quadratic Knapsack Model},
booktitle = {{ICORES} 2014 - Proceedings of the 3rd International Conference on
Operations Research and Enterprise Systems, Angers, Loire Valley,
France, March 6-8, 2014},
pages = {363--370},
publisher = {SciTePress},
year = {2014},
url = {https://doi.org/10.5220/0004825803630370},
doi = {10.5220/0004825803630370},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icores/PferschySM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/DarmannPS14,
author = {Andreas Darmann and
Ulrich Pferschy and
Joachim Schauer},
editor = {Josep D{\'{\i}}az and
Ivan Lanese and
Davide Sangiorgi},
title = {The Shortest Path Game: Complexity and Algorithms},
booktitle = {Theoretical Computer Science - 8th {IFIP} {TC} 1/WG 2.2 International
Conference, {TCS} 2014, Rome, Italy, September 1-3, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8705},
pages = {39--53},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44602-7\_4},
doi = {10.1007/978-3-662-44602-7\_4},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/DarmannPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/MariniNPP13,
author = {Claudia Marini and
Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
title = {Strategies in competing subset selection},
journal = {Ann. Oper. Res.},
volume = {207},
number = {1},
pages = {181--200},
year = {2013},
url = {https://doi.org/10.1007/s10479-011-1057-2},
doi = {10.1007/S10479-011-1057-2},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/MariniNPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/MonaciPS13,
author = {Michele Monaci and
Ulrich Pferschy and
Paolo Serafini},
title = {Exact solution of the robust knapsack problem},
journal = {Comput. Oper. Res.},
volume = {40},
number = {11},
pages = {2625--2631},
year = {2013},
url = {https://doi.org/10.1016/j.cor.2013.05.005},
doi = {10.1016/J.COR.2013.05.005},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/MonaciPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PferschyS13,
author = {Ulrich Pferschy and
Joachim Schauer},
title = {The maximum flow problem with disjunctive constraints},
journal = {J. Comb. Optim.},
volume = {26},
number = {1},
pages = {109--119},
year = {2013},
url = {https://doi.org/10.1007/s10878-011-9438-7},
doi = {10.1007/S10878-011-9438-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PferschyS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/MonaciP13,
author = {Michele Monaci and
Ulrich Pferschy},
title = {On the Robust Knapsack Problem},
journal = {{SIAM} J. Optim.},
volume = {23},
number = {4},
pages = {1956--1982},
year = {2013},
url = {https://doi.org/10.1137/120880355},
doi = {10.1137/120880355},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/MonaciP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/AgnetisNPP13,
author = {Alessandro Agnetis and
Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
editor = {Patrice Perny and
Marc Pirlot and
Alexis Tsouki{\`{a}}s},
title = {Two Agents Competing for a Shared Machine},
booktitle = {Algorithmic Decision Theory - Third International Conference, {ADT}
2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8176},
pages = {1--14},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41575-3\_1},
doi = {10.1007/978-3-642-41575-3\_1},
timestamp = {Mon, 03 Jan 2022 22:21:02 +0100},
biburl = {https://dblp.org/rec/conf/aldt/AgnetisNPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/PferschyS13,
author = {Ulrich Pferschy and
Joachim Schauer},
editor = {Christos Kaklamanis and
Kirk Pruhs},
title = {Approximating the Quadratic Knapsack Problem on Special Graph Classes},
booktitle = {Approximation and Online Algorithms - 11th International Workshop,
{WAOA} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8447},
pages = {61--72},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-08001-7\_6},
doi = {10.1007/978-3-319-08001-7\_6},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/PferschyS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mss/KlamlerPR12,
author = {Christian Klamler and
Ulrich Pferschy and
Stefan Ruzika},
title = {Committee selection under weight constraints},
journal = {Math. Soc. Sci.},
volume = {64},
number = {1},
pages = {48--56},
year = {2012},
url = {https://doi.org/10.1016/j.mathsocsci.2011.11.006},
doi = {10.1016/J.MATHSOCSCI.2011.11.006},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mss/KlamlerPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/NicosiaPP12,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
editor = {Andreas Brieden and
Zafer{-}Korcan G{\"{o}}rg{\"{u}}l{\"{u}} and
Tino Krug and
Erik Kropat and
Silja Meyer{-}Nieberg and
Goran Mihelcic and
Stefan Wolfgang Pickl},
title = {Strategies for Single-machine Multi-agent Scheduling Problems},
booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Munich, Germany, May 29-31, 2012. Extended Abstracts},
pages = {197--200},
year = {2012},
timestamp = {Thu, 16 May 2013 15:41:40 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/NicosiaPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DarmannPSW11,
author = {Andreas Darmann and
Ulrich Pferschy and
Joachim Schauer and
Gerhard J. Woeginger},
title = {Paths, trees and matchings under disjunctive constraints},
journal = {Discret. Appl. Math.},
volume = {159},
number = {16},
pages = {1726--1735},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.12.016},
doi = {10.1016/J.DAM.2010.12.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DarmannPSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NicosiaPP11,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
title = {Competitive subset selection with two agents},
journal = {Discret. Appl. Math.},
volume = {159},
number = {16},
pages = {1865--1877},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.11.011},
doi = {10.1016/J.DAM.2010.11.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NicosiaPP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/MonaciP11,
author = {Michele Monaci and
Ulrich Pferschy},
editor = {Ludovica Adacher and
Marta Flamini and
Gianmaria Leo and
Gaia Nicosia and
Andrea Pacifici and
Veronica Piccialli},
title = {On the Robust Knapsack Problem},
booktitle = {Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial
optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy,
June 14-16, 2011},
pages = {207--210},
year = {2011},
url = {http://ctw2011.dia.uniroma3.it/ctw\_proceedings.pdf\#page=219},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/MonaciP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/inoc/PferschyS11,
author = {Ulrich Pferschy and
Joachim Schauer},
editor = {Julia Pahl and
Torsten Reiners and
Stefan Vo{\ss}},
title = {The Maximum Flow Problem with Conflict and Forcing Conditions},
booktitle = {Network Optimization - 5th International Conference, {INOC} 2011,
Hamburg, Germany, June 13-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6701},
pages = {289--294},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21527-8\_34},
doi = {10.1007/978-3-642-21527-8\_34},
timestamp = {Fri, 16 Feb 2024 11:29:47 +0100},
biburl = {https://dblp.org/rec/conf/inoc/PferschyS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/PuchingerRP10,
author = {Jakob Puchinger and
G{\"{u}}nther R. Raidl and
Ulrich Pferschy},
title = {The Multidimensional Knapsack Problem: Structure and Algorithms},
journal = {{INFORMS} J. Comput.},
volume = {22},
number = {2},
pages = {250--265},
year = {2010},
url = {https://doi.org/10.1287/ijoc.1090.0344},
doi = {10.1287/IJOC.1090.0344},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/PuchingerRP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mss/DarmannKP10,
author = {Andreas Darmann and
Christian Klamler and
Ulrich Pferschy},
title = {A note on maximizing the minimum voter satisfaction on spanning trees},
journal = {Math. Soc. Sci.},
volume = {60},
number = {1},
pages = {82--85},
year = {2010},
url = {https://doi.org/10.1016/j.mathsocsci.2010.04.003},
doi = {10.1016/J.MATHSOCSCI.2010.04.003},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mss/DarmannKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DarmannPS10,
author = {Andreas Darmann and
Ulrich Pferschy and
Joachim Schauer},
title = {Resource allocation with time intervals},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {49},
pages = {4217--4234},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.08.028},
doi = {10.1016/J.TCS.2010.08.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DarmannPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/MansiniP09,
author = {Renata Mansini and
Ulrich Pferschy},
title = {A Two-Period Portfolio Selection Model for Asset-backed Securitization},
journal = {Algorithmic Oper. Res.},
volume = {4},
number = {2},
pages = {155--170},
year = {2009},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/10091},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/MansiniP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/AlizadehBP09,
author = {Behrooz Alizadeh and
Rainer E. Burkard and
Ulrich Pferschy},
title = {Inverse 1-center location problems with edge length augmentation on
trees},
journal = {Computing},
volume = {86},
number = {4},
pages = {331--343},
year = {2009},
url = {https://doi.org/10.1007/s00607-009-0070-7},
doi = {10.1007/S00607-009-0070-7},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/AlizadehBP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PferschyS09,
author = {Ulrich Pferschy and
Joachim Schauer},
title = {The Knapsack Problem with Conflict Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {233--249},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00186},
doi = {10.7155/JGAA.00186},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PferschyS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mss/DarmannKP09,
author = {Andreas Darmann and
Christian Klamler and
Ulrich Pferschy},
title = {Maximizing the minimum voter satisfaction on spanning trees},
journal = {Math. Soc. Sci.},
volume = {58},
number = {2},
pages = {238--250},
year = {2009},
url = {https://doi.org/10.1016/j.mathsocsci.2009.05.002},
doi = {10.1016/J.MATHSOCSCI.2009.05.002},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mss/DarmannKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/KlamlerPR09,
author = {Christian Klamler and
Ulrich Pferschy and
Stefan Ruzika},
editor = {Francesca Rossi and
Alexis Tsouki{\`{a}}s},
title = {Committee Selection with a Weight Constraint Based on Lexicographic
Rankings of Individuals},
booktitle = {Algorithmic Decision Theory, First International Conference, {ADT}
2009, Venice, Italy, October 20-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5783},
pages = {50--61},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04428-1\_5},
doi = {10.1007/978-3-642-04428-1\_5},
timestamp = {Tue, 23 Jan 2024 13:25:45 +0100},
biburl = {https://dblp.org/rec/conf/aldt/KlamlerPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/NicosiaPP09,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
editor = {Francesca Rossi and
Alexis Tsouki{\`{a}}s},
title = {Subset Weight Maximization with Two Competing Agents},
booktitle = {Algorithmic Decision Theory, First International Conference, {ADT}
2009, Venice, Italy, October 20-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5783},
pages = {74--85},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04428-1\_7},
doi = {10.1007/978-3-642-04428-1\_7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/NicosiaPP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/DarmannPS09,
author = {Andreas Darmann and
Ulrich Pferschy and
Joachim Schauer},
editor = {Francesca Rossi and
Alexis Tsouki{\`{a}}s},
title = {Determining a Minimum Spanning Tree with Disjunctive Constraints},
booktitle = {Algorithmic Decision Theory, First International Conference, {ADT}
2009, Venice, Italy, October 20-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5783},
pages = {414--423},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04428-1\_36},
doi = {10.1007/978-3-642-04428-1\_36},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/DarmannPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/NicosiaPP09,
author = {Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy},
editor = {Sonia Cafieri and
Antonio Mucherino and
Giacomo Nannicini and
Fabien Tarissan and
Leo Liberti},
title = {On Multi-Agent Knapsack Problems},
booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
pages = {44--47},
year = {2009},
url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=56},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/NicosiaPP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/DarmannPSW09,
author = {Andreas Darmann and
Ulrich Pferschy and
Joachim Schauer and
Gerhard J. Woeginger},
editor = {Sonia Cafieri and
Antonio Mucherino and
Giacomo Nannicini and
Fabien Tarissan and
Leo Liberti},
title = {Combinatorial Optimization Problems with Conflict Graphs},
booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
pages = {293--296},
year = {2009},
url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=305},
timestamp = {Wed, 17 Jun 2009 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/DarmannPSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scw/KlamlerP07,
author = {Christian Klamler and
Ulrich Pferschy},
title = {The traveling group problem},
journal = {Soc. Choice Welf.},
volume = {29},
number = {3},
pages = {429--452},
year = {2007},
url = {https://doi.org/10.1007/s00355-006-0214-z},
doi = {10.1007/S00355-006-0214-Z},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scw/KlamlerP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LjubicWPKMF06,
author = {Ivana Ljubic and
Ren{\'{e}} Weiskircher and
Ulrich Pferschy and
Gunnar W. Klau and
Petra Mutzel and
Matteo Fischetti},
title = {An Algorithmic Framework for the Exact Solution of the Prize-Collecting
Steiner Tree Problem},
journal = {Math. Program.},
volume = {105},
number = {2-3},
pages = {427--449},
year = {2006},
url = {https://doi.org/10.1007/s10107-005-0660-x},
doi = {10.1007/S10107-005-0660-X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LjubicWPKMF06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/evoW/PuchingerRP06,
author = {Jakob Puchinger and
G{\"{u}}nther R. Raidl and
Ulrich Pferschy},
editor = {Jens Gottlieb and
G{\"{u}}nther R. Raidl},
title = {The Core Concept for the Multidimensional Knapsack Problem},
booktitle = {Evolutionary Computation in Combinatorial Optimization, 6th European
Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3906},
pages = {195--208},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11730095\_17},
doi = {10.1007/11730095\_17},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/evoW/PuchingerRP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/WagnerRPMB06,
author = {Daniel Wagner and
G{\"{u}}nther R. Raidl and
Ulrich Pferschy and
Petra Mutzel and
Peter Bachhiesl},
editor = {Karl{-}Heinz Waldmann and
Ulrike M. Stocker},
title = {A Multi-Commodity Flow Approach for the Design of the Last Mile in
Real-World Fiber Optic Networks},
booktitle = {Operations Research, Proceedings 2006, Selected Papers of the Annual
International Conference of the German Operations ResearchSociety
(GOR), Jointly Organized with the Austrian Society of Operations Research
({\"{O}}GOR) and the Swiss Society of Operations Research (SVOR),
Karlsruhe, Germany, September 6-8, 2006},
pages = {197--202},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-69995-8\_33},
doi = {10.1007/978-3-540-69995-8\_33},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/or/WagnerRPMB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/KlinzPS06,
author = {Bettina Klinz and
Ulrich Pferschy and
Joachim Schauer},
editor = {Karl{-}Heinz Waldmann and
Ulrike M. Stocker},
title = {{ILP} Models for a Nurse Scheduling Problem},
booktitle = {Operations Research, Proceedings 2006, Selected Papers of the Annual
International Conference of the German Operations ResearchSociety
(GOR), Jointly Organized with the Austrian Society of Operations Research
({\"{O}}GOR) and the Swiss Society of Operations Research (SVOR),
Karlsruhe, Germany, September 6-8, 2006},
pages = {319--324},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-69995-8\_52},
doi = {10.1007/978-3-540-69995-8\_52},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/or/KlinzPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CapraraP05,
author = {Alberto Caprara and
Ulrich Pferschy},
title = {Modified subset sum heuristics for bin packing},
journal = {Inf. Process. Lett.},
volume = {96},
number = {1},
pages = {18--23},
year = {2005},
url = {https://doi.org/10.1016/j.ipl.2005.04.005},
doi = {10.1016/J.IPL.2005.04.005},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CapraraP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/LjubicWPKMF05,
author = {Ivana Ljubic and
Ren{\'{e}} Weiskircher and
Ulrich Pferschy and
Gunnar W. Klau and
Petra Mutzel and
Matteo Fischetti},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Solving the Prize-Collecting Steiner Tree Problem to Optimality},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {68--76},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/06iljubic.pdf},
timestamp = {Tue, 30 Jan 2007 13:47:28 +0100},
biburl = {https://dblp.org/rec/conf/alenex/LjubicWPKMF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0010031,
author = {Hans Kellerer and
Ulrich Pferschy and
David Pisinger},
title = {Knapsack problems},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24777-7},
doi = {10.1007/978-3-540-24777-7},
isbn = {978-3-540-40286-2},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0010031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/MansiniP04,
author = {Renata Mansini and
Ulrich Pferschy},
title = {Securitization of Financial Assets: Approximation in Theory and Practice},
journal = {Comput. Optim. Appl.},
volume = {29},
number = {2},
pages = {147--171},
year = {2004},
url = {https://doi.org/10.1023/B:COAP.0000042028.93872.b9},
doi = {10.1023/B:COAP.0000042028.93872.B9},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/MansiniP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KellererP04,
author = {Hans Kellerer and
Ulrich Pferschy},
title = {Improved Dynamic Programming in Connection with an {FPTAS} for the
Knapsack Problem},
journal = {J. Comb. Optim.},
volume = {8},
number = {1},
pages = {5--11},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000021934.29833.6b},
doi = {10.1023/B:JOCO.0000021934.29833.6B},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KellererP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CapraraP04,
author = {Alberto Caprara and
Ulrich Pferschy},
title = {Worst-case analysis of the subset sum algorithm for bin packing},
journal = {Oper. Res. Lett.},
volume = {32},
number = {2},
pages = {159--166},
year = {2004},
url = {https://doi.org/10.1016/S0167-6377(03)00092-0},
doi = {10.1016/S0167-6377(03)00092-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CapraraP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/KlauLMMNPRW04,
author = {Gunnar W. Klau and
Ivana Ljubic and
Andreas Moser and
Petra Mutzel and
Philipp Neuner and
Ulrich Pferschy and
G{\"{u}}nther R. Raidl and
Ren{\'{e}} Weiskircher},
editor = {Kalyanmoy Deb and
Riccardo Poli and
Wolfgang Banzhaf and
Hans{-}Georg Beyer and
Edmund K. Burke and
Paul J. Darwen and
Dipankar Dasgupta and
Dario Floreano and
James A. Foster and
Mark Harman and
Owen Holland and
Pier Luca Lanzi and
Lee Spector and
Andrea Tettamanzi and
Dirk Thierens and
Andrew M. Tyrrell},
title = {Combining a Memetic Algorithm with Integer Programming to Solve the
Prize-Collecting Steiner Tree Problem},
booktitle = {Genetic and Evolutionary Computation - {GECCO} 2004, Genetic and Evolutionary
Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {3102},
pages = {1304--1315},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24854-5\_125},
doi = {10.1007/978-3-540-24854-5\_125},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/KlauLMMNPRW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/CapraraKP03,
author = {Alberto Caprara and
Hans Kellerer and
Ulrich Pferschy},
title = {A 3/4-Approximation Algorithm for Multiple Subset Sum},
journal = {J. Heuristics},
volume = {9},
number = {2},
pages = {99--111},
year = {2003},
url = {https://doi.org/10.1023/A:1022584312032},
doi = {10.1023/A:1022584312032},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/CapraraKP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KellererMPS03,
author = {Hans Kellerer and
Renata Mansini and
Ulrich Pferschy and
Maria Grazia Speranza},
title = {An efficient fully polynomial approximation scheme for the Subset-Sum
Problem},
journal = {J. Comput. Syst. Sci.},
volume = {66},
number = {2},
pages = {349--370},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00006-0},
doi = {10.1016/S0022-0000(03)00006-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KellererMPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KlauLMPW03,
author = {Gunnar W. Klau and
Ivana Ljubic and
Petra Mutzel and
Ulrich Pferschy and
Ren{\'{e}} Weiskircher},
editor = {Giuseppe Di Battista and
Uri Zwick},
title = {The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended
Abstract},
booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,
Hungary, September 16-19, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2832},
pages = {691--702},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39658-1\_62},
doi = {10.1007/978-3-540-39658-1\_62},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/KlauLMPW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/ErlebachKP02,
author = {Thomas Erlebach and
Hans Kellerer and
Ulrich Pferschy},
title = {Approximating Multiobjective Knapsack Problems},
journal = {Manag. Sci.},
volume = {48},
number = {12},
pages = {1603--1612},
year = {2002},
url = {https://doi.org/10.1287/mnsc.48.12.1603.445},
doi = {10.1287/MNSC.48.12.1603.445},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/ErlebachKP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/CapraraKP01,
author = {Alberto Caprara and
Hans Kellerer and
Ulrich Pferschy},
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Approximation Schemes for Ordered Vector Packing Problems},
booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms
and Techniques, 4th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2001 and 5th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2129},
pages = {63--74},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4\_11},
doi = {10.1007/3-540-44666-4\_11},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/CapraraKP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ErlebachKP01,
author = {Thomas Erlebach and
Hans Kellerer and
Ulrich Pferschy},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Approximating Multi-objective Knapsack Problems},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {210--221},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_20},
doi = {10.1007/3-540-44634-6\_20},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/ErlebachKP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CapraraKPP00,
author = {Alberto Caprara and
Hans Kellerer and
Ulrich Pferschy and
David Pisinger},
title = {Approximation algorithms for knapsack problems with cardinality constraints},
journal = {Eur. J. Oper. Res.},
volume = {123},
number = {2},
pages = {333--345},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00261-1},
doi = {10.1016/S0377-2217(99)00261-1},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/CapraraKPP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CapraraKP00,
author = {Alberto Caprara and
Hans Kellerer and
Ulrich Pferschy},
title = {A {PTAS} for the Multiple Subset Sum Problem with different knapsack
capacities},
journal = {Inf. Process. Lett.},
volume = {73},
number = {3-4},
pages = {111--118},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00010-7},
doi = {10.1016/S0020-0190(00)00010-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CapraraKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/CapraraKP00,
author = {Alberto Caprara and
Hans Kellerer and
Ulrich Pferschy},
title = {The Multiple Subset Sum Problem},
journal = {{SIAM} J. Optim.},
volume = {11},
number = {2},
pages = {308--319},
year = {2000},
url = {https://doi.org/10.1137/S1052623498348481},
doi = {10.1137/S1052623498348481},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/CapraraKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/KellererP99,
author = {Hans Kellerer and
Ulrich Pferschy},
title = {Cardinality constrained bin-packing problems},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {335--348},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018947117526},
doi = {10.1023/A\%3A1018947117526},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/KellererP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Pferschy99,
author = {Ulrich Pferschy},
title = {Dynamic Programming Revisited: Improving Knapsack Algorithms},
journal = {Computing},
volume = {63},
number = {4},
pages = {419--430},
year = {1999},
url = {https://doi.org/10.1007/s006070050042},
doi = {10.1007/S006070050042},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Pferschy99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KellererP99,
author = {Hans Kellerer and
Ulrich Pferschy},
title = {A New Fully Polynomial Time Approximation Scheme for the Knapsack
Problem},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {59--71},
year = {1999},
url = {https://doi.org/10.1023/A:1009813105532},
doi = {10.1023/A:1009813105532},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KellererP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KellererP98,
author = {Hans Kellerer and
Ulrich Pferschy},
editor = {Klaus Jansen and
Dorit S. Hochbaum},
title = {A New Fully Polynomial Approximation Scheme for the Knapsack Problem},
booktitle = {Approximation Algorithms for Combinatorial Optimization, International
Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1444},
pages = {123--134},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0053969},
doi = {10.1007/BFB0053969},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/approx/KellererP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Pferschy97,
author = {Ulrich Pferschy},
title = {Solution Methods and Computational Investigations for the Linear Bottleneck
Assignment Problem},
journal = {Computing},
volume = {59},
number = {3},
pages = {237--258},
year = {1997},
url = {https://doi.org/10.1007/BF02684443},
doi = {10.1007/BF02684443},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Pferschy97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PferschyPW97,
author = {Ulrich Pferschy and
David Pisinger and
Gerhard J. Woeginger},
title = {Simple But Efficient Approaches for the Collapsing Knapsack Problem},
journal = {Discret. Appl. Math.},
volume = {77},
number = {3},
pages = {271--280},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00134-5},
doi = {10.1016/S0166-218X(96)00134-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PferschyPW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BekesiGPW97,
author = {J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
G{\'{a}}bor Galambos and
Ulrich Pferschy and
Gerhard J. Woeginger},
title = {Greedy Algorithms for On-Line Data Compression},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {274--289},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0885},
doi = {10.1006/JAGM.1997.0885},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BekesiGPW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KellererPS97,
author = {Hans Kellerer and
Ulrich Pferschy and
Maria Grazia Speranza},
editor = {Hon Wai Leong and
Hiroshi Imai and
Sanjay Jain},
title = {An Efficient Approximation Scheme for the Subset-Sum Problem},
booktitle = {Algorithms and Computation, 8th International Symposium, {ISAAC} '97,
Singapore, December 17-19, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1350},
pages = {394--403},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63890-3\_42},
doi = {10.1007/3-540-63890-3\_42},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KellererPS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/BesiGPW96,
author = {J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
G{\'{a}}bor Galambos and
Ulrich Pferschy and
Gerhard J. Woeginger},
title = {The Fractional Greedy Algorithm for Data Compression},
journal = {Computing},
volume = {56},
number = {1},
pages = {29--46},
year = {1996},
url = {https://doi.org/10.1007/BF02238290},
doi = {10.1007/BF02238290},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/BesiGPW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cococ/BekesiGPW95,
author = {J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
G{\'{a}}bor Galambos and
Ulrich Pferschy and
Gerhard J. Woeginger},
editor = {Michel Deza and
Reinhardt Euler and
Yannis Manoussakis},
title = {Worst-Case Analysis for On-Line Data Compression},
booktitle = {Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese
Conference, Brest, France, July 3-5, 1995, Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {1120},
pages = {288--300},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-61576-8\_90},
doi = {10.1007/3-540-61576-8\_90},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cococ/BekesiGPW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Pferschy95,
author = {Ulrich Pferschy},
editor = {Egon Balas and
Jens Clausen},
title = {The Random Linear Bottleneck Assignment Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 4th International
{IPCO} Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {920},
pages = {145--156},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59408-6\_48},
doi = {10.1007/3-540-59408-6\_48},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Pferschy95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/PferschyWY94,
author = {Ulrich Pferschy and
Gerhard J. Woeginger and
En{-}Yu Yao},
title = {Partitioning Graphs into Two Trees},
journal = {Acta Cybern.},
volume = {11},
number = {3},
pages = {233--240},
year = {1994},
url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3431},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/PferschyWY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/PferschyT94,
author = {Ulrich Pferschy and
Hoang Tuy},
title = {Linear programs with an additional rank two reverse convex constraint},
journal = {J. Glob. Optim.},
volume = {4},
number = {4},
pages = {441--454},
year = {1994},
url = {https://doi.org/10.1007/BF01099268},
doi = {10.1007/BF01099268},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/PferschyT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/PferschyRW94,
author = {Ulrich Pferschy and
R{\"{u}}diger Rudolf and
Gerhard J. Woeginger},
title = {Some Geometric Clustering Problems},
journal = {Nord. J. Comput.},
volume = {1},
number = {2},
pages = {246--263},
year = {1994},
timestamp = {Thu, 19 Feb 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/PferschyRW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PferschyRW94,
author = {Ulrich Pferschy and
R{\"{u}}diger Rudolf and
Gerhard J. Woeginger},
title = {Monge matrices make maximization manageable},
journal = {Oper. Res. Lett.},
volume = {16},
number = {5},
pages = {245--254},
year = {1994},
url = {https://doi.org/10.1016/0167-6377(94)90037-X},
doi = {10.1016/0167-6377(94)90037-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PferschyRW94.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-04-26 00:01 CEST 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:
