# Terminal-Pairability problems

Last updated on
Mar 23, 2019

##### Tamás Róbert Mezei

###### Mathematician

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

## Publications

### Extremal solutions to some art gallery and terminal-pairability problems

The thesis consists of two parts. In both parts, the problems studied are of significant interest, but are either

*NP*-hard or unknown to …### Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands

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

### Terminal-Pairability in Complete Bipartite Graphs

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

### Note on Terminal-Pairability in Complete Grid Graphs

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

### Terminal-Pairability in Complete Graphs

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

## Talks

### Doctoral Dissertation Defense

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

Nov 17, 2017 10:00 AM — 10:40 AM
Zrínyi utca 14, Budapest, Hungary