Crossing Numbers and Parameterized Complexity (Q5452207): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-77537-9_6
+Normal rank
@@ Property / OpenAlex ID @@
+W1708570965
@@ Property / OpenAlex ID: W1708570965 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing crossing numbers in quadratic time
@@ Property / cites work: Computing crossing numbers in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549636
@@ Property / cites work: Q3549636 / rank @@
+Normal rank
@@ Property / cites work @@
+String graphs requiring exponential representations
+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 @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3576669
@@ Property / cites work: Q3576669 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of string graphs
@@ Property / cites work: Decidability of string graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Note on the pair-crossing number and the odd-crossing number
+Normal rank
@@ Property / cites work @@
+Q5290280
@@ Property / cites work: Q5290280 / rank @@
+Normal rank