


default search action
Theoretical Computer Science, Volume 695
Volume 695, September 2017
- Pascal Halffmann, Stefan Ruzika, Clemens Thielen

, David Willems:
A general approximation method for bicriteria minimization problems. 1-15 - Irena Rusu:

Graph matching problems and the NP-hardness of sortedness constraints. 16-27 - Christoph Dürr

, Lukasz Jez, Óscar C. Vásquez
:
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling. 28-41 - Axel Bacher, Olivier Bodini

, Alice Jacquot:
Efficient random sampling of binary and unary-binary trees via holonomic equations. 42-53 - Roland Glantz, Henning Meyerhenke

:
On finding convex cuts in general, bipartite and plane graphs. 54-73 - Shurong Zhang

, Lin Chen, Weihua Yang:
On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks. 74-82

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














