Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
25
click to vote
STOC
2001
ACM
favorite
Email
discuss
report
144
views
Algorithms
»
more
STOC 2001
»
Decidability of string graphs
14 years 10 months ago
Download
people.cs.uchicago.edu
Marcus Schaefer, Daniel Stefankovic
Real-time Traffic
Algorithms
|
STOC 2001
|
claim paper
Related Content
»
Recognizing string graphs in NP
»
Formal Properties of Gene Assembly Equivalence Problem for Overlap Graphs
»
Clustering of Short Strings in Large Databases
»
Reachability in Unions of Commutative Rewriting Systems Is Decidable
»
A Separator Theorem for String Graphs and its Applications
»
Sequencing from Compomers The Puzzle
»
Open Graphs and Monoidal Theories
»
MicroMacro Stack Systems A New Frontier of Elementary Decidability for Sequential Systems
»
Exact Distribution of Deletion Sizes for Unavoidable Strings
more »
Post Info
More Details (n/a)
Added
03 Dec 2009
Updated
03 Dec 2009
Type
Conference
Year
2001
Where
STOC
Authors
Marcus Schaefer, Daniel Stefankovic
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision