Остановите войну!
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 50 matches
- 2005
- Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot:
(Non)-Approximability for the Multi-criteria TSP(1, 2). FCT 2005: 329-340 - Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga:
The Delayed k-Server Problem. FCT 2005: 281-292 - Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough:
A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT 2005: 115-124 - Julien Bernet, David Janin:
Tree Automata and Discrete Distributed Games. FCT 2005: 540-551 - Markus Bläser, L. Shankar Ram:
An Improved Approximation Algorithm for TSP with Distances One and Two. FCT 2005: 504-515 - Beate Bollig:
Property Testing and the Branching Program Size of Boolean Functions. FCT 2005: 258-269 - Benedikt Bollig:
On the Expressiveness of Asynchronous Cellular Automata. FCT 2005: 528-539 - Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura:
On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems. FCT 2005: 197-208 - Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Path Coupling Using Stopping Times. FCT 2005: 19-31 - Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk:
The Maximum Resource Bin Packing Problem. FCT 2005: 397-408 - Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin:
Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196 - Andreas Brandstädt, Van Bang Le, Suhail Mahfud:
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. FCT 2005: 516-527 - Michael Brinkmeier:
A Simple and Fast Min-cut Algorithm. FCT 2005: 317-328 - Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois:
The Complexity of Semilinear Problems in Succinct Representation. FCT 2005: 479-490 - Bogdan S. Chlebus, Dariusz R. Kowalski:
Almost Optimal Explicit Selectors. FCT 2005: 270-280 - Julien Cristau, Christof Löding, Wolfgang Thomas:
Deterministic Automata on Unranked Trees. FCT 2005: 68-79 - Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang:
Bounds on the Power of Constant-Depth Quantum Circuits. FCT 2005: 44-55 - Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms. FCT 2005: 161-171 - Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven:
On the Black-Box Complexity of Sperner's Lemma. FCT 2005: 245-257 - Bernd Gärtner, Leo Rüst:
Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems. FCT 2005: 209-220 - Joachim Giesen, Dieter Mitsche:
Reconstructing Many Partitions Using Spectral Techniques. FCT 2005: 433-444 - Alexander Grigoriev, Hans L. Bodlaender:
Algorithms for Graphs Embeddable with Few Crossings Per Edge. FCT 2005: 378-387 - Martin Grohe, Christoph Koch, Nicole Schweikardt:
The Complexity of Querying External Memory and Streaming Data. FCT 2005: 1-16 - Jiong Guo, Rolf Niedermeier, Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT 2005: 172-184 - Yo-Sub Han, Derick Wood:
A New Linearizing Restriction in the Pattern Matching Problem. FCT 2005: 552-562 - Kouichi Hirata, Megumi Kuwabara, Masateru Harao:
On Finding Acyclic Subhypergraphs. FCT 2005: 491-503 - Michael Hoffmann, Richard M. Thomas:
Biautomatic Semigroups. FCT 2005: 56-67 - Markus Holzer, Friedrich Otto:
Shrinking Multi-pushdown Automata. FCT 2005: 305-316 - Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Fully Incremental LCS Computation. FCT 2005: 563-574 - Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai:
Translational Lemmas for Alternating TMs and PRAMs. FCT 2005: 137-148
skipping 20 more matches
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-31 07:12 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