Sciweavers

FOCS
1994
IEEE
13 years 7 months ago
On Rank vs. Communication Complexity
This paper concerns the open problem of Lov
Noam Nisan, Avi Wigderson
GD
2009
Springer
13 years 8 months ago
Removing Independently Even Crossings
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
MFCS
2007
Springer
13 years 9 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov