![](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
Information Processing Letters, Volume 169
Volume 169, August 2021
- John C. Urschel
, Jake Wellens:
Testing gap k-planarity is NP-complete. 106083 - Ambroise Baril, Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Hardness and tractability of the γ-Complete Subgraph problem. 106105 - Ivy Ordanel, Proceso Fernandez
, Henry N. Adorna
:
A polynomial time algorithm for the 2-Poset Cover Problem. 106106 - Stefano Bistarelli, Fabio Rossi, Francesco Santini
:
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs. 106107 - Ali Mili
:
Differentiators and detectors. 106111 - Judith Schilling:
Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings. 106112 - Bartosz Bednarczyk
:
Statistical EL is ExpTime-complete. 106113 - Chris R. Giannella:
Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data. 106115
![](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.