Near-Optimal Separators in String Graphs (Q5414151): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6482
@@ Property / arXiv ID: 1302.6482 / rank @@
+Normal rank
@@ Property / cites work @@
+Which crossing number is it anyway?
@@ Property / cites work: Which crossing number is it anyway? / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Crossing number, pair-crossing number, and expansion
+Normal rank
@@ Property / cites work @@
+Applications of a New Separator Theorem for String Graphs
+Normal rank
@@ Property / cites work @@
+On average distortion of embedding metrics into the line
+Normal rank
@@ Property / cites work @@
+Separator theorems and Turán-type results for planar intersection graphs
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for String Graphs and its Applications
+Normal rank