![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 475
Volume 475, March 2013
- Júlio Araújo
, Victor A. Campos, Frédéric Giroire, Nicolas Nisse, Leonardo Sampaio Rocha
, R. Soares:
On the hull number of some graph classes. 1-12 - Jørgen Bang-Jensen
, Daniel Gonçalves
, Anders Yeo
:
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties. 13-20 - Malgorzata Bednarska-Bzdega:
On weight function methods in Chooser-Picker games. 21-33 - Francine Blanchet-Sadri, Sean Simmons:
Deciding representability of sets of words of equal length. 34-46 - Alain Bretto
, Yannick Silvestre, Thierry Vallée:
Factorization of products of hypergraphs: Structure and algorithms. 47-58 - Shlomi Dolev
, Limor Lahiani, Yinnon A. Haviv:
Unique permutation hashing. 59-65 - Sigrid Ewert
, Andries P. J. van der Walt:
Necessary conditions for subclasses of random context languages. 66-72 - Stefano Brocchi, Andrea Frosini, Renzo Pinzani, Simone Rinaldi
:
A tiling system for the class of L-convex polyominoes. 73-81 - Che-Nan Kuo, Hsin-Hung Chou
, Nai-Wen Chang, Sun-Yuan Hsieh:
Fault-tolerant path embedding in folded hypercubes with both node and edge faults. 82-91 - Marcin Bienkowski
, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez
, Lukasz Jez, Grzegorz Stachowiak
:
A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue. 92-102 - Saira Karim
, Joe Sawada, Zareen Alamgir
, Syed Husnine:
Generating bracelets with fixed content. 103-112 - Wing-Kai Hon
, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter
:
Faster compressed dictionary matching. 113-119
- L'ubomíra Balková
, Edita Pelantová
, Stepán Starosta:
Proof of the Brlek-Reutenauer conjecture. 120-125
- Achim Blumensath:
Erratum to "On the structure of graphs in the Caucal hierarchy" [Theoret. Comput. Sci 400 (2008) 19-45]. 126-127
![](https://dblp.dagstuhl.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.