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
44
click to vote
ENDM
2010
127
views
more
ENDM 2010
»
MPQ-trees for orthogonal packing problem
14 years 15 days ago
Download
www.labri.fr
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
claim paper
Read More »
38
click to vote
ENDM
2010
111
views
more
ENDM 2010
»
Clique and chromatic number of circular-perfect graphs
14 years 15 days ago
Download
www.irit.fr
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr
Arnaud Pêcher, Annegret Katrin Wagler
claim paper
Read More »
« first
‹ previous
1
2
3
4