Image de couverture de livre

Parameterized Algorithms for Kidney Exchange

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Maiti, Arnab, Dey, Palash
Format:	Preprint
Publié:	2021
Sujets:	Computer Science and Game Theory Data Structures and Algorithms 68Q27
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Binary Networked Public Goods Game with Altruism
par: Maiti, Arnab, et autres
Publié: (2022)

Parameterized Complexity of Directed Traveling Salesman Problem
par: Blažej, Václav, et autres
Publié: (2025)

Prediction-Augmented Mechanism Design for Weighted Facility Location
par: Shi, Yangguang, et autres
Publié: (2025)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

The NTU Partitioned Matching Game for International Kidney Exchange Programs
par: Csáji, Gergely, et autres
Publié: (2024)

Maximizing Value in Challenge the Champ Tournaments
par: Bhaskar, Umang, et autres
Publié: (2025)

Fairness and Efficiency in Two-Sided Matching Markets
par: Jain, Pallavi, et autres
Publié: (2025)

On the Parameterized Complexity of Controlling Amendment and Successive Winners
par: Yang, Yongjie
Publié: (2025)

Partitioned Matching Games for International Kidney Exchange
par: Benedek, Márton, et autres
Publié: (2023)

Algorithms for Minimum Membership Dominating Set Problem
par: Reddy, Sangam Balchandar, et autres
Publié: (2024)

Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
par: Cheng, Christine T., et autres
Publié: (2026)

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
par: Benedek, Márton, et autres
Publié: (2023)

Data Exchange Markets via Utility Balancing
par: Bhaskara, Aditya, et autres
Publié: (2024)

Pairwise Exchanges of Freely Replicable Goods with Negative Externalities
par: Yang, Shangyuan, et autres
Publié: (2026)

On weighted graph separation problems and flow-augmentation
par: Kim, Eun Jung, et autres
Publié: (2022)

Algorithmic Persuasion with Evidence
par: Hoefer, Martin, et autres
Publié: (2020)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
par: Bojikian, Narek, et autres
Publié: (2025)

Improved Parallel Algorithms for EF1 Allocations
par: Gowda, Kishen N, et autres
Publié: (2026)

A Strongly Polynomial Algorithm for Arctic Auctions
par: Garg, Jugal, et autres
Publié: (2026)

An Algorithm-to-Contract Framework without Demand Queries
par: Doron-Arad, Ilan, et autres
Publié: (2025)

Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
par: Glitzner, Frederik, et autres
Publié: (2024)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
par: Bei, Xiaohui, et autres
Publié: (2025)

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms
par: Ezra, Tomer, et autres
Publié: (2024)

Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
par: Pashkovich, Kanstantsin, et autres
Publié: (2026)

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
par: Brown, Adam, et autres
Publié: (2024)

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
par: Alpay, Faruk, et autres
Publié: (2026)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
par: Banik, Aritra, et autres
Publié: (2025)

Steiner Tree Parameterized by Multiway Cut and Even Less
par: Jansen, Bart M. P., et autres
Publié: (2024)

The Exchange Problem
par: Garg, Mohit, et autres
Publié: (2024)

Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
par: Kawase, Sota, et autres
Publié: (2024)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
par: Jansen, Klaus, et autres
Publié: (2024)

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
par: Schlotter, Ildikó, et autres
Publié: (2021)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
par: Liu, Bowen
Publié: (2025)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
par: Anagnostides, Ioannis, et autres
Publié: (2023)

Single-Sample Prophet Inequalities via Greedy-Ordered Selection
par: Caramanis, Constantine, et autres
Publié: (2021)

On Interim Envy-Free Allocation Lotteries
par: Caragiannis, Ioannis, et autres
Publié: (2021)

Condorcet Dimension and Pareto Optimality for Matchings and Beyond
par: Kavitha, Telikepalli, et autres
Publié: (2026)

Best of Both Worlds Guarantees for Equitable Allocations
par: Bhaskar, Umang, et autres
Publié: (2025)

Universal Online Contention Resolution with Preselected Order
par: Zhao, Junyao
Publié: (2025)