Остановите войну!
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 28 matches
- 2009
- Noga Alon, Shai Gutner:
Balanced Hashing, Color Coding and Approximate Counting. IWPEC 2009: 1-16 - Sebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström:
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. IWPEC 2009: 38-49 - Hans L. Bodlaender:
Kernelization: New Upper and Lower Bound Techniques. IWPEC 2009: 17-37 - Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx:
Planar Capacitated Dominating Set Is W[1]-Hard. IWPEC 2009: 50-60 - Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Boolean-Width of Graphs. IWPEC 2009: 61-74 - Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
The Complexity of Satisfiability of Small Depth Circuits. IWPEC 2009: 75-85 - Jean Daligault, Stéphan Thomassé:
On Finding Directed Trees with Many Leaves. IWPEC 2009: 86-97 - Peter Damaschke:
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. IWPEC 2009: 98-109 - Peter Damaschke:
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. IWPEC 2009: 110-121 - Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý:
What Makes Equitable Connected Partition Easy. IWPEC 2009: 122-133 - Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen:
Improved Induced Matchings in Sparse Graphs. IWPEC 2009: 134-148 - Michael R. Fellows, Danny Hermelin, Frances A. Rosamond:
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC 2009: 149-160 - Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC 2009: 161-172 - Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan:
An Exponential Time 2-Approximation Algorithm for Bandwidth. IWPEC 2009: 173-184 - Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197 - Panos Giannopoulos, Christian Knauer, Günter Rote:
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. IWPEC 2009: 198-209 - Petr A. Golovach, Dimitrios M. Thilikos:
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. IWPEC 2009: 210-221 - Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon:
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. IWPEC 2009: 222-233 - Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245 - Shai Gutner:
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. IWPEC 2009: 246-257 - Mikko Koivisto:
Partitioning into Sets of Bounded Cardinality. IWPEC 2009: 258-263 - Stefan Kratsch, Magnus Wahlström:
Two Edge Modification Problems without Polynomial Kernels. IWPEC 2009: 264-275 - Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
On the Directed Degree-Preserving Spanning Tree Problem. IWPEC 2009: 276-287 - Daniel Lokshtanov, Saket Saurabh:
Even Faster Algorithm for Set Splitting! IWPEC 2009: 288-299 - Dániel Marx, Ildikó Schlotter:
Stable Assignment with Couples: Parameterized Complexity and Local Search. IWPEC 2009: 300-311 - Narges Simjour:
Improved Parameterized Algorithms for the Kemeny Aggregation Problem. IWPEC 2009: 312-323 - Karol Suchan, Yngve Villanger:
Computing Pathwidth Faster Than 2n. IWPEC 2009: 324-335 - Jianer Chen, Fedor V. Fomin:
Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5917, Springer 2009, ISBN 978-3-642-11268-3 [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-07-20 16:41 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