| Publication | Date of Publication | Type |
|---|
| Middle-income traps and complexity in economic development | 2024-06-11 | Paper |
| Technology choice, externalities in production, and a chaotic middle-income trap | 2024-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187837 | 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 | 2023-08-10 | Paper |
| An approximation algorithm for MAX 3-SAT | 2023-03-21 | Paper |
| Optimal investment under ambiguous technology shocks | 2021-06-07 | Paper |
| Portfolio allocation problems between risky and ambiguous assets | 2020-01-20 | Paper |
| Consequentialism and dynamic consistency in updating ambiguous beliefs | 2019-08-30 | Paper |
| Optimal initial capital induced by the optimized certainty equivalent | 2019-03-28 | Paper |
| Chaotic dynamics of a piecewise linear model of credit cycles | 2019-03-26 | Paper |
| An experimental test of a search model under ambiguity | 2016-01-14 | Paper |
| An axiomatization of Choquet expected utility with cominimum independence | 2015-07-09 | Paper |
| Modularity and monotonicity of games | 2014-09-08 | Paper |
| UNCERTAINTY AVERSION AND PORTFOLIO INERTIA | 2013-01-10 | Paper |
| Complex behaviour in a piecewise linear dynamic macroeconomic model with endogenous discontinuity | 2013-01-04 | Paper |
| Distributing distinct integers uniformly over a square matrix with application to digital halftoning | 2012-07-02 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Portfolio inertia and epsilon-contaminations | 2010-03-15 | Paper |
| On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees. | 2008-12-21 | Paper |
| Portfolio inertia under ambiguity | 2007-01-16 | Paper |
| An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472492 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427856 | 2003-09-14 | Paper |
| Improved approximation algorithms for MAX SAT | 2002-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4538163 | 2002-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952605 | 2001-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703908 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268439 | 1999-10-31 | Paper |
| Approximation algorithms for the maximum satisfiability problem | 1998-03-02 | Paper |
| Constructing a bipartite graph of maximum connectivity with prescribed degrees | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129924 | 1997-09-07 | Paper |
| The design of a precompensator for multivariable adaptive control-a network-theoretic approach | 1994-06-20 | Paper |
| DYNAMIC PROGRAMMING ON INTERVALS | 1994-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3981722 | 1992-06-26 | Paper |
| A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency | 1989-01-01 | Paper |
| Shortest path between two simple polygons | 1987-01-01 | Paper |
| An Application of Duality to Edge-Deletion Problems | 1987-01-01 | Paper |
| Dynamic orthogonal segment intersection search | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787490 | 1987-01-01 | Paper |
| Efficient Algorithms for Geometric Graph Search Problems | 1986-01-01 | Paper |
| Visibility of disjoint polygons | 1986-01-01 | Paper |
| Polygon triangulation: Efficiency and minimality | 1986-01-01 | Paper |
| An approach to the subgraph homeomorphism problem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716294 | 1985-01-01 | Paper |
| A note on nongraphic matroids | 1984-01-01 | Paper |
| A new point-location algorithm and its practical efficiency: comparison with existing algorithms | 1984-01-01 | Paper |
| A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs | 1984-01-01 | Paper |
| A note on the critical problem for matroids | 1984-01-01 | Paper |
| Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane | 1983-01-01 | Paper |
| Edge-contraction problems | 1983-01-01 | Paper |
| An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs | 1983-01-01 | Paper |
| Properties of matroids characterizable in terms of excluded matroids | 1983-01-01 | Paper |
| The smallest 2-connected cubic bipartite planar nonhamiltonian graph | 1982-01-01 | Paper |
| An upper bound on the length of a Hamiltonian walk of a maximal planar graph | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200080 | 1980-01-01 | Paper |
| General Results on Tour Lengths in Machines and Digraphs | 1976-01-01 | Paper |
