A Mathematical Model for Periodic Scheduling Problems. - Paolo Serafini; Walter Ukovich (SIAM J. Discret. Math., 1989)

Computing the Throughput of a Network with Dedicated Lines. - Christos H. Papadimitriou; Paolo Serafini; Mihalis Yannakakis (Discret. Appl. Math., 1993)

Scheduling Jobs on Several Machines with the Job Splitting Property. - Paolo Serafini (Oper. Res., 1996)

Job Shop Scheduling With Deadlines. - Egon Balas; Giuseppe Lancia; Paolo Serafini; Alkiviadis Vazacopoulos (J. Comb. Optim., 1998)

Exact algorithms for minimum routing cost trees. - Matteo Fischetti; Giuseppe Lancia; Paolo Serafini (Networks, 2002)

Asymptotic scheduling. - Paolo Serafini (Math. Program., 2003)

A Column Generation Scheme for Faculty Timetabling. - Andrea Qualizza; Paolo Serafini (PATAT, 2004)

Linear programming with variable matrix entries. - Paolo Serafini (Oper. Res. Lett., 2005)

Scheduling School Meetings. - Franca Rinaldi; Paolo Serafini (PATAT, 2006)

Dynamic programming and minimum risk paths. - Paolo Serafini (Eur. J. Oper. Res., 2006)

A Set-Covering Approach with Column Generation for Parsimony Haplotyping. - Giuseppe Lancia; Paolo Serafini (INFORMS J. Comput., 2009)

Separating negative and positive points with the minimum number of boxes. - Paolo Serafini (CTW, 2011)

A time-indexed LP-based approach for min-sum job-shop problems. - Giuseppe Lancia; Franca Rinaldi; Paolo Serafini (Ann. Oper. Res., 2011)

An effective compact formulation of the max cut problem on sparse graphs. - Giuseppe Lancia; Paolo Serafini (Electron. Notes Discret. Math., 2011)

Allocation of the EU Parliament seats via integer linear programming and revised quotas. - Paolo Serafini (Math. Soc. Sci., 2012)

Network flow methods for electoral systems. - Friedrich Pukelsheim; Federica Ricca; Bruno Simeone; Andrea Scozzari; Paolo Serafini (Networks, 2012)

Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment. - Paolo Serafini; Bruno Simeone (Networks, 2012)

Certificates of optimality: the third way to biproportional apportionment. - Paolo Serafini; Bruno Simeone (Soc. Choice Welf., 2012)

Exact solution of the robust knapsack problem. - Michele Monaci; Ulrich Pferschy; Paolo Serafini (Comput. Oper. Res., 2013)

Combinatorial optimization problems with normal random costs. - Paolo Serafini (Oper. Res. Lett., 2013)

Deriving compact extended formulations via LP-based separation techniques. - Giuseppe Lancia; Paolo Serafini (4OR, 2014)

Classifying negative and positive points by optimal box clustering. - Paolo Serafini (Discret. Appl. Math., 2014)

Optimal shift coloring of trees. - Giovanni Andreatta; Luigi De Giovanni; Paolo Serafini (Oper. Res. Lett., 2014)

A Unified Integer Programming Model for Genome Rearrangement Problems. - Giuseppe Lancia; Franca Rinaldi; Paolo Serafini (IWBBIO (1), 2015)

Optimal shift partitioning of pharmacies. - Giovanni Andreatta; Luigi De Giovanni; Paolo Serafini (Comput. Oper. Res., 2015)

Local search inequalities. - Giuseppe Lancia; Franca Rinaldi; Paolo Serafini (Discret. Optim., 2015)

Certificates of optimality for minimum norm biproportional apportionments. - Paolo Serafini (Soc. Choice Welf., 2015)

The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets. - Giuseppe Lancia; Paolo Serafini (IWBBIO, 2016)

Constrained domatic bipartition on trees. - Giovanni Andreatta; Carla De Francesco; Luigi De Giovanni; Paolo Serafini (Discret. Optim., 2016)

An Iterative Scheme to Compute Size Probabilities in Random Graphs and Branching Processes. - Paolo Serafini (Sci. Program., 2018)

Star partitions on graphs. - Giovanni Andreatta; Carla De Francesco; Luigi De Giovanni; Paolo Serafini (Discret. Optim., 2019)

Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data. - Giuseppe Lancia; Paolo Serafini (Algorithms, 2021)