| Publication | Date of Publication | Type |
|---|
Middle-income traps and complexity in economic development
Studies in Nonlinear Dynamics & Econometrics | 2024-06-11 | Paper |
Technology choice, externalities in production, and a chaotic middle-income trap
Journal of Economics | 2024-04-30 | Paper |
scientific article; zbMATH DE number 7788641 (Why is no real title available?)
| 2024-01-15 | Paper |
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts
| 2023-11-14 | Paper |
Choquet operators and belief functions
Journal of Mathematical Analysis and Applications | 2023-08-10 | Paper |
An approximation algorithm for MAX 3-SAT
| 2023-03-21 | Paper |
Optimal investment under ambiguous technology shocks
European Journal of Operational Research | 2021-06-07 | Paper |
Portfolio allocation problems between risky and ambiguous assets
Annals of Operations Research | 2020-01-20 | Paper |
Consequentialism and dynamic consistency in updating ambiguous beliefs
Economic Theory | 2019-08-30 | Paper |
Optimal initial capital induced by the optimized certainty equivalent
Insurance Mathematics \& Economics | 2019-03-28 | Paper |
Chaotic dynamics of a piecewise linear model of credit cycles
Journal of Mathematical Economics | 2019-03-26 | Paper |
An experimental test of a search model under ambiguity
Theory and Decision | 2016-01-14 | Paper |
An axiomatization of Choquet expected utility with cominimum independence
Theory and Decision | 2015-07-09 | Paper |
Modularity and monotonicity of games
Mathematical Methods of Operations Research | 2014-09-08 | Paper |
Uncertainty aversion and portfolio inertia
Bulletin of Economic Research | 2013-01-10 | Paper |
Complex behaviour in a piecewise linear dynamic macroeconomic model with endogenous discontinuity
Journal of Difference Equations and Applications | 2013-01-04 | Paper |
Distributing distinct integers uniformly over a square matrix with application to digital halftoning
HERMIS-\(\mu\pi\). Hellenic European Research on Mathematics and Informatics Science | 2012-07-02 | Paper |
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Portfolio inertia and epsilon-contaminations
Theory and Decision | 2010-03-15 | Paper |
On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
Portfolio inertia under ambiguity
Mathematical Social Sciences | 2007-01-16 | Paper |
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science | 2006-04-28 | Paper |
scientific article; zbMATH DE number 2080247 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 1979512 (Why is no real title available?)
| 2003-09-14 | Paper |
Improved approximation algorithms for MAX SAT
Journal of Algorithms | 2002-08-14 | Paper |
scientific article; zbMATH DE number 1766747 (Why is no real title available?)
Journal of the Operations Research Society of Japan | 2002-07-11 | Paper |
scientific article; zbMATH DE number 1445292 (Why is no real title available?)
| 2001-01-18 | Paper |
scientific article; zbMATH DE number 1372698 (Why is no real title available?)
| 1999-12-01 | Paper |
scientific article; zbMATH DE number 1354126 (Why is no real title available?)
| 1999-10-31 | Paper |
Approximation algorithms for the maximum satisfiability problem
Algorithm Theory — SWAT'96 | 1998-03-02 | Paper |
Constructing a bipartite graph of maximum connectivity with prescribed degrees
| 1997-11-25 | Paper |
scientific article; zbMATH DE number 1002206 (Why is no real title available?)
| 1997-09-07 | Paper |
The design of a precompensator for multivariable adaptive control-a network-theoretic approach
IEEE Transactions on Automatic Control | 1994-06-20 | Paper |
DYNAMIC PROGRAMMING ON INTERVALS
International Journal of Computational Geometry & Applications | 1994-05-18 | Paper |
scientific article; zbMATH DE number 22188 (Why is no real title available?)
| 1992-06-26 | Paper |
A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
Algorithmica | 1989-01-01 | Paper |
Shortest path between two simple polygons
Information Processing Letters | 1987-01-01 | Paper |
An Application of Duality to Edge-Deletion Problems
SIAM Journal on Computing | 1987-01-01 | Paper |
Dynamic orthogonal segment intersection search
Journal of Algorithms | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4051001 (Why is no real title available?)
| 1987-01-01 | Paper |
Efficient Algorithms for Geometric Graph Search Problems
SIAM Journal on Computing | 1986-01-01 | Paper |
Visibility of disjoint polygons
Algorithmica | 1986-01-01 | Paper |
Polygon triangulation: Efficiency and minimality
Journal of Algorithms | 1986-01-01 | Paper |
An approach to the subgraph homeomorphism problem
Theoretical Computer Science | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3945343 (Why is no real title available?)
| 1985-01-01 | Paper |
A note on nongraphic matroids
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
A new point-location algorithm and its practical efficiency: comparison with existing algorithms
ACM Transactions on Graphics | 1984-01-01 | Paper |
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
Discrete Applied Mathematics | 1984-01-01 | Paper |
A note on the critical problem for matroids
European Journal of Combinatorics | 1984-01-01 | Paper |
Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
Journal of Algorithms | 1983-01-01 | Paper |
Edge-contraction problems
Journal of Computer and System Sciences | 1983-01-01 | Paper |
An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
Discrete Applied Mathematics | 1983-01-01 | Paper |
Properties of matroids characterizable in terms of excluded matroids
Journal of Combinatorial Theory. Series B | 1983-01-01 | Paper |
The smallest 2-connected cubic bipartite planar nonhamiltonian graph
Discrete Mathematics | 1982-01-01 | Paper |
An upper bound on the length of a Hamiltonian walk of a maximal planar graph
Journal of Graph Theory | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3641465 (Why is no real title available?)
| 1980-01-01 | Paper |
General Results on Tour Lengths in Machines and Digraphs
SIAM Journal on Computing | 1976-01-01 | Paper |
