default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 906
Volume 906, March 2022
- David Eppstein, Daniel Frishberg
, William Maxwell:
On the treewidth of Hanoi graphs. 1-17 - Saeed Akhoondian Amiri, Ben Wiederhake:
Distributed distance-r covering problems on sparse high-girth graphs. 18-31 - B. S. Panda, Priyamvada:
Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs. 32-51 - Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The hull number in the convexity of induced paths of order 3. 52-63 - Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
The weighted k-center problem in trees for fixed k. 64-75 - Zuosong Liang, Juan Wang, Junqing Cai, Xinxin Yang:
On the complexity of local-equitable coloring of graphs. 76-82 - Wenjun Li, Huan Peng, Yongjie Yang:
Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations. 83-93 - Vittorio Bilò:
On the robustness of the approximate price of anarchy in generalized congestion games. 94-113
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-09 00:12 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:
