![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 845
Volume 845, December 2020
- Christophe Demko
, Karell Bertet, Cyril Faucher, Jean-François Viaud, Sergei O. Kuznetsov:
NextPriorityConcept: A new and generic algorithm computing concepts from complex and heterogeneous data. 1-20 - Pratibha Choudhary
, Pallavi Jain, R. Krithika, Vibha Sahlot:
Vertex deletion on split graphs: Beyond 4-hitting set. 21-37 - Ramesh K. Jallu
, Sangram Kishor Jena
, Gautam K. Das:
Liar's domination in unit disk graphs. 38-49 - Ranveer Singh:
Parameterized complexity of determinant and permanent. 50-58 - Krishnamoorthy Dinesh
, Samir Otiv, Jayalal Sarma:
New bounds for energy complexity of Boolean functions. 59-75 - Balaram D. Behera
:
Sorting an array using the topological sort of a corresponding comparison graph. 76-97 - Miguel Coviello Gonzalez, Marek Chrobak:
Towards a theory of mixing graphs: A characterization of perfect mixability. 98-121 - Ken Takashima
, Yuta Abe
, Tatsuya Sasaki, Daiki Miyahara
, Kazumasa Shinagawa
, Takaaki Mizuki
, Hideaki Sone
:
Card-based protocols for secure ranking computations. 122-135 - Abbass Gorgi
, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation of set multi-cover via hypergraph matching. 136-143 - Georgios Konstantinidis, Athanasios Kehagias:
On positionality of trigger strategies Nash equilibria in SCAR. 144-158 - Gordon Belot:
Absolutely no free lunches! 159-180 - Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding patterns and periods in Cartesian tree matching. 181-197 - Heqin Liu, Dongqin Cheng:
Structure fault tolerance of balanced hypercubes. 198-207 - Avivit Levy, B. Riva Shalom:
Online parameterized dictionary matching with one gap. 208-229 - Takuya Mieno
, Dominik Köppl
, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Space-efficient algorithms for computing minimal/shortest unique substrings. 230-242
![](https://dblp.org/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.