default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 689
Volume 689, August 2017
- Gianluca De Marco
, Dariusz R. Kowalski:
Contention resolution in a non-synchronized multiple access channel. 1-13 - Michael Brand:
P-RAM vs. RP-RAM. 14-26 - Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Generalized threshold processes on graphs. 27-35 - Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A linear kernel for finding square roots of almost planar graphs. 36-47 - Michael A. Bekos, Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani:
On RAC drawings of 1-planar graphs. 48-57 - Pierre Bonami, Dorian Mazauric, Yann Vaxès:
Maximum flow under proportional delay constraint. 58-66 - Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. 67-95 - Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke:
Improved analysis of the online set cover problem with advice. 96-107 - Xiaoxue Hu, Ping Wang, Yiqiao Wang, Weifan Wang:
The entire chromatic number of graphs embedded on the torus with large maximum degree. 108-116 - Shuguang Li:
Parallel batch scheduling with nested processing set restrictions. 117-125 - AmirMahdi Ahmadinejad, Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
On the rectangle escape problem. 126-136 - Kai Feng:
Strong matching preclusion for non-bipartite torus networks. 137-146 - Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring strings from Lyndon factorization. 147-156 - Stephane Durocher, Saeed Mehrabi:
Computing conforming partitions of orthogonal polygons with minimum stabbing number. 157-168
- Shan Ge, Jianguo Li, Changqing Xu:
Neighbor sum distinguishing total coloring of planar graphs without 5-cycles. 169-175
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 2026-08-09 22:58 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
