default search action
Theoretical Computer Science, Volume 487
Volume 487, May 2013
- Dror Fried, Solomon Eyal Shimony, Amit Benbassat, Cenny Wenner:
Complexity of Canadian traveler problem variants. 1-16 - Manuel Vazquez de Parga, Pedro García, Damián López
:
A polynomial double reversal minimization algorithm for deterministic finite automata. 17-22 - Nicolás Carrasco, Jean-Marie Le Bars, Alfredo Viola:
Enumerative encoding of correlation-immune Boolean functions. 23-36 - Antoine Ndione, Aurélien Lemay, Joachim Niehren:
Approximate membership for regular languages modulo the edit distance. 37-49 - Victor A. Campos, Frédéric Havet, Rudini Menezes Sampaio
Backbone colouring: Tree backbones with small diameter in planar graphs. 50-64 - Diarmuid Early, Michel P. Schellekens:
Running time of the Treapsort algorithm. 65-73 - Zhendong Shao, Roberto Solis-Oba:
L(2, 1)L(2, 1)-labelings on the modular product of two graphs. 74-81 - Jean-François Couturier, Pinar Heggernes
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. 82-94 - Sheng Yu, Prudence W. H. Wong
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time. 95-102
- Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. 103-105
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.
last updated on 2024-12-08 01:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: