default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 58, 2010
Volume 58, Number 1, September 2010
- David F. Manlove
, Robert W. Irving, Kazuo Iwama:
Guest Editorial: Special Issue on Matching Under Preferences. 1-4 - Péter Biró, Eric McDermid:
Three-Sided Stable Matchings with Cyclic Preferences. 5-18 - Katarína Cechlárová, Tamás Fleiner:
Housing Markets Through Graphs. 19-33 - Christine T. Cheng:
Understanding the Generalized Median Stable Matchings. 34-51 - John Dabney, Brian C. Dean:
An Efficient Algorithm for Batch Stability Testing. 52-58 - Brian C. Dean, Siddharth Munshi:
Faster Algorithms for Stable Allocation Problems. 59-81 - Tamás Fleiner:
The Stable Roommates Problem with Choice Functions. 82-101 - Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. 102-118 - Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre:
Assigning Papers to Referees. 119-136 - Chien-Chung Huang:
Circular Stable Matching and 3-way Kidney Transplant. 137-150 - Hirotatsu Kobayashi, Tomomi Matsui:
Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists. 151-169 - Dániel Marx, Ildikó Schlotter:
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties. 170-187 - Jun Wako:
A Polynomial-Time Algorithm to Find von Neumann-Morgenstern Stable Matchings in Marriage Games. 188-220
Volume 58, Number 2, October 2010
- Karim Douïeb, Stefan Langerman:
Near-Entropy Hotlink Assignments. 221-244 - Refael Hassin, Jérôme Monnot, Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems. 245-262 - Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong:
Compressed Indexes for Approximate String Matching. 263-281 - Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri:
Fingerprint Clustering with Bounded Number of Missing Values. 282-303 - Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas:
NBmalloc: Allocating Memory in a Lock-Free Manner. 304-338 - Ulrich Lauther, Tamás Lukovszki:
Space Efficient Algorithms for the Burrows-Wheeler Backtransformation. 339-351 - Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu:
Guarding a Terrain by Two Watchtowers. 352-390 - Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram:
Approximation Algorithms for Scheduling with Reservations. 391-404 - Christophe Crespelle, Christophe Paul:
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. 405-432 - Seok-Hee Hong, Hiroshi Nagamochi:
A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. 433-460 - Susanne Albers:
New Results on Web Caching with Request Reordering. 461-477 - Seok-Hee Hong, Hiroshi Nagamochi:
Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. 478-497 - Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang:
Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks. 498-515 - Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano:
Fractional Path Coloring in Bounded Degree Trees with Applications. 516-540
Volume 58, Number 3, November 2010
- Benjamin Doerr, Frank Neumann:
In Memoriam: Ingo Wegener. 541-542 - Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann:
Algorithmic Aspects of Proportional Symbol Maps. 543-565 - Elena Grigorieva, P. Jean-Jacques Herings, Rudolf Müller, Dries Vermeulen:
On the Fastest Vickrey Algorithm. 566-590 - Leena Salmela, Jorma Tarhio, Petri Kalsi:
Approximate Boyer-Moore String Matching for Small Alphabets. 591-609 - Gilad Goraly, Refael Hassin:
Multi-Color Pebble Motion on Graphs. 610-636 - Louis Ibarra:
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs. 637-678 - Katerina Asdre, Stavros D. Nikolopoulos:
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs. 679-710 - Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. 711-729 - James Allen Fill, Takéhiko Nakama:
Analysis of the Expected Number of Bit Comparisons Required by Quickselect. 730-769 - Lukasz Kowalik:
Fast 3-coloring Triangle-Free Planar Graphs. 770-789 - Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. 790-810
Volume 58, Number 4, December 2010
- Mira Gonen, Dana Ron:
On the Benefits of Adaptivity in Property Testing of Dense Graphs. 811-830 - Omer Barkol, Yuval Ishai, Enav Weinreb:
On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR. 831-859 - Mohsen Bayati, Jeong Han Kim, Amin Saberi:
A Sequential Algorithm for Generating Random Graphs. 860-910 - Sam Greenberg, Dana Randall:
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours. 911-927 - Xiaotie Deng, Fan Chung Graham:
Introduction to the Special Section on Internet and Network Economics. 928-929 - Yiling Chen, Stanko Dimitrov, Rahul Sami, Daniel M. Reeves, David M. Pennock, Robin D. Hanson, Lance Fortnow, Rica Gonen:
Gaming Prediction Markets: Equilibrium Strategies with a Market Maker. 930-969 - Tian-Ming Bu, Li Liang, Qi Qi:
On Robustness of Forward-looking in Sponsored Search Auction. 970-989 - John Langford, Lihong Li, Yevgeniy Vorobeychik, Jennifer Wortman:
Maintaining Equilibria During Exploration in Sponsored Search Auctions. 990-1021 - S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. 1022-1044
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-03-24 00:28 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:
