Search Sciweavers | Sciweavers

We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science hav...

Dag Normann

claim paper

Read More »

111

click to vote

WG
2007
Springer

87views Theoretical Computer Science» more WG 2007»

Approximation Algorithms for Geometric Intersection Graphs

15 years 9 months ago

Download www.cs.le.ac.uk

Klaus Jansen

claim paper

Read More »

click to vote

FOCS
2000
IEEE

97views Theoretical Computer Science» more FOCS 2000»

Polynomial Time Approximation Schemes for Geometric k-Clustering

15 years 7 months ago

Download www.cs.ucla.edu

Rafail Ostrovsky, Yuval Rabani

claim paper

Read More »

click to vote

FOCS
1994
IEEE

87views Theoretical Computer Science» more FOCS 1994»

More Output-Sensitive Geometric Algorithms (Extended Abstract)

15 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers