default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 66 matches
- 2024
- Claudio Gentile, Gaia Nicosia, Andrea Pacifici, Giuseppe Stecca, Paolo Ventura:
Preface: 18th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2020). Discret. Appl. Math. 354: 1-2 (2024) - 2023
- Alessandro Agnetis, Matteo Cosmi, Gaia Nicosia, Andrea Pacifici:
Two is better than one? Order aggregation in a meal delivery scheduling problem. Comput. Ind. Eng. 183: 109514 (2023) - Paolo Detti, Gaia Nicosia, Andrea Pacifici:
Robust job-sequencing with an uncertain flexible maintenance activity. Comput. Ind. Eng. 185: 109610 (2023) - 2021
- Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer:
On the Stackelberg knapsack game. Eur. J. Oper. Res. 291(1): 18-31 (2021) - Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini:
Optimally rescheduling jobs with a Last-In-First-Out buffer. J. Sched. 24(6): 663-680 (2021) - Salvatore Foderaro, Maurizio Naldi, Gaia Nicosia, Andrea Pacifici:
Mass Vaccine Administration under Uncertain Supply Scenarios. FedCSIS 2021: 393-402 - Salvatore Foderaro, Maurizio Naldi, Gaia Nicosia, Andrea Pacifici:
Planning a Mass Vaccination Campaign with Balanced Staff Engagement. ISM@FedCSIS 2021: 97-116 - Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini:
Optimally rescheduling jobs with a LIFO buffer. CoRR abs/2106.15901 (2021) - 2019
- Paolo Detti, Gaia Nicosia, Andrea Pacifici, Garazi Zabalo Manrique de Lara:
Robust single machine scheduling with a flexible maintenance activity. Comput. Oper. Res. 107: 19-31 (2019) - Alessandro Agnetis, Bo Chen, Gaia Nicosia, Andrea Pacifici:
Price of fairness in two-agent single-machine scheduling problems. Eur. J. Oper. Res. 276(1): 79-87 (2019) - Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
A Stackelberg knapsack game with weight control. Theor. Comput. Sci. 799: 149-159 (2019) - 2018
- Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Competitive multi-agent scheduling with an iterative selection rule. 4OR 16(1): 15-29 (2018) - Enrico Grande, Gaia Nicosia, Andrea Pacifici, Vincenzo Roselli:
An exact algorithm for a multicommodity min-cost flow over time problem. Electron. Notes Discret. Math. 64: 125-134 (2018) - Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
On a Stackelberg Subset Sum Game. Electron. Notes Discret. Math. 69: 133-140 (2018) - Maurizio Naldi, Andrea Pacifici, Alessio Tagliacozzo, Gaia Nicosia:
Build or Merge: Locational Decisions in Mobile Access Networks. UKSim 2018: 133-138 - Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
On a Stackelberg Subset Sum Game. CoRR abs/1801.03698 (2018) - 2017
- Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for allocating a bounded resource. Eur. J. Oper. Res. 257(3): 933-943 (2017) - Gaia Nicosia, Andrea Pacifici:
Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines. Int. J. Prod. Res. 55(6): 1680-1691 (2017) - Marco Di Bartolomeo, Enrico Grande, Gaia Nicosia, Andrea Pacifici:
Cheapest paths in dynamic networks. Networks 69(1): 23-32 (2017) - 2016
- Enrico Grande, Gaia Nicosia, Andrea Pacifici:
Minimum cost paths over dynamic networks. Electron. Notes Discret. Math. 52: 343-350 (2016) - Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Maximin Fairness in Project Budget Allocation. Electron. Notes Discret. Math. 55: 65-68 (2016) - Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Maximin Fairness-profit Tradeoff in Project Budget Allocation. CENTERIS/ProjMAN/HCist 2016: 313-320 - Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Bernhard Leder:
A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models. EMS 2016: 85-90 - 2015
- Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Scheduling two agent task chains with a central selection mechanism. J. Sched. 18(3): 243-261 (2015) - Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Two agent scheduling with a central selection mechanism. Theor. Comput. Sci. 596: 109-123 (2015) - Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Brief Announcement: On the Fair Subset Sum Problem. SAGT 2015: 309-311 - Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for Multiagent Subset Sum Problems. CTW 2015: 55-58 - Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for Allocating a Bounded Resource. CoRR abs/1508.05253 (2015) - 2014
- Ulrich Faigle, Gaia Nicosia, Andrea Pacifici:
Preface. Discret. Appl. Math. 165: 1 (2014) - Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer:
The Subset Sum game. Eur. J. Oper. Res. 233(3): 539-549 (2014)
skipping 36 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-15 19:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint