Nondominated Schedules for a Job-Shop with Two Competing Users. - Alessandro Agnetis; Pitu B. Mirchandani; Dario Pacciarelli; Andrea Pacifici (Comput. Math. Organ. Theory, 2000)

Optimally balancing assembly lines with different workstations. - Gaia Nicosia; Dario Pacciarelli; Andrea Pacifici (Discret. Appl. Math., 2002)

A reconfigurable channel codec coprocessor for software radio multimedia applications. - Andrea Pacifici; C. Vendetti; Fabrizio Frescura; Saverio Cacopardi (ISCAS (2), 2003)

Exact algorithms for a discrete metric labeling problem. - Gaia Nicosia; Andrea Pacifici (Electron. Notes Discret. Math., 2004)

Scheduling Problems with Two Competing Agents. - Alessandro Agnetis; Pitu B. Mirchandani; Dario Pacciarelli; Andrea Pacifici (Oper. Res., 2004)

Exact algorithms for a discrete metric labeling problem. - Arianna Alfieri; Gaia Nicosia; Andrea Pacifici (Discret. Optim., 2006)

Multi-agent single machine scheduling. - Alessandro Agnetis; Dario Pacciarelli; Andrea Pacifici (Ann. Oper. Res., 2007)

Cellular radio resource allocation problem. - Andrea Abrardo; Paolo Detti; Gaia Nicosia; Andrea Pacifici; Mara Servilio (CTW, 2008)

Optimum Channel Allocation in OFDMA Multi-cell Systems. - Andrea Abrardo; Paolo Detti; Gaia Nicosia; Andrea Pacifici; Mara Servilio (NET-COOP, 2008)

Subset Weight Maximization with Two Competing Agents. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (ADT, 2009)

Column Generation for the Multicommodity Min-cost Flow Over Time Problem. - Enrico Grande; Pitu B. Mirchandani; Andrea Pacifici (CTW, 2009)

On Multi-Agent Knapsack Problems. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (CTW, 2009)

Covering a line segment with variable radius discs. - Alessandro Agnetis; Enrico Grande; Pitu B. Mirchandani; Andrea Pacifici (Comput. Oper. Res., 2009)

Optimal sequence of free traffic offers in mixed fee-consumption pricing packages. - Maurizio Naldi; Andrea Pacifici (Decis. Support Syst., 2010)

Scheduling three chains on two parallel machines. - Alessandro Agnetis; Marta Flamini; Gaia Nicosia; Andrea Pacifici (Eur. J. Oper. Res., 2010)

Competitive subset selection with two agents. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Discret. Appl. Math., 2011)

Projected Perspective Reformulations with Applications in Design Problems. - Antonio Frangioni; Claudio Gentile; Enrico Grande; Andrea Pacifici (Oper. Res., 2011)

Optimal power control in OFDMA cellular networks. - Paolo Detti; Gaia Nicosia; Andrea Pacifici; Mara Servilio (Networks, 2011)

A job-shop problem with one additional resource type. - Alessandro Agnetis; Marta Flamini; Gaia Nicosia; Andrea Pacifici (J. Sched., 2011)

Scheduling Two Chains on Parallel Dedicated Machines. - Alessandro Agnetis; Hans Kellerer; Gaia Nicosia; Andrea Pacifici (CTW, 2012)

Strategies for Single-machine Multi-agent Scheduling Problems. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (CTW, 2012)

Parallel dedicated machines scheduling with chain precedence constraints. - Alessandro Agnetis; Hans Kellerer; Gaia Nicosia; Andrea Pacifici (Eur. J. Oper. Res., 2012)

Demand allocation with latency cost functions. - Alessandro Agnetis; Enrico Grande; Andrea Pacifici (Math. Program., 2012)

Two Agents Competing for a Shared Machine. - Alessandro Agnetis; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (ADT, 2013)

Scheduling Tasks with Comb Precedence Constraints on Dedicated Machines. - Gaia Nicosia; Andrea Pacifici (MIM, 2013)

Minimizing Part Transfer Costs in Flexible Manufacturing Systems: A Computational Study on Different Lower Bounds. - Giuseppina Falcone; Gaia Nicosia; Andrea Pacifici (UKSim, 2013)

Strategies in competing subset selection. - Claudia Marini; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Ann. Oper. Res., 2013)

Cyclic Schedules for Pipeline Assembly Processes. - Marta Flamini; Gaia Nicosia; Andrea Pacifici (UKSim, 2014)

Preface. - Ulrich Faigle; Gaia Nicosia; Andrea Pacifici (Discret. Appl. Math., 2014)

