default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 540
Volume 540/541, June 2014
- Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos:
Special Issue: "Combinatorial Optimization: Theory of Algorithms and Complexity". 1
- Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou:
Multi-target ray searching problems. 2-12 - Nicolas Boria, Federico Della Croce
:
Reoptimization in machine scheduling. 13-26 - Dimitris Fotakis, Paraschos Koutris:
Online Sum-Radii Clustering. 27-39 - Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks:
On the complexity of constructing minimum changeover cost arborescences. 40-52 - Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
Solutions for the stable roommates problem with payments. 53-61 - Xin Han, Yasushi Kawase, Kazuhisa Makino, He Guo:
Online removable knapsack problem under convex function. 62-69 - Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius Gusmão Pereira de Sá, Raphael C. S. Machado:
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. 70-81 - Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos:
Optimal data placement on networks with a constant number of clients. 82-88 - Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries:
On the complexity of the selective graph coloring problem in some special classes of graphs. 89-102 - Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Second-Price Ad Auctions with Binary Bids and markets with good competition. 103-114 - Monaldo Mastrolilli, Georgios Stamoulis:
Bi-criteria and approximation algorithms for restricted matchings. 115-132 - T. Van Du Tran, Philippe Chassignet, Jean-Marc Steyaert:
On permuted super-secondary structures of transmembrane β-barrel proteins. 133-142 - Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König:
On the sum-max graph partitioning problem. 143-155 - Dennis Weyland:
On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines. 156-168 - Zhigang Cao, Xiaoguang Yang:
The fashion game: Network extension of Matching Pennies. 169-181
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-04 22:08 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:
