| Publication | Date of Publication | Type |
|---|
Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging
Top | 2015-05-04 | Paper |
Maximum weight archipelago subgraph problem
Annals of Operations Research | 2015-01-22 | Paper |
Improved approximation of maximum vertex coverage problem on bipartite graphs
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
The maximum vertex coverage problem on bipartite graphs
Discrete Applied Mathematics | 2014-05-05 | Paper |
A Boolean theory of signatures for tonal scales
Discrete Applied Mathematics | 2014-05-05 | Paper |
Political districting: from classical models to recent approaches
Annals of Operations Research | 2013-08-08 | Paper |
Error minimization methods in biproportional apportionment
Top | 2013-02-26 | Paper |
Certificates of optimality: the third way to biproportional apportionment
Social Choice and Welfare | 2012-07-03 | Paper |
Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
Networks | 2012-06-18 | Paper |
Network flow methods for electoral systems
Networks | 2012-06-18 | Paper |
Political districting: From classical models to recent approaches
4OR | 2012-01-10 | Paper |
The give-up problem for blocked regional lists with multi-winners
Mathematical Social Sciences | 2011-08-04 | Paper |
Bicolored graph partitioning, or: gerrymandering at its worst
Discrete Applied Mathematics | 2010-04-28 | Paper |
| scientific article; zbMATH DE number 5605114 (Why is no real title available?) | 2009-09-19 | Paper |
Weighted Voronoi region algorithms for political districting
Mathematical and Computer Modelling | 2009-07-18 | Paper |
Computing sharp bounds for hard clustering problems on trees
Discrete Applied Mathematics | 2009-06-30 | Paper |
A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
Discrete Applied Mathematics | 2008-11-19 | Paper |
Local search algorithms for political districting
European Journal of Operational Research | 2008-04-24 | Paper |
Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
Networks | 2008-01-08 | Paper |
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
Mathematical Programming. Series A. Series B | 2008-01-07 | Paper |
Peter L. Hammer (1936-2006)
4OR | 2007-08-31 | Paper |
Peter Ladislaw Hammer
Discrete Mathematics | 2007-08-23 | Paper |
Peter Ladislaw Hammer (December 23, 1936 to December 27, 2006)
Discrete Applied Mathematics | 2007-07-19 | Paper |
Maximum split clustering under connectivity constraints
Journal of Classification | 2005-02-11 | Paper |
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics | 2005-01-31 | Paper |
Block linear majorants in quadratic 0--1 optimization
Discrete Applied Mathematics | 2005-01-31 | Paper |
Cardinality constrained path covering problems in grid graphs
Networks | 2005-01-12 | Paper |
Pareto-optimal patterns in logical analysis of data
Discrete Applied Mathematics | 2004-11-12 | Paper |
Saturated systems of homogeneous boxes and the logical analysis of numerical data
Discrete Applied Mathematics | 2004-11-12 | Paper |
The maximum box problem and its application to data analysis
Computational Optimization and Applications | 2004-01-19 | Paper |
A shifting algorithm for continuous tree partitioning
Theoretical Computer Science | 2002-12-12 | Paper |
| Max-min partitioning of grid graphs into connected components | 2002-07-21 | Paper |
Polynomial algorithms for nested univariate clustering
Discrete Mathematics | 2002-05-15 | Paper |
A polynomial-time algorithm for max-min partitioning of ladders
Theory of Computing Systems | 2002-05-14 | Paper |
| A satisfiability formulation of problems on level graphs | 2001-09-24 | Paper |
Combinatorial problems related to origin-destination matrices.
Discrete Applied Mathematics | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1535754 (Why is no real title available?) | 2000-11-29 | Paper |
Path equipartition in the Chebyshev norm
European Journal of Operational Research | 2000-09-20 | Paper |
On a 2-dimensional equipartition problem
European Journal of Operational Research | 1999-11-29 | Paper |
A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
Discrete Applied Mathematics | 1999-05-18 | Paper |
| scientific article; zbMATH DE number 1208721 (Why is no real title available?) | 1998-12-15 | Paper |
| Evaluation and Optimization of Electoral Systems | 1998-11-24 | Paper |
Clustering on trees
Computational Statistics and Data Analysis | 1998-07-23 | Paper |
A graph partition problem
Acta Mathematicae Applicatae Sinica. English Series | 1998-06-29 | Paper |
| scientific article; zbMATH DE number 1140607 (Why is no real title available?) | 1998-04-13 | Paper |
On-line 2-satisfiability
Annals of Mathematics and Artificial Intelligence | 1997-11-09 | Paper |
Espaliers: A generalization of dendrograms
Journal of Classification | 1997-03-18 | Paper |
A spanning tree heuristic for regional clustering
Communications in Statistics: Theory and Methods | 1995-08-17 | Paper |
An O(nm)-time algorithm for computing the dual of a regular Boolean function
Discrete Applied Mathematics | 1994-12-18 | Paper |
| scientific article; zbMATH DE number 568830 (Why is no real title available?) | 1994-08-10 | Paper |
Clustering heuristics for set covering
Annals of Operations Research | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 279581 (Why is no real title available?) | 1993-08-23 | Paper |
| scientific article; zbMATH DE number 279605 (Why is no real title available?) | 1993-08-23 | Paper |
Most uniform path partitioning and its use in image processing
Discrete Applied Mathematics | 1993-06-29 | Paper |
Theoretical results on at most 1-bend embeddability of graphs
Acta Mathematicae Applicatae Sinica. English Series | 1993-05-25 | Paper |
Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
Transportation Science | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 38107 (Why is no real title available?) | 1992-06-28 | Paper |
Experimental comparison of 2-satisfiability algorithms
RAIRO - Operations Research | 1992-06-26 | Paper |
Fair dissections of spiders, worms, and caterpillars
Networks | 1992-06-25 | Paper |
General theoretical results on rectilinear embeddability of graphs
Acta Mathematicae Applicatae Sinica. English Series | 1991-01-01 | Paper |
Recognition of a class of unimodular functions
Discrete Applied Mathematics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4176831 (Why is no real title available?) | 1989-01-01 | Paper |
On the supermodular knapsack problem
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
A feasible directions method for computing Bayes E-optimal block designs
Computational Statistics and Data Analysis | 1988-01-01 | Paper |
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Adamant digraphs
Discrete Mathematics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4008098 (Why is no real title available?) | 1987-01-01 | Paper |
On the complexity of the maximum satisfiability problem for Horn formulas
Information Processing Letters | 1987-01-01 | Paper |
Product form parametric representation of the solutions to a quadratic boolean equation
RAIRO - Operations Research | 1987-01-01 | Paper |
Unimodular functions
Discrete Applied Mathematics | 1986-01-01 | Paper |
An asymptotically exact polynomial algorithm for equipartition problems
Discrete Applied Mathematics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4057558 (Why is no real title available?) | 1985-01-01 | Paper |
Polynomial-time algorithms for regular set-covering and threshold synthesis
Discrete Applied Mathematics | 1985-01-01 | Paper |
Degree sequences of matrogenic graphs
Discrete Mathematics | 1984-01-01 | Paper |
Roof duality, complementation and persistency in quadratic 0–1 optimization
Mathematical Programming | 1984-01-01 | Paper |
Node-weighted graphs having the König-Egerváry property
Mathematical Programming Studies | 1984-01-01 | Paper |
Box-threshold graphs
Journal of Graph Theory | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3853102 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3845638 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3835783 (Why is no real title available?) | 1983-01-01 | Paper |
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3848971 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3731332 (Why is no real title available?) | 1981-01-01 | Paper |
The splittance of a graph
Combinatorica | 1981-01-01 | Paper |
Threshold Sequences
SIAM Journal on Algebraic Discrete Methods | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3713491 (Why is no real title available?) | 1980-01-01 | Paper |
Quadratic knapsack problems
Mathematical Programming Studies | 1980-01-01 | Paper |
A switching algorithm for the solution of quadratic Boolean equations
Information Processing Letters | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3668328 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3666538 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3666536 (Why is no real title available?) | 1975-01-01 | Paper |
