![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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 38 matches
- 2007
- Faisal N. Abu-Khzam:
Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems. Theory Comput. Syst. 41(3): 399-410 (2007) - Faisal N. Abu-Khzam, Michael R. Fellows
, Michael A. Langston, W. Henry Suters:
Crown Structures for Vertex Cover Kernelization. Theory Comput. Syst. 41(3): 411-430 (2007) - Jan A. Bergstra, Cornelis A. Middelburg
:
A Thread Algebra with Multi-Level Strategic Interleaving. Theory Comput. Syst. 41(1): 3-32 (2007) - Hans-Joachim Böckenhauer
, Juraj Hromkovic, Joachim Kneis, Joachim Kupke:
The Parameterized Approximability of TSP with Deadlines. Theory Comput. Syst. 41(3): 431-444 (2007) - Elmar Böhler, Henning Schnoor:
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. Theory Comput. Syst. 41(4): 753-777 (2007) - Michael Brinkmeier:
A Simple and Fast Min-Cut Algorithm. Theory Comput. Syst. 41(2): 369-380 (2007) - Jonathan F. Buss, Tarique Islam:
Algorithms in the W-Hierarchy. Theory Comput. Syst. 41(3): 445-457 (2007) - Liming Cai, Michael R. Fellows
, David W. Juedes
, Frances A. Rosamond
:
The Complexity of Polynomial-Time Approximation. Theory Comput. Syst. 41(3): 459-477 (2007) - F. Cedo, Ana Cortés
, Ana Ripoll
, Miquel A. Senar
, Emilio Luque
:
The Convergence of Realistic Distributed Load-Balancing Algorithms. Theory Comput. Syst. 41(4): 609-618 (2007) - Pieter Collins:
Optimal Semicomputable Approximations to Reachable and Invariant Sets. Theory Comput. Syst. 41(1): 33-48 (2007) - S. Barry Cooper, Benedikt Löwe, Peter van Emde Boas:
Theory of Computation at CiE 2005. Theory Comput. Syst. 41(1): 1-2 (2007) - Frank K. H. A. Dehne, Michael R. Fellows
, Michael A. Langston, Frances A. Rosamond
, Kim Stevens:
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. Theory Comput. Syst. 41(3): 479-492 (2007) - Rod Downey:
Foreword. Theory Comput. Syst. 41(3): 397 (2007) - Michael Elkin, David Peleg:
The Hardness of Approximating Spanner Problems. Theory Comput. Syst. 41(4): 691-729 (2007) - Amin Farjudian
:
Shrad: A Language for Sequential Real Number Computation. Theory Comput. Syst. 41(1): 49-105 (2007) - Fedor V. Fomin
, Pinar Heggernes
, Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. 41(2): 381-393 (2007) - Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang:
Dynamic Programming for Minimum Steiner Trees. Theory Comput. Syst. 41(3): 493-500 (2007) - Li Gao, Grzegorz Malewicz:
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably. Theory Comput. Syst. 41(4): 731-752 (2007) - Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Parameterized Complexity of Vertex Cover Variants. Theory Comput. Syst. 41(3): 501-520 (2007) - Gregory Z. Gutin, Arash Rafiey, Stefan Szeider
, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007) - Michael T. Hallett
, Catherine McCartin:
A Faster FPT Algorithm for the Maximum Agreement Forest Problem. Theory Comput. Syst. 41(3): 539-550 (2007) - Petr Hlinený
:
Some Hard Problems on Matroid Spikes. Theory Comput. Syst. 41(3): 551-562 (2007) - Tomasz Jurdzinski
, Krzysztof Lorys:
Leftist Grammars and the Chomsky Hierarchy. Theory Comput. Syst. 41(2): 233-256 (2007) - Sanjiv Kapoor, Mohammad Sarwat:
Bounded-Diameter Minimum-Cost Graph Problems. Theory Comput. Syst. 41(4): 779-794 (2007) - Matthias P. Krieger:
On the Incompressibility of Monotone DNFs. Theory Comput. Syst. 41(2): 211-231 (2007) - Maciej Liskiewicz, Rüdiger Reischuk:
Preface. Theory Comput. Syst. 41(2): 209-210 (2007) - Klaus Meer:
Some Relations between Approximation Problems and PCPs over the Real Numbers. Theory Comput. Syst. 41(1): 107-118 (2007) - Daniel Meister:
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers. Theory Comput. Syst. 41(2): 257-289 (2007) - Peter Bro Miltersen:
The Computational Complexity of One-Dimensional Sandpiles. Theory Comput. Syst. 41(1): 119-125 (2007) - Milad Niqui:
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory. Theory Comput. Syst. 41(1): 127-154 (2007)
skipping 8 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-13 11:32 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