default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 930
Volume 930, September 2022
- Masahiro Ikeda, Atsushi Miyauchi
, Yuuki Takai, Yuichi Yoshida:
Finding Cheeger cuts in hypergraphs via heat equation. 1-23 - Jung-Chao Ban, Chih-Hung Chang, Wen-Guei Hu, Yu-Liang Wu:
Topological entropy for shifts of finite type over Z and trees. 24-32 - Gábor Kondor:
NP-hardness of m-dimensional weighted matching problems. 33-36 - Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Partitioning H-free graphs of bounded diameter. 37-52 - Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang:
Complexity of paired domination in AT-free and planar graphs. 53-62 - Girija Vani Gurram, C. Noorullah Shariff, Rajkumar L. Biradar:
A Secure Energy Aware Meta-Heuristic Routing Protocol (SEAMHR) for sustainable IoT-Wireless Sensor Network (WSN). 63-76 - Peng Li, Jianhui Shang, Yi Shi:
A simple linear time algorithm to solve the MIST problem on interval graphs. 77-85 - Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira:
Weighted forward looking adaptive coding. 86-99 - Wenming Zhang, Huan Hu, Yongxi Cheng, Hongmei Li, Haizhen Wang:
The work function algorithm for the paging problem. 100-105 - Josef Rukavicka:
Palindromic length and reduction of powers. 106-115 - Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell:
Minimum color spanning circle of imprecise points. 116-127 - Guillaume Ducoffe:
Eccentricity queries and beyond using hub labels. 128-141 - Frank Angel Hernández Mira, Ernesto Parra Inza, José M. Sigarreta Almira, Nodari Vakhania:
A polynomial-time approximation to a minimum dominating set in a graph. 142-156 - Mohammad Tawhidul Hasan Bhuiyan, Muhammad Rashed Alam, M. Sohel Rahman:
Computing the longest common almost-increasing subsequence. 157-178 - Pasin Manurangsi, Warut Suksompong:
Almost envy-freeness for groups: Improved bounds via discrepancy theory. 179-195 - Maria-Romina Ivan, Imre Leader, Mark Walters:
Constructible graphs and pursuit. 196-208 - Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen:
Online learning for min-max discrete problems. 209-217 - Guy Kortsarz, Zeev Nutov, Eli Shalom:
Approximating activation edge-cover and facility location problems. 218-228
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-05 22:23 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:
