default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 818
Volume 818, May 2020
- Yixin Cao:
Preface to the special issue on Computing and Combinatorics. 1 - Alessio Conte
, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph. 2-11 - Qilong Feng, Senmin Zhu, Jianxin Wang:
An improved kernel for Max-Bisection above tight lower bound. 12-21 - Mikko Koivisto, Petteri Laakkonen, Juho Lauri:
NP-completeness results for partitioning a graph into total dominating sets. 22-31 - Qian Li, Xiaoming Sun:
On the modulo degree complexity of Boolean functions. 32-40 - Ruta Mehta, Vijay V. Vazirani:
An incentive compatible, efficient market for air traffic flow management. 41-50 - Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Linear representation of transversal matroids and gammoids parameterized by rank. 51-59 - Vladimir Shenmaier:
Complexity and algorithms for finding a subset of vectors with the longest sum. 60-73 - Guangwei Wu, Jianer Chen, Jianxin Wang:
On scheduling multiple two-stage flowshops. 74-82 - Jian Xu, Soumya Banerjee, Wenjing Rao:
The existence of universally agreed fairest semi-matchings in any given bipartite graph. 83-91
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-11-28 12:45 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:
