default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. CIAC 2013: Barcelona, Spain
- Paul G. Spirakis, Maria J. Serna
:
Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings. Lecture Notes in Computer Science 7878, Springer 2013, ISBN 978-3-642-38232-1 - Hasna Mohsen Alqahtani, Thomas Erlebach:
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost. 1-12 - Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. 13-24 - Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis:
Selfish Resource Allocation in Optical Networks. 25-36 - Djamal Belazzougui, Mathieu Raffinot:
Average Optimal String Matching in Packed Strings. 37-48 - René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Parameterized Complexity of DAG Partitioning. 49-60 - Joan Boyar, Magnus Find, René Peralta:
Four Measures of Nonlinearity. 61-72 - Till Bruckdorfer, Stefan Felsner, Michael Kaufmann:
On the Characterization of Plane Bus Graphs. 73-84 - Mihai Burcea, Prudence W. H. Wong, Fencol C. C. Yung:
Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items. 85-96 - Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A Greedy Approximation Algorithm for Minimum-Gap Scheduling. 97-109 - Evgeny Dantsin, Alexander Wolpert:
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas. 110-121 - Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe:
Linear Time Distributed Swap Edge Algorithms. 122-133 - Jasper de Jong, Marc Uetz, Andreas Wombacher:
Decentralized Throughput Scheduling. 134-145 - José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira:
New Results on Stabbing Segments with a Polygon. 146-157 - Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák:
Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. 158-169 - Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia:
Complexity of Barrier Coverage with Relocatable Sensors in the Plane. 170-182 - Shlomi Dolev, Nova Fandina, Dan Gutfreund:
Succinct Permanent Is NEXP-Hard with Many Hard Instances. 183-196 - Pavlos S. Efraimidis, Remous-Aris Koutsiamanis:
Money-Based Coordination of Network Packets. 197-208 - Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard:
Truthful Many-to-Many Assignment with Private Weights. 209-220 - Aleksander Fabijan, Bengt J. Nilsson, Mia Persson:
Competitive Online Clique Clustering. 221-233 - Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Optimal Network Decontamination with Threshold Immunity. 234-245 - Roland Glantz, Henning Meyerhenke:
Finding All Convex Cuts of a Plane Graph in Cubic Time. 246-263 - Paul W. Goldberg, Antony McCabe:
Shortest Paths with Bundles and Non-additive Weights Is Hard. 264-275 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Cliques and Clubs. 276-287 - Petr A. Golovach, Daniël Paulusma:
List Coloring in the Absence of Two Subgraphs. 288-299 - Raghav Kulkarni, Miklos Santha:
Query Complexity of Matroids. 300-311 - Georgia Mali, Panagiotis Michail, Andreas Paraskevopoulos, Christos D. Zaroliagis:
A New Dynamic Graph Structure for Large-Scale Transportation Networks. 312-323 - Katarzyna E. Paluch:
Capacitated Rank-Maximal Matchings. 324-335 - Chung Keung Poon, Hao Yuan:
A Faster CREW PRAM Algorithm for Computing Cartesian Trees. 336-344 - Sebastian Seibert, Andreas Sprock, Walter Unger:
Advice Complexity of the Online Coloring Problem. 345-357 - Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Sparse Linear Complementarity Problems. 358-369 - Li Yan, Marek Chrobak:
LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem. 370-381
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-01-07 20:32 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:
