Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 600
Volume 600, October 2015
- Gunjan Kumar, Saswata Shannigrahi:
On the NP-hardness of speed scaling with sleep state. 1-10 - Danny Hermelin
, Liat Rozenberg:
Parameterized complexity analysis for the Closest String with Wildcards problem. 11-18 - Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp, Nicholas W. M. Touikan:
Multipass automata and group word problems. 19-33 - Manolis Christodoulakis, Patrick J. Ryan, William F. Smyth, Shu Wang:
Indeterminate strings, prefix arrays & undirected graphs. 34-48 - Erika M. M. Coelho, Mitre Costa Dourado, Rudini M. Sampaio:
Inapproximability results for graph convexity parameters. 49-58 - Flavia Bonomo, Guillermo Durán, Mario Valencia-Pabon:
Complexity of the cluster deletion problem on subclasses of chordal graphs. 59-69 - Marin Bougeret, Pierre-François Dutot, Denis Trystram, Klaus Jansen, Christina Robenek:
Improved approximation algorithms for scheduling parallel jobs on identical clusters. 70-85 - David Gajser:
Verifying time complexity of Turing machines. 86-97 - Aureli Alabert, Alessandro Berti, Ricard Caballero, Marco Ferrante:
No-Free-Lunch theorems in the continuum. 98-106 - Alessandro Chiesa, Zeyuan Allen Zhu:
Shorter arithmetization of nondeterministic computations. 107-131 - Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Linear-time algorithm for sliding tokens on trees. 132-142 - Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational complexity of traffic hijacking under BGP and S-BGP. 143-154 - Marc P. Renault, Adi Rosén, Rob van Stee:
Online algorithms with advice for bin packing and scheduling problems. 155-170
- Jun Kawahara, Koji M. Kobayashi:
An improved lower bound for one-dimensional online unit clustering. 171-173 - Ye Du:
The discrete sell or hold problem with constraints on asset values. 174-179
a service of 
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 2024-04-19 19:19 CEST 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:
