default search action
Theoretical Computer Science, Volume 775
Volume 775, July 2019
- Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis:
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. 1-15 - Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei:
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. 16-25 - Arash Ahadi, Alireza Zarei:
Connecting guards with minimum Steiner points inside simple polygons. 26-31 - Xiao Zhang, Shengli Liu, Dawu Gu, Joseph K. Liu:
A generic construction of tightly secure signatures in the multi-user setting. 32-52 - Tanima Chatterjee, Bhaskar DasGupta, Nasim Mobasheri, Venkatkumar Srinivasan, Ismael González Yero:
On the computational complexities of three problems related to a privacy measure for large networks under active attack. 53-67 - Pierre Bonardo, Anna E. Frid, Jeffrey O. Shallit:
The number of valid factorizations of Fibonacci prefixes. 68-75 - Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
Complexity Study for the Robust Stable Marriage Problem. 76-92 - Frank Gurski, Carolin Rehs, Jochen Rethmann:
Knapsack problems: A parameterized point of view. 93-108
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.