38 citations · 246 across the 68 of their papers we have counts for
6 papers · 1 filter
Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
Márton Benedek, Péter Biró, Gergely Csáji +3
In kidney exchange programmes (KEP) patients may swap their incompatible donors leading to cycles of kidney transplants. Nowadays, countries try to merge their national patient-don…
Computing pivot-minors
Konrad K. Dabrowski, François Dross, Jisu Jeong +4
A graph contains a graph as a pivot-minor if can be obtained from by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in…
Comparing Width Parameters on Graph Classes
Nick Brettell, Andrea Munaro, Daniël Paulusma +1
We study how the relationship between non-equivalent width parameters changes once we restrict to some special graph class. As width parameters, we consider treewidth, clique-width…
Computing Subset Vertex Covers in -Free Graphs
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey +3
We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph , a subset and integer , if has…
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs
Matthew Johnson, Barnaby Martin, Sukanya Pandey +3
For any finite set of graphs, a graph is -subgraph-free if it does not contain any of as a subgraph. In recent work…
Partitioned Matching Games for International Kidney Exchange
Márton Benedek, Péter Biró, Walter Kern +2
We introduce partitioned matching games as a suitable model for international kidney exchange programmes, where in each round the total number of available kidney transplants needs…