default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 135
Volume 135, Number 1, May 25, 1997
- Goos Kant, Hans L. Bodlaender:
Triangulating Planar Graphs while Minimizing the Maximum Degree. 1-14 - Konstantin Skodinis, Egon Wanke:
The Bounded Degree Problem for eNCE Graph Grammars. 15-35 - Rudolf Ahlswede, Ning Cai:
Models of Multi-User Write-Efficient Memories and General Diametric Theorems. 37-67
Volume 135, Number 2, June 15, 1997
- Nicola Leone
, Pasquale Rullo, Francesco Scarcello:
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation. 69-112 - Jerzy Tyszkiewicz:
The Kolmogorov Expression Complexity of Logics. 113-135
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-12-02 23:29 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:
