Bruno Simeone

SIAM J. Discret. Math., 2014

A Boolean theory of signatures for tonal scales.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

The maximum vertex coverage problem on bipartite graphs.

[BibT_eX]

[DOI]

Nicola Apollonio

Discret. Appl. Math., 2014

Maximum weight archipelago subgraph problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2014

2012

Certificates of optimality: the third way to biproportional apportionment.

[BibT_eX]

[DOI]

Paolo Serafini

Soc. Choice Welf., 2012

Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment.

[BibT_eX]

[DOI]

Paolo Serafini

Networks, 2012

Network flow methods for electoral systems.

[BibT_eX]

[DOI]

Networks, 2012

2011

The give-up problem for blocked regional lists with multi-winners.

[BibT_eX]

[DOI]

Andrea Scozzari

Math. Soc. Sci., 2011

Political districting: from classical models to recent approaches.

[BibT_eX]

[DOI]

Andrea Scozzari

4OR, 2011

2010

Classification Techniques and Error Control in Logic Mining.

[BibT_eX]

[DOI]

Giovanni Felici

Vincenzo Spinelli

Proceedings of the Data Mining - Special Issue in Annals of Information Systems, 2010

2009

Computing sharp bounds for hard clustering problems on trees.

[BibT_eX]

[DOI]

Isabella Lari

Maurizio Maravalle

Discret. Appl. Math., 2009

Bicolored graph partitioning, or: gerrymandering at its worst.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs.

[BibT_eX]

[DOI]

Networks, 2008

On the complexity of general matrix scaling and entropy minimization via the RAS algorithm.

[BibT_eX]

[DOI]

Math. Program., 2008

Weighted Voronoi region algorithms for political districting.

[BibT_eX]

[DOI]

Andrea Scozzari

Math. Comput. Model., 2008

Local search algorithms for political districting.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

A pseudo-Boolean consensus approach to nonlinear 0-1 optimization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

Obituary Peter L. Hammer (1936-2006).

[BibT_eX]

Bull. EATCS, 2007

Peter Ladislaw Hammer.

[BibT_eX]

[DOI]

Discret. Math., 2007

Peter Ladislaw Hammer: December 23, 1936-December 27, 2006.

[BibT_eX]

[DOI]

Discret. Optim., 2007

Peter L. Hammer (1936-2006).

[BibT_eX]

[DOI]

4OR, 2007

2004

Cardinality constrained path covering problems in grid graphs.

[BibT_eX]

[DOI]

Nicola Apollonio

Lou Caccetta

Networks, 2004

Saturated systems of homogeneous boxes and the logical analysis of numerical data.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Pareto-optimal patterns in logical analysis of data.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Block linear majorants in quadratic 0-1 optimization.

[BibT_eX]

[DOI]

Isabella Lari

Discret. Appl. Math., 2004

Consensus algorithms for the generation of all maximal bicliques.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

Maximum Split Clustering Under Connectivity Constraints.

[BibT_eX]

[DOI]

J. Classif., 2003

2002

A shifting algorithm for continuous tree partitioning.

[BibT_eX]

[DOI]

Ronald I. Becker

Yen-I Chiang

Theor. Comput. Sci., 2002

Polynomial algorithms for nested univariate clustering.

[BibT_eX]

[DOI]

Brigitte Jaumard

Discret. Math., 2002

The Maximum Box Problem and its Application to Data Analysis.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2002

2001

A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2001

A Satisfiability Formulation of Problems on Level Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Combinatorial problems related to origin-destination matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Path equipartition in the Chebyshev norm.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

1999

On a 2-dimensional equipartition problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

1998

Max-min partitioning of grid graphs into connected components.

[BibT_eX]

[DOI]

Networks, 1998

A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid.

[BibT_eX]

[DOI]

Yanpei Liu

Aurora Morgana

Discret. Appl. Math., 1998

1995

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

A O(<i>nm</i>)-Time Algorithm for Computing the Dual of a Regular Boolean Function.

[BibT_eX]

[DOI]

Uri N. Peled

Discret. Appl. Math., 1994

1993

Most Uniform Path Partitioning and its Use in Image Processing.

[BibT_eX]

[DOI]

Mario Lucertini

Yehoshua Perl

Discret. Appl. Math., 1993

Clustering heuristics for set covering.

[BibT_eX]

[DOI]

Renata Krystyna Kwatera

Ann. Oper. Res., 1993

1992

Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem.

[BibT_eX]

[DOI]

Perino M. Dearing

Transp. Sci., 1992

Boolean-Combinatorial Bounding of Maximum 2-Satisfiability.

[BibT_eX]

[DOI]

Jean-Marie Bourjolly

William R. Pulleyblank

Proceedings of the Computer Science and Operations Research, 1992

1991

Erratum.

[BibT_eX]

[DOI]

Dominique de Werra

Maurice Cochand

Discret. Appl. Math., 1991

1990

Fair dissections of spiders, worms, and caterpillars.

[BibT_eX]

[DOI]

Networks, 1990

Recognition of a class of unimodular functions.

[BibT_eX]

[DOI]

Dominique de Werra

Maurice Cochand

Discret. Appl. Math., 1990

On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization.

[BibT_eX]

[DOI]

Shi-Hui Lu

Discret. Appl. Math., 1990

On Line 2-Satisfiability.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1990

1989

On the supermodular knapsack problem.

[BibT_eX]

[DOI]

Giorgio Gallo

Math. Program., 1989

Image enhancement by path partitioning.

[BibT_eX]

[DOI]

Mario Lucertini

Yehoshua Perl

Proceedings of the Recent Issues in Pattern Analysis and Recognition, 1989

1988

From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

Adamant digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1988

1987

On the Complexity of the Maximum Satisfiability Problem for Horn Formulas.

[BibT_eX]

[DOI]

Brigitte Jaumard

Inf. Process. Lett., 1987

1986

An asymptotically exact polynomial algorithm for equipartition problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

Unimodular functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1985

Polynomial-time algorithms for regular set-covering and threshold synthesis.

[BibT_eX]

[DOI]

Uri N. Peled

Discret. Appl. Math., 1985

1984

Roof duality, complementation and persistency in quadratic 0-1 optimization.

[BibT_eX]

[DOI]

Math. Program., 1984

Box-threshold graphs.

[BibT_eX]

[DOI]

Uri N. Peled

J. Graph Theory, 1984

Degree sequences of matrogenic graphs.

[BibT_eX]

[DOI]

Discret. Math., 1984

1981

The splittance of a graph.

[BibT_eX]

[DOI]

Comb., 1981

1980

A Switching Algorithm for the Solution of Quadratic Boolean Equations.

[BibT_eX]

[DOI]

Rossella Petreschi

Inf. Process. Lett., 1980

1973

An Automatic River Planning Operating System (ARPOS).

[BibT_eX]

[DOI]

Enrico Martino