Algorithms for graphs embedable with few crossings per egde

Research output: Working paper / Preprint › Working paper

1663 Downloads (Pure)

Original language	English
Place of Publication	Maastricht
Publisher	METEOR, Maastricht University School of Business and Economics
Number of pages	4
DOIs	https://doi.org/10.26481/umamet.2004035
Publication status	Published - 1 Jan 2004

Series	METEOR Research Memorandum
Number	035

Access to Document

@techreport{68015a0d4d4647ae8800759c77f325f1,

title = "Algorithms for graphs embedable with few crossings per egde",

author = "A. Grigoriev and H.L. Bodlaender",

year = "2004",

month = jan,

day = "1",

doi = "10.26481/umamet.2004035",

language = "English",

series = "METEOR Research Memorandum",

publisher = "METEOR, Maastricht University School of Business and Economics",

number = "035",

type = "WorkingPaper",

institution = "METEOR, Maastricht University School of Business and Economics",

}

TY - UNPB

T1 - Algorithms for graphs embedable with few crossings per egde

AU - Grigoriev, A.

AU - Bodlaender, H.L.

PY - 2004/1/1

Y1 - 2004/1/1

U2 - 10.26481/umamet.2004035

DO - 10.26481/umamet.2004035

M3 - Working paper

T3 - METEOR Research Memorandum

BT - Algorithms for graphs embedable with few crossings per egde

PB - METEOR, Maastricht University School of Business and Economics

CY - Maastricht

ER -