Martin Pál

According to our database1, Martin Pál authored at least 34 papers between 2001 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
A Field Guide to Personalized Reserve Prices.
Proceedings of the 25th International Conference on World Wide Web, 2016

2011
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems.
SIAM J. Comput., 2011

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint.
SIAM J. Comput., 2011

2010
Contextual Multi-Armed Bandits.
Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010

2009
General auction mechanism for search advertising.
Proceedings of the 18th International Conference on World Wide Web, 2009

Online Ad Assignment with Free Disposal.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

An online mechanism for ad slot reservations with cancellations.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Algorithms for Secretary Problems on Graphs and Hypergraphs.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Theory research at Google.
SIGACT News, 2008

Sponsored Search Auctions with Markovian Users.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Improved algorithms for orienteering and related problems.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A Truthful Mechanism for Offline Ad Slot Scheduling.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Proportional Fairness in Multi-Rate Wireless LANs.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.
Theory of Computing, 2007

Approximation via cost sharing: Simpler and better approximation algorithms for network design.
J. ACM, 2007

Stochastic Models for Budget Optimization in Search-Based Advertising.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Budget optimization in search-based advertising auctions.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
Admission control for multihop wireless backhaul networks with QoS support.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.
Proceedings of the Approximation, 2006

2005
The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners.
Manufacturing & Service Operations Management, 2005

Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Approximation Algorithms for Stochastic Inventory Control Models.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Stochastic Steiner Trees Without a Root.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

A Recursive Greedy Algorithm for Walks in Directed Graphs.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Unbalanced Graph Cuts.
Proceedings of the Algorithms, 2005

What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.
Proceedings of the Approximation, 2005

Sampling Bounds for Stochastic Optimization.
Proceedings of the Approximation, 2005

2004
Boosted sampling: approximation algorithms for stochastic optimization.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Optimization, Games, and Quantified Constraint Satisfaction.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
Group Strategyproof Mechanisms via Primal-Dual Algorithms.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Universal Facility Location.
Proceedings of the Algorithms, 2003

2001
Facility Location with Nonuniform Hard Capacities.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001


  Loading...