![](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 24 matches
- 2022
- Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth
:
Reconfiguration of connected graph partitions via recombination. Theor. Comput. Sci. 923: 13-26 (2022) - Morteza Alimi, Amir Daneshgar, Mohammad-Hadi Foroughmand-Araabi:
Mean isoperimetry with control on outliers: Exact and approximation algorithms. Theor. Comput. Sci. 923: 348-365 (2022) - Julien Bensmail, François Dross, Nacim Oijid
, Éric Sopena:
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. Theor. Comput. Sci. 923: 196-221 (2022) - Julien Bensmail, Fionn Mc Inerney
:
On a vertex-capturing game. Theor. Comput. Sci. 923: 27-46 (2022) - You Chen, Xueliang Li:
The proper vertex-disconnection of graphs. Theor. Comput. Sci. 923: 167-178 (2022) - Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio
:
Spy game: FPT-algorithm, hardness and graph products. Theor. Comput. Sci. 923: 304-317 (2022) - Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. Theor. Comput. Sci. 923: 271-291 (2022) - El-Mahdi El-Mhamdi, Rachid Guerraoui
, Lê-Nguyên Hoang
, Alexandre Maurer:
Removing algorithmic discrimination (with minimal individual error). Theor. Comput. Sci. 923: 47-55 (2022) - Herman Goulet-Ouellet
:
Suffix-connected languages. Theor. Comput. Sci. 923: 126-143 (2022) - Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen
, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a set of line segments with a few squares. Theor. Comput. Sci. 923: 74-98 (2022) - Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. Theor. Comput. Sci. 923: 56-73 (2022) - Pierre Hosteins
, Rosario Scatamacchia, Andrea Grosso, Roberto Aringhieri
:
The Connected Critical Node Problem. Theor. Comput. Sci. 923: 235-255 (2022) - Kazuhiro Kurita, Kunihiro Wasa
:
Constant amortized time enumeration of Eulerian trails. Theor. Comput. Sci. 923: 1-12 (2022) - Jing Liang, Haixing Zhao, Jun Yin:
A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks. Theor. Comput. Sci. 923: 144-159 (2022) - Min-Sheng Lin:
Counting dominating sets in some subclasses of bipartite graphs. Theor. Comput. Sci. 923: 337-347 (2022) - Xiaofei Liu
, Weidong Li
, Han Dai:
Approximation algorithms for the minimum power cover problem with submodular/linear penalties. Theor. Comput. Sci. 923: 256-270 (2022) - Dieaa I. Nassr
, M. Anwar, Hatem M. Bahig
:
Improving small private exponent attack on the Murru-Saettone cryptosystem. Theor. Comput. Sci. 923: 222-234 (2022) - Kien Trung Nguyen, Wen Chean Teh
, Nguyen Thanh Hung, Huong Nguyen-Thu:
A linear time algorithm for connected p-centdian problem on block graphs. Theor. Comput. Sci. 923: 318-326 (2022) - Wantao Ning, Litao Guo:
Connectivity and super connectivity of the exchanged 3-ary n-cube. Theor. Comput. Sci. 923: 160-166 (2022) - Boaz Patt-Shamir
, Mor Perry:
Proof-labeling schemes: Broadcast, unicast and in between. Theor. Comput. Sci. 923: 179-195 (2022) - Ryoma Senda, Yoshiaki Takata
, Hiroyuki Seki
:
Complexity results on register context-free grammars and related formalisms. Theor. Comput. Sci. 923: 99-125 (2022) - Chai Shu, Xiang-Jun Li
, Meijie Ma:
Note on reliability of star graphs. Theor. Comput. Sci. 923: 366-375 (2022) - Zhiyi Tang
:
Optimal embedding of hypercube into cylinder. Theor. Comput. Sci. 923: 327-336 (2022) - Zhen Zhang, Yipeng Zhou, Shaoqian Yu:
Better guarantees for k-median with service installation costs. Theor. Comput. Sci. 923: 292-303 (2022)
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-07-28 04:24 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