Bruno Simeone

According to our database1, Bruno Simeone
  • authored at least 64 papers between 1973 and 2014.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs.
SIAM J. Discrete Math., 2014

A Boolean theory of signatures for tonal scales.
Discrete Applied Mathematics, 2014

The maximum vertex coverage problem on bipartite graphs.
Discrete Applied Mathematics, 2014

Maximum weight archipelago subgraph problem.
Annals OR, 2014

2013
Political Districting: from classical models to recent approaches.
Annals OR, 2013

2012
Certificates of optimality: the third way to biproportional apportionment.
Social Choice and Welfare, 2012

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

Network flow methods for electoral systems.
Networks, 2012

2011
The give-up problem for blocked regional lists with multi-winners.
Mathematical Social Sciences, 2011

Political districting: from classical models to recent approaches.
4OR, 2011

2010
Classification Techniques and Error Control in Logic Mining.
Proceedings of the Data Mining - Special Issue in Annals of Information Systems, 2010

2009
Computing sharp bounds for hard clustering problems on trees.
Discrete Applied Mathematics, 2009

Bicolored graph partitioning, or: gerrymandering at its worst.
Discrete Applied Mathematics, 2009

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

On the complexity of general matrix scaling and entropy minimization via the RAS algorithm.
Math. Program., 2008

Weighted Voronoi region algorithms for political districting.
Mathematical and Computer Modelling, 2008

Local search algorithms for political districting.
European Journal of Operational Research, 2008

A pseudo-Boolean consensus approach to nonlinear 0-1 optimization.
Discrete Applied Mathematics, 2008

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

Obituary Peter L. Hammer (1936-2006).
Bulletin of the EATCS, 2007

Peter Ladislaw Hammer.
Discrete Mathematics, 2007

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

Peter L. Hammer (1936-2006).
4OR, 2007

Weighted Voronoi Region Algorithms for Political Districting.
Proceedings of the Frontiers of Electronic Voting, 29.07. - 03.08.2007, 2007

2004
Cardinality constrained path covering problems in grid graphs.
Networks, 2004

Saturated systems of homogeneous boxes and the logical analysis of numerical data.
Discrete Applied Mathematics, 2004

Pareto-optimal patterns in logical analysis of data.
Discrete Applied Mathematics, 2004

Block linear majorants in quadratic 0-1 optimization.
Discrete Applied Mathematics, 2004

Consensus algorithms for the generation of all maximal bicliques.
Discrete Applied Mathematics, 2004

2003
Maximum Split Clustering Under Connectivity Constraints.
J. Classification, 2003

2002
A shifting algorithm for continuous tree partitioning.
Theor. Comput. Sci., 2002

Polynomial algorithms for nested univariate clustering.
Discrete Mathematics, 2002

The Maximum Box Problem and its Application to Data Analysis.
Comp. Opt. and Appl., 2002

2001
A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders.
Theory Comput. Syst., 2001

A Satisfiability Formulation of Problems on Level Graphs.
Electronic Notes in Discrete Mathematics, 2001

Combinatorial problems related to origin-destination matrices.
Discrete Applied Mathematics, 2001

2000
Path equipartition in the Chebyshev norm.
European Journal of Operational Research, 2000

1999
On a 2-dimensional equipartition problem.
European Journal of Operational Research, 1999

1998
Max-min partitioning of grid graphs into connected components.
Networks, 1998

A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid.
Discrete Applied Mathematics, 1998

1995
Preface.
Discrete Applied Mathematics, 1995

1994
A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function.
Discrete Applied Mathematics, 1994

1993
Most Uniform Path Partitioning and its Use in Image Processing.
Discrete Applied Mathematics, 1993

Clustering heuristics for set covering.
Annals OR, 1993

1992
Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem.
Transportation Science, 1992

1991
Erratum.
Discrete Applied Mathematics, 1991

1990
Fair dissections of spiders, worms, and caterpillars.
Networks, 1990

Recognition of a class of unimodular functions.
Discrete Applied Mathematics, 1990

On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization.
Discrete Applied Mathematics, 1990

On Line 2-Satisfiability.
Ann. Math. Artif. Intell., 1990

1989
On the supermodular knapsack problem.
Math. Program., 1989

Image enhancement by path partitioning.
Proceedings of the Recent Issues in Pattern Analysis and Recognition, 1989

1988
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.
SIAM J. Discrete Math., 1988

Adamant digraphs.
Discrete Mathematics, 1988

1987
On the Complexity of the Maximum Satisfiability Problem for Horn Formulas.
Inf. Process. Lett., 1987

1986
An asymptotically exact polynomial algorithm for equipartition problems.
Discrete Applied Mathematics, 1986

Unimodular functions.
Discrete Applied Mathematics, 1986

1985
Polynomial-time algorithms for regular set-covering and threshold synthesis.
Discrete Applied Mathematics, 1985

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

Box-threshold graphs.
Journal of Graph Theory, 1984

Degree sequences of matrogenic graphs.
Discrete Mathematics, 1984

1981
The splittance of a graph.
Combinatorica, 1981

1980
A Switching Algorithm for the Solution of Quadratic Boolean Equations.
Inf. Process. Lett., 1980

1973
An Automatic River Planning Operating System (ARPOS).
Proceedings of the 5th Conference on Optimization Techniques, 1973


  Loading...