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
332
search results - page 4 / 67
»
Parameterized Graph Separation Problems
Sort
relevance
views
votes
recent
update
View
thumb
title
21
click to vote
CPM
2010
Springer
134
views
Combinatorics
»
more
CPM 2010
»
On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
14 years 4 days ago
Download
cs.nyu.edu
Minghui Jiang
claim paper
Read More »
21
click to vote
ICALP
2001
Springer
86
views
Programming Languages
»
more
ICALP 2001
»
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
13 years 11 months ago
Download
theinf1.informatik.uni-jena.de
Jochen Alber, Henning Fernau, Rolf Niedermeier
claim paper
Read More »
22
click to vote
CPM
2008
Springer
170
views
Combinatorics
»
more
CPM 2008
»
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
13 years 9 months ago
Download
www.cs.ucr.edu
Nadja Betzler, Michael R. Fellows, Christian Komus...
claim paper
Read More »
21
click to vote
CORR
2010
Springer
122
views
Education
»
more
CORR 2010
»
Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs
13 years 4 months ago
Download
www.lirmm.fr
Mathieu Chapelle
claim paper
Read More »
27
click to vote
SODA
2010
ACM
235
views
Algorithms
»
more
SODA 2010
»
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
14 years 4 months ago
Download
www.ii.uib.no
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
claim paper
Read More »
« Prev
« First
page 4 / 67
Last »
Next »