Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 21 matches
- 2008
- Omid Amini, Ignasi Sau, Saket Saurabh:
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC 2008: 13-29 - Yonatan Aumann, Yair Dombb:
Fixed Structure Complexity. IWPEC 2008: 30-42 - Sebastian Böcker, Quang Bao Anh Bui, Anke Truß:
An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees. IWPEC 2008: 43-54 - Hans L. Bodlaender, Eelko Penninkx:
A Linear Kernel for Planar Feedback Vertex Set. IWPEC 2008: 160-171 - Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. IWPEC 2008: 55-65 - Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith:
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. IWPEC 2008: 66-77 - Jianer Chen:
Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters. IWPEC 2008: 1-8 - Erik D. Demaine:
Algorithmic Graph Minors and Bidimensionality. IWPEC 2008: 9 - Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Capacitated Domination and Covering: A Parameterized Perspective. IWPEC 2008: 78-90 - Khaled M. Elbassioni, Matthias Hagen, Imran Rauf:
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. IWPEC 2008: 91-102 - Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond:
A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114 - Sylvain Guillemot:
Parameterized Complexity and Approximability of the SLCS Problem. IWPEC 2008: 115-128 - Sylvain Guillemot:
FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs. IWPEC 2008: 129-140 - Stephan Kreutzer:
Algorithmic Meta-theorems. IWPEC 2008: 10-12 - Daniel Lokshtanov:
Wheel-Free Deletion Is W[2]-Hard. IWPEC 2008: 141-147 - Moritz Müller:
Parameterized Derandomization. IWPEC 2008: 148-159 - Johan M. M. van Rooij, Hans L. Bodlaender:
Exact Algorithms for Edge Domination. IWPEC 2008: 214-225 - Allan Scott, Ulrike Stege:
Parameterized Chess. IWPEC 2008: 172-189 - Patrick Traxler:
The Time Complexity of Constraint Satisfaction. IWPEC 2008: 190-201 - Magnus Wahlström:
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. IWPEC 2008: 202-213 - Martin Grohe, Rolf Niedermeier:
Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings. Lecture Notes in Computer Science 5018, Springer 2008, ISBN 978-3-540-79722-7 [contents]
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-23 08:26 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint