default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 846
Volume 846, December 2020
- Aritra Banik, Pratibha Choudhary
, Venkatesh Raman, Saket Saurabh:
Fixed-parameter tractable algorithms for Tracking Shortest Paths. 1-13 - Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum independent sets in subcubic graphs: New results. 14-26 - Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and local independent set approximation. 27-37 - Ioannis Lamprou, Russell Martin, Sven Schewe:
Fast two-robot disk evacuation with wireless communication. 38-60 - Volker Turau:
A distributed algorithm for finding Hamiltonian cycles in random graphs in O(logn) time. 61-74 - Jinling Wang:
Fractional matching preclusion of product networks. 75-81 - Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza:
On caterpillar factors in graphs. 82-90 - Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Priority evacuation from a disk: The case of n ≥ 4. 91-102 - Mingyu Xiao, Shaowei Kou:
Parameterized algorithms and kernels for almost induced matching. 103-113 - Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra:
On the curve complexity of 3-colored point-set embeddings. 114-140 - Ugo de'Liguoro, Riccardo Treglia:
The untyped computational λ-calculus and its intersection type discipline. 141-159 - Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu:
Prior-free multi-unit auctions with ordered bidders. 160-171
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-07-31 23:19 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.
