OpenAlex
PricingAboutJobs
Log inGet started
Work

Some Prospects forEfficient Fixed Parameter Algorithms

HTML

Year: 1998
Type: conference-paper
Source: Lecture notes in computer science
Parent work: SOFSEM’ 98: Theory and Practice of Informatics
DOI: 10.1007/3-540-49477-4_12
Author: Rolf Niedermeier
Institution: University of Tübingen
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: parameterized algorithms, fixed-parameter tractability, parameterized complexity, exponential-time algorithms, NP-hard problems, vertex cover, MaxSAT, algorithm design techniques

Open Access status: closed
OpenAlex ID: W1968650717
FWCI: 2.369
Cites: 57
Cited by: 23
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security