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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
A new trust region technique for the maximum weight clique p...
Sort
relevance
views
votes
recent
update
View
thumb
title
134
click to vote
DAM
2006
87
views
more
DAM 2006
»
A new trust region technique for the maximum weight clique problem
15 years 5 months ago
Download
www.stasbusygin.org
A new simple generalization of the Motzkin
Stanislav Busygin
claim paper
Read More »
141
click to vote
MST
2010
107
views
more
MST 2010
»
Fixed-Parameter Algorithms for Cluster Vertex Deletion
15 years 4 months ago
Download
theinf1.informatik.uni-jena.de
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
Falk Hüffner, Christian Komusiewicz, Hannes M...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »