Остановите войну!
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 25 matches
- 2019
- Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. FCT 2019: 111-125 - Libor Barto:
Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps. FCT 2019: 3-17 - Andreas Bärtschi, Stephan J. Eidenbenz:
Deterministic Preparation of Dicke States. FCT 2019: 126-139 - Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
An Efficient Algorithm for the Fast Delivery Problem. FCT 2019: 171-184 - Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. FCT 2019: 185-200 - Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti:
Space Efficient Algorithms for Breadth-Depth Search. FCT 2019: 201-212 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular Pattern Matching with k Mismatches. FCT 2019: 213-228 - Bernard Chazelle:
Some Observations on Dynamic Random Walks and Network Renormalization. FCT 2019: 18-28 - Christian Coester, Thomas Schwentick, Martin Schuster:
Winning Strategies for Streaming Rewriting Games. FCT 2019: 49-63 - Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan:
Succinct Representations of Finite Groups. FCT 2019: 229-242 - Jesús Domínguez, Maribel Fernández:
Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting. FCT 2019: 64-79 - Riccardo Dondi, Manuel Lafond:
On the Tractability of Covering a Graph with 2-Clubs. FCT 2019: 243-257 - Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT 2019: 258-273 - Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum Rectilinear Convex Subsets. FCT 2019: 274-291 - Frank Gurski, Dominique Komander, Carolin Rehs:
Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). FCT 2019: 292-305 - Torben Hagerup:
Highly Succinct Dynamic Data Structures. FCT 2019: 29-45 - Marek Klonowski, Dariusz R. Kowalski, Jaroslaw Mirek, Prudence W. H. Wong:
Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel. FCT 2019: 306-321 - Miroslaw Kowaluk, Andrzej Lingas:
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. FCT 2019: 322-334 - Alexander Kozachinskiy, Alexander Shen:
Two Characterizations of Finite-State Dimension. FCT 2019: 80-94 - Markus Lohrey, Sebastian Maneth:
Largest Common Prefix of a Regular Tree Language. FCT 2019: 95-108 - Gianluca De Marco, Tomasz Jurdzinski, Dariusz R. Kowalski:
Optimal Channel Utilization with Limited Feedback. FCT 2019: 140-152 - Dominique Schmitt:
Bivariate B-Splines from Convex Pseudo-circle Configurations. FCT 2019: 335-349 - Duygu Vietz, Egon Wanke:
The Fault-Tolerant Metric Dimension of Cographs. FCT 2019: 350-364 - Leszek Antoni Gasieniec, Jesper Jansson, Christos Levcopoulos:
Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings. Lecture Notes in Computer Science 11651, Springer 2019, ISBN 978-3-030-25026-3 [contents] - (Withdrawn) Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle. FCT 2019: 153-167
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 18: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