![](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 589
Volume 589, July 2015
- Claude Sureson:
Random reals as measures of natural open sets. 1-23 - Toshiya Itoh, Seiji Yoshimoto:
Buffer management of multi-queue QoS switches with class segregation. 24-33 - Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary matching with a few gaps. 34-46 - Che-Nan Kuo
:
Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant. 47-52 - Ioannis Caragiannis
, Aris Filos-Ratsikas
, Ariel D. Procaccia:
An improved 2-agent kidney exchange mechanism. 53-60 - Martin Anthony
, Joel Ratsaby:
A probabilistic approach to case-based inference. 61-75 - Carla Binucci
, Emilio Di Giacomo
, Walter Didimo, Fabrizio Montecchiani
, Maurizio Patrignani
, Antonios Symvonis
, Ioannis G. Tollis:
Fan-planarity: Properties and complexity. 76-86 - Isolde Adler, Mamadou Moustapha Kanté
:
Linear rank-width and linear clique-width of trees. 87-98 - Laurent Bulteau
, Jiehua Chen, Piotr Faliszewski
, Rolf Niedermeier, Nimrod Talmon
:
Combinatorial voter control in elections. 99-120 - Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Worst case compromises in matroids with applications to the allocation of indivisible goods. 121-140
- Colm Ó'Dúnlaing:
An almost-confluent congruential language which is not Church-Rosser congruential. 141-146
![](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.