


default search action
Theoretical Computer Science, Volume 662
Volume 662, February 2017
- Andrzej Czygrinow, Michal Hanckowiak

, Edyta Szymanska, Wojciech Wawrzyniak
, Marcin Witkowski
:
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs. 1-8 - Vittorio Bilò

, Michele Flammini
, Gianpiero Monaco:
Approximating the revenue maximization problem with sharp demands. 9-30 - Luis Pedro Montejano, Ignasi Sau

:
On the complexity of computing the k-restricted edge-connectivity of a graph. 31-39 - Shiva Kintali, Qiuyi Zhang:

Forbidden directed minors and Kelly-width. 40-47 - Jung Yeon Hwang, Boyeon Song, Daeseon Choi, Seung-Hun Jin, Hyun Sook Cho, Mun-Kyu Lee

:
Simplified small exponent test for batch verification. 48-58
- William J. Lenhart

, Giuseppe Liotta, Fabrizio Montecchiani
:
On partitioning the edges of 1-plane graphs. 59-65

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 Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














