Gaia Nicosia

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 28

Top Topics

Scheduling Problem

Top Venues

Eur. J. Oper. Res.

Electron. Notes Discret. Math.

Publications

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 (2024)
Paolo Detti, Gaia Nicosia, Andrea Pacifici
Robust job-sequencing with an uncertain flexible maintenance activity. Comput. Ind. Eng. 185 (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 (2023)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini
Optimally rescheduling jobs with a LIFO buffer. CoRR (2021)
Salvatore Foderaro, Maurizio Naldi, Gaia Nicosia, Andrea Pacifici
Planning a Mass Vaccination Campaign with Balanced Staff Engagement. ISM@FedCSIS (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) (2021)
Salvatore Foderaro, Maurizio Naldi, Gaia Nicosia, Andrea Pacifici
Mass Vaccine Administration under Uncertain Supply Scenarios. FedCSIS (2021)
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer
On the Stackelberg knapsack game. Eur. J. Oper. Res. 291 (1) (2021)
Paolo Detti, Gaia Nicosia, Andrea Pacifici, Garazi Zabalo Manrique de Lara
Robust single machine scheduling with a flexible maintenance activity. Comput. Oper. Res. 107 (2019)
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
A Stackelberg knapsack game with weight control. Theor. Comput. Sci. 799 (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) (2019)
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
On a Stackelberg Subset Sum Game. CoRR (2018)
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
On a Stackelberg Subset Sum Game. Electron. Notes Discret. Math. 69 (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 (2018)
Maurizio Naldi, Andrea Pacifici, Alessio Tagliacozzo, Gaia Nicosia
Build or Merge: Locational Decisions in Mobile Access Networks. UKSim (2018)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Competitive multi-agent scheduling with an iterative selection rule. 4OR 16 (1) (2018)
Marco Di Bartolomeo, Enrico Grande, Gaia Nicosia, Andrea Pacifici
Cheapest paths in dynamic networks. Networks 69 (1) (2017)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Price of Fairness for allocating a bounded resource. Eur. J. Oper. Res. 257 (3) (2017)
Gaia Nicosia, Andrea Pacifici
Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines. Int. J. Prod. Res. 55 (6) (2017)
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)
Enrico Grande, Gaia Nicosia, Andrea Pacifici
Minimum cost paths over dynamic networks. Electron. Notes Discret. Math. 52 (2016)
Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Maximin Fairness-profit Tradeoff in Project Budget Allocation. CENTERIS/ProjMAN/HCist (2016)
Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Maximin Fairness in Project Budget Allocation. Electron. Notes Discret. Math. 55 (2016)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Two agent scheduling with a central selection mechanism. Theor. Comput. Sci. 596 (2015)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Price of Fairness for Multiagent Subset Sum Problems. CTW (2015)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Brief Announcement: On the Fair Subset Sum Problem. SAGT (2015)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Price of Fairness for Allocating a Bounded Resource. CoRR (2015)
Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Scheduling two agent task chains with a central selection mechanism. J. Sched. 18 (3) (2015)
Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer
The Subset Sum game. Eur. J. Oper. Res. 233 (3) (2014)
Ulrich Faigle, Gaia Nicosia, Andrea Pacifici
Preface. Discret. Appl. Math. 165 (2014)
Marta Flamini, Gaia Nicosia, Andrea Pacifici
Cyclic Schedules for Pipeline Assembly Processes. UKSim (2014)
Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Two Agents Competing for a Shared Machine. ADT (2013)
Claudia Marini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Strategies in competing subset selection. Ann. Oper. Res. 207 (1) (2013)
Giuseppina Falcone, Gaia Nicosia, Andrea Pacifici
Minimizing Part Transfer Costs in Flexible Manufacturing Systems: A Computational Study on Different Lower Bounds. UKSim (2013)
Gaia Nicosia, Andrea Pacifici
Scheduling Tasks with Comb Precedence Constraints on Dedicated Machines. MIM (2013)
Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici
Parallel dedicated machines scheduling with chain precedence constraints. Eur. J. Oper. Res. 221 (2) (2012)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Strategies for Single-machine Multi-agent Scheduling Problems. CTW (2012)
Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici
Scheduling Two Chains on Parallel Dedicated Machines. CTW (2012)
Paolo Detti, Gaia Nicosia, Andrea Pacifici, Mara Servilio
Optimal power control in OFDMA cellular networks. Networks 57 (3) (2011)
Alessandro Agnetis, Marta Flamini, Gaia Nicosia, Andrea Pacifici
A job-shop problem with one additional resource type. J. Sched. 14 (3) (2011)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Competitive subset selection with two agents. Discret. Appl. Math. 159 (16) (2011)
Michele Flammini, Gaia Nicosia
-server problem. ACM Trans. Algorithms 7 (1) (2010)
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità
Stable routing under the Spanning Tree Protocol. Oper. Res. Lett. 38 (5) (2010)
Alessandro Agnetis, Marta Flamini, Gaia Nicosia, Andrea Pacifici
Scheduling three chains on two parallel machines. Eur. J. Oper. Res. 202 (3) (2010)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
On Multi-Agent Knapsack Problems. CTW (2009)
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Subset Weight Maximization with Two Competing Agents. ADT (2009)
Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia
Single-Machine Scheduling Problems with Generalized Preemption. INFORMS J. Comput. 21 (1) (2009)
Andrea Abrardo, Paolo Detti, Gaia Nicosia, Andrea Pacifici, Mara Servilio
Cellular radio resource allocation problem. CTW (2008)
Paola Iovanna, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità, Ezio Sperduto
Local Restoration for Trees and Arborescences. FITraMEn (2008)
Andrea Abrardo, Paolo Detti, Gaia Nicosia, Andrea Pacifici, Mara Servilio
Optimum Channel Allocation in OFDMA Multi-cell Systems. NET-COOP (2008)
Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5 (1) (2007)
Arianna Alfieri, Gaia Nicosia
Minimum cost multi-product flow lines. Ann. Oper. Res. 150 (1) (2007)
Arianna Alfieri, Gaia Nicosia, Andrea Pacifici
Exact algorithms for a discrete metric labeling problem. Discret. Optim. 3 (3) (2006)
Michele Flammini, Alfredo Navarra, Gaia Nicosia
-server problem and online applications. J. Discrete Algorithms 4 (3) (2006)
Michele Flammini, Gaia Nicosia
Competitive algorithms for the bicriteria k-server problem. Discret. Appl. Math. 154 (15) (2006)
Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia
A heuristic approach to batching and scheduling a single machine to minimize setup costs. Comput. Ind. Eng. 46 (4) (2004)
Gaia Nicosia, Andrea Pacifici
Exact algorithms for a discrete metric labeling problem. Electron. Notes Discret. Math. 17 (2004)
Gaia Nicosia, Andrea Pacifici
Exact Algorithms for a Discrete Metric Labeling Problem. CTW (2004)
Ludovica Adacher, Gaia Nicosia
A Decentralized Route Guidance Algorithm in Urban Transportation Networks. ICINCO (1) (2004)
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
Online Load Balancing Made Simple: Greedy Strikes Back. ICALP (2003)
Gaia Nicosia, Gianpaolo Oriolo
An approximate A* algorithm and its application to the SCS problem. Theor. Comput. Sci. 290 (3) (2003)
Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia
Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs. J. Sched. 6 (1) (2003)
Gaia Nicosia, Dario Pacciarelli, Andrea Pacifici
Optimally balancing assembly lines with different workstations. Discret. Appl. Math. 118 (1-2) (2002)
Giorgio Gambosi, Gaia Nicosia
On-line scheduling with setup costs. Inf. Process. Lett. 73 (1-2) (2000)
Michele Flammini, Gaia Nicosia
On Multicriteria Online Problems. ESA (2000)