CORE
🇺🇦Â
 make metadata, not war
Services
Research
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
2 research outputs found
Approximation algorithms for NP-complete problems on planar graphs
Author
Brenda S. Baker
DOLEV D.
+9Â more
~BAR-YEHUDA R.
~CHIBA N.
~CHIBA N.
~COCKAYNE E.
~DJIDJEV H. N.
~MITCHELL S. L.
~MITCHELL S. L.
~PAPADIMITR OU C
~YANNAKAKIS M.
Publication venue
'Association for Computing Machinery (ACM)'
Publication date
Field of study
Full text link
Crossref
Virtual time
Author
BERNSTEIN P. A.
BERRY O.
+19Â more
CALTECH
CHANDY K. M.
David R. Jefferson
DIJKSTRA E. W.
FOX G. C.
JE RSON
JEF S0N
JEFFERSON D. R.
JEFFERSON D. R.
PAPADIMITR OU C
PEACOCK J. K.
PEACOCK J. K.
PEACOCK J. K.
RUSSELL D.L.
SAMADI B.
SOW ZRAL
SWAN
WULF W. A.
WYATT D.
Publication venue
'Association for Computing Machinery (ACM)'
Publication date
Field of study
Full text link
Crossref
Full text link
