


default search action
Theoretical Computer Science, Volume 428
Volume 428, April 2012
- Francine Blanchet-Sadri, Robert Mercas  : :
 The three-squares lemma for partial words with one hole. 1-9
- Kathie Cameron, Benjamin Lévêque, Frédéric Maffray: 
 Coloring vertices of a graph or finding a Meyniel obstruction. 10-17
- Thomas Clouser, Mikhail Nesterenko, Christian Scheideler: 
 Tiara: A self-stabilizing deterministic skip list and skip graph. 18-35
- Chris J. Conidis: 
 Effectively approximating measurable sets by open sets. 36-46
- Yoann Dieudonné, Franck Petit  : :
 Self-stabilizing gathering with strong multiplicity detection. 47-57
- Raffaele Giancarlo, Filippo Utro  : :
 Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis. 58-79
- Sayaka Kamei  , Hirotsugu Kakugawa: , Hirotsugu Kakugawa:
 A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs. 80-90
- Victor Y. Pan: 
 A note on the paper by Murat Cenk and Ferruh Ozbudak "Multiplication of polynomials modulo xn", Theoret. Comput. Sci. 412(2011) 3451-3462. 91
- Gwénaël Richomme, Patrice Séébold: 
 Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms. 92-97

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.


 Google
Google Google Scholar
Google Scholar Semantic Scholar
Semantic Scholar Internet Archive Scholar
Internet Archive Scholar CiteSeerX
CiteSeerX ORCID
ORCID














