Narrow search
Showing 1 - 10 of 11
Cover Image
A characterization of the single-crossing domain
Bredereck, Robert; Chen, Jiehua; Woeginger, Gerhard J. - In: Social choice and welfare 41 (2013) 4, pp. 989-998
Persistent link: https://www.econbiz.de/10010251813
Cover Image
The one-dimensional Euclidean domain : finitely many obstructions are not enough
Chen, Jiehua; Pruhs, Kirk R.; Woeginger, Gerhard J. - In: Social choice and welfare 48 (2017) 2, pp. 409-432
Persistent link: https://www.econbiz.de/10011885528
Cover Image
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Moser, Hannes; Niedermeier, Rolf; Sorge, Manuel - In: Journal of combinatorial optimization 24 (2012) 3, pp. 347-373
Persistent link: https://www.econbiz.de/10009657496
Cover Image
Constant-factor approximations for capacitated arc routing without triangle inequality
Van Bevern, René; Hartung, Sepp; Nichterlein, André; … - In: Operations research letters 42 (2014) 4, pp. 290-292
Persistent link: https://www.econbiz.de/10010396159
Cover Image
Scheduling two agents on a single machine : a parameterized analysis of NP-hard problems
Hermelin, Danny; Kubitza, Judith-Madeleine; Shabtay, Dvir; … - In: Omega : the international journal of management science 83 (2018), pp. 275-286
Persistent link: https://www.econbiz.de/10011989184
Cover Image
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Hermelin, Danny; Shabtay, Dvir; Talmon, Nimrod - In: Journal of scheduling 22 (2019) 6, pp. 663-676
Persistent link: https://www.econbiz.de/10012125311
Cover Image
On the parameterized tractability of single machine scheduling with rejection
Hermelin, Danny; Pinedo, Michael; Shabtay, Dvir; … - In: European journal of operational research : EJOR 273 (2019) 1, pp. 67-73
Persistent link: https://www.econbiz.de/10011979416
Cover Image
Equitable scheduling on a single machine
Heeger, Klaus; Hermelin, Danny; Mertzios, George B.; … - In: Journal of scheduling : JOS 26 (2023) 2, pp. 209-225
Persistent link: https://www.econbiz.de/10014265759
Cover Image
Minimizing the weighted number of tardy jobs via (max,+)-convolutions
Hermelin, Danny; Molter, Hendrik; Shabtay, Dvir - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 3, pp. 836-848
Persistent link: https://www.econbiz.de/10014634767
Cover Image
Serial batching to minimize the weighted number of tardy jobs
Hermelin, Danny; Mnich, Matthias; Omlor, Simon - In: Journal of scheduling : JOS 27 (2024) 6, pp. 545-556
Persistent link: https://www.econbiz.de/10015123336