default search action
Information Processing Letters, Volume 122
Volume 122, June 2017
- Min-Sheng Lin, Chien-Min Chen:
Linear-time algorithms for counting independent sets in bipartite permutation graphs. 1-7 - Toni Mancini, Federico Mari, Annalisa Massini, Igor Melatti, Ivano Salvo, Enrico Tronci:
On minimising the maximum expected verification time. 8-16 - Euiwoong Lee:
APX-hardness of maximizing Nash social welfare with indivisible items. 17-20 - Nikhil Bansal, Seeun William Umboh:
Tight approximation bounds for dominating set on graphs of bounded arboricity. 21-24 - Krishnendu Chatterjee, Georg Osang:
Pushdown reachability with constant treewidth. 25-29 - Izak Broere, Gabriel Semanisin:
Some bounds on the generalised total chromatic number of degenerate graphs. 30-33 - Ertem Esiner, Anwitaman Datta:
On query result integrity over encrypted data. 34-39
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.