default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 828-829
Volume 828-829, August 2020
- Ian Albuquerque Raymundo Da Silva, Gruia Calinescu, Nathan De Graaf:
Faster compression of patterns to Rectangle Rule Lists. 1-18 - Katarzyna Rybarczyk:
GHS algorithm on a graph with random weights. 19-31 - Qiufen Ni, Jianxiong Guo
, Chuanhe Huang, Weili Wu:
Information coverage maximization for multiple products in social networks. 32-41 - Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC drawings of graphs with one bend per edge. 42-54 - Vincent Chau, Minming Li, Elaine Yinling Wang, Ruilong Zhang, Yingchao Zhao:
Minimizing the cost of batch calibrations. 55-64 - Ching-Lueh Chang:
On ultrametric 1-median selection. 65-69 - Yanze Huang, Limei Lin, Li Xu:
A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model. 70-80
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 2024-09-17 00:17 CEST 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:
