Tina Janne Schmidt

According to our database, Tina Janne Schmidt authored at least 5 papers between 2015 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2019

Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete.

Andrea Jiménez, Tina Janne Schmidt

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

On minimum bisection and related cut problems in trees and tree-like graphs.

Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz

J. Graph Theory, 2018

2017

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter.

Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz

CoRR, 2017

2015

Approximating Minimum k-Section in Trees with Linear Diameter.

Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz

Electron. Notes Discret. Math., 2015

On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width.

Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz

Electron. Notes Discret. Math., 2015