default search action
Gaia Nicosia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j40]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
- [j39]Alessandro Agnetis
, Matteo Cosmi
Two is better than one? Order aggregation in a meal delivery scheduling problem. Comput. Ind. Eng. 183: 109514 (2023) - [j38]Paolo Detti, Gaia Nicosia
Robust job-sequencing with an uncertain flexible maintenance activity. Comput. Ind. Eng. 185: 109610 (2023) - 2021
- [j37]Ulrich Pferschy, Gaia Nicosia
On the Stackelberg knapsack game. Eur. J. Oper. Res. 291(1): 18-31 (2021) - [j36]Gaia Nicosia
Optimally rescheduling jobs with a Last-In-First-Out buffer. J. Sched. 24(6): 663-680 (2021) - [c21]Salvatore Foderaro, Maurizio Naldi
Planning a Mass Vaccination Campaign with Balanced Staff Engagement. ISM@FedCSIS 2021: 97-116 - [c20]Salvatore Foderaro, Maurizio Naldi, Gaia Nicosia
Mass Vaccine Administration under Uncertain Supply Scenarios. FedCSIS 2021: 393-402 - [i4]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini:
Optimally rescheduling jobs with a LIFO buffer. CoRR abs/2106.15901 (2021)
2010 – 2019
- 2019
- [j35]Paolo Detti
Robust single machine scheduling with a flexible maintenance activity. Comput. Oper. Res. 107: 19-31 (2019) - [j34]Alessandro Agnetis, Bo Chen
Price of fairness in two-agent single-machine scheduling problems. Eur. J. Oper. Res. 276(1): 79-87 (2019) - [j33]Ulrich Pferschy, Gaia Nicosia
A Stackelberg knapsack game with weight control. Theor. Comput. Sci. 799: 149-159 (2019) - 2018
- [j32]Gaia Nicosia
Competitive multi-agent scheduling with an iterative selection rule. 4OR 16(1): 15-29 (2018) - [j31]Enrico Grande, Gaia Nicosia
An exact algorithm for a multicommodity min-cost flow over time problem. Electron. Notes Discret. Math. 64: 125-134 (2018) - [j30]Ulrich Pferschy, Gaia Nicosia
On a Stackelberg Subset Sum Game. Electron. Notes Discret. Math. 69: 133-140 (2018) - [c19]Maurizio Naldi, Andrea Pacifici, Alessio Tagliacozzo, Gaia Nicosia
Build or Merge: Locational Decisions in Mobile Access Networks. UKSim 2018: 133-138 - [i3]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
On a Stackelberg Subset Sum Game. CoRR abs/1801.03698 (2018) - 2017
- [j29]Gaia Nicosia
Price of Fairness for allocating a bounded resource. Eur. J. Oper. Res. 257(3): 933-943 (2017) - [j28]Gaia Nicosia
Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines. Int. J. Prod. Res. 55(6): 1680-1691 (2017) - [j27]Marco Di Bartolomeo, Enrico Grande, Gaia Nicosia
Cheapest paths in dynamic networks. Networks 69(1): 23-32 (2017) - 2016
- [j26]Enrico Grande, Gaia Nicosia
Minimum cost paths over dynamic networks. Electron. Notes Discret. Math. 52: 343-350 (2016) - [j25]Maurizio Naldi, Gaia Nicosia
Maximin Fairness in Project Budget Allocation. Electron. Notes Discret. Math. 55: 65-68 (2016) - [c18]Maurizio Naldi, Gaia Nicosia
Maximin Fairness-profit Tradeoff in Project Budget Allocation. CENTERIS/ProjMAN/HCist 2016: 313-320 - [c17]Maurizio Naldi, Gaia Nicosia
A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models. EMS 2016: 85-90 - 2015
- [j24]Alessandro Agnetis
Scheduling two agent task chains with a central selection mechanism. J. Sched. 18(3): 243-261 (2015) - [j23]Gaia Nicosia
Two agent scheduling with a central selection mechanism. Theor. Comput. Sci. 596: 109-123 (2015) - [c16]Gaia Nicosia
Brief Announcement: On the Fair Subset Sum Problem. SAGT 2015: 309-311 - [i2]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for Multiagent Subset Sum Problems. CTW 2015: 55-58 - [i1]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for Allocating a Bounded Resource. CoRR abs/1508.05253 (2015) - 2014
- [j22]Ulrich Faigle, Gaia Nicosia
Preface. Discret. Appl. Math. 165: 1 (2014) - [j21]Andreas Darmann, Gaia Nicosia
The Subset Sum game. Eur. J. Oper. Res. 233(3): 539-549 (2014) - [c15]Marta Flamini
Cyclic Schedules for Pipeline Assembly Processes. UKSim 2014: 221-226 - 2013
- [j20]Claudia Marini, Gaia Nicosia
Strategies in competing subset selection. Ann. Oper. Res. 207(1): 181-200 (2013) - [c14]Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Two Agents Competing for a Shared Machine. ADT 2013: 1-14 - [c13]Gaia Nicosia
Scheduling Tasks with Comb Precedence Constraints on Dedicated Machines. MIM 2013: 430-435 - [c12]Giuseppina Falcone, Gaia Nicosia
Minimizing Part Transfer Costs in Flexible Manufacturing Systems: A Computational Study on Different Lower Bounds. UKSim 2013: 359-364 - 2012
- [j19]Alessandro Agnetis
Parallel dedicated machines scheduling with chain precedence constraints. Eur. J. Oper. Res. 221(2): 296-305 (2012) - [c11]Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici:
Scheduling Two Chains on Parallel Dedicated Machines. CTW 2012: 9-12 - [c10]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Strategies for Single-machine Multi-agent Scheduling Problems. CTW 2012: 197-200 - 2011
- [j18]Gaia Nicosia
Competitive subset selection with two agents. Discret. Appl. Math. 159(16): 1865-1877 (2011) - [j17]Paolo Detti
Optimal power control in OFDMA cellular networks. Networks 57(3): 200-211 (2011) - [j16]Alessandro Agnetis
A job-shop problem with one additional resource type. J. Sched. 14(3): 225-237 (2011) - [e1]Ludovica Adacher, Marta Flamini, Gianmaria Leo, Gaia Nicosia, Andrea Pacifici, Veronica Piccialli:
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011. 2011 [contents] - 2010
- [j15]Alessandro Agnetis
Scheduling three chains on two parallel machines. Eur. J. Oper. Res. 202(3): 669-674 (2010) - [j14]Fabrizio Grandoni
Stable routing under the Spanning Tree Protocol. Oper. Res. Lett. 38(5): 399-404 (2010) - [j13]Michele Flammini
On the bicriteria k-server problem. ACM Trans. Algorithms 7(1): 6:1-6:19 (2010)
2000 – 2009
- 2009
- [j12]Alessandro Agnetis
Single-Machine Scheduling Problems with Generalized Preemption. INFORMS J. Comput. 21(1): 1-12 (2009) - [c9]Gaia Nicosia
Subset Weight Maximization with Two Competing Agents. ADT 2009: 74-85 - [c8]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
On Multi-Agent Knapsack Problems. CTW 2009: 44-47 - 2008
- [c7]Andrea Abrardo, Paolo Detti, Gaia Nicosia, Andrea Pacifici, Mara Servilio:
Cellular radio resource allocation problem. CTW 2008: 39-42 - [c6]Paola Iovanna, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità, Ezio Sperduto:
Local Restoration for Trees and Arborescences. FITraMEn 2008: 130-140 - [c5]Andrea Abrardo, Paolo Detti
Optimum Channel Allocation in OFDMA Multi-cell Systems. NET-COOP 2008: 103-111 - 2007
- [j11]Arianna Alfieri, Gaia Nicosia
Minimum cost multi-product flow lines. Ann. Oper. Res. 150(1): 31-46 (2007) - [j10]Pilu Crescenzi
On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5(1): 162-175 (2007) - 2006
- [j9]Michele Flammini
Competitive algorithms for the bicriteria k-server problem. Discret. Appl. Math. 154(15): 2117-2127 (2006) - [j8]Arianna Alfieri, Gaia Nicosia
Exact algorithms for a discrete metric labeling problem. Discret. Optim. 3(3): 181-194 (2006) - [j7]Michele Flammini
Efficient offline algorithms for the bicriteria k-server problem and online applications. J. Discrete Algorithms 4(3): 414-432 (2006) - 2004
- [j6]Alessandro Agnetis
A heuristic approach to batching and scheduling a single machine to minimize setup costs. Comput. Ind. Eng. 46(4): 793-802 (2004) - [j5]Gaia Nicosia
Exact algorithms for a discrete metric labeling problem. Electron. Notes Discret. Math. 17: 223-227 (2004) - [c4]Gaia Nicosia, Andrea Pacifici:
Exact Algorithms for a Discrete Metric Labeling Problem. CTW 2004: 196-200 - [c3]Ludovica Adacher, Gaia Nicosia:
A Decentralized Route Guidance Algorithm in Urban Transportation Networks. ICINCO (1) 2004: 318-321 - 2003
- [j4]Alessandro Agnetis
Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs. J. Sched. 6(1): 87-108 (2003) - [j3]Gaia Nicosia
An approximate A* algorithm and its application to the SCS problem. Theor. Comput. Sci. 290(3): 2021-2029 (2003) - [c2]Pierluigi Crescenzi
Online Load Balancing Made Simple: Greedy Strikes Back. ICALP 2003: 1108-1122 - 2002
- [j2]Gaia Nicosia
Optimally balancing assembly lines with different workstations. Discret. Appl. Math. 118(1-2): 99-113 (2002) - 2000
- [j1]Giorgio Gambosi, Gaia Nicosia
On-line scheduling with setup costs. Inf. Process. Lett. 73(1-2): 61-68 (2000) - [c1]Michele Flammini, Gaia Nicosia:
On Multicriteria Online Problems. ESA 2000: 191-201
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-08-03 20:11 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: