| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126327 | 2024-04-09 | Paper |
| Matching Is as Easy as the Decision Problem, in the NC Model | 2023-02-03 | Paper |
| A real polynomial for bipartite graph minimum weight perfect matchings | 2022-10-28 | Paper |
| The general graph matching game: approximate core | 2022-02-25 | Paper |
| Reducibility Among Protocols | 2022-01-08 | Paper |
| RSA bits are .732 + ε secure | 2022-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009626 | 2021-08-04 | Paper |
| Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem under Small Bids | 2021-07-22 | Paper |
| NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs | 2021-06-22 | Paper |
| A Proof of the MV Matching Algorithm | 2020-12-07 | Paper |
| Planar Graph Perfect Matching Is in NC | 2020-11-11 | Paper |
| Diversity in times of adversity: probabilistic strategies in microbial survival games | 2020-08-24 | Paper |
| A microbial modified prisoner's dilemma game: how frequency-dependent selection can lead to random phase variation | 2020-08-24 | Paper |
| Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion | 2020-05-27 | Paper |
| An incentive compatible, efficient market for air traffic flow management | 2020-04-07 | Paper |
| Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets | 2020-04-02 | Paper |
| A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings | 2020-03-19 | Paper |
| Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm | 2020-03-12 | Paper |
| Suboptimal cuts: Their enumeration, weight and number | 2019-12-04 | Paper |
| On Computability of Equilibria in Markets with Production | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743452 | 2019-05-10 | Paper |
| Multiway cuts in directed and node weighted graphs | 2019-04-29 | Paper |
| Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover | 2019-03-29 | Paper |
| Mutation, Sexual Reproduction and Survival in Dynamic Environments | 2018-05-03 | Paper |
| Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608044 | 2018-03-15 | Paper |
| Rock-Paper-Scissors, Differential Games and Biological Diversity | 2017-10-30 | Paper |
| An incentive compatible, efficient market for air traffic flow management | 2017-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368666 | 2017-10-10 | Paper |
| Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria | 2017-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275395 | 2017-07-13 | Paper |
| Majorizing estimators and the approximation of #P-complete problems | 2016-09-29 | Paper |
| Market equilibrium via a primal--dual algorithm for a convex program | 2015-11-11 | Paper |
| Settling Some Open Problems on 2-Player Symmetric Nash Equilibria | 2015-11-04 | Paper |
| ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria | 2015-10-27 | Paper |
| Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions | 2015-06-26 | Paper |
| Approximate max-flow min-(multi)cut theorems and their applications | 2015-05-07 | Paper |
| A primal-dual approximation algorithm for generalized Steiner network problems | 2015-05-07 | Paper |
| Learning Economic Parameters from Revealed Preferences | 2015-01-07 | Paper |
| Submodularity Helps in Nash and Nonsymmetric Bargaining Games | 2014-06-19 | Paper |
| The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game | 2014-02-17 | Paper |
| Nonseparable, Concave Utilities Are Easy---in a Perfect Price Discrimination Market Model | 2013-06-27 | Paper |
| Thrifty Algorithms for Multistage Robust Optimization | 2013-03-19 | Paper |
| Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games | 2013-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165947 | 2012-10-19 | Paper |
| A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It | 2012-05-24 | Paper |
| New geometry-inspired relaxations and algorithms for the metric Steiner tree problem | 2011-11-23 | Paper |
| Market equilibrium under separable, piecewise-linear, concave utilities | 2011-07-14 | Paper |
| Rationality and Strongly Polynomial Solvability of Eisenberg–Gale Markets with Two Agents | 2011-06-17 | Paper |
| Spending Constraint Utilities with Applications to the Adwords Market | 2011-04-27 | Paper |
| Design is as Easy as Optimization | 2011-03-15 | Paper |
| A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It | 2010-10-19 | Paper |
| 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties | 2010-10-19 | Paper |
| A stochastic process on the hypercube with applications to peer-to-peer networks | 2010-08-16 | Paper |
| Accelerating simulated annealing for the permanent and combinatorial counting problems | 2010-08-16 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Design Is as Easy as Optimization | 2009-03-12 | Paper |
| Efficiency, Fairness and Competitiveness in Nash Bargaining Games | 2009-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549634 | 2009-01-05 | Paper |
| AdWords and generalized online matching | 2008-12-21 | Paper |
| Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems | 2008-10-28 | Paper |
| Random Bichromatic Matchings | 2008-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524714 | 2008-09-12 | Paper |
| Nash Bargaining Via Flexible Budget Markets | 2008-07-10 | Paper |
| New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem | 2008-06-10 | Paper |
| Random bichromatic matchings | 2008-04-23 | Paper |
| An auction-based market equilibrium algorithm for a production model | 2007-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485629 | 2006-08-31 | Paper |
| A computationally motivated definition of parametric estimation and its applications to the Gaussian distribution | 2006-06-27 | Paper |
| Posted price profit maximization for multicast by approximating fixed points | 2006-04-28 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Multiway cuts in node weighted graphs | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736885 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470515 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801070 | 2003-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780788 | 2002-11-21 | Paper |
| Recent results on approximating the Steiner tree problem and its generalizations | 2000-06-05 | Paper |
| Finding Separator Cuts in Planar Graphs within Twice the Optimal | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258215 | 1999-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252355 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234149 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400842 | 1998-11-26 | Paper |
| Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs | 1998-09-21 | Paper |
| Primal-dual approximation algorithms for integral flow and multicut in trees | 1997-05-28 | Paper |
| Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications | 1996-05-13 | Paper |
| A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts | 1996-02-01 | Paper |
| A primal-dual approximation algorithm for generalized Steiner network problems | 1995-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763421 | 1995-04-11 | Paper |
| Finding k Cuts within Twice the Optimal | 1995-03-27 | Paper |
| A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm | 1995-02-14 | Paper |
| On-line algorithms for weighted bipartite matching and stable marriages | 1995-02-09 | Paper |
| Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees | 1994-09-05 | Paper |
| Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs | 1993-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036608 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037426 | 1993-05-18 | Paper |
| Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph | 1993-01-16 | Paper |
| Planar graph coloring is not self-reducible, assuming P\(\neq NP\) | 1991-01-01 | Paper |
| Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs | 1989-01-01 | Paper |
| NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems | 1989-01-01 | Paper |
| Maximum matchings in general graphs through randomization | 1989-01-01 | Paper |
| The Two-Processor Scheduling Problem is in Random NC | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3793731 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796778 | 1988-01-01 | Paper |
| Matching is as easy as matrix inversion | 1987-01-01 | Paper |
| Global wire routing in two-dimensional arrays | 1987-01-01 | Paper |
| Random generation of combinatorial structures from a uniform distribution | 1986-01-01 | Paper |
| NP is as easy as detecting unique solutions | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3702366 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732972 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680844 | 1984-01-01 | Paper |
| A natural encoding scheme proved probabilistic polynomial complete | 1983-01-01 | Paper |
| Scheduling open shops with parallel machines | 1982-01-01 | Paper |
| NP-completeness of some generalizations of the maximum matching problem | 1982-01-01 | Paper |
