![](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
Information Processing Letters, Volume 141
Volume 141, January 2019
- Raghunath Reddy Madireddy
, Apurva Mudgal:
NP-hardness of geometric set cover and hitting set with rectangles containing a common point. 1-8 - Raghunath Reddy Madireddy
, Apurva Mudgal:
Approximability and hardness of geometric hitting set with axis-parallel rectangles. 9-15 - Adi Shraibman:
The corruption bound, log-rank, and communication complexity. 16-21 - Kung-Jui Pai
, Jou-Ming Chang
:
Improving the diameters of completely independent spanning trees in locally twisted cubes. 22-24 - Dmitry Kosolobov
, Arseny M. Shur:
Comparison of LZ77-type parsings. 25-29 - Abdelouadoud Stambouli, Luigi Logrippo:
Data flow analysis from capability lists, with application to RBAC. 30-40
![](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.