


default search action
Theoretical Computer Science, Volume 745
Volume 745, October 2018
- Joachim M. Buhmann, Julien Dumazert, Alexey Gronskiy

, Wojciech Szpankowski:
Posterior agreement for large parameter-rich optimization problems. 1-22 - Steve Hanneke, Liu Yang:

Testing piecewise functions. 23-35 - Sang Won Bae

, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer
, Luca Grilli
, Seok-Hee Hong, Matias Korman
, Fabrizio Montecchiani
, Ignaz Rutter
, Csaba D. Tóth:
Gap-planar graphs. 36-52 - I. Vinod Reddy

:
Parameterized algorithms for conflict-free colorings of graphs. 53-62 - Mauro Mezzini

:
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs. 63-74 - Yixin Cao

, Yuping Ke, Yota Otachi
, Jie You:
Vertex deletion problems on chordal graphs. 75-86 - Pairat Thorncharoensri

, Willy Susilo
, Yi Mu:
Policy controlled system with anonymity. 87-113 - Oscar H. Ibarra, Ian McQuillan

:
On store languages of language acceptors. 114-132 - Michele Garraffa, Lei Shang

, Federico Della Croce
, Vincent T'kindt
:
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem. 133-149 - Nicola Gatti, Marco Rocco, Paolo Serafino, Carmine Ventre

:
Towards better models of externalities in sponsored search auctions. 150-162 - Jin-Yi Cai, Heng Guo

, Tyson Williams:
Clifford gates in the Holant framework. 163-171 - Guillaume Escamocher

, Barry O'Sullivan:
Pushing the frontier of minimality. 172-201 - Dimitri Watel, Alain Faye:

Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive. 202-223

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














