Piotr Krysta - RankMe

87 papers A* 20A 12B 6Misc 4Journal 35Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Beating Competitive Ratio 4 for Graphic Matroid Secretary. ESA Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Danny Mittal, Jan Olkowski
2025	J	`jnl`	Beating Competitive Ratio 4 for Graphic Matroid Secretary. CoRR Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Danny Mittal, Jan Olkowski
2025	A*	`conf`	Delegated Choice with Combinatorial Constraints. EC Kiarash Banihashem, Mohammad Taghi Hajiaghayi, Piotr Krysta, Suho Shin
2025	A*	`conf`	Delegation with Costly Inspection. EC Mohammad Taghi Hajiaghayi, Piotr Krysta, Mohammad Mahdavi, Suho Shin
2025	J	`jnl`	Delegation with Costly Inspection. CoRR Mohammad T. Hajiaghayi, Piotr Krysta, Mohammad Mahdavi, Suho Shin
2025	J	`jnl`	Selling Privacy in Blockchain Transactions. CoRR Georgios Chionas, Olga Gorelkina, Piotr Krysta, Rida Laraki
2025	A	`conf`	What Is the Minimum Number of Random Bits Required for Computability and Efficiency in Anonymous Networks? APPROX/RANDOM Dariusz R. Kowalski, Piotr Krysta, Shay Kutten
2024	—	`conf`	MEV Sharing with Dynamic Extraction Rates. DeFi@CCS Pedro Braga, Georgios Chionas, Piotr Krysta, Stefanos Leonardos, Georgios Piliouras, Carmine Ventre
2024	J	`jnl`	On the Redistribution of Maximal Extractable Value: A Dynamic Mechanism. CoRR Pedro Braga, Georgios Chionas, Stefanos Leonardos, Piotr Krysta, Georgios Piliouras, Carmine Ventre
2024	A*	`conf`	Online Sampling and Decision Making with Low Entropy. IJCAI Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
2024	A*	`conf`	Power of Posted-price Mechanisms for Prophet Inequalities. SODA Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
2024	J	`jnl`	Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs. Algorithmica Piotr Krysta, Mathieu Mari, Nan Zhi
2024	A	`conf`	Who gets the Maximal Extractable Value? A Dynamic Sharing Blockchain Mechanism. AAMAS Pedro Braga, Georgios Chionas, Piotr Krysta, Stefanos Leonardos, Georgios Piliouras, Carmine Ventre
2023	A*	`conf`	Adversarial Contention Resolution Games. IJCAI Giorgos Chionas, Bogdan S. Chlebus, Dariusz R. Kowalski, Piotr Krysta
2023	A*	`conf`	Combinatorial Group Testing with Selfish Agents. NeurIPS Georgios Chionas, Dariusz R. Kowalski, Piotr Krysta
2023	J	`jnl`	First Order Methods for Geometric Optimization of Crystal Structures. CoRR Antonia Tsili, Matthew S. Dyer, Vladimir V. Gusev, Piotr Krysta, Rahul Savani
2023	J	`jnl`	Optimality guarantees for crystal structure prediction. Nat. Vladimir V. Gusev, Duncan Adamson, Argyrios Deligkas, Dmytro Antypov, Christopher M. Collins, Piotr Krysta, Igor Potapov, George R. Darling, Matthew S. Dyer, Paul G. Spirakis, Matthew J. Rosseinsky
2022	J	`jnl`	Optimal Algorithms for Free Order Multiple-Choice Secretary. CoRR Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
2021	A*	`conf`	Efficient Truthful Scheduling and Resource Allocation through Monitoring. AAAI Dimitris Fotakis, Piotr Krysta, Carmine Ventre
2021	J	`jnl`	Entropy-Based Approximation of the Secretary Problem. CoRR Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
2020	A*	`conf`	Ultimate greedy approximation of independent sets in subcubic graphs. SODA Piotr Krysta, Mathieu Mari, Nan Zhi
2020	J	`jnl`	Ultimate greedy approximation of independent sets in subcubic graphs. CoRR Piotr Krysta, Mathieu Mari, Nan Zhi
2019	J	`jnl`	Deterministic coloring algorithms in the LOCAL model. CoRR Dariusz R. Kowalski, Piotr Krysta
2019	J	`jnl`	Network Pollution Games. Algorithmica Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang
2019	J	`jnl`	Size Versus Truthfulness in the House Allocation Problem. Algorithmica Piotr Krysta, David F. Manlove, Baharak Rastegari, Jinshan Zhang
2019	—	`conf`	Truthful Mechanisms for Multi Agent Self-interested Correspondence Selection. ISWC (1) Nan Zhi, Terry R. Payne, Piotr Krysta, Minming Li
2018	J	`jnl`	The Power of Verification for Greedy Mechanism Design. J. Artif. Intell. Res. Dimitris Fotakis, Piotr Krysta, Carmine Ventre
2017	J	`jnl`	Combinatorial Auctions Without Money. Algorithmica Dimitris Fotakis, Piotr Krysta, Carmine Ventre
2017	J	`jnl`	Learning Powers of Poisson Binomial Distributions. CoRR Dimitris Fotakis, Vasilis Kontonis, Piotr Krysta, Paul G. Spirakis
2017	A	`conf`	Mechanism Design for Ontology Alignment. AAMAS Piotr Krysta, Minming Li, Terry R. Payne, Nan Zhi
2016	A*	`conf`	House Markets with Matroid and Knapsack Constraints. ICALP Piotr Krysta, Jinshan Zhang
2016	A	`conf`	Network Pollution Games. AAMAS Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang
2016	Misc	`conf`	New Results for Network Pollution Games. COCOON Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang
2016	—	`ch.`	Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms Piotr Krysta, Berthold Vöcking
2015	J	`jnl`	Combinatorial auctions with verification are tractable. Theor. Comput. Sci. Piotr Krysta, Carmine Ventre
2015	J	`jnl`	Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods. J. Artif. Intell. Res. Piotr Krysta, Orestis Telelis, Carmine Ventre
2015	A*	`conf`	Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions. IJCAI Piotr Krysta, Orestis Telelis, Carmine Ventre
2015	A	`conf`	The Power of Verification for Greedy Mechanism Design. AAMAS Dimitris Fotakis, Piotr Krysta, Carmine Ventre
2014	A	`conf`	Combinatorial auctions without money. AAMAS Dimitris Fotakis, Piotr Krysta, Carmine Ventre
2014	J	`jnl`	Size versus truthfulness in the House Allocation problem. CoRR Piotr Krysta, David F. Manlove, Baharak Rastegari, Jinshan Zhang
2014	A*	`conf`	Size versus truthfulness in the house allocation problem. EC Piotr Krysta, David F. Manlove, Baharak Rastegari, Jinshan Zhang
2014	J	`jnl`	Utilitarian Mechanism Design for Multiobjective Optimization. SIAM J. Comput. Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre
2013	J	`jnl`	Combinatorial Auctions without Money. CoRR Dimitris Fotakis, Piotr Krysta, Carmine Ventre
2013	A	`conf`	Mechanisms for multi-unit combinatorial auctions with a few distinct goods. AAMAS Piotr Krysta, Orestis Telelis, Carmine Ventre
2013	J	`jnl`	Ranking Games that have Competitiveness-based Strategies CoRR Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
2013	J	`jnl`	Ranking games that have competitiveness-based strategies. Theor. Comput. Sci. Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
2012	—	`conf`	Limited Supply Online Auctions for Revenue Maximization. WINE Piotr Krysta, Orestis Telelis
2012	—	`conf`	Online Mechanism Design (Randomized Rounding on the Fly). ICALP (2) Piotr Krysta, Berthold Vöcking
2012	J	`jnl`	Stackelberg Network Pricing Games. Algorithmica Patrick Briest, Martin Hoefer, Piotr Krysta
2011	J	`jnl`	Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. Patrick Briest, Piotr Krysta, Berthold Vöcking
2011	J	`jnl`	Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM J. Comput. Patrick Briest, Piotr Krysta
2011	B	`conf`	Externalities among Advertisers in Sponsored Search. SAGT Dimitris Fotakis, Piotr Krysta, Orestis Telelis
2010	—	`conf`	Combinatorial Auctions with Verification Are Tractable. ESA (2) Piotr Krysta, Carmine Ventre
2010	A	`conf`	Combinatorial auctions with externalities. AAMAS Piotr Krysta, Tomasz P. Michalak, Tuomas Sandholm, Michael J. Wooldridge
2010	A*	`conf`	Ranking games that have competitiveness-based strategies. EC Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
2010	J	`jnl`	Selfish Traffic Allocation for Server Farms. SIAM J. Comput. Artur Czumaj, Piotr Krysta, Berthold Vöcking
2010	A*	`conf`	Utilitarian Mechanism Design for Multi-Objective Optimization. SODA Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre
2008	B	`conf`	On the Approximability of Combinatorial Exchange Problems. SAGT Moshe Babaioff, Patrick Briest, Piotr Krysta
2008	—	`conf`	Social Context Games. WINE Itai Ashlagi, Piotr Krysta, Moshe Tennenholtz
2008	J	`jnl`	Stackelberg Network Pricing Games CoRR Patrick Briest, Martin Hoefer, Piotr Krysta
2008	A	`conf`	Stackelberg Network Pricing Games. STACS Patrick Briest, Martin Hoefer, Piotr Krysta
2008	—	`ch.`	Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms Piotr Krysta, Berthold Vöcking
2007	A*	`conf`	Buying cheap is expensive: hardness of non-parametric multi-product pricing. SODA Patrick Briest, Piotr Krysta
2007	J	`jnl`	Stackelberg Network Pricing Games. Electron. Colloquium Comput. Complex. Patrick Briest, Martin Hoefer, Piotr Krysta
2006	B	`conf`	An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions. WAOA Jörg Knoche, Piotr Krysta
2006	J	`jnl`	Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. Electron. Colloquium Comput. Complex. Patrick Briest, Piotr Krysta
2006	J	`jnl`	Computing equilibria for a service provider game with (Im)perfect information. ACM Trans. Algorithms René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
2006	J	`jnl`	Efficient approximation algorithms for the achromatic number. Theor. Comput. Sci. Piotr Krysta, Krzysztof Lorys
2006	A*	`conf`	Single-minded unlimited supply pricing on sparse instances. SODA Patrick Briest, Piotr Krysta
2005	A*	`conf`	Approximation techniques for utilitarian mechanism design. STOC Patrick Briest, Piotr Krysta, Berthold Vöcking
2005	Misc	`conf`	Bicriteria Network Design via Iterative Rounding. COCOON Piotr Krysta
2005	Misc	`conf`	Geometric Network Design with Selfish Agents. COCOON Martin Hoefer, Piotr Krysta
2005	B	`conf`	Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. MFCS Piotr Krysta
2004	A*	`conf`	Computing equilibria for congestion games with (im)perfect information. SODA René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
2003	—	`conf`	An Experimental Study of Euro-Par Amit Agarwal, Tarun Agarwal, Sumit Chopra, Anja Feldmann, Nils Kammenhuber, Piotr Krysta, Berthold Vöcking
2003	J	`jnl`	Approximating minimum size {1, 2}-connected network. Discret. Appl. Math. Piotr Krysta
2003	A*	`conf`	Optimizing misdirection. SODA Piotr Berman, Piotr Krysta
2003	B	`conf`	Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS Piotr Krysta, Peter Sanders, Berthold Vöcking
2002	A*	`conf`	Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. SODA Béla Csaba, Marek Karpinski, Piotr Krysta
2002	A*	`conf`	Selfish traffic allocation for server farms. STOC Artur Czumaj, Piotr Krysta, Berthold Vöcking
2001	J	`jnl`	Approximation Algorithms for Bounded Facility Location Problems. J. Comb. Optim. Piotr Krysta, Roberto Solis-Oba
2001	A	`conf`	Approximation Algorithms for Minimum Size 2-Connectivity Problems. STACS Piotr Krysta, V. S. Anil Kumar
2001	—	`—`	Approximation algorithms for combinatorial optimization problems in graph coloring and network desig. Piotr Krysta
1999	Misc	`conf`	Approximation Algorithms for Bounded Facility Location. COCOON Piotr Krysta, Roberto Solis-Oba
1999	A	`conf`	Efficient Approximation Algorithms for the Achromatic Number. ESA Piotr Krysta, Krzysztof Lorys
1999	J	`jnl`	The STO problem is NP-complete. J. Symb. Comput. Piotr Krysta, Leszek Pacholski
1997	B	`conf`	External Inverse Pattern Matching. CPM Leszek Gasieniec, Piotr Indyk, Piotr Krysta