Price of Fairness for Multiagent Subset Sum Problems. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (CTW, 2015)

Brief Announcement: On the Fair Subset Sum Problem. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (SAGT, 2015)

Scheduling two agent task chains with a central selection mechanism. - Alessandro Agnetis; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (J. Sched., 2015)

Two agent scheduling with a central selection mechanism. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Theor. Comput. Sci., 2015)

Maximin Fairness-profit Tradeoff in Project Budget Allocation. - Maurizio Naldi; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (CENTERIS/ProjMAN/HCist, 2016)

A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models. - Maurizio Naldi; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy; Bernhard Leder (EMS, 2016)

Minimum cost paths over dynamic networks. - Enrico Grande; Gaia Nicosia; Andrea Pacifici (Electron. Notes Discret. Math., 2016)

Maximin Fairness in Project Budget Allocation. - Maurizio Naldi; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Electron. Notes Discret. Math., 2016)

Price of Fairness for allocating a bounded resource. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (Eur. J. Oper. Res., 2017)

Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines. - Gaia Nicosia; Andrea Pacifici (Int. J. Prod. Res., 2017)

Optimal design of a regional railway service in Italy. - Francesca Fedeli; Roberto Mancini; Carlo Mannino; Paolo Ofria; Gianpaolo Oriolo; Andrea Pacifici; Veronica Piccialli (J. Rail Transp. Plan. Manag., 2017)

Cheapest paths in dynamic networks. - Marco Di Bartolomeo; Enrico Grande; Gaia Nicosia; Andrea Pacifici (Networks, 2017)

Build or Merge: Locational Decisions in Mobile Access Networks. - Maurizio Naldi; Andrea Pacifici; Alessio Tagliacozzo; Gaia Nicosia (UKSim, 2018)

Competitive multi-agent scheduling with an iterative selection rule. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (4OR, 2018)

An exact algorithm for a multicommodity min-cost flow over time problem. - Enrico Grande; Gaia Nicosia; Andrea Pacifici; Vincenzo Roselli (Electron. Notes Discret. Math., 2018)

On a Stackelberg Subset Sum Game. - Ulrich Pferschy; Gaia Nicosia; Andrea Pacifici (Electron. Notes Discret. Math., 2018)

Robust single machine scheduling with a flexible maintenance activity. - Paolo Detti; Gaia Nicosia; Andrea Pacifici; Garazi Zabalo Manrique de Lara (Comput. Oper. Res., 2019)

Price of fairness in two-agent single-machine scheduling problems. - Alessandro Agnetis; Bo Chen 002; Gaia Nicosia; Andrea Pacifici (Eur. J. Oper. Res., 2019)

A Stackelberg knapsack game with weight control. - Ulrich Pferschy; Gaia Nicosia; Andrea Pacifici (Theor. Comput. Sci., 2019)

Mass Vaccine Administration under Uncertain Supply Scenarios. - Salvatore Foderaro; Maurizio Naldi; Gaia Nicosia; Andrea Pacifici (FedCSIS, 2021)

Planning a Mass Vaccination Campaign with Balanced Staff Engagement. - Salvatore Foderaro; Maurizio Naldi; Gaia Nicosia; Andrea Pacifici (ISM@FedCSIS, 2021)

Optimally rescheduling jobs with a LIFO buffer. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy; Julia Resch; Giovanni Righini (CoRR, 2021)

On the Stackelberg knapsack game. - Ulrich Pferschy; Gaia Nicosia; Andrea Pacifici; Joachim Schauer (Eur. J. Oper. Res., 2021)

Optimally rescheduling jobs with a Last-In-First-Out buffer. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy; Julia Resch; Giovanni Righini (J. Sched., 2021)

Two is better than one? Order aggregation in a meal delivery scheduling problem. - Alessandro Agnetis; Matteo Cosmi; Gaia Nicosia; Andrea Pacifici (Comput. Ind. Eng., 2023)

Robust job-sequencing with an uncertain flexible maintenance activity. - Paolo Detti; Gaia Nicosia; Andrea Pacifici (Comput. Ind. Eng., 2023)

Preface: 18th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2020). - Claudio Gentile; Gaia Nicosia; Andrea Pacifici; Giuseppe Stecca; Paolo Ventura (Discret. Appl. Math., 2024)

Flow shop scheduling with inter-stage flexibility and blocking constraints. - Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy; Anna Russo Russo; Cecilia Salvatore (Comput. Oper. Res., 2025)

Trade-off between utility and fairness in two-agent single-machine scheduling. - Alessandro Agnetis; Mario Benini; Gaia Nicosia; Andrea Pacifici (Eur. J. Oper. Res., 2025)