| Publication | Date of Publication | Type |
|---|
Easy and hard separation of sparse and dense odd-set constraints in matching
Discrete Optimization | 2025-01-23 | Paper |
The finagle point is close to the yolk
Operations Research Letters | 2024-06-17 | Paper |
Path-length analysis for grid-based path planning
Artificial Intelligence | 2021-12-13 | Paper |
Dominance in spatial voting with imprecise ideals
Social Choice and Welfare | 2021-12-10 | Paper |
A contagion measure provably superior to the reproduction number: theory and a case study of the Yemen cholera epidemic, Datasets
| 2019-08-22 | Dataset |
On the uniqueness of the yolk
Social Choice and Welfare | 2018-02-02 | Paper |
Optimal solution to the multinomial selection problem for two alternatives
Sequential Analysis | 2017-12-01 | Paper |
The complexity of power indexes with graph restricted coalitions
Mathematical Social Sciences | 2015-12-18 | Paper |
Optimal selection of the most probable multinomial alternative
Sequential Analysis | 2014-12-12 | Paper |
The slippage configuration is always the least favorable configuration for two alternatives
Sequential Analysis | 2014-12-12 | Paper |
Linear optimization and duality. A modern exposition
| 2014-03-11 | Paper |
A finite exact algorithm for epsilon-core membership in two dimensions
Mathematical Social Sciences | 2010-11-19 | Paper |
The probability of majority rule instability in the 2D Euclidean model with an even number of voters
Social Choice and Welfare | 2010-10-15 | Paper |
A near-tight approximation lower bound and algorithm for the kidnapped robot problem
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A near-tight approximation algorithm for the robot localization problem
SIAM Journal on Computing | 2010-04-29 | Paper |
The instability of instability of centered distributions
Mathematical Social Sciences | 2010-03-18 | Paper |
A critique of distributional analysis in the spatial model
Mathematical Social Sciences | 2010-03-18 | Paper |
Approximation of the yolk by the LP yolk
Mathematical Social Sciences | 2010-03-18 | Paper |
The almost surely shrinking yolk
Mathematical Social Sciences | 2010-03-18 | Paper |
Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
Social Choice and Welfare | 2009-09-09 | Paper |
Polarity and the complexity of the shooting experiment
Discrete Optimization | 2008-10-29 | Paper |
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic
SIAM Journal on Discrete Mathematics | 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
Artificial Intelligence | 2006-02-07 | Paper |
Simple lifted cover inequalities and hard knapsack problems
Discrete Optimization | 2006-01-09 | Paper |
Connect the dots: how many random points can a regular curve pass through?
Advances in Applied Probability | 2005-10-17 | Paper |
Non-approximability of precedence-constrained sequencing to minimize setups.
Discrete Applied Mathematics | 2004-01-26 | Paper |
Optimal Online Algorithms for Minimax Resource Scheduling
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
Computational Optimization and Applications | 2003-04-22 | Paper |
Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms
Journal of Intelligent & Robotic Systems | 2003-02-17 | Paper |
Analysis of a random cut test instance generator for the TSP
| 2001-09-18 | Paper |
The complexity of cover inequality separation
Operations Research Letters | 2001-04-02 | Paper |
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1305450 (Why is no real title available?)
| 1999-09-15 | Paper |
Probabilities of preferences and cycles with super majority rules
Journal of Economic Theory | 1998-08-03 | Paper |
scientific article; zbMATH DE number 1082121 (Why is no real title available?)
| 1998-04-22 | Paper |
New Ramsey Bounds from Cyclic Graphs of Prime Order
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
scientific article; zbMATH DE number 1082101 (Why is no real title available?)
| 1997-10-30 | Paper |
scientific article; zbMATH DE number 1003245 (Why is no real title available?)
| 1997-04-23 | Paper |
Circuit Partitioning Via Set Partitioning and Column Generation
Operations Research | 1996-07-01 | Paper |
Planar Ramsey numbers
Journal of Combinatorial Theory. Series B | 1994-08-28 | Paper |
Erratum to: Local optimization on graphs
Discrete Applied Mathematics | 1994-03-17 | Paper |
A polynomial-time algorithm for computing the yolk in fixed dimension
Mathematical Programming. Series A. Series B | 1993-12-20 | Paper |
How hard is it to control an election?
Mathematical and Computer Modelling | 1993-01-16 | Paper |
Probability and convergence for supra-majority rule with Euclidean preferences
Mathematical and Computer Modelling | 1993-01-16 | Paper |
Routing Printed Circuit Cards Through an Assembly Cell
Operations Research | 1992-09-26 | Paper |
When Is the Classroom Assignment Problem Hard?
Operations Research | 1992-06-28 | Paper |
The probability of an undominated central voter in 2-dimensional spatial majority voting
Social Choice and Welfare | 1992-06-28 | Paper |
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
Algorithmica | 1992-06-28 | Paper |
Limiting median lines do not suffice to determine the yolk
Social Choice and Welfare | 1992-06-28 | Paper |
Algorithms for recognition of regular properties and decomposition of recursive graph families
Annals of Operations Research | 1992-06-27 | Paper |
Deterministic Dcomposition of Recursive Graph Classes
SIAM Journal on Discrete Mathematics | 1992-06-27 | Paper |
Recognizing majority-rule equilibrium in spatial voting games
Social Choice and Welfare | 1992-06-26 | Paper |
Erratum: The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods
SIAM Review | 1992-06-26 | Paper |
The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods
SIAM Review | 1992-06-25 | Paper |
Asymmetric probabilistic prospects of Stackelberg players
Journal of Optimization Theory and Applications | 1991-01-01 | Paper |
A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
Voting schemes for which it can be difficult to tell who won the election
Social Choice and Welfare | 1989-01-01 | Paper |
The computational difficulty of manipulating an election
Social Choice and Welfare | 1989-01-01 | Paper |
Local optimization on graphs
Discrete Applied Mathematics | 1989-01-01 | Paper |
Simulated Simulated Annealing
American Journal of Mathematical and Management Sciences | 1988-01-01 | Paper |
Finding Saddlepoints of Two-Person, Zero Sum Games
The American Mathematical Monthly | 1988-01-01 | Paper |
Minimum Spillage Sequencing
Management Science | 1988-01-01 | Paper |
Layered Augmenting Path Algorithms
Mathematics of Operations Research | 1986-01-01 | Paper |
Low order polynomial bounds on the expected performance of local improvement algorithms
Mathematical Programming | 1986-01-01 | Paper |
Affirmative action algorithms
Mathematical Programming | 1986-01-01 | Paper |
Rescheduling to minimize makespan on a changing number of identical processors
Naval Research Logistics Quarterly | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3914325 (Why is no real title available?)
| 1985-01-01 | Paper |
Hill Climbing with Multiple Local Optima
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Networks and chain coverings in partial orders and their products
Order | 1985-01-01 | Paper |
A simplified NP-complete satisfiability problem
Discrete Applied Mathematics | 1984-01-01 | Paper |
On the number of iterations of local improvement algorithms
Operations Research Letters | 1983-01-01 | Paper |
Semiantichains and Unichain Coverings in Direct Products of Partial Orders
SIAM Journal on Algebraic Discrete Methods | 1981-01-01 | Paper |
