| Publication | Date of Publication | Type |
|---|
| Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging | 2015-05-04 | Paper |
| Maximum weight archipelago subgraph problem | 2015-01-22 | Paper |
| Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs | 2014-12-22 | Paper |
| A Boolean theory of signatures for tonal scales | 2014-05-05 | Paper |
| The maximum vertex coverage problem on bipartite graphs | 2014-05-05 | Paper |
| Political districting: from classical models to recent approaches | 2013-08-08 | Paper |
| Error minimization methods in biproportional apportionment | 2013-02-26 | Paper |
| Certificates of optimality: the third way to biproportional apportionment | 2012-07-03 | Paper |
| Network flow methods for electoral systems | 2012-06-18 | Paper |
| Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment | 2012-06-18 | Paper |
| Political districting: From classical models to recent approaches | 2012-01-10 | Paper |
| The give-up problem for blocked regional lists with multi-winners | 2011-08-04 | Paper |
| Bicolored graph partitioning, or: gerrymandering at its worst | 2010-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396612 | 2009-09-19 | Paper |
| Weighted Voronoi region algorithms for political districting | 2009-07-18 | Paper |
| Computing sharp bounds for hard clustering problems on trees | 2009-06-30 | Paper |
| A pseudo-Boolean consensus approach to nonlinear 0-1 optimization | 2008-11-19 | Paper |
| Local search algorithms for political districting | 2008-04-24 | Paper |
| Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs | 2008-01-08 | Paper |
| On the complexity of general matrix scaling and entropy minimization via the RAS algorithm | 2008-01-07 | Paper |
| Peter L. Hammer (1936-2006) | 2007-08-31 | Paper |
| Peter Ladislaw Hammer | 2007-08-23 | Paper |
| Peter Ladislaw Hammer (December 23, 1936 to December 27, 2006) | 2007-07-19 | Paper |
| Maximum split clustering under connectivity constraints | 2005-02-11 | Paper |
| Consensus algorithms for the generation of all maximal bicliques | 2005-01-31 | Paper |
| Block linear majorants in quadratic 0--1 optimization | 2005-01-31 | Paper |
| Cardinality constrained path covering problems in grid graphs | 2005-01-12 | Paper |
| Pareto-optimal patterns in logical analysis of data | 2004-11-12 | Paper |
| Saturated systems of homogeneous boxes and the logical analysis of numerical data | 2004-11-12 | Paper |
| The maximum box problem and its application to data analysis | 2004-01-19 | Paper |
| A shifting algorithm for continuous tree partitioning | 2002-12-12 | Paper |
| Max-min partitioning of grid graphs into connected components | 2002-07-21 | Paper |
| Polynomial algorithms for nested univariate clustering | 2002-05-15 | Paper |
| A polynomial-time algorithm for max-min partitioning of ladders | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741531 | 2001-09-24 | Paper |
| Combinatorial problems related to origin-destination matrices. | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4516030 | 2000-11-29 | Paper |
| Path equipartition in the Chebyshev norm | 2000-09-20 | Paper |
| On a 2-dimensional equipartition problem | 1999-11-29 | Paper |
| A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4211748 | 1998-12-15 | Paper |
| Evaluation and Optimization of Electoral Systems | 1998-11-24 | Paper |
| Clustering on trees | 1998-07-23 | Paper |
| A graph partition problem | 1998-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385383 | 1998-04-13 | Paper |
| On-line 2-satisfiability | 1997-11-09 | Paper |
| Espaliers: A generalization of dendrograms | 1997-03-18 | Paper |
| A spanning tree heuristic for regional clustering | 1995-08-17 | Paper |
| An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function | 1994-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4294622 | 1994-08-10 | Paper |
| Clustering heuristics for set covering | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5289554 | 1993-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5289581 | 1993-08-23 | Paper |
| Most uniform path partitioning and its use in image processing | 1993-06-29 | Paper |
| Theoretical results on at most 1-bend embeddability of graphs | 1993-05-25 | Paper |
| Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990423 | 1992-06-28 | Paper |
| Experimental comparison of 2-satisfiability algorithms | 1992-06-26 | Paper |
| Fair dissections of spiders, worms, and caterpillars | 1992-06-25 | Paper |
| General theoretical results on rectilinear embeddability of graphs | 1991-01-01 | Paper |
| Recognition of a class of unimodular functions | 1990-01-01 | Paper |
| On the supermodular knapsack problem | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3200885 | 1989-01-01 | Paper |
| A feasible directions method for computing Bayes E-optimal block designs | 1988-01-01 | Paper |
| Adamant digraphs | 1988-01-01 | Paper |
| From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions | 1988-01-01 | Paper |
| On the complexity of the maximum satisfiability problem for Horn formulas | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758559 | 1987-01-01 | Paper |
| Product form parametric representation of the solutions to a quadratic boolean equation | 1987-01-01 | Paper |
| An asymptotically exact polynomial algorithm for equipartition problems | 1986-01-01 | Paper |
| Unimodular functions | 1986-01-01 | Paper |
| Polynomial-time algorithms for regular set-covering and threshold synthesis | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792723 | 1985-01-01 | Paper |
| Degree sequences of matrogenic graphs | 1984-01-01 | Paper |
| Node-weighted graphs having the König-Egerváry property | 1984-01-01 | Paper |
| Box-threshold graphs | 1984-01-01 | Paper |
| Roof duality, complementation and persistency in quadratic 0–1 optimization | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3040955 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3315557 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322122 | 1983-01-01 | Paper |
| Vertices Belonging to All or to No Maximum Stable Sets of a Graph | 1982-01-01 | Paper |
| The splittance of a graph | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318541 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919075 | 1981-01-01 | Paper |
| Threshold Sequences | 1981-01-01 | Paper |
| A switching algorithm for the solution of quadratic Boolean equations | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3904382 | 1980-01-01 | Paper |
| Quadratic knapsack problems | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3865840 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3863436 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3863434 | 1975-01-01 | Paper |
