default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 7
Volume 7, Number 1, November 2010
- Ignaz Rutter
, Alexander Wolff:
Computing large matchings fast. 1:1-1:21 - Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Approximation algorithms for the sex-equal stable marriage problem. 2:1-2:17 - Hristo N. Djidjev:
A faster algorithm for computing the girth of planar and bounded genus graphs. 3:1-3:16 - Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella:
Length-bounded cuts and flows. 4:1-4:27 - Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie:
Additive spanners and (alpha, beta)-spanners. 5:1-5:26 - Michele Flammini, Gaia Nicosia:
On the bicriteria k-server problem. 6:1-6:19 - Leah Epstein, Rob van Stee:
On the online unit clustering problem. 7:1-7:18 - Jie Gao, Michael Langberg, Leonard J. Schulman:
Clustering lines in high-dimensional space: Classification of incomplete data. 8:1-8:26 - Atlas F. Cook, Carola Wenk:
Geodesic Fréchet distance inside a simple polygon. 9:1-9:19 - Paolo Ferragina, Rossano Venturini:
The compressed permuterm index. 10:1-10:21 - Pankaj K. Agarwal, Lars Arge, Ke Yi:
I/O-efficient batched union-find and its applications to terrain analysis. 11:1-11:21 - Ashish Goel, Sudipto Guha, Kamesh Munagala:
How to probe for an extreme value. 12:1-12:20 - Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Taxes for linear atomic congestion games. 13:1-13:31
Volume 7, Number 2, March 2011
- Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Data structures for mergeable trees. 14:1-14:30 - Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania:
Decision trees for entity identification: Approximation algorithms and hardness results. 15:1-15:22 - Tobias Jacobs:
Constant factor approximations for the hotlink assignment problem. 16:1-16:19 - Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang:
Tree exploration with logarithmic memory. 17:1-17:21 - Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev:
Set connectivity problems in undirected graphs and the directed steiner network problem. 18:1-18:17 - Éric Colin de Verdière, Alexander Schrijver:
Shortest vertex-disjoint two-face paths in planar graphs. 19:1-19:12 - Michael Elkin:
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners. 20:1-20:17 - Graham Cormode, S. Muthukrishnan, Ke Yi:
Algorithms for distributed functional monitoring. 21:1-21:20 - Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko:
Sum edge coloring of multigraphs via configuration LP. 22:1-22:21 - Avraham Ben-Aroya, Sivan Toledo:
Competitive analysis of flash memory algorithms. 23:1-23:37 - Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding witnesses by peeling. 24:1-24:15 - Yongwook Choi, Wojciech Szpankowski:
Constrained pattern matching. 25:1-25:19 - Bin Fu, Ming-Yang Kao, Lusheng Wang:
Discovering almost any hidden motif from multiple sequences. 26:1-26:18 - Ge Nong, Sen Zhang, Wai Hong Chan:
Computing the inverse sort transform in linear time. 27:1-27:16
Volume 7, Number 3, July 2011
- Zachary Friggstad, Mohammad R. Salavatipour:
Minimizing movement in mobile facility location problems. 28:1-28:22 - Allan Borodin, David Cashman, Avner Magen:
How well can primal-dual and local-ratio algorithms perform? 29:1-29:26 - Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T connectivity on digraphs with a known stationary distribution. 30:1-30:21 - Martin Gairing, Burkhard Monien, Karsten Tiemann:
Routing (un-) splittable flow in games with player-specific affine latency functions. 31:1-31:31 - Adi Rosén, Gabriel Scalosub:
Rate vs. buffer size-greedy information gathering on the line. 32:1-32:22 - Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie:
Minimizing flow time in the wireless gathering problem. 33:1-33:20 - Evangelos Kranakis, Danny Krizanc, Pat Morin:
Randomized rendezvous with limited memory. 34:1-34:12 - Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
Max-coloring and online coloring with bandwidths on interval graphs. 35:1-35:21 - Samir Khuller, Azarakhsh Malekian, Julián Mestre:
To fill or not to fill: The gas station problem. 36:1-36:16 - Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Philippe Tresser, Chai Wah Wu:
The optimality of the online greedy algorithm in carpool and chairman assignment problems. 37:1-37:22 - Philip Bille, Inge Li Gørtz:
The tree inclusion problem: In linear space and faster. 38:1-38:47 - Eduardo Sany Laber, Marco Molinaro:
Improved approximations for the hotlink assignment problem. 39:1-39:34
Volume 7, Number 4, September 2011
- Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe flajolet, the father of analytic combinatorics. 40:1-40:2 - Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas:
Three-coloring triangle-free planar graphs in linear time. 41:1-41:14 - Shlomo Moran, Sagi Snir, Wing-Kin Sung:
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds. 42:1-42:20 - Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote:
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. 43:1-43:27 - Paul S. Bonsma, Frederic Dorn:
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. 44:1-44:19 - Liam Roditty, Asaf Shapira:
All-pairs shortest paths with a sublinear additive error. 45:1-45:12 - David Pritchard, Ramakrishna Thurimella:
Fast computation of small cuts via cycle space sampling. 46:1-46:30 - Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller:
Broadcast scheduling: Algorithms and complexity. 47:1-47:14 - Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani:
An improved approximation algorithm for resource allocation. 48:1-48:7 - Dimitris Fotakis:
Memoryless facility location in one pass. 49:1-49:24 - Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, Yong Zhang:
A new upper bound 2.5545 on 2D Online Bin Packing. 50:1-50:18 - Jeff Edmonds, Kirk Pruhs:
Cake cutting really is not a piece of cake. 51:1-51:12 - Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti:
Succinct indexes for strings, binary relations and multilabeled trees. 52:1-52:27 - Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Fully compressed suffix trees. 53:1-53:34 - Alexander Izsak, Nicholas Pippenger:
Carry propagation in multiplication by constants. 54:1-54:11
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-10-07 00:55 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:
