![](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 878
Volume 878-879, July 2021
- Huimin Bi, Xin Zhang
:
Incidence coloring of Mycielskians with fast algorithm. 1-10 - Andreas Brandstädt, Raffaele Mosca:
Maximum weight independent sets for (S1, 2, 4, triangle)-free graphs in polynomial time. 11-25 - Éric Duchêne, Stéphane Gonzalez, Aline Parreau, Eric Rémila, Philippe Solal:
influence: A partizan scoring game on graphs. 26-46 - Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Exhaustive generation of some lattice paths and their prefixes. 47-52 - Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Nonuniform SINR+Voronoi diagrams are effectively uniform. 53-66 - Zhen Zhang, Yutian Guo, Junyu Huang, Jianxin Wang, Feng Shi:
Improved approximation for prize-collecting red-blue median. 67-82 - Oded Goldreich, Tom Gur
:
Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP. 83-101 - Yu-Han Chen, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang:
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes. 102-112
![](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.