![](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
Theoretical Computer Science, Volume 770
Volume 770, May 2019
- Nicolas Pena
, Allan Borodin:
On extensions of the deterministic online model for bipartite matching and max-sat. 1-24 - George Manoussakis:
A new decomposition technique for maximal clique enumeration for sparse graphs. 25-33 - Travis Gagie
, Meng He
, Gonzalo Navarro
:
Path queries on functions. 34-50 - Stephane Durocher, Robby Singh:
A simple linear-space data structure for constant-time range minimum query. 51-61 - Jan Arne Telle, Yngve Villanger:
FPT algorithms for domination in sparse graphs and beyond. 62-68 - Hoàng-Oanh Le, Van Bang Le
:
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. 69-78 - Miroslaw Kowaluk, Andrzej Lingas:
A fast deterministic detection of small pattern graphs in graphs without large cliques. 79-87 - Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
:
On the edge-length ratio of outerplanar graphs. 88-94 - Tero Harju
:
On square-free arithmetic progressions in infinite words. 95-100 - Paul M. B. Vitányi:
Corrigendum to "On the rate of decrease in logical depth" [Theor. Comput. Sci. 702 (2017) 60-64] by L.F. Antunes, A. Souto, and P.M.B. Vitányi. 101
![](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.