default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computer and System Sciences, Volume 108
Volume 108, March 2020
- Chia-Wen Cheng, Sun-Yuan Hsieh, Ralf Klasing:
Vulnerability of super extra edge-connected graphs. 1-9 - Alejandro Erickson, Javier Navaridas
, Iain A. Stewart:
Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs. 10-28 - Guillaume Bagan, Angela Bonifati, Benoît Groz:
A trichotomy for regular simple path queries on graphs. 29-48 - Laurent Bienvenu, Rod Downey:
On low for speed oracles. 49-63 - Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-width and well-quasi-ordering of triangle-free graph classes. 64-91 - James Aisenberg, Maria Luisa Bonet, Sam Buss:
2-D Tucker is PPA complete. 92-103 - Henning Bordihn, Victor Mitrana:
On the degrees of non-regularity and non-context-freeness. 104-117 - Jakub Michaliszyn, Jan Otop:
Non-deterministic weighted automata evaluated over Markov chains. 118-136
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-27 20:34 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:
