default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim Schauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Nina Chiarelli
, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica 85(5): 1459-1489 (2023)- [j18]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer:
Fair allocation algorithms for indivisible items under structured conflict constraints. Comput. Appl. Math. 42(7): 302 (2023) - [j17]Toni Böhnlein, Oliver Schaudt, Joachim Schauer:
Stackelberg packing games. Theor. Comput. Sci. 943: 16-35 (2023) - [c14]Francesco Corti, Christopher Hinterer, Julian Rudolf, Balz Maag, Joachim Schauer, Olga Saukh:
Poster: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints on IoT Devices. EWSN 2023: 301-302 - [c13]Sayyidshahab Nabavi, Joachim Schauer:
Poster Abstract: Anchor Placement Optimization for Area-Based Localization Using Tabu Search Algorithm. EWSN 2023: 305-306 - [i7]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer:
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR abs/2308.09399 (2023) - [i6]Francesco Corti, Balz Maag, Joachim Schauer, Ulrich Pferschy, Olga Saukh:
REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints. CoRR abs/2311.13349 (2023) - 2021
- [j16]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer:
On the Stackelberg knapsack game. Eur. J. Oper. Res. 291(1): 18-31 (2021) - [j15]Ulrich Pferschy, Joachim Schauer, Clemens Thielen:
Approximating the product knapsack problem. Optim. Lett. 15(8): 2529-2540 (2021) - 2020
- [c12]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair Packing of Independent Sets. IWOCA 2020: 154-165 - [i5]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair packing of independent sets. CoRR abs/2003.11313 (2020)
2010 – 2019
- 2019
- [c11]Toni Böhnlein, Oliver Schaudt, Joachim Schauer:
Stackelberg Packing Games. WADS 2019: 239-253 - [i4]Ulrich Pferschy, Joachim Schauer, Clemens Thielen:
The Product Knapsack Problem: Approximation and Complexity. CoRR abs/1901.00695 (2019) - 2018
- [j14]Ulrich Pferschy, Joachim Schauer:
Order Batching and Routing in a Non-Standard Warehouse. Electron. Notes Discret. Math. 69: 125-132 (2018) - [j13]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group activity selection problem with approval preferences. Int. J. Game Theory 47(3): 767-796 (2018) - 2017
- [j12]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
On the Shortest Path Game. Discret. Appl. Math. 217: 3-18 (2017) - [j11]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The shortest connection game. Discret. Appl. Math. 231: 139-154 (2017) - [j10]Ulrich Pferschy, Joachim Schauer:
Approximation of knapsack problems with conflict and forcing graphs. J. Comb. Optim. 33(4): 1300-1323 (2017) - 2016
- [j9]Joachim Schauer:
Asymptotic behavior of the quadratic knapsack problem. Eur. J. Oper. Res. 255(2): 357-363 (2016) - [j8]Ulrich Pferschy, Joachim Schauer:
Approximation of the Quadratic Knapsack Problem. INFORMS J. Comput. 28(2): 308-318 (2016) - 2015
- [j7]Andreas Darmann, Joachim Schauer:
Maximizing Nash product social welfare in allocating indivisible goods. Eur. J. Oper. Res. 247(2): 548-559 (2015) - [c10]Tobias Kreiter, Ulrich Pferschy, Joachim Schauer:
Personnel Planning with Multi-tasking and Structured Qualifications. OR 2015: 597-603 - [i3]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
On the shortest path game: extended version. CoRR abs/1506.00462 (2015) - [i2]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The Shortest Connection Game. CoRR abs/1511.07847 (2015) - 2014
- [j6]Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer:
The Subset Sum game. Eur. J. Oper. Res. 233(3): 539-549 (2014) - [c9]Ulrich Pferschy, Joachim Schauer, Gerhild Maier:
A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign. ICORES (Selected Papers) 2014: 251-264 - [c8]Ulrich Pferschy, Joachim Schauer, Gerhild Maier:
Media Mix Optimization - Applying a Quadratic Knapsack Model. ICORES 2014: 363-370 - [c7]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The Shortest Path Game: Complexity and Algorithms. IFIP TCS 2014: 39-53 - [i1]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. CoRR abs/1401.8151 (2014) - 2013
- [j5]Ulrich Pferschy, Joachim Schauer:
The maximum flow problem with disjunctive constraints. J. Comb. Optim. 26(1): 109-119 (2013) - [j4]Joachim Schauer, Cornelius Schwarz:
Job-shop scheduling in a body shop. J. Sched. 16(2): 215-229 (2013) - [c6]Ulrich Pferschy, Joachim Schauer:
Approximating the Quadratic Knapsack Problem on Special Graph Classes. WAOA 2013: 61-72 - 2012
- [c5]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. WINE 2012: 156-169 - 2011
- [j3]Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger:
Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159(16): 1726-1735 (2011) - [c4]Ulrich Pferschy, Joachim Schauer:
The Maximum Flow Problem with Conflict and Forcing Conditions. INOC 2011: 289-294 - 2010
- [j2]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
Resource allocation with time intervals. Theor. Comput. Sci. 411(49): 4217-4234 (2010)
2000 – 2009
- 2009
- [j1]Ulrich Pferschy, Joachim Schauer:
The Knapsack Problem with Conflict Graphs. J. Graph Algorithms Appl. 13(2): 233-249 (2009) - [c3]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT 2009: 414-423 - [c2]Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger:
Combinatorial Optimization Problems with Conflict Graphs. CTW 2009: 293-296 - 2006
- [c1]Bettina Klinz, Ulrich Pferschy, Joachim Schauer:
ILP Models for a Nurse Scheduling Problem. OR 2006: 319-324
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 01:00 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:
