# Martin Pál

According to our database

Collaborative distances:

^{1}, Martin Pál authored at least 42 papers between 2001 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2024

Proc. Priv. Enhancing Technol., 2024

2021

Oper. Res., 2021

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

CoRR, 2020

2018

CoRR, 2018

2016

Proceedings of the 25th International Conference on World Wide Web, 2016

2012

ACM Trans. Algorithms, 2012

2011

Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems.

SIAM J. Comput., 2011

SIAM J. Comput., 2011

2010

Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010

CoRR, 2010

Algorithmica, 2010

2009

Proceedings of the 18th International Conference on World Wide Web, 2009

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

SIGACT News, 2008

CoRR, 2008

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

An O(log <i>n</i>) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.

Theory Comput., 2007

Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.

ACM Trans. Algorithms, 2007

Math. Oper. Res., 2007

Approximation via cost sharing: Simpler and better approximation algorithms for network design.

J. ACM, 2007

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

Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

An <i>O</i>(log<i>n</i>) Approximation Ratio for the Asymmetric Traveling Salesman <i>Path</i> Problem.

Proceedings of the Approximation, 2006

2005

Cost Sharing and Approximation.

PhD thesis, 2005

Manuf. Serv. Oper. Manag., 2005

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Proceedings of the Algorithms, 2005

What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.

Proceedings of the Approximation, 2005

Proceedings of the Approximation, 2005

2004

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

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

Proceedings of the Algorithms, 2003

2001

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001