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
12
click to vote
DAGSTUHL
2003
favorite
Email
discuss
report
87
views
Software Engineering
»
more
DAGSTUHL 2003
»
Some Algorithmic Problems in Polytope Theory
13 years 10 months ago
Download
www.math.tu-bs.de
Volker Kaibel, Marc E. Pfetsch
Real-time Traffic
DAGSTUHL 2003
|
DAGSTUHL 2007
|
claim paper
Related Content
»
Some problems in asymptotic convex geometry and random matrices motivated by numerical alg...
»
How Good are Convex Hull Algorithms
»
Computing hereditary convex structures
»
ILPBased Scheduling with Time and Resource Constraints in High Level Synthesis
»
Upper Bounds on the Complexity of Some Galois Theory Problems
»
Approximating Transitive Reductions for Directed Networks
»
Coresets for polytope distance
»
Embedding 3polytopes on a small grid
»
Solving the feedback vertex set problem on undirected graphs
more »
Post Info
More Details (n/a)
Added
31 Oct 2010
Updated
31 Oct 2010
Type
Conference
Year
2003
Where
DAGSTUHL
Authors
Volker Kaibel, Marc E. Pfetsch
Comments
(0)
Researcher Info
Software Engineering Study Group
Computer Vision