Terminal-Pairability problems

Avatar
Tamás Róbert Mezei
Mathematician

My research interests include Graph Theory, Computational Geometry, and Algorithms

Publications

The thesis consists of two parts. In both parts, the problems studied are of significant interest, but are either NP-hard or unknown to …

We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is …

We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is …

We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel (1999) concerning the path-pairability of …

We investigate terminal-pairability properties of complete graphs and improve the known bounds in two open problems. We prove that the …

Talks

Commitee: András Gyárfás, Frank Hoffmann, Károly Böröczky (chair), Ervin Győri (supervisor, non-voting)