The following pages link to Adrian Vetta (Q487015):
Displaying 50 items.
- Routing regardless of network stability (Q487016) (← links)
- Finding odd cycle transversals. (Q703225) (← links)
- Network design via iterative rounding of setpair relaxations (Q858116) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- Galaxy cutsets in graphs (Q975761) (← links)
- Tight bounds on the relative performances of pricing mechanisms in storable good markets (Q1617678) (← links)
- Pricing policies for selling indivisible storable goods to strategic consumers (Q1730708) (← links)
- Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets (Q2067499) (← links)
- Two-buyer sequential multiunit auctions with no overbidding (Q2109940) (← links)
- How many freemasons are there? The consensus voting mechanism in metric spaces (Q2109972) (← links)
- The fair division of hereditary set systems (Q2190407) (← links)
- Bounds on the cleaning times of robot vacuums (Q2270327) (← links)
- The finite horizon, undiscounted, durable goods monopoly problem with finitely many consumers (Q2425152) (← links)
- An upper bound for the chromatic number of line graphs (Q2461774) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- On the odd-minor variant of Hadwiger's conjecture (Q2519011) (← links)
- Improved two sample revenue guarantees via mixed-integer linear programming (Q2670901) (← links)
- The price of stability of envy-free equilibria in multi-buyer sequential auctions (Q2670902) (← links)
- Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? (Q2670933) (← links)
- Two birds with one stone: fairness and welfare via transfers (Q2670942) (← links)
- Pirates in wonderland: liquid democracy has bicriteria guarantees (Q2670943) (← links)
- The price of anarchy of two-buyer sequential multiunit auctions (Q2692273) (← links)
- (Q2753746) (← links)
- (Q2768327) (← links)
- Defending Planar Graphs against Star-Cutsets (Q2851448) (← links)
- The Complexity of the Simultaneous Cluster Problem (Q2871222) (← links)
- An approximation algorithm for the maximum leaf spanning arborescence problem (Q2930326) (← links)
- A Near-Optimal Mechanism for Impartial Selection (Q2936981) (← links)
- To Save Or Not To Save: The Fisher Game (Q2936994) (← links)
- Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3 (Q2937742) (← links)
- On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms (Q3162524) (← links)
- (Q3439692) (← links)
- The Combinatorial World (of Auctions) According to GARP (Q3449587) (← links)
- (Q3455036) (← links)
- Testing Consumer Rationality Using Perfect Graphs and Oriented Discs (Q3460788) (← links)
- Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction (Q3460790) (← links)
- Approximation Algorithms for Network Design with Metric Costs (Q3519197) (← links)
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows (Q3546347) (← links)
- (Q3576679) (← links)
- Approximation algorithms for minimum-cost k-vertex connected subgraphs (Q3579233) (← links)
- (Almost) tight bounds and existence theorems for confluent flows (Q3581008) (← links)
- Approximation algorithms for network design with metric costs (Q3581389) (← links)
- On clusterings (Q3583579) (← links)
- Maximum Flows on Disjoint Paths (Q3588418) (← links)
- Approximate Min-max Relations for Odd Cycles in Planar Graphs (Q3596358) (← links)
- An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph (Q4429672) (← links)
- On the Economic Efficiency of the Combinatorial Clock Auction (Q4575680) (← links)
- (Q4602397) (← links)
- (Q4737545) (← links)
- A Theoretical Examination of Practical Game Playing: Lookahead Search (Q4910951) (← links)
