default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 522
Volume 522, February 2014
- Christophe Crespelle, Philippe Gambette
:
(Nearly-)tight bounds on the contiguity and linearity of cographs. 1-12 - Shaunak Dattaprasad Bopardikar, Subhash Suri:
k-Capture in multiagent pursuit evasion, or the lion and the hyenas. 13-23 - Yi-Hao Zhang, Yue-Hong Shen, Min Dong, Yi-Min Jiang:
A method of batching conflict routings in shuffle-exchange networks. 24-33 - Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma:
Colouring of graphs with Ramsey-type forbidden subgraphs. 34-43 - Kai Plociennik:
A probabilistic PTAS for shortest common superstring. 44-53 - Huijuan Wang, Lidong Wu, Jianliang Wu:
Total coloring of planar graphs with maximum degree 8. 54-61 - Lavinia Egidi, Giovanni Manzini:
Design and analysis of periodic multiple seeds. 62-76 - Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Linear computation of unbordered conjugate on unordered alphabet. 77-84 - Qilong Feng, Jianxin Wang, Jianer Chen:
Matching and Weighted P2-Packing: Algorithms and Kernels. 85-94 - Gianluigi Greco, Francesco Scarcello:
Tree projections and structural decomposition methods: Minimality and game-theoretic characterization. 95-114
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-04 01:27 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:
