![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.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 32 matches
- 2011
- Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online Maximum k-Coverage. FCT 2011: 181-192 - Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Reactive Turing Machines. FCT 2011: 348-359 - Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux
, Adrien Richard:
On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems. FCT 2011: 126-137 - Annabell Berger, Matthias Müller-Hannemann
:
Dag Realizations of Directed Degree Sequences. FCT 2011: 264-275 - Stéphane Bessy, Anthony Perez:
Polynomial Kernels for Proper Interval Completion and Related Problems. FCT 2011: 229-239 - Robert Bredereck
, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
The Effect of Homogeneity on the Complexity of k-Anonymity. FCT 2011: 53-64 - Nathaniel Charlton, Bernhard Reus
:
Specification Patterns and Proofs for Recursion through the Store. FCT 2011: 310-321 - Krishnendu Chatterjee, Laurent Doyen, Rohit Singh:
On Memoryless Quantitative Objectives. FCT 2011: 148-159 - Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. FCT 2011: 288-297 - Florian Corzilius, Erika Ábrahám
:
Virtual Substitution for SMT-Solving. FCT 2011: 360-371 - Martin Ebbesen, Paul Fischer, Carsten Witt
:
Edge-Matching Problems with Rotations. FCT 2011: 114-125 - Elliot Fairweather, Maribel Fernández, Murdoch James Gabbay
:
Principal Types for Nominal Theories. FCT 2011: 160-172 - Stephen A. Fenner:
Functions That Preserve p-Randomness. FCT 2011: 336-347 - Fabien Givors, Grégory Lafitte:
Sub-computabilities. FCT 2011: 322-335 - Petr A. Golovach
, Daniël Paulusma
, Jian Song:
Coloring Graphs without Short Cycles and Long Induced Paths. FCT 2011: 193-204 - Sergey Goncharov
, Lutz Schröder
:
A Coinductive Calculus for Asynchronous Side-Effecting Processes. FCT 2011: 276-287 - Yuri Gurevich:
Impugning Randomness, Convincingly. FCT 2011: 38 - Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. FCT 2011: 138-147 - Pinar Heggernes
, Pim van 't Hof
, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger:
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT 2011: 240-251 - Paul Hunter
:
LIFO-Search on Digraphs: A Searching Game for Cycle-Rank. FCT 2011: 217-228 - Bart M. P. Jansen, Stefan Kratsch:
Data Reduction for Graph Coloring Problems. FCT 2011: 90-101 - Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary
, Lhouari Nourine:
Enumeration of Minimal Dominating Sets and Variants. FCT 2011: 298-309 - Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai:
Computational Randomness from Generalized Hardcore Sets. FCT 2011: 78-89 - Daniel Lokshtanov:
Kernelization: An Overview. FCT 2011: 39-40 - Guillaume Malod:
Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes. FCT 2011: 205-216 - Klaus Meer:
Almost Transparent Short Proofs for NPℝ. FCT 2011: 41-52 - José Meseguer, Grigore Rosu:
The Rewriting Logic Semantics Project: A Progress Report. FCT 2011: 1-37 - Mila Dalla Preda, Cinzia Di Giusto:
Hunting Distributed Malware with the κ-Calculus. FCT 2011: 102-113 - Ludwig Staiger:
Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension. FCT 2011: 252-263 - A. N. Trahtman:
Modifying the Upper Bound on the Length of Minimal Synchronizing Word. FCT 2011: 173-180
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.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-07-02 10:18 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