5 Einträge gefunden

1. Deciding whether a grid is a topological subgraph of a planar graph is NP-complete

   1. Jiménez, Andrea
   2. Schmidt, Tina Janne

   2020 - TUHH Open Research
2. Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete

   1. Jiménez, Andrea
   2. Schmidt, Tina Janne

   2019 - TUHH Open Research - frei zugänglich
3. On minimum bisection and related cut problems in trees and tree-like graphs

   1. Fernandes, Cristina G.
   2. Schmidt, Tina Janne
   3. Taraz, Anusch

   2018 - TUHH Open Research
4. On minimum bisection and related partition problems in graphs with bounded tree width

   1. Fernandes, Cristina G.
   2. Schmidt, Tina Janne
   3. Taraz, Anusch

   2015 - TUHH Open Research
5. Approximating Minimum k-Section in Trees with Linear Diameter

   1. Fernandes, Cristina G.
   2. Schmidt, Tina Janne
   3. Taraz, Anusch

   2015 - TUHH Open Research