


default search action
Journal of Computer and System Sciences, Volume 97
Volume 97, November 2018
- Prachi Goyal, Pranabendu Misra, Fahad Panolan

, Geevarghese Philip, Saket Saurabh:
Finding even subgraphs even faster. 1-13 - Víctor Dalmau, Andrei A. Krokhin

, Rajsekar Manokaran:
Towards a characterization of constant-factor approximable finite-valued CSPs. 14-27 - Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:

A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees. 28-44 - Mahdi Cheraghchi

, Elena Grigorescu
, Brendan Juba, Karl Wimmer, Ning Xie
:
AC0∘MOD2 lower bounds for the Boolean Inner Product. 45-59 - George B. Mertzios

, Paul G. Spirakis
:
Strong bounds for evolution in networks. 60-82 - Guangya Cai, Daowen Qiu

:
Optimal separation in exact query complexities for Simon's problem. 83-93 - Jhih-Hong Ye, Chih-Yu Li, Biing-Feng Wang:

An improved algorithm for the minmax regret path centdian problem on trees. 94-105 - Alkida Balliu

, Gianlorenzo D'Angelo
, Pierre Fraigniaud, Dennis Olivetti
:
What can be verified locally? 106-120 - Eduard Eiben

, Robert Ganian, O-joung Kwon
:
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. 121-146 - Emmanuel Filiot

, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Visibly pushdown transducers. 147-181 - Florent Becker, Mathieu Chapelle, Jérôme Durand-Lose

, Vincent Levorato, Maxime Senot:
Abstract geometrical computation 8: Small machines, accumulations & rationality. 182-198

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














