| Publication | Date of Publication | Type |
|---|
| Path-length analysis for grid-based path planning | 2021-12-13 | Paper |
| Dominance in spatial voting with imprecise ideals | 2021-12-10 | Paper |
| On the uniqueness of the yolk | 2018-02-02 | Paper |
| Optimal solution to the multinomial selection problem for two alternatives | 2017-12-01 | Paper |
| The complexity of power indexes with graph restricted coalitions | 2015-12-18 | Paper |
| Optimal Selection of the Most Probable Multinomial Alternative | 2014-12-12 | Paper |
| The Slippage Configuration Is Always the Least Favorable Configuration for Two Alternatives | 2014-12-12 | Paper |
| Linear Optimization and Duality | 2014-03-11 | Paper |
| A finite exact algorithm for epsilon-core membership in two dimensions | 2010-11-19 | Paper |
| The probability of majority rule instability in the 2D Euclidean model with an even number of voters | 2010-10-15 | Paper |
| A near-tight approximation lower bound and algorithm for the kidnapped robot problem | 2010-08-16 | Paper |
| A Near-Tight Approximation Algorithm for the Robot Localization Problem | 2010-04-29 | Paper |
| The instability of instability of centered distributions | 2010-03-18 | Paper |
| The almost surely shrinking yolk | 2010-03-18 | Paper |
| A critique of distributional analysis in the spatial model | 2010-03-18 | Paper |
| Approximation of the yolk by the LP yolk | 2010-03-18 | Paper |
| Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting | 2009-09-09 | Paper |
| Polarity and the complexity of the shooting experiment | 2008-10-29 | Paper |
| Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic | 2006-06-01 | Paper |
| Correction. Connect The Dots: How Many Random Points Can A Regular Curve Pass Through? | 2006-03-28 | Paper |
| Performance bounds for planning in unknown terrain | 2006-02-07 | Paper |
| Simple lifted cover inequalities and hard knapsack problems | 2006-01-09 | Paper |
| Connect the dots: how many random points can a regular curve pass through? | 2005-10-17 | Paper |
| Non-approximability of precedence-constrained sequencing to minimize setups. | 2004-01-26 | Paper |
| Optimal Online Algorithms for Minimax Resource Scheduling | 2004-01-08 | Paper |
| Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results | 2003-04-22 | Paper |
| Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms | 2003-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743976 | 2001-09-18 | Paper |
| The complexity of cover inequality separation | 2001-04-02 | Paper |
| New Results on the Old k-opt Algorithm for the Traveling Salesman Problem | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252336 | 1999-09-15 | Paper |
| Probabilities of preferences and cycles with super majority rules | 1998-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365148 | 1998-04-22 | Paper |
| New Ramsey Bounds from Cyclic Graphs of Prime Order | 1998-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365128 | 1997-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335205 | 1997-04-23 | Paper |
| Circuit Partitioning Via Set Partitioning and Column Generation | 1996-07-01 | Paper |
| Planar Ramsey numbers | 1994-08-28 | Paper |
| Erratum to: Local optimization on graphs | 1994-03-17 | Paper |
| A polynomial-time algorithm for computing the yolk in fixed dimension | 1993-12-20 | Paper |
| How hard is it to control an election? | 1993-01-16 | Paper |
| Probability and convergence for supra-majority rule with Euclidean preferences | 1993-01-16 | Paper |
| Routing Printed Circuit Cards Through an Assembly Cell | 1992-09-26 | Paper |
| Limiting median lines do not suffice to determine the yolk | 1992-06-28 | Paper |
| The probability of an undominated central voter in 2-dimensional spatial majority voting | 1992-06-28 | Paper |
| Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families | 1992-06-28 | Paper |
| When Is the Classroom Assignment Problem Hard? | 1992-06-28 | Paper |
| Algorithms for recognition of regular properties and decomposition of recursive graph families | 1992-06-27 | Paper |
| Deterministic Dcomposition of Recursive Graph Classes | 1992-06-27 | Paper |
| Recognizing majority-rule equilibrium in spatial voting games | 1992-06-26 | Paper |
| Erratum: The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods | 1992-06-26 | Paper |
| The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods | 1992-06-25 | Paper |
| Asymmetric probabilistic prospects of Stackelberg players | 1991-01-01 | Paper |
| A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling | 1990-01-01 | Paper |
| Voting schemes for which it can be difficult to tell who won the election | 1989-01-01 | Paper |
| Local optimization on graphs | 1989-01-01 | Paper |
| The computational difficulty of manipulating an election | 1989-01-01 | Paper |
| Minimum Spillage Sequencing | 1988-01-01 | Paper |
| Finding Saddlepoints of Two-Person, Zero Sum Games | 1988-01-01 | Paper |
| Simulated Simulated Annealing | 1988-01-01 | Paper |
| Affirmative action algorithms | 1986-01-01 | Paper |
| Layered Augmenting Path Algorithms | 1986-01-01 | Paper |
| Rescheduling to minimize makespan on a changing number of identical processors | 1986-01-01 | Paper |
| Low order polynomial bounds on the expected performance of local improvement algorithms | 1986-01-01 | Paper |
| Networks and chain coverings in partial orders and their products | 1985-01-01 | Paper |
| Hill Climbing with Multiple Local Optima | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691743 | 1985-01-01 | Paper |
| A simplified NP-complete satisfiability problem | 1984-01-01 | Paper |
| On the number of iterations of local improvement algorithms | 1983-01-01 | Paper |
| Semiantichains and Unichain Coverings in Direct Products of Partial Orders | 1981-01-01 | Paper |
