The following pages link to Mihalis Yannakakis (Q458479):
Displaying 50 items.
- The Complexity of Multiterminal Cuts (Q4305362) (← links)
- Linear approximation of shortest superstrings (Q4310837) (← links)
- On the Approximation of Maximum Satisfiability (Q4314502) (← links)
- On the hardness of approximating minimization problems (Q4323730) (← links)
- (Q4356435) (← links)
- (Q4365127) (← links)
- The complexity of probabilistic verification (Q4369884) (← links)
- (Q4472253) (← links)
- Markov decision processes and regular events (Q4506554) (← links)
- (Q4535063) (← links)
- (Q4536434) (← links)
- (Q4542582) (← links)
- (Q4551151) (← links)
- Power Grid State Estimation Following a Joint Cyber and Physical Attack (Q4562375) (← links)
- Doubly Balanced Connected Graph Partitioning (Q4575873) (← links)
- (Q4608026) (← links)
- The approximation of maximum subgraph problems (Q4630247) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- Multiway cuts in directed and node weighted graphs (Q4632450) (← links)
- The Complexity of Non-Monotone Markets (Q4640292) (← links)
- The Traveling Salesman Problem with Distances One and Two (Q4697080) (← links)
- A note on succinct representations of graphs (Q4725746) (← links)
- Scheduling Opposing Forests (Q4745255) (← links)
- Tools for Template Dependencies (Q4747556) (← links)
- (Q4778537) (← links)
- (Q4804922) (← links)
- (Q4807832) (← links)
- (Q4818841) (← links)
- Multiway cuts in node weighted graphs (Q4819693) (← links)
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications (Q4877516) (← links)
- (Q4910705) (← links)
- (Q4942015) (← links)
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer (Q5080487) (← links)
- (Q5091153) (← links)
- (Q5091277) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
- Smoothed complexity of local max-cut and binary max-CSP (Q5144991) (← links)
- Suboptimal cuts: Their enumeration, weight and number (Q5204331) (← links)
- Linear programming without the matrix (Q5248478) (← links)
- On the hardness of approximating minimization problems (Q5248497) (← links)
- Approximate max-flow min-(multi)cut theorems and their applications (Q5248541) (← links)
- On the value of information in distributed decision-making (extended abstract) (Q5255806) (← links)
- Analysis of Boolean Programs (Q5326327) (← links)
- Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (Q5327434) (← links)
- A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381) (← links)
- The Complexity of Optimal Multidimensional Pricing (Q5384059) (← links)
- Node-and edge-deletion NP-complete problems (Q5402565) (← links)
- Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars (Q5415502) (← links)
- (Q5417682) (← links)
- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games (Q5449837) (← links)
