![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 14,741 matches
- 2024
- Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit
:
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. Theor. Comput. Sci. 990: 114402 (2024) - Marios Adamoudis, Konstantinos A. Draziotis, Dimitrios Poulakis
:
Attacking (EC)DSA scheme with ephemeral keys sharing specific bits. Theor. Comput. Sci. 1001: 114578 (2024) - Nada Almalki
, Othon Michail:
On geometric shape construction via growth operations. Theor. Comput. Sci. 984: 114324 (2024) - Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes
:
Self-stabilizing synchronous unison in directed networks. Theor. Comput. Sci. 1001: 114577 (2024) - Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theor. Comput. Sci. 981: 114230 (2024) - Samuel N. Araújo, João Marcos Brito, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio
:
Graph convexity impartial games: Complexity and winning strategies. Theor. Comput. Sci. 998: 114534 (2024) - Rocco Ascone
, Giulia Bernardini
, Luca Manzoni
:
Fixed points and attractors of reactantless and inhibitorless reaction systems. Theor. Comput. Sci. 984: 114322 (2024) - Aistis Atminas
, Vadim V. Lozin:
Deciding atomicity of subword-closed languages. Theor. Comput. Sci. 1003: 114595 (2024) - Romain Azaïs
, Florian Ingels:
Detection of common subtrees with identical label distribution. Theor. Comput. Sci. 988: 114366 (2024) - Oliver Bachtler
, Tim Bergner
, Sven O. Krumke:
Almost disjoint paths and separating by forbidden pairs. Theor. Comput. Sci. 982: 114272 (2024) - Tian Bai, Mingyu Xiao
:
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs. Theor. Comput. Sci. 984: 114326 (2024) - Ambroise Baril, Antoine Castillon, Nacim Oijid
:
On the parameterized complexity of non-hereditary relaxations of clique. Theor. Comput. Sci. 1003: 114625 (2024) - Jean-Luc Baril, José Luis Ramírez
, Fabio A. Velandia:
Bijections between directed-column convex polyominoes and restricted compositions. Theor. Comput. Sci. 1003: 114626 (2024) - Julien Baste, Dimitri Watel:
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theor. Comput. Sci. 990: 114406 (2024) - Prashant Batra, Vikram Sharma
:
Complexity of a root clustering algorithm for holomorphic functions. Theor. Comput. Sci. 999: 114504 (2024) - Bishnu Charan Behera, Somindu C. Ramanna:
Unbounded non-zero inner product encryption. Theor. Comput. Sci. 1000: 114548 (2024) - Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani
, Antonios Symvonis:
Convex grid drawings of planar graphs with constant edge-vertex resolution. Theor. Comput. Sci. 982: 114290 (2024) - Kristóf Bérczi
, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002: 114596 (2024) - Daniel Berend, Liat Cohen, Omrit Filtser
:
A tour of general Hanoi graphs. Theor. Comput. Sci. 983: 114289 (2024) - Daniel Berend, S. Mamana:
A probabilistic algorithm for vertex cover. Theor. Comput. Sci. 983: 114306 (2024) - Sophie Berthelette, Gilles Brassard, Xavier Coiteux-Roy:
On computable numbers, with an application to the Druckproblem. Theor. Comput. Sci. 1002: 114573 (2024) - Bernard Berthomieu, Dmitry A. Zaitsev
:
Sleptsov nets are Turing-complete. Theor. Comput. Sci. 986: 114346 (2024) - Subhash Bhagat
, Andrzej Pelc:
Deterministic rendezvous in infinite trees. Theor. Comput. Sci. 984: 114313 (2024) - Christian Bianchini, Alberto Policriti, Brian Riccardi
, Riccardo Romanello:
Incremental NFA minimization. Theor. Comput. Sci. 1004: 114621 (2024) - Ivan Bliznets, Anton Bukov, Danil Sagunov:
Fair division with minimal withheld information in social networks. Theor. Comput. Sci. 991: 114446 (2024) - Jan Bok
, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. Theor. Comput. Sci. 1001: 114580 (2024) - Guillaume Bonfante, Florian L. Deloup:
The genus of regular languages and directed graph emulators. Theor. Comput. Sci. 1000: 114579 (2024) - Prosenjit Bose, Guillermo Esteban
, Anil Maheshwari:
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. Theor. Comput. Sci. 1001: 114583 (2024) - Valentin Bouquet
, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On the complexity of Dominating Set for graphs with fixed diameter. Theor. Comput. Sci. 1001: 114561 (2024) - Joan Boyar
, Kim S. Larsen
, Denis Pankratov:
Advice complexity of adaptive priority algorithms. Theor. Comput. Sci. 984: 114318 (2024)
skipping 14,711 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-06-19 12:25 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