default search action
Theoretical Computer Science, Volume 506
Volume 506, September 2013
- Sahadev Bera, Partha Bhowmick, Peer Stelldinger, Bhargab B. Bhattacharya:
On covering a digital disc with concentric circles in Z2. 1-16 - Francine Blanchet-Sadri, Brent Woodhouse:
Strict bounds for pattern avoidance. 17-28 - Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
Split clique graph complexity. 29-42 - Yoann Dieudonné, Florence Levé, Franck Petit, Vincent Villain:
Deterministic geoleader election in disoriented anonymous systems. 43-54 - Dyi-Rong Duh, Yao-Chung Lin, Cheng-Nan Lai, Yue-Li Wang:
Two spanning disjoint paths with required length in generalized hypercubes. 55-78 - Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Zoran Sunic:
Cellular automata between sofic tree shifts. 79-101 - Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski:
Enhanced string covering. 102-114 - Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar:
Solving min ones 2-sat as fast as vertex cover. 115-121
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.