default search action
Journal of Computer and System Sciences, Volume 105
Volume 105, November 2019
- Dominik D. Freydenberger, Markus L. Schmid:
Deterministic regular expressions with back-references. 1-39 - Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil:
Space complexity of reachability testing in labelled graphs. 40-53 - Marc Gyssens
, Jelle Hellings, Jan Paredaens, Dirk Van Gucht, Jef Wijsen
Calculi for symmetric queries. 54-86 - Takayuki Sakai, Kazuhisa Seto
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression. 87-103 - Jung-Heum Park
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs. 104-115 - Yair Bartal, Arnold Filtser, Ofer Neiman:
On notions of distortion and an almost minimum spanning tree with constant average distortion. 116-129 - Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters
k-Majority digraphs and the hardness of voting with a constant number of voters. 130-157 - Eduard Eiben, Danny Hermelin, M. S. Ramanujan:
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. 158-170 - Albert Atserias, Phokion G. Kolaitis, Simone Severini:
Generalized satisfiability problems via operator assignments. 171-198 - Erik D. Demaine, Felix Reidl
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. 199-241
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.
last updated on 2025-01-13 01:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